/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/mult-comm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:25:14,495 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:25:14,497 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:25:14,532 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:25:14,532 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:25:14,535 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:25:14,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:25:14,543 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:25:14,548 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:25:14,552 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:25:14,553 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:25:14,555 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:25:14,555 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:25:14,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:25:14,558 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:25:14,561 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:25:14,561 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:25:14,562 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:25:14,564 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:25:14,569 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:25:14,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:25:14,570 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:25:14,571 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:25:14,572 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:25:14,578 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:25:14,578 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:25:14,579 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:25:14,580 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:25:14,581 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:25:14,581 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:25:14,581 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:25:14,583 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:25:14,584 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:25:14,585 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:25:14,585 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:25:14,586 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:25:14,586 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:25:14,586 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:25:14,587 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:25:14,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:25:14,588 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:25:14,589 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:25:14,618 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:25:14,619 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:25:14,620 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:25:14,620 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:25:14,620 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:25:14,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:25:14,621 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:25:14,621 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:25:14,621 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:25:14,621 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:25:14,622 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:25:14,622 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:25:14,622 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:25:14,622 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:25:14,622 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:25:14,622 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:25:14,622 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:25:14,622 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:25:14,622 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:25:14,622 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:25:14,622 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:25:14,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:25:14,623 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:25:14,623 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:25:14,623 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:25:14,623 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:25:14,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:25:14,623 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:25:14,624 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-06 07:25:14,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:25:14,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:25:14,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:25:14,925 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:25:14,926 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:25:14,927 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/mult-comm.wvr.c [2022-12-06 07:25:16,096 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:25:16,281 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:25:16,282 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-comm.wvr.c [2022-12-06 07:25:16,292 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee73fdaad/7cf8e53a4b48405a9e71d36fe6ca133d/FLAG04314a7c9 [2022-12-06 07:25:16,303 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee73fdaad/7cf8e53a4b48405a9e71d36fe6ca133d [2022-12-06 07:25:16,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:25:16,306 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:25:16,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:25:16,308 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:25:16,311 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:25:16,311 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:25:16" (1/1) ... [2022-12-06 07:25:16,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a491739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:25:16, skipping insertion in model container [2022-12-06 07:25:16,312 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:25:16" (1/1) ... [2022-12-06 07:25:16,318 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:25:16,336 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:25:16,469 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/mult-comm.wvr.c[1910,1923] [2022-12-06 07:25:16,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:25:16,482 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:25:16,497 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/mult-comm.wvr.c[1910,1923] [2022-12-06 07:25:16,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:25:16,510 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:25:16,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:25:16 WrapperNode [2022-12-06 07:25:16,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:25:16,512 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:25:16,512 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:25:16,514 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:25:16,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:25:16" (1/1) ... [2022-12-06 07:25:16,527 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:25:16" (1/1) ... [2022-12-06 07:25:16,546 INFO L138 Inliner]: procedures = 21, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 52 [2022-12-06 07:25:16,547 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:25:16,547 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:25:16,547 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:25:16,548 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:25:16,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:25:16" (1/1) ... [2022-12-06 07:25:16,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:25:16" (1/1) ... [2022-12-06 07:25:16,567 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:25:16" (1/1) ... [2022-12-06 07:25:16,568 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:25:16" (1/1) ... [2022-12-06 07:25:16,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:25:16" (1/1) ... [2022-12-06 07:25:16,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:25:16" (1/1) ... [2022-12-06 07:25:16,581 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:25:16" (1/1) ... [2022-12-06 07:25:16,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:25:16" (1/1) ... [2022-12-06 07:25:16,583 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:25:16,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:25:16,584 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:25:16,584 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:25:16,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:25:16" (1/1) ... [2022-12-06 07:25:16,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:25:16,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:25:16,613 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-06 07:25:16,634 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-06 07:25:16,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:25:16,652 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:25:16,654 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:25:16,654 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:25:16,654 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:25:16,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:25:16,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:25:16,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:25:16,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:25:16,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:25:16,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:25:16,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:25:16,656 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 07:25:16,758 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:25:16,760 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:25:16,982 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:25:16,991 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:25:16,991 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 07:25:16,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:25:16 BoogieIcfgContainer [2022-12-06 07:25:16,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:25:16,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:25:16,995 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:25:16,997 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:25:16,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:25:16" (1/3) ... [2022-12-06 07:25:16,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7c7304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:25:16, skipping insertion in model container [2022-12-06 07:25:16,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:25:16" (2/3) ... [2022-12-06 07:25:16,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7c7304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:25:16, skipping insertion in model container [2022-12-06 07:25:16,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:25:16" (3/3) ... [2022-12-06 07:25:17,000 INFO L112 eAbstractionObserver]: Analyzing ICFG mult-comm.wvr.c [2022-12-06 07:25:17,016 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:25:17,016 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:25:17,016 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:25:17,079 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 07:25:17,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 75 transitions, 166 flow [2022-12-06 07:25:17,143 INFO L130 PetriNetUnfolder]: 5/73 cut-off events. [2022-12-06 07:25:17,143 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:25:17,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 73 events. 5/73 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2022-12-06 07:25:17,148 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 75 transitions, 166 flow [2022-12-06 07:25:17,151 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 65 transitions, 142 flow [2022-12-06 07:25:17,153 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:17,168 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 65 transitions, 142 flow [2022-12-06 07:25:17,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 65 transitions, 142 flow [2022-12-06 07:25:17,198 INFO L130 PetriNetUnfolder]: 5/65 cut-off events. [2022-12-06 07:25:17,198 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:25:17,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 65 events. 5/65 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2022-12-06 07:25:17,201 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 65 transitions, 142 flow [2022-12-06 07:25:17,201 INFO L188 LiptonReduction]: Number of co-enabled transitions 500 [2022-12-06 07:25:19,327 INFO L203 LiptonReduction]: Total number of compositions: 50 [2022-12-06 07:25:19,356 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:25:19,362 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;@34e8bfa9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:25:19,362 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 07:25:19,366 INFO L130 PetriNetUnfolder]: 2/14 cut-off events. [2022-12-06 07:25:19,367 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:25:19,367 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:19,367 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:19,368 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-06 07:25:19,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:19,379 INFO L85 PathProgramCache]: Analyzing trace with hash 948435928, now seen corresponding path program 1 times [2022-12-06 07:25:19,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:19,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132520326] [2022-12-06 07:25:19,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:19,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:19,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-06 07:25:19,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:19,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132520326] [2022-12-06 07:25:19,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132520326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:19,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:19,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 07:25:19,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316616350] [2022-12-06 07:25:19,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:19,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:25:19,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:19,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:25:19,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:25:19,886 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-06 07:25:19,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:19,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:19,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-06 07:25:19,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:19,967 INFO L130 PetriNetUnfolder]: 65/114 cut-off events. [2022-12-06 07:25:19,967 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-06 07:25:19,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 114 events. 65/114 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 323 event pairs, 9 based on Foata normal form. 1/74 useless extension candidates. Maximal degree in co-relation 179. Up to 85 conditions per place. [2022-12-06 07:25:19,971 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 19 selfloop transitions, 3 changer transitions 1/25 dead transitions. [2022-12-06 07:25:19,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 25 transitions, 117 flow [2022-12-06 07:25:19,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:25:19,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:25:19,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 07:25:19,982 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-06 07:25:19,983 INFO L175 Difference]: Start difference. First operand has 20 places, 15 transitions, 42 flow. Second operand 3 states and 30 transitions. [2022-12-06 07:25:19,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 25 transitions, 117 flow [2022-12-06 07:25:19,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 25 transitions, 103 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 07:25:19,988 INFO L231 Difference]: Finished difference. Result has 19 places, 17 transitions, 53 flow [2022-12-06 07:25:19,989 INFO L276 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=53, PETRI_PLACES=19, PETRI_TRANSITIONS=17} [2022-12-06 07:25:19,992 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, -1 predicate places. [2022-12-06 07:25:19,992 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:19,993 INFO L89 Accepts]: Start accepts. Operand has 19 places, 17 transitions, 53 flow [2022-12-06 07:25:19,995 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:19,995 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:19,996 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 17 transitions, 53 flow [2022-12-06 07:25:19,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 17 transitions, 53 flow [2022-12-06 07:25:20,003 INFO L130 PetriNetUnfolder]: 7/29 cut-off events. [2022-12-06 07:25:20,003 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:25:20,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 29 events. 7/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 25. Up to 10 conditions per place. [2022-12-06 07:25:20,004 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 19 places, 17 transitions, 53 flow [2022-12-06 07:25:20,004 INFO L188 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-06 07:25:20,004 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:25:20,006 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 07:25:20,006 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 53 flow [2022-12-06 07:25:20,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:20,007 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:20,007 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:20,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:25:20,007 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-06 07:25:20,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:20,008 INFO L85 PathProgramCache]: Analyzing trace with hash -285936356, now seen corresponding path program 1 times [2022-12-06 07:25:20,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:20,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091562831] [2022-12-06 07:25:20,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:20,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:20,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:20,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:20,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091562831] [2022-12-06 07:25:20,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091562831] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:25:20,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927365751] [2022-12-06 07:25:20,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:20,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:25:20,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:25:20,279 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:25:20,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 07:25:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:20,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 07:25:20,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:25:20,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:20,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:25:20,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:20,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927365751] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:25:20,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:25:20,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 7 [2022-12-06 07:25:20,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314706415] [2022-12-06 07:25:20,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:25:20,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:25:20,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:20,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:25:20,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:25:20,676 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-06 07:25:20,677 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 17 transitions, 53 flow. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:20,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:20,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-06 07:25:20,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:20,992 INFO L130 PetriNetUnfolder]: 75/137 cut-off events. [2022-12-06 07:25:20,992 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-06 07:25:20,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339 conditions, 137 events. 75/137 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 430 event pairs, 1 based on Foata normal form. 1/136 useless extension candidates. Maximal degree in co-relation 84. Up to 79 conditions per place. [2022-12-06 07:25:20,993 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 21 selfloop transitions, 5 changer transitions 15/42 dead transitions. [2022-12-06 07:25:20,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 42 transitions, 200 flow [2022-12-06 07:25:20,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:25:20,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:25:20,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2022-12-06 07:25:20,994 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-06 07:25:20,995 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 53 flow. Second operand 6 states and 48 transitions. [2022-12-06 07:25:20,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 42 transitions, 200 flow [2022-12-06 07:25:20,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 42 transitions, 195 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:25:20,996 INFO L231 Difference]: Finished difference. Result has 26 places, 19 transitions, 78 flow [2022-12-06 07:25:20,996 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=78, PETRI_PLACES=26, PETRI_TRANSITIONS=19} [2022-12-06 07:25:20,997 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 6 predicate places. [2022-12-06 07:25:20,997 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:20,997 INFO L89 Accepts]: Start accepts. Operand has 26 places, 19 transitions, 78 flow [2022-12-06 07:25:20,998 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:20,998 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:20,998 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 19 transitions, 78 flow [2022-12-06 07:25:20,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 19 transitions, 78 flow [2022-12-06 07:25:21,002 INFO L130 PetriNetUnfolder]: 7/28 cut-off events. [2022-12-06 07:25:21,002 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 07:25:21,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 28 events. 7/28 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 50. Up to 10 conditions per place. [2022-12-06 07:25:21,003 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 19 transitions, 78 flow [2022-12-06 07:25:21,003 INFO L188 LiptonReduction]: Number of co-enabled transitions 70 [2022-12-06 07:25:21,052 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [170] $Ultimate##0-->L42-5: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] and [238] L50-5-->L50-5: Formula: (and (< (mod v_thread2Thread1of1ForFork0_~i~1_24 4294967296) (mod v_~a~0_34 4294967296)) (= (+ v_thread2Thread1of1ForFork0_~i~1_24 1) v_thread2Thread1of1ForFork0_~i~1_23) (= (+ v_~b~0_32 v_~x_2~0_32) v_~x_2~0_31)) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_24, ~a~0=v_~a~0_34, ~b~0=v_~b~0_32, ~x_2~0=v_~x_2~0_32} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_23, ~a~0=v_~a~0_34, ~b~0=v_~b~0_32, ~x_2~0=v_~x_2~0_31, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, ~x_2~0, thread2Thread1of1ForFork0_#t~post2] [2022-12-06 07:25:21,084 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:21,085 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 07:25:21,085 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 18 transitions, 78 flow [2022-12-06 07:25:21,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:21,086 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:21,086 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:21,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 07:25:21,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:25:21,294 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-06 07:25:21,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:21,296 INFO L85 PathProgramCache]: Analyzing trace with hash 933912008, now seen corresponding path program 1 times [2022-12-06 07:25:21,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:21,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467520014] [2022-12-06 07:25:21,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:21,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:21,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-06 07:25:21,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:21,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467520014] [2022-12-06 07:25:21,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467520014] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:21,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:21,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:21,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626043830] [2022-12-06 07:25:21,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:21,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:25:21,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:21,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:25:21,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:25:21,541 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-06 07:25:21,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 78 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:21,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:21,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-06 07:25:21,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:21,622 INFO L130 PetriNetUnfolder]: 48/92 cut-off events. [2022-12-06 07:25:21,623 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2022-12-06 07:25:21,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 92 events. 48/92 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 204 event pairs, 8 based on Foata normal form. 1/93 useless extension candidates. Maximal degree in co-relation 264. Up to 71 conditions per place. [2022-12-06 07:25:21,624 INFO L137 encePairwiseOnDemand]: 9/17 looper letters, 19 selfloop transitions, 9 changer transitions 4/33 dead transitions. [2022-12-06 07:25:21,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 33 transitions, 193 flow [2022-12-06 07:25:21,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:25:21,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:25:21,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-12-06 07:25:21,626 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38235294117647056 [2022-12-06 07:25:21,626 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 78 flow. Second operand 6 states and 39 transitions. [2022-12-06 07:25:21,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 33 transitions, 193 flow [2022-12-06 07:25:21,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 33 transitions, 165 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-06 07:25:21,628 INFO L231 Difference]: Finished difference. Result has 27 places, 23 transitions, 114 flow [2022-12-06 07:25:21,628 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=114, PETRI_PLACES=27, PETRI_TRANSITIONS=23} [2022-12-06 07:25:21,629 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 7 predicate places. [2022-12-06 07:25:21,629 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:21,629 INFO L89 Accepts]: Start accepts. Operand has 27 places, 23 transitions, 114 flow [2022-12-06 07:25:21,630 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:21,630 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:21,630 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 23 transitions, 114 flow [2022-12-06 07:25:21,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 23 transitions, 114 flow [2022-12-06 07:25:21,634 INFO L130 PetriNetUnfolder]: 8/33 cut-off events. [2022-12-06 07:25:21,634 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 07:25:21,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 33 events. 8/33 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 62 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 56. Up to 11 conditions per place. [2022-12-06 07:25:21,635 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 23 transitions, 114 flow [2022-12-06 07:25:21,635 INFO L188 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-06 07:25:21,691 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] L50-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_Out_4| 0) (= |v_thread2Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< (mod v_thread2Thread1of1ForFork0_~i~1_In_2 4294967296) (mod v_~a~0_In_2 4294967296)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_In_2, ~a~0=v_~a~0_In_2} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_4|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_In_2, ~a~0=v_~a~0_In_2, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base] and [254] $Ultimate##0-->L42-5: Formula: (and (< (mod (+ v_thread1Thread1of1ForFork1_~i~0_35 4294967295) 4294967296) (mod v_~b~0_48 4294967296)) (= v_thread1Thread1of1ForFork1_~i~0_35 2) (= (+ (* v_~a~0_54 2) v_~x_1~0_47) v_~x_1~0_45)) InVars {~a~0=v_~a~0_54, ~b~0=v_~b~0_48, ~x_1~0=v_~x_1~0_47} OutVars{~a~0=v_~a~0_54, ~b~0=v_~b~0_48, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_24|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_35, ~x_1~0=v_~x_1~0_45} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~x_1~0] [2022-12-06 07:25:21,798 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [180] $Ultimate##0-->L50-5: Formula: (= v_thread2Thread1of1ForFork0_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1] and [252] $Ultimate##0-->L42-5: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_29 1) (= (+ v_~a~0_50 v_~x_1~0_42) v_~x_1~0_41) (< 0 (mod v_~b~0_44 4294967296))) InVars {~a~0=v_~a~0_50, ~b~0=v_~b~0_44, ~x_1~0=v_~x_1~0_42} OutVars{~a~0=v_~a~0_50, ~b~0=v_~b~0_44, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_22|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_29, ~x_1~0=v_~x_1~0_41} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~x_1~0] [2022-12-06 07:25:21,875 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [180] $Ultimate##0-->L50-5: Formula: (= v_thread2Thread1of1ForFork0_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1] and [253] $Ultimate##0-->L50-5: Formula: (and (= (+ v_thread2Thread1of1ForFork0_~i~1_33 1) v_thread2Thread1of1ForFork0_~i~1_32) (= v_thread1Thread1of1ForFork1_~i~0_33 0) (= v_~x_2~0_43 (+ v_~b~0_46 v_~x_2~0_44)) (< (mod v_thread2Thread1of1ForFork0_~i~1_33 4294967296) (mod v_~a~0_52 4294967296))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_33, ~a~0=v_~a~0_52, ~b~0=v_~b~0_46, ~x_2~0=v_~x_2~0_44} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_32, ~a~0=v_~a~0_52, ~b~0=v_~b~0_46, ~x_2~0=v_~x_2~0_43, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_19|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, ~x_2~0, thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post2] [2022-12-06 07:25:21,906 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:25:21,907 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 278 [2022-12-06 07:25:21,907 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 116 flow [2022-12-06 07:25:21,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:21,908 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:21,908 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:21,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:25:21,908 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-06 07:25:21,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:21,909 INFO L85 PathProgramCache]: Analyzing trace with hash -2116490318, now seen corresponding path program 2 times [2022-12-06 07:25:21,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:21,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264973873] [2022-12-06 07:25:21,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:21,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:22,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-06 07:25:22,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:22,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264973873] [2022-12-06 07:25:22,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264973873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:22,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:22,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:22,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326135203] [2022-12-06 07:25:22,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:22,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:25:22,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:22,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:25:22,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:25:22,150 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 07:25:22,150 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 116 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:22,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:22,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 07:25:22,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:22,282 INFO L130 PetriNetUnfolder]: 73/131 cut-off events. [2022-12-06 07:25:22,283 INFO L131 PetriNetUnfolder]: For 97/97 co-relation queries the response was YES. [2022-12-06 07:25:22,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 419 conditions, 131 events. 73/131 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 355 event pairs, 5 based on Foata normal form. 1/130 useless extension candidates. Maximal degree in co-relation 268. Up to 77 conditions per place. [2022-12-06 07:25:22,284 INFO L137 encePairwiseOnDemand]: 9/20 looper letters, 27 selfloop transitions, 12 changer transitions 5/45 dead transitions. [2022-12-06 07:25:22,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 45 transitions, 276 flow [2022-12-06 07:25:22,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:25:22,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:25:22,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-12-06 07:25:22,286 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.425 [2022-12-06 07:25:22,286 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 116 flow. Second operand 6 states and 51 transitions. [2022-12-06 07:25:22,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 45 transitions, 276 flow [2022-12-06 07:25:22,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 45 transitions, 244 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:22,288 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 153 flow [2022-12-06 07:25:22,288 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=153, PETRI_PLACES=30, PETRI_TRANSITIONS=26} [2022-12-06 07:25:22,289 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 10 predicate places. [2022-12-06 07:25:22,289 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:22,289 INFO L89 Accepts]: Start accepts. Operand has 30 places, 26 transitions, 153 flow [2022-12-06 07:25:22,290 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:22,290 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:22,290 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 26 transitions, 153 flow [2022-12-06 07:25:22,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 26 transitions, 153 flow [2022-12-06 07:25:22,295 INFO L130 PetriNetUnfolder]: 12/46 cut-off events. [2022-12-06 07:25:22,295 INFO L131 PetriNetUnfolder]: For 26/27 co-relation queries the response was YES. [2022-12-06 07:25:22,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 46 events. 12/46 cut-off events. For 26/27 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 127 event pairs, 0 based on Foata normal form. 1/47 useless extension candidates. Maximal degree in co-relation 99. Up to 15 conditions per place. [2022-12-06 07:25:22,295 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 26 transitions, 153 flow [2022-12-06 07:25:22,296 INFO L188 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-06 07:25:22,347 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] L50-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_Out_4| 0) (= |v_thread2Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< (mod v_thread2Thread1of1ForFork0_~i~1_In_2 4294967296) (mod v_~a~0_In_2 4294967296)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_In_2, ~a~0=v_~a~0_In_2} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_4|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_In_2, ~a~0=v_~a~0_In_2, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base] and [223] L42-5-->L42-5: Formula: (and (< (mod v_thread1Thread1of1ForFork1_~i~0_24 4294967296) (mod v_~b~0_22 4294967296)) (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= v_~x_1~0_25 (+ v_~a~0_22 v_~x_1~0_26))) InVars {~a~0=v_~a~0_22, ~b~0=v_~b~0_22, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~x_1~0=v_~x_1~0_26} OutVars{~a~0=v_~a~0_22, ~b~0=v_~b~0_22, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~x_1~0=v_~x_1~0_25} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~x_1~0] [2022-12-06 07:25:22,507 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:25:22,508 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 219 [2022-12-06 07:25:22,509 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 25 transitions, 155 flow [2022-12-06 07:25:22,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:22,509 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:22,509 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:22,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 07:25:22,509 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-06 07:25:22,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:22,510 INFO L85 PathProgramCache]: Analyzing trace with hash -998089523, now seen corresponding path program 1 times [2022-12-06 07:25:22,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:22,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778766717] [2022-12-06 07:25:22,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:22,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:22,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-06 07:25:22,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:22,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778766717] [2022-12-06 07:25:22,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778766717] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:22,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:22,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:25:22,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869881043] [2022-12-06 07:25:22,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:22,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:25:22,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:22,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:25:22,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:25:22,692 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-06 07:25:22,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 25 transitions, 155 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:22,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:22,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-06 07:25:22,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:22,782 INFO L130 PetriNetUnfolder]: 79/141 cut-off events. [2022-12-06 07:25:22,782 INFO L131 PetriNetUnfolder]: For 167/167 co-relation queries the response was YES. [2022-12-06 07:25:22,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 141 events. 79/141 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 402 event pairs, 2 based on Foata normal form. 1/134 useless extension candidates. Maximal degree in co-relation 448. Up to 112 conditions per place. [2022-12-06 07:25:22,784 INFO L137 encePairwiseOnDemand]: 11/22 looper letters, 24 selfloop transitions, 11 changer transitions 2/39 dead transitions. [2022-12-06 07:25:22,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 39 transitions, 280 flow [2022-12-06 07:25:22,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:25:22,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:25:22,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-06 07:25:22,785 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37272727272727274 [2022-12-06 07:25:22,785 INFO L175 Difference]: Start difference. First operand has 28 places, 25 transitions, 155 flow. Second operand 5 states and 41 transitions. [2022-12-06 07:25:22,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 39 transitions, 280 flow [2022-12-06 07:25:22,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 39 transitions, 247 flow, removed 13 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:22,788 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 182 flow [2022-12-06 07:25:22,788 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=182, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2022-12-06 07:25:22,788 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 11 predicate places. [2022-12-06 07:25:22,789 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:22,789 INFO L89 Accepts]: Start accepts. Operand has 31 places, 29 transitions, 182 flow [2022-12-06 07:25:22,789 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:22,789 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:22,790 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 29 transitions, 182 flow [2022-12-06 07:25:22,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 29 transitions, 182 flow [2022-12-06 07:25:22,794 INFO L130 PetriNetUnfolder]: 14/47 cut-off events. [2022-12-06 07:25:22,794 INFO L131 PetriNetUnfolder]: For 28/29 co-relation queries the response was YES. [2022-12-06 07:25:22,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 47 events. 14/47 cut-off events. For 28/29 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 114. Up to 15 conditions per place. [2022-12-06 07:25:22,797 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 29 transitions, 182 flow [2022-12-06 07:25:22,797 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 07:25:22,859 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [259] $Ultimate##0-->L50-5: Formula: (and (< (mod (+ 4294967295 v_thread2Thread1of1ForFork0_~i~1_46) 4294967296) (mod v_~a~0_64 4294967296)) (= v_thread1Thread1of1ForFork1_~i~0_45 0) (= (+ v_~b~0_58 v_~x_2~0_52) v_~x_2~0_51) (= v_thread2Thread1of1ForFork0_~i~1_46 1)) InVars {~a~0=v_~a~0_64, ~b~0=v_~b~0_58, ~x_2~0=v_~x_2~0_52} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_46, ~a~0=v_~a~0_64, ~b~0=v_~b~0_58, ~x_2~0=v_~x_2~0_51, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_45, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, ~x_2~0, thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post2] and [251] L42-5-->thread1EXIT: Formula: (and (not (< (mod v_thread1Thread1of1ForFork1_~i~0_In_3 4294967296) (mod v_~b~0_In_2 4294967296))) (= |v_thread1Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~b~0=v_~b~0_In_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_4|, ~b~0=v_~b~0_In_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] [2022-12-06 07:25:22,929 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [259] $Ultimate##0-->L50-5: Formula: (and (< (mod (+ 4294967295 v_thread2Thread1of1ForFork0_~i~1_46) 4294967296) (mod v_~a~0_64 4294967296)) (= v_thread1Thread1of1ForFork1_~i~0_45 0) (= (+ v_~b~0_58 v_~x_2~0_52) v_~x_2~0_51) (= v_thread2Thread1of1ForFork0_~i~1_46 1)) InVars {~a~0=v_~a~0_64, ~b~0=v_~b~0_58, ~x_2~0=v_~x_2~0_52} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_46, ~a~0=v_~a~0_64, ~b~0=v_~b~0_58, ~x_2~0=v_~x_2~0_51, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_45, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, ~x_2~0, thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post2] and [223] L42-5-->L42-5: Formula: (and (< (mod v_thread1Thread1of1ForFork1_~i~0_24 4294967296) (mod v_~b~0_22 4294967296)) (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= v_~x_1~0_25 (+ v_~a~0_22 v_~x_1~0_26))) InVars {~a~0=v_~a~0_22, ~b~0=v_~b~0_22, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~x_1~0=v_~x_1~0_26} OutVars{~a~0=v_~a~0_22, ~b~0=v_~b~0_22, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~x_1~0=v_~x_1~0_25} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~x_1~0] [2022-12-06 07:25:22,977 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [264] $Ultimate##0-->thread1EXIT: Formula: (and (= v_thread2Thread1of1ForFork0_~i~1_58 1) (= |v_thread1Thread1of1ForFork1_#res.offset_15| 0) (< (mod (+ 4294967295 v_thread2Thread1of1ForFork0_~i~1_58) 4294967296) (mod v_~a~0_74 4294967296)) (= v_thread1Thread1of1ForFork1_~i~0_61 0) (= v_~x_2~0_61 (+ v_~b~0_68 v_~x_2~0_62)) (= |v_thread1Thread1of1ForFork1_#res.base_15| 0) (not (< (mod v_thread1Thread1of1ForFork1_~i~0_61 4294967296) (mod v_~b~0_68 4294967296)))) InVars {~a~0=v_~a~0_74, ~b~0=v_~b~0_68, ~x_2~0=v_~x_2~0_62} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_58, ~a~0=v_~a~0_74, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_15|, ~b~0=v_~b~0_68, ~x_2~0=v_~x_2~0_61, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_61, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_15|, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread1Thread1of1ForFork1_#res.base, ~x_2~0, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork0_#t~post2] and [238] L50-5-->L50-5: Formula: (and (< (mod v_thread2Thread1of1ForFork0_~i~1_24 4294967296) (mod v_~a~0_34 4294967296)) (= (+ v_thread2Thread1of1ForFork0_~i~1_24 1) v_thread2Thread1of1ForFork0_~i~1_23) (= (+ v_~b~0_32 v_~x_2~0_32) v_~x_2~0_31)) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_24, ~a~0=v_~a~0_34, ~b~0=v_~b~0_32, ~x_2~0=v_~x_2~0_32} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_23, ~a~0=v_~a~0_34, ~b~0=v_~b~0_32, ~x_2~0=v_~x_2~0_31, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, ~x_2~0, thread2Thread1of1ForFork0_#t~post2] [2022-12-06 07:25:23,071 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:25:23,072 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 283 [2022-12-06 07:25:23,072 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 27 transitions, 182 flow [2022-12-06 07:25:23,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:23,072 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:23,072 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:23,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 07:25:23,073 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-06 07:25:23,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:23,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1437561251, now seen corresponding path program 1 times [2022-12-06 07:25:23,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:23,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523341305] [2022-12-06 07:25:23,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:23,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:23,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-06 07:25:23,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:23,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523341305] [2022-12-06 07:25:23,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523341305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:23,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:23,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:23,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423069337] [2022-12-06 07:25:23,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:23,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:23,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:23,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:23,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:23,228 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:23,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:23,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:23,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:23,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:23,292 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:23,293 INFO L131 PetriNetUnfolder]: For 158/158 co-relation queries the response was YES. [2022-12-06 07:25:23,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 120 events. 64/120 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/121 useless extension candidates. Maximal degree in co-relation 399. Up to 101 conditions per place. [2022-12-06 07:25:23,294 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:23,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 36 transitions, 277 flow [2022-12-06 07:25:23,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:23,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:23,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:23,296 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:23,296 INFO L175 Difference]: Start difference. First operand has 29 places, 27 transitions, 182 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:23,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 36 transitions, 277 flow [2022-12-06 07:25:23,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-12-06 07:25:23,299 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:23,299 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:23,302 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:23,302 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:23,302 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:23,302 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:23,303 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:23,303 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:23,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:23,309 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:23,310 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:23,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:23,310 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:23,311 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:23,407 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:23,408 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-06 07:25:23,408 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:23,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:23,409 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:23,409 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:23,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 07:25:23,409 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-06 07:25:23,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:23,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1550230813, now seen corresponding path program 1 times [2022-12-06 07:25:23,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:23,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479023954] [2022-12-06 07:25:23,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:23,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:23,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-06 07:25:23,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:23,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479023954] [2022-12-06 07:25:23,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479023954] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:23,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:23,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:23,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664793862] [2022-12-06 07:25:23,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:23,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:23,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:23,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:23,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:23,579 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:23,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:23,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:23,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:23,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:23,631 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:23,631 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:23,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:23,633 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:23,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:23,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:23,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:23,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:23,636 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:23,636 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:23,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:23,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:23,640 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:23,640 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:23,641 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:23,641 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:23,641 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:23,641 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:23,641 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:23,642 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:23,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:23,646 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:23,646 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:23,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:23,647 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:23,647 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:23,745 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:23,746 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-06 07:25:23,746 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:23,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:23,747 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:23,747 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:23,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 07:25:23,747 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-06 07:25:23,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:23,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1580707006, now seen corresponding path program 1 times [2022-12-06 07:25:23,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:23,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108263859] [2022-12-06 07:25:23,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:23,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:23,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-06 07:25:23,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:23,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108263859] [2022-12-06 07:25:23,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108263859] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:23,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:23,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:23,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941846735] [2022-12-06 07:25:23,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:23,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:23,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:23,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:23,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:23,892 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:23,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:23,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:23,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:23,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:23,963 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:23,964 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:23,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:23,965 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:23,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:23,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:23,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:23,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:23,967 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:23,967 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:23,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:23,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:23,969 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:23,969 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:23,972 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:23,972 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:23,972 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:23,972 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:23,972 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:23,973 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:23,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:23,977 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:23,977 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:23,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:23,978 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:23,978 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:24,071 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:24,072 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 07:25:24,072 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:24,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:24,073 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:24,073 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:24,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 07:25:24,073 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-06 07:25:24,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:24,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1607489115, now seen corresponding path program 1 times [2022-12-06 07:25:24,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:24,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156307054] [2022-12-06 07:25:24,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:24,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25: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-06 07:25:24,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:24,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156307054] [2022-12-06 07:25:24,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156307054] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:24,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:24,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:24,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896359466] [2022-12-06 07:25:24,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:24,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:24,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:24,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:24,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:24,247 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:24,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:24,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:24,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:24,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:24,295 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:24,296 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:24,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:24,297 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:24,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:24,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:24,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:24,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:24,298 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:24,298 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:24,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:24,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:24,300 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:24,300 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:24,301 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:24,301 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:24,301 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:24,302 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:24,302 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:24,302 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:24,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:24,312 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:24,313 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:24,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:24,313 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:24,313 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:24,411 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:24,412 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-06 07:25:24,412 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:24,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:24,412 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:24,412 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:24,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 07:25:24,412 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-06 07:25:24,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:24,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1637965308, now seen corresponding path program 1 times [2022-12-06 07:25:24,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:24,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683228069] [2022-12-06 07:25:24,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:24,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:24,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:24,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-06 07:25:24,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:24,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683228069] [2022-12-06 07:25:24,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683228069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:24,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:24,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:24,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157893598] [2022-12-06 07:25:24,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:24,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:24,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:24,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:24,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:24,526 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:24,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:24,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:24,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:24,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:24,580 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:24,580 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:24,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:24,582 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:24,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:24,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:24,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:24,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:24,584 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:24,584 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:24,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:24,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:24,585 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:24,586 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:24,586 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:24,587 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:24,587 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:24,587 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:24,587 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:24,587 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:24,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:24,594 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:24,594 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:24,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:24,595 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:24,595 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:24,690 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:24,691 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-06 07:25:24,691 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:24,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:24,692 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:24,692 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:24,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 07:25:24,692 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-06 07:25:24,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:24,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1664747417, now seen corresponding path program 1 times [2022-12-06 07:25:24,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:24,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409560791] [2022-12-06 07:25:24,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:24,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:24,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-06 07:25:24,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:24,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409560791] [2022-12-06 07:25:24,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409560791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:24,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:24,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:24,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492107186] [2022-12-06 07:25:24,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:24,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:24,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:24,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:24,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:24,837 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:24,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:24,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:24,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:24,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:24,893 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:24,893 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:24,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:24,894 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:24,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:24,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:24,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:24,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:24,895 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:24,895 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:24,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:24,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:24,897 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:24,897 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:24,897 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:24,898 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:24,898 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:24,898 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:24,898 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:24,898 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:24,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:24,903 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:24,903 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:24,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:24,903 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:24,903 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:24,995 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:24,995 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 07:25:24,996 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:24,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:24,996 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:24,996 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:24,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 07:25:24,996 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-06 07:25:24,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:24,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1695223610, now seen corresponding path program 1 times [2022-12-06 07:25:24,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:24,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350877114] [2022-12-06 07:25:24,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:24,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:25,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-06 07:25:25,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:25,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350877114] [2022-12-06 07:25:25,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350877114] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:25,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:25,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:25,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278938836] [2022-12-06 07:25:25,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:25,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:25,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:25,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:25,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:25,140 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:25,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:25,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:25,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:25,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:25,203 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:25,203 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:25,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:25,204 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:25,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:25,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:25,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:25,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:25,206 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:25,206 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:25,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:25,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 36 transitions, 244 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 07:25:25,207 INFO L231 Difference]: Finished difference. Result has 30 places, 28 transitions, 185 flow [2022-12-06 07:25:25,207 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=185, PETRI_PLACES=30, PETRI_TRANSITIONS=28} [2022-12-06 07:25:25,208 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 10 predicate places. [2022-12-06 07:25:25,208 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:25,208 INFO L89 Accepts]: Start accepts. Operand has 30 places, 28 transitions, 185 flow [2022-12-06 07:25:25,210 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:25,210 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:25,210 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 28 transitions, 185 flow [2022-12-06 07:25:25,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 28 transitions, 185 flow [2022-12-06 07:25:25,217 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:25,217 INFO L131 PetriNetUnfolder]: For 40/41 co-relation queries the response was YES. [2022-12-06 07:25:25,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 48 events. 16/48 cut-off events. For 40/41 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 117. Up to 16 conditions per place. [2022-12-06 07:25:25,218 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 28 transitions, 185 flow [2022-12-06 07:25:25,218 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:25,314 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:25,315 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-06 07:25:25,315 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 27 transitions, 177 flow [2022-12-06 07:25:25,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:25,315 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:25,315 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:25,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 07:25:25,316 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-06 07:25:25,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:25,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1722005719, now seen corresponding path program 1 times [2022-12-06 07:25:25,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:25,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229630980] [2022-12-06 07:25:25,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:25,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07: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-06 07:25:25,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:25,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229630980] [2022-12-06 07:25:25,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229630980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:25,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:25,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:25,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680247287] [2022-12-06 07:25:25,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:25,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:25,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:25,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:25,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:25,465 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:25,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 177 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:25,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:25,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:25,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:25,516 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:25,516 INFO L131 PetriNetUnfolder]: For 161/161 co-relation queries the response was YES. [2022-12-06 07:25:25,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 126 events. 68/126 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 388. Up to 103 conditions per place. [2022-12-06 07:25:25,517 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:25,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 36 transitions, 270 flow [2022-12-06 07:25:25,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:25,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:25,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:25,518 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:25,518 INFO L175 Difference]: Start difference. First operand has 29 places, 27 transitions, 177 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:25,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 36 transitions, 270 flow [2022-12-06 07:25:25,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 36 transitions, 246 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:25,521 INFO L231 Difference]: Finished difference. Result has 30 places, 28 transitions, 185 flow [2022-12-06 07:25:25,521 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=185, PETRI_PLACES=30, PETRI_TRANSITIONS=28} [2022-12-06 07:25:25,522 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 10 predicate places. [2022-12-06 07:25:25,522 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:25,522 INFO L89 Accepts]: Start accepts. Operand has 30 places, 28 transitions, 185 flow [2022-12-06 07:25:25,522 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:25,522 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:25,523 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 28 transitions, 185 flow [2022-12-06 07:25:25,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 28 transitions, 185 flow [2022-12-06 07:25:25,527 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:25,527 INFO L131 PetriNetUnfolder]: For 42/43 co-relation queries the response was YES. [2022-12-06 07:25:25,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 48 events. 14/48 cut-off events. For 42/43 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 114. Up to 15 conditions per place. [2022-12-06 07:25:25,528 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 28 transitions, 185 flow [2022-12-06 07:25:25,528 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:25,622 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:25,623 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-06 07:25:25,623 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 27 transitions, 179 flow [2022-12-06 07:25:25,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:25,624 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:25,624 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:25,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 07:25:25,624 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-06 07:25:25,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:25,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1752481912, now seen corresponding path program 1 times [2022-12-06 07:25:25,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:25,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941972544] [2022-12-06 07:25:25,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:25,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:25,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-06 07:25:25,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:25,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941972544] [2022-12-06 07:25:25,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941972544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:25,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:25,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:25,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512985397] [2022-12-06 07:25:25,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:25,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:25,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:25,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:25,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:25,789 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:25,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 179 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:25,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:25,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:25,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:25,848 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:25,848 INFO L131 PetriNetUnfolder]: For 172/172 co-relation queries the response was YES. [2022-12-06 07:25:25,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 120 events. 64/120 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 370. Up to 101 conditions per place. [2022-12-06 07:25:25,849 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:25,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 36 transitions, 270 flow [2022-12-06 07:25:25,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:25,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:25,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:25,850 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:25,850 INFO L175 Difference]: Start difference. First operand has 29 places, 27 transitions, 179 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:25,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 36 transitions, 270 flow [2022-12-06 07:25:25,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-06 07:25:25,852 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:25,852 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:25,853 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:25,853 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:25,853 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:25,853 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:25,853 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:25,853 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:25,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:25,858 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:25,858 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:25,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:25,858 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:25,858 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:25,957 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:25,958 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-06 07:25:25,958 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:25,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:25,959 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:25,959 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:25,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 07:25:25,959 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-06 07:25:25,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:25,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1779264021, now seen corresponding path program 1 times [2022-12-06 07:25:25,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:25,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72983420] [2022-12-06 07:25:25,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:25,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:26,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:26,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:26,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72983420] [2022-12-06 07:25:26,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72983420] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:26,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:26,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:26,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975780664] [2022-12-06 07:25:26,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:26,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:26,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:26,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:26,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:26,130 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:26,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:26,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:26,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:26,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:26,196 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:26,196 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:26,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:26,198 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:26,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:26,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:26,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:26,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:26,199 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:26,199 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:26,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:26,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:26,201 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:26,201 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:26,202 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:26,203 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:26,203 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:26,204 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:26,204 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:26,204 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:26,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:26,210 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:26,210 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:26,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:26,211 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:26,211 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:26,311 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:26,312 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 110 [2022-12-06 07:25:26,313 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:26,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:26,313 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:26,313 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:26,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 07:25:26,313 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-06 07:25:26,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:26,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1809740214, now seen corresponding path program 1 times [2022-12-06 07:25:26,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:26,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712778646] [2022-12-06 07:25:26,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:26,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:26,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-06 07:25:26,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:26,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712778646] [2022-12-06 07:25:26,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712778646] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:26,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:26,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:26,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561668962] [2022-12-06 07:25:26,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:26,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:26,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:26,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:26,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:26,425 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:26,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:26,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:26,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:26,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:26,473 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:26,473 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:26,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:26,474 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:26,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:26,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:26,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:26,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:26,475 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:26,475 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:26,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:26,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:26,477 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:26,477 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:26,477 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:26,477 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:26,477 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:26,478 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:26,478 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:26,478 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:26,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:26,482 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:26,482 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:26,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:26,483 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:26,483 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:26,571 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:26,572 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 07:25:26,572 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:26,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:26,572 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:26,572 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:26,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 07:25:26,573 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-06 07:25:26,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:26,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1836522323, now seen corresponding path program 1 times [2022-12-06 07:25:26,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:26,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669620081] [2022-12-06 07:25:26,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:26,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:26,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-06 07:25:26,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:26,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669620081] [2022-12-06 07:25:26,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669620081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:26,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:26,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:26,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025327560] [2022-12-06 07:25:26,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:26,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:26,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:26,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:26,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:26,690 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:26,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:26,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:26,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:26,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:26,752 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:26,752 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:26,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:26,753 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:26,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:26,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:26,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:26,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:26,754 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:26,755 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:26,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:26,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:26,756 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:26,756 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:26,757 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:26,757 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:26,757 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:26,758 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:26,758 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:26,758 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:26,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:26,766 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:26,766 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:26,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:26,767 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:26,767 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:26,860 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:26,861 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-06 07:25:26,861 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:26,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:26,861 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:26,862 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:26,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 07:25:26,862 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-06 07:25:26,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:26,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1866998516, now seen corresponding path program 1 times [2022-12-06 07:25:26,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:26,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185902374] [2022-12-06 07:25:26,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:26,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:26,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-06 07:25:26,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:26,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185902374] [2022-12-06 07:25:26,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185902374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:26,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:26,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:26,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490947195] [2022-12-06 07:25:26,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:26,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:26,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:26,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:26,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:26,998 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:26,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:26,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:26,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:26,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:27,059 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:27,059 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:27,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:27,060 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:27,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:27,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:27,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:27,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:27,061 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:27,062 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:27,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:27,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:27,063 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:27,063 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:27,064 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:27,064 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:27,064 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:27,065 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:27,065 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:27,065 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:27,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:27,070 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:27,070 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:27,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:27,071 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:27,071 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:27,165 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:27,166 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-06 07:25:27,166 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:27,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:27,166 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:27,166 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:27,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 07:25:27,166 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-06 07:25:27,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:27,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1893780625, now seen corresponding path program 1 times [2022-12-06 07:25:27,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:27,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042091877] [2022-12-06 07:25:27,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:27,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:27,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-06 07:25:27,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:27,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042091877] [2022-12-06 07:25:27,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042091877] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:27,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:27,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:27,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431746285] [2022-12-06 07:25:27,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:27,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:27,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:27,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:27,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:27,281 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:27,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:27,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:27,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:27,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:27,329 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:27,330 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:27,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:27,331 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:27,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:27,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:27,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:27,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:27,332 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:27,332 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:27,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:27,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:27,333 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:27,334 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:27,334 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:27,334 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:27,334 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:27,335 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:27,335 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:27,335 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:27,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:27,339 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:27,339 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:27,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:27,340 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:27,340 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:27,433 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:27,434 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 07:25:27,434 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:27,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:27,434 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:27,434 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:27,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 07:25:27,434 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-06 07:25:27,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:27,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1924256818, now seen corresponding path program 1 times [2022-12-06 07:25:27,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:27,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958570881] [2022-12-06 07:25:27,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:27,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:27,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-06 07:25:27,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:27,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958570881] [2022-12-06 07:25:27,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958570881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:27,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:27,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:27,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134291050] [2022-12-06 07:25:27,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:27,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:27,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:27,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:27,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:27,543 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:27,543 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:27,543 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:27,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:27,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:27,604 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:27,605 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:25:27,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:27,606 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:27,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:27,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:27,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:27,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:27,607 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:27,607 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:27,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:27,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:27,609 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:27,609 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:27,609 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:27,609 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:27,609 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:27,610 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:27,610 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:27,610 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:27,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:27,628 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:27,628 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:27,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:27,629 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:27,629 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:27,723 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:27,724 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-06 07:25:27,724 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:27,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:27,724 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:27,724 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:27,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 07:25:27,724 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-06 07:25:27,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:27,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1951038927, now seen corresponding path program 1 times [2022-12-06 07:25:27,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:27,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852255557] [2022-12-06 07:25:27,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:27,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:27,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-06 07:25:27,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:27,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852255557] [2022-12-06 07:25:27,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852255557] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:27,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:27,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:27,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539190842] [2022-12-06 07:25:27,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:27,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:27,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:27,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:27,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:27,832 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:27,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:27,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:27,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:27,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:27,895 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:27,896 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:27,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:27,897 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:27,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:27,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:27,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:27,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:27,898 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:27,898 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:27,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:27,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:27,899 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:27,899 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:27,900 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:27,900 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:27,901 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:27,902 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:27,902 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:27,902 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:27,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:27,907 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:27,907 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:27,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:27,907 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:27,907 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:27,999 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:28,000 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 07:25:28,000 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:28,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:28,000 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:28,001 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:28,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 07:25:28,001 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-06 07:25:28,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:28,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1981515120, now seen corresponding path program 1 times [2022-12-06 07:25:28,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:28,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823475914] [2022-12-06 07:25:28,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:28,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:28,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-06 07:25:28,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:28,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823475914] [2022-12-06 07:25:28,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823475914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:28,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:28,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:28,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728303790] [2022-12-06 07:25:28,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:28,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:28,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:28,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:28,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:28,109 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:28,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:28,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:28,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:28,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:28,161 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:28,161 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:28,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:28,163 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:28,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:28,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:28,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:28,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:28,164 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:28,164 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:28,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:28,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:28,165 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:28,165 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:28,166 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:28,166 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:28,166 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:28,167 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:28,167 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:28,167 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:28,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:28,172 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:28,172 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:28,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:28,172 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:28,172 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:28,269 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:28,270 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-06 07:25:28,270 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:28,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:28,270 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:28,270 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:28,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 07:25:28,270 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-06 07:25:28,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:28,271 INFO L85 PathProgramCache]: Analyzing trace with hash 2008297229, now seen corresponding path program 1 times [2022-12-06 07:25:28,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:28,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035967005] [2022-12-06 07:25:28,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:28,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:28,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-06 07:25:28,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:28,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035967005] [2022-12-06 07:25:28,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035967005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:28,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:28,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:28,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470529682] [2022-12-06 07:25:28,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:28,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:28,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:28,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:28,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:28,401 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:28,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:28,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:28,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:28,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:28,452 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:28,452 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:28,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:28,453 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:28,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:28,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:28,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:28,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:28,454 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:28,454 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:28,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:28,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:28,456 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:28,456 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:28,456 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:28,456 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:28,457 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:28,458 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:28,458 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:28,458 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:28,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:28,463 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:28,463 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:28,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:28,464 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:28,464 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:28,559 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:28,560 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-06 07:25:28,560 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:28,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:28,560 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:28,560 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:28,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 07:25:28,561 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-06 07:25:28,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:28,561 INFO L85 PathProgramCache]: Analyzing trace with hash 2038773422, now seen corresponding path program 1 times [2022-12-06 07:25:28,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:28,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166674611] [2022-12-06 07:25:28,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:28,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:28,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-06 07:25:28,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:28,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166674611] [2022-12-06 07:25:28,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166674611] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:28,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:28,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:28,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667685108] [2022-12-06 07:25:28,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:28,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:28,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:28,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:28,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:28,691 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:28,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:28,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:28,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:28,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:28,755 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:28,755 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:28,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:28,757 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:28,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:28,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:28,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:28,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:28,758 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:28,758 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:28,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:28,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:28,759 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:28,759 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:28,759 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:28,760 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:28,760 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:28,760 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:28,760 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:28,760 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:28,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:28,765 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:28,765 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:28,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:28,765 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:28,765 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:28,864 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:28,864 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-06 07:25:28,864 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:28,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:28,865 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:28,865 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:28,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 07:25:28,865 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-06 07:25:28,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:28,865 INFO L85 PathProgramCache]: Analyzing trace with hash 2065555531, now seen corresponding path program 1 times [2022-12-06 07:25:28,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:28,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403408362] [2022-12-06 07:25:28,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:28,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:28,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-06 07:25:28,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:28,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403408362] [2022-12-06 07:25:28,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403408362] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:28,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:28,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:28,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228218856] [2022-12-06 07:25:28,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:28,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:28,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:28,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:28,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:28,968 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:28,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:28,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:28,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:28,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:29,027 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:29,027 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:29,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:29,029 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:29,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:29,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:29,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:29,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:29,030 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:29,030 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:29,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:29,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:29,031 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:29,031 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:29,032 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:29,032 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:29,032 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:29,032 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:29,032 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:29,032 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:29,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:29,036 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:29,036 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:29,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:29,037 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:29,037 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:29,130 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:29,131 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 07:25:29,131 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:29,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:29,131 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:29,131 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:29,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 07:25:29,131 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-06 07:25:29,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:29,132 INFO L85 PathProgramCache]: Analyzing trace with hash 2096031724, now seen corresponding path program 1 times [2022-12-06 07:25:29,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:29,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884338504] [2022-12-06 07:25:29,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:29,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:29,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-06 07:25:29,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:29,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884338504] [2022-12-06 07:25:29,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884338504] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:29,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:29,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:29,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491718485] [2022-12-06 07:25:29,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:29,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:29,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:29,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:29,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:29,260 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:29,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:29,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:29,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:29,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:29,319 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:29,319 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:29,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:29,320 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:29,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:29,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:29,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:29,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:29,321 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:29,321 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:29,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:29,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:29,325 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:29,325 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:29,325 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:29,325 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:29,326 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:29,326 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:29,326 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:29,326 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:29,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:29,331 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:29,331 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:29,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:29,332 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:29,332 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:29,426 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:29,427 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-06 07:25:29,427 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:29,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:29,427 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:29,428 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:29,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 07:25:29,428 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-06 07:25:29,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:29,428 INFO L85 PathProgramCache]: Analyzing trace with hash 2122813833, now seen corresponding path program 1 times [2022-12-06 07:25:29,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:29,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766244690] [2022-12-06 07:25:29,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:29,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:29,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:29,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-06 07:25:29,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:29,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766244690] [2022-12-06 07:25:29,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766244690] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:29,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:29,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:29,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91333142] [2022-12-06 07:25:29,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:29,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:29,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:29,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:29,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:29,532 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:29,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:29,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:29,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:29,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:29,581 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:29,581 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:29,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:29,582 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:29,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:29,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:29,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:29,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:29,583 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:29,583 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:29,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:29,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:29,585 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:29,585 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:29,585 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:29,586 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:29,586 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:29,586 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:29,586 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:29,586 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:29,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:29,590 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:29,590 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:29,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:29,591 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:29,591 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:29,684 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:29,685 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 07:25:29,685 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:29,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:29,686 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:29,686 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:29,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-06 07:25:29,686 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-06 07:25:29,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:29,686 INFO L85 PathProgramCache]: Analyzing trace with hash -2141677270, now seen corresponding path program 1 times [2022-12-06 07:25:29,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:29,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857820847] [2022-12-06 07:25:29,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:29,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:29,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:29,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:29,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857820847] [2022-12-06 07:25:29,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857820847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:29,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:29,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:29,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676449044] [2022-12-06 07:25:29,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:29,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:29,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:29,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:29,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:29,777 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:29,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:29,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:29,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:29,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:29,825 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:29,825 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:25:29,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:29,827 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:29,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:29,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:29,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:29,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:29,828 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:29,828 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:29,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:29,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:29,829 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:29,829 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:29,829 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:29,830 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:29,830 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:29,830 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:29,830 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:29,830 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:29,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:29,834 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:29,834 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:29,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:29,835 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:29,835 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:29,930 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:29,930 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 07:25:29,930 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:29,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:29,931 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:29,931 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:29,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 07:25:29,931 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-06 07:25:29,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:29,931 INFO L85 PathProgramCache]: Analyzing trace with hash -2114895161, now seen corresponding path program 1 times [2022-12-06 07:25:29,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:29,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526675783] [2022-12-06 07:25:29,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:29,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:29,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:30,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-06 07:25:30,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:30,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526675783] [2022-12-06 07:25:30,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526675783] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:30,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:30,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:30,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747807441] [2022-12-06 07:25:30,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:30,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:30,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:30,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:30,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:30,066 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:30,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:30,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:30,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:30,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:30,126 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:30,126 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:30,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:30,127 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:30,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:30,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:30,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:30,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:30,128 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:30,128 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:30,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:30,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:30,130 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:30,130 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:30,132 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:30,132 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:30,132 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:30,132 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:30,133 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:30,133 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:30,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:30,137 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:30,138 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:30,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:30,138 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:30,138 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:30,233 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:30,234 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-06 07:25:30,234 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:30,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:30,234 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:30,234 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:30,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-06 07:25:30,235 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-06 07:25:30,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:30,235 INFO L85 PathProgramCache]: Analyzing trace with hash -2084418968, now seen corresponding path program 1 times [2022-12-06 07:25:30,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:30,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163144837] [2022-12-06 07:25:30,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:30,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:30,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-06 07:25:30,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:30,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163144837] [2022-12-06 07:25:30,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163144837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:30,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:30,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:30,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910627481] [2022-12-06 07:25:30,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:30,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:30,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:30,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:30,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:30,339 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:30,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:30,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:30,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:30,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:30,386 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:30,386 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:30,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:30,387 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:30,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:30,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:30,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:30,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:30,388 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:30,388 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:30,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:30,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:30,390 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:30,390 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:30,390 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:30,391 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:30,391 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:30,391 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:30,391 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:30,391 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:30,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:30,395 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:30,395 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:30,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:30,396 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:30,396 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:30,486 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:30,487 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:25:30,487 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:30,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:30,487 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:30,487 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:30,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-06 07:25:30,487 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-06 07:25:30,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:30,488 INFO L85 PathProgramCache]: Analyzing trace with hash -2057636859, now seen corresponding path program 1 times [2022-12-06 07:25:30,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:30,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045089634] [2022-12-06 07:25:30,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:30,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:30,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-06 07:25:30,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:30,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045089634] [2022-12-06 07:25:30,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045089634] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:30,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:30,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:30,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812156159] [2022-12-06 07:25:30,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:30,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:30,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:30,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:30,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:30,603 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:30,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:30,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:30,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:30,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:30,650 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:30,650 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:30,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:30,652 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:30,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:30,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:30,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:30,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:30,654 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:30,654 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:30,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:30,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:30,655 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:30,656 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:30,656 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:30,656 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:30,656 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:30,656 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:30,656 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:30,657 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:30,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:30,661 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:30,661 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:30,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:30,662 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:30,662 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:30,749 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:30,750 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 07:25:30,750 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:30,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:30,750 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:30,750 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:30,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-06 07:25:30,751 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-06 07:25:30,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:30,751 INFO L85 PathProgramCache]: Analyzing trace with hash -2027160666, now seen corresponding path program 1 times [2022-12-06 07:25:30,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:30,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240265010] [2022-12-06 07:25:30,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:30,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:30,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:30,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-06 07:25:30,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:30,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240265010] [2022-12-06 07:25:30,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240265010] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:30,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:30,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:30,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490150329] [2022-12-06 07:25:30,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:30,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:30,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:30,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:30,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:30,864 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:30,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:30,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:30,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:30,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:30,927 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:30,927 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:30,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:30,928 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:30,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:30,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:30,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:30,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:30,929 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:30,930 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:30,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:30,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:30,932 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:30,932 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:30,932 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:30,933 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:30,933 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:30,933 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:30,933 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:30,933 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:30,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:30,937 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:30,937 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:30,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:30,938 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:30,938 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:31,032 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:31,032 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 07:25:31,032 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:31,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:31,033 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:31,033 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:31,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-06 07:25:31,033 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-06 07:25:31,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:31,033 INFO L85 PathProgramCache]: Analyzing trace with hash -2000378557, now seen corresponding path program 1 times [2022-12-06 07:25:31,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:31,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242940118] [2022-12-06 07:25:31,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:31,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:31,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-06 07:25:31,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:31,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242940118] [2022-12-06 07:25:31,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242940118] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:31,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:31,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:31,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027679838] [2022-12-06 07:25:31,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:31,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:31,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:31,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:31,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:31,131 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:31,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:31,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:31,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:31,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:31,178 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:31,178 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:31,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 375 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:31,179 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:31,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:31,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:31,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:31,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:31,180 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:31,180 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:31,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:31,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:31,181 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:31,181 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:31,182 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:31,182 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:31,182 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:31,182 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:31,182 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:31,182 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:31,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:31,186 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:31,186 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:31,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:31,187 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:31,187 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:31,288 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:31,289 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-06 07:25:31,289 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:31,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:31,289 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:31,289 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:31,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-06 07:25:31,289 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-06 07:25:31,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:31,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1969902364, now seen corresponding path program 1 times [2022-12-06 07:25:31,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:31,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995021978] [2022-12-06 07:25:31,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:31,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:31,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-06 07:25:31,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:31,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995021978] [2022-12-06 07:25:31,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995021978] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:31,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:31,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:31,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949097097] [2022-12-06 07:25:31,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:31,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:31,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:31,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:31,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:31,385 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:31,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:31,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:31,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:31,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:31,433 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:31,434 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:31,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:31,435 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:31,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:31,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:31,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:31,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:31,435 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:31,436 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:31,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:31,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:31,437 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:31,437 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:31,437 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:31,437 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:31,437 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:31,439 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:31,440 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:31,440 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:31,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:31,444 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:31,444 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:31,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:31,444 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:31,445 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:31,537 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:31,537 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 07:25:31,537 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:31,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:31,538 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:31,538 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:31,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-06 07:25:31,538 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-06 07:25:31,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:31,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1943120255, now seen corresponding path program 1 times [2022-12-06 07:25:31,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:31,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757428825] [2022-12-06 07:25:31,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:31,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:31,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:31,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-06 07:25:31,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:31,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757428825] [2022-12-06 07:25:31,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757428825] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:31,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:31,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:31,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130900666] [2022-12-06 07:25:31,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:31,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:31,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:31,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:31,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:31,634 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:31,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:31,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:31,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:31,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:31,693 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:31,694 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:31,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:31,695 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:31,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:31,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:31,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:31,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:31,696 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:31,696 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:31,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:31,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:31,697 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:31,698 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:31,698 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:31,698 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:31,698 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:31,698 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:31,699 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:31,699 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:31,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:31,705 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:31,705 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:31,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:31,705 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:31,705 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:31,820 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:31,821 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-06 07:25:31,821 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:31,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:31,821 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:31,821 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:31,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-06 07:25:31,821 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-06 07:25:31,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:31,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1912644062, now seen corresponding path program 1 times [2022-12-06 07:25:31,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:31,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644299777] [2022-12-06 07:25:31,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:31,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:31,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:31,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-06 07:25:31,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:31,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644299777] [2022-12-06 07:25:31,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644299777] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:31,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:31,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:31,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049391484] [2022-12-06 07:25:31,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:31,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:31,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:31,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:31,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:31,913 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:31,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:31,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:31,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:31,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:31,961 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:31,961 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:31,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:31,962 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:31,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:31,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:31,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:31,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:31,963 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:31,963 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:31,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:31,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:31,965 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:31,965 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:31,965 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:31,966 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:31,966 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:31,966 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:31,966 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:31,968 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:31,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:31,971 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:31,972 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:31,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:31,972 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:31,972 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:32,071 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:32,071 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-06 07:25:32,071 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:32,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:32,072 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:32,072 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:32,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-06 07:25:32,072 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-06 07:25:32,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:32,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1885861953, now seen corresponding path program 1 times [2022-12-06 07:25:32,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:32,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600366435] [2022-12-06 07:25:32,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:32,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:32,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:32,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-06 07:25:32,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:32,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600366435] [2022-12-06 07:25:32,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600366435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:32,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:32,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:32,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515981509] [2022-12-06 07:25:32,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:32,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:32,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:32,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:32,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:32,183 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:32,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:32,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:32,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:32,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:32,242 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:32,242 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:32,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:32,243 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:32,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:32,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:32,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:32,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:32,244 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:32,244 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:32,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:32,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:32,245 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:32,245 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:32,246 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:32,246 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:32,246 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:32,246 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:32,247 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:32,247 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:32,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:32,251 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:32,251 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:32,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:32,251 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:32,251 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:32,347 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:32,348 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-06 07:25:32,348 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:32,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:32,349 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:32,349 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:32,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-06 07:25:32,349 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-06 07:25:32,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:32,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1855385760, now seen corresponding path program 1 times [2022-12-06 07:25:32,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:32,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797836578] [2022-12-06 07:25:32,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:32,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:32,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-06 07:25:32,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:32,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797836578] [2022-12-06 07:25:32,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797836578] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:32,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:32,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:32,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655346608] [2022-12-06 07:25:32,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:32,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:32,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:32,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:32,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:32,444 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:32,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:32,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:32,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:32,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:32,499 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:32,499 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:32,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:32,500 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:32,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:32,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:32,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:32,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:32,501 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:32,501 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:32,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:32,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:32,502 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:32,503 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:32,503 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:32,503 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:32,503 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:32,503 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:32,503 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:32,504 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:32,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:32,507 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:32,508 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:32,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:32,508 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:32,508 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:32,600 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:32,601 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 07:25:32,601 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:32,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:32,601 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:32,601 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:32,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-06 07:25:32,602 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-06 07:25:32,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:32,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1828603651, now seen corresponding path program 1 times [2022-12-06 07:25:32,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:32,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758584468] [2022-12-06 07:25:32,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:32,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:32,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-06 07:25:32,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:32,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758584468] [2022-12-06 07:25:32,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758584468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:32,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:32,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:32,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034364313] [2022-12-06 07:25:32,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:32,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:32,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:32,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:32,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:32,719 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:32,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:32,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:32,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:32,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:32,766 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:32,766 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:32,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:32,767 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:32,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:32,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:32,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:32,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:32,769 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:32,769 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:32,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:32,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:32,770 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:32,770 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:32,771 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:32,771 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:32,771 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:32,771 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:32,771 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:32,771 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:32,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:32,775 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:32,775 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:32,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:32,776 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:32,776 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:32,863 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:32,864 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-06 07:25:32,864 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:32,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:32,864 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:32,864 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:32,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-06 07:25:32,864 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-06 07:25:32,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:32,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1798127458, now seen corresponding path program 1 times [2022-12-06 07:25:32,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:32,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648085151] [2022-12-06 07:25:32,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:32,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:32,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-06 07:25:32,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:32,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648085151] [2022-12-06 07:25:32,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648085151] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:32,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:32,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:32,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888602670] [2022-12-06 07:25:32,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:32,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:32,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:32,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:32,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:32,952 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:32,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:32,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:32,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:32,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:33,014 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:33,015 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:33,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:33,016 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:33,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:33,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:33,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:33,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:33,017 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:33,017 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:33,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:33,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:33,020 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:33,020 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:33,020 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:33,020 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:33,020 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:33,021 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:33,021 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:33,021 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:33,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:33,025 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:33,025 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:33,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:33,026 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:33,026 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:33,119 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:33,119 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 07:25:33,119 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:33,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:33,120 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:33,120 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:33,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-06 07:25:33,120 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-06 07:25:33,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:33,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1771345349, now seen corresponding path program 1 times [2022-12-06 07:25:33,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:33,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873433258] [2022-12-06 07:25:33,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:33,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:33,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:33,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-06 07:25:33,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:33,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873433258] [2022-12-06 07:25:33,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873433258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:33,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:33,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:33,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458846384] [2022-12-06 07:25:33,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:33,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:33,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:33,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:33,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:33,210 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:33,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:33,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:33,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:33,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:33,254 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:33,254 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:33,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:33,255 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:33,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:33,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:33,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:33,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:33,256 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:33,256 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:33,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:33,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:33,257 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:33,257 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:33,258 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:33,258 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:33,258 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:33,258 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:33,258 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:33,258 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:33,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:33,262 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:33,262 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:33,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:33,263 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:33,263 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:33,354 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:33,354 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:25:33,354 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:33,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:33,355 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:33,355 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:33,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-06 07:25:33,355 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-06 07:25:33,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:33,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1740869156, now seen corresponding path program 1 times [2022-12-06 07:25:33,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:33,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859698952] [2022-12-06 07:25:33,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:33,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:33,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:33,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-06 07:25:33,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:33,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859698952] [2022-12-06 07:25:33,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859698952] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:33,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:33,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:33,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067544322] [2022-12-06 07:25:33,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:33,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:33,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:33,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:33,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:33,450 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:33,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:33,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:33,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:33,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:33,502 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:33,502 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:25:33,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:33,503 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:33,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:33,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:33,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:33,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:33,505 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:33,505 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:33,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:33,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:33,523 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:33,523 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:33,524 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:33,524 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:33,524 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:33,524 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:33,524 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:33,524 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:33,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:33,529 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:33,530 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:33,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:33,531 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:33,531 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:33,620 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:33,622 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 07:25:33,622 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:33,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:33,622 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:33,622 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:33,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-06 07:25:33,623 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-06 07:25:33,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:33,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1714087047, now seen corresponding path program 1 times [2022-12-06 07:25:33,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:33,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766405410] [2022-12-06 07:25:33,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:33,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:33,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-06 07:25:33,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:33,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766405410] [2022-12-06 07:25:33,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766405410] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:33,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:33,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:33,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94320529] [2022-12-06 07:25:33,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:33,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:33,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:33,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:33,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:33,737 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:33,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:33,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:33,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:33,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:33,788 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:33,788 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:33,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:33,789 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:33,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:33,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:33,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:33,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:33,790 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:33,790 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:33,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:33,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:33,792 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:33,792 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:33,793 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:33,793 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:33,793 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:33,794 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:33,794 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:33,794 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:33,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:33,798 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:33,798 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:33,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:33,799 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:33,799 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:33,898 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:33,899 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-06 07:25:33,899 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:33,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:33,899 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:33,899 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:33,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-06 07:25:33,900 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-06 07:25:33,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:33,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1683610854, now seen corresponding path program 1 times [2022-12-06 07:25:33,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:33,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466888782] [2022-12-06 07:25:33,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:33,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:33,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-06 07:25:33,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:33,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466888782] [2022-12-06 07:25:33,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466888782] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:33,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:33,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:33,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963429031] [2022-12-06 07:25:33,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:33,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:33,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:33,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:33,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:33,998 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:33,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:33,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:33,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:33,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:34,055 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:34,055 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:34,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:34,056 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:34,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:34,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:34,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:34,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:34,057 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:34,057 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:34,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:34,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:34,059 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:34,059 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:34,059 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:34,059 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:34,059 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:34,059 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:34,060 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:34,060 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:34,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:34,063 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:34,064 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:34,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:34,064 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:34,064 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:34,158 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:34,159 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 07:25:34,159 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:34,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:34,159 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:34,159 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:34,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-06 07:25:34,159 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-06 07:25:34,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:34,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1656828745, now seen corresponding path program 1 times [2022-12-06 07:25:34,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:34,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247684166] [2022-12-06 07:25:34,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:34,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:34,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-06 07:25:34,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:34,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247684166] [2022-12-06 07:25:34,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247684166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:34,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:34,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:34,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290687832] [2022-12-06 07:25:34,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:34,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:34,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:34,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:34,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:34,249 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:34,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:34,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:34,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:34,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:34,300 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:34,300 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:34,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 356 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:34,301 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:34,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:34,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:34,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:34,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:34,302 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:34,302 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:34,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:34,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:34,304 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:34,304 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:34,304 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:34,304 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:34,304 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:34,304 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:34,305 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:34,305 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:34,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:34,309 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:34,309 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:34,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:34,309 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:34,309 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:34,401 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:34,402 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 07:25:34,402 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:34,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:34,402 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:34,402 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:34,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-06 07:25:34,402 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-06 07:25:34,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:34,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1626352552, now seen corresponding path program 1 times [2022-12-06 07:25:34,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:34,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744391873] [2022-12-06 07:25:34,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:34,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:34,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-06 07:25:34,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:34,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744391873] [2022-12-06 07:25:34,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744391873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:34,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:34,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:34,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114332302] [2022-12-06 07:25:34,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:34,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:34,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:34,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:34,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:34,497 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:34,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:34,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:34,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:34,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:34,555 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:34,556 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:34,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:34,557 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:34,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:34,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:34,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:34,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:34,558 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:34,558 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:34,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:34,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:34,559 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:34,559 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:34,559 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:34,559 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:34,559 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:34,560 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:34,560 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:34,560 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:34,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:34,563 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:34,564 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:34,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:34,564 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:34,564 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:34,670 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:34,670 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-06 07:25:34,671 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:34,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:34,671 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:34,671 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:34,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-06 07:25:34,671 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-06 07:25:34,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:34,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1599570443, now seen corresponding path program 1 times [2022-12-06 07:25:34,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:34,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858787701] [2022-12-06 07:25:34,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:34,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:34,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-06 07:25:34,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:34,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858787701] [2022-12-06 07:25:34,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858787701] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:34,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:34,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:34,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594829912] [2022-12-06 07:25:34,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:34,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:34,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:34,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:34,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:34,760 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:34,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:34,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:34,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:34,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:34,803 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:34,803 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:34,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:34,804 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:34,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:34,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:34,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:34,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:34,805 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:34,805 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:34,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:34,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:34,806 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:34,807 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:34,807 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:34,807 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:34,807 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:34,807 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:34,807 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:34,807 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:34,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:34,811 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:34,811 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:34,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:34,812 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:34,812 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:34,901 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:34,902 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 07:25:34,902 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:34,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:34,902 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:34,902 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:34,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-06 07:25:34,902 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-06 07:25:34,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:34,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1569094250, now seen corresponding path program 1 times [2022-12-06 07:25:34,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:34,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080372437] [2022-12-06 07:25:34,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:34,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:34,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-06 07:25:34,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:34,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080372437] [2022-12-06 07:25:34,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080372437] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:34,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:34,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:34,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658271769] [2022-12-06 07:25:34,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:34,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:34,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:34,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:34,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:34,993 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:34,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:34,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:34,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:34,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:35,047 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:35,047 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:25:35,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:35,048 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:35,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:35,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:35,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:35,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:35,049 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:35,049 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:35,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:35,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:35,051 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:35,051 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:35,051 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:35,051 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:35,051 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:35,052 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:35,052 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:35,052 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:35,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:35,056 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:35,056 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:35,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:35,056 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:35,056 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:35,152 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:35,152 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-06 07:25:35,152 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:35,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:35,153 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:35,153 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:35,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-06 07:25:35,153 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-06 07:25:35,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:35,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1542312141, now seen corresponding path program 1 times [2022-12-06 07:25:35,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:35,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956978446] [2022-12-06 07:25:35,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:35,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:35,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-06 07:25:35,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:35,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956978446] [2022-12-06 07:25:35,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956978446] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:35,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:35,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:35,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558245941] [2022-12-06 07:25:35,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:35,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:35,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:35,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:35,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:35,239 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:35,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:35,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:35,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:35,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:35,288 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:35,289 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:35,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:35,290 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:35,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:35,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:35,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:35,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:35,291 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:35,291 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:35,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:35,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:35,292 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:35,292 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:35,292 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:35,292 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:35,292 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:35,293 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:35,293 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:35,293 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:35,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:35,296 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:35,296 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:35,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:35,297 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:35,297 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:35,390 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:35,391 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 07:25:35,391 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:35,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:35,391 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:35,391 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:35,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-06 07:25:35,391 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-06 07:25:35,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:35,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1511835948, now seen corresponding path program 1 times [2022-12-06 07:25:35,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:35,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931959603] [2022-12-06 07:25:35,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:35,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:35,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:35,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:35,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931959603] [2022-12-06 07:25:35,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931959603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:35,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:35,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:35,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386949356] [2022-12-06 07:25:35,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:35,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:35,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:35,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:35,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:35,487 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:35,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:35,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:35,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:35,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:35,546 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:35,547 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:35,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:35,548 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:35,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:35,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:35,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:35,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:35,549 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:35,549 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:35,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:35,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:35,550 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:35,550 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:35,550 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:35,551 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:35,551 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:35,551 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:35,551 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:35,551 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:35,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:35,555 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:35,555 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:35,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 118 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:35,556 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:35,556 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:35,648 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:35,649 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 07:25:35,649 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:35,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:35,649 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:35,649 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:35,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-06 07:25:35,649 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-06 07:25:35,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:35,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1485053839, now seen corresponding path program 1 times [2022-12-06 07:25:35,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:35,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404955870] [2022-12-06 07:25:35,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:35,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:35,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-06 07:25:35,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:35,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404955870] [2022-12-06 07:25:35,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404955870] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:35,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:35,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:35,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575537809] [2022-12-06 07:25:35,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:35,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:35,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:35,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:35,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:35,752 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:35,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:35,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:35,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:35,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:35,802 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:35,803 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:35,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:35,804 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:35,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:35,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:35,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:35,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:35,805 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:35,805 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:35,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:35,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:35,807 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:35,807 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:35,807 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:35,807 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:35,807 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:35,808 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:35,808 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:35,808 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:35,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:35,811 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:35,811 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:35,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:35,812 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:35,812 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:35,903 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:35,903 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:25:35,903 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:35,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:35,904 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:35,904 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:35,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-06 07:25:35,904 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-06 07:25:35,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:35,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1454577646, now seen corresponding path program 1 times [2022-12-06 07:25:35,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:35,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222483571] [2022-12-06 07:25:35,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:35,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:35,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:35,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-06 07:25:35,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:35,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222483571] [2022-12-06 07:25:35,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222483571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:35,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:35,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:35,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556592488] [2022-12-06 07:25:35,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:35,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:35,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:36,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:36,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:36,002 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:36,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:36,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:36,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:36,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:36,056 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:36,057 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:36,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:36,058 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:36,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:36,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:36,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:36,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:36,059 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:36,059 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:36,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:36,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:36,060 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:36,060 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:36,060 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:36,060 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:36,060 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:36,061 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:36,061 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:36,061 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:36,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:36,064 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:36,065 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:36,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:36,065 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:36,065 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:36,161 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:36,162 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-06 07:25:36,162 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:36,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:36,162 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:36,162 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:36,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-06 07:25:36,162 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-06 07:25:36,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:36,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1427795537, now seen corresponding path program 1 times [2022-12-06 07:25:36,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:36,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241640562] [2022-12-06 07:25:36,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:36,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:36,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-06 07:25:36,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:36,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241640562] [2022-12-06 07:25:36,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241640562] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:36,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:36,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:36,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758297727] [2022-12-06 07:25:36,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:36,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:36,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:36,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:36,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:36,255 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:36,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:36,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:36,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:36,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:36,305 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:36,306 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:36,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:36,307 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:36,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:36,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:36,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:36,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:36,308 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:36,308 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:36,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:36,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:36,310 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:36,310 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:36,310 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:36,310 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:36,310 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:36,310 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:36,310 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:36,311 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:36,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:36,314 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:36,314 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:36,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:36,314 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:36,315 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:36,409 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:36,410 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 07:25:36,410 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:36,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:36,410 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:36,410 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:36,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-06 07:25:36,411 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-06 07:25:36,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:36,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1397319344, now seen corresponding path program 1 times [2022-12-06 07:25:36,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:36,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445011931] [2022-12-06 07:25:36,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:36,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:36,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-06 07:25:36,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:36,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445011931] [2022-12-06 07:25:36,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445011931] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:36,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:36,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:36,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733636711] [2022-12-06 07:25:36,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:36,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:36,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:36,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:36,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:36,496 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:36,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:36,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:36,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:36,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:36,543 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:36,543 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:36,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:36,544 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:36,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:36,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:36,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:36,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:36,545 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:36,545 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:36,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:36,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:36,546 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:36,546 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:36,546 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:36,547 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:36,547 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:36,547 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:36,547 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:36,547 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:36,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:36,550 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:36,551 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:36,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:36,551 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:36,551 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:36,639 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:36,640 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-06 07:25:36,640 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:36,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:36,640 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:36,640 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:36,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-06 07:25:36,640 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-06 07:25:36,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:36,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1370537235, now seen corresponding path program 1 times [2022-12-06 07:25:36,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:36,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347470863] [2022-12-06 07:25:36,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:36,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:36,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:36,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:36,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347470863] [2022-12-06 07:25:36,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347470863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:36,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:36,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:36,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374139335] [2022-12-06 07:25:36,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:36,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:36,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:36,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:36,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:36,733 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:36,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:36,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:36,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:36,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:36,780 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:36,781 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:36,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:36,782 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:36,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:36,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:36,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:36,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:36,782 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:36,782 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:36,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:36,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:36,784 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:36,784 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:36,784 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:36,784 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:36,784 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:36,785 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:36,785 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:36,785 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:36,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:36,788 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:36,788 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:36,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:36,789 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:36,789 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:36,883 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:36,884 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 07:25:36,884 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:36,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:36,884 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:36,884 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:36,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-06 07:25:36,884 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-06 07:25:36,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:36,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1340061042, now seen corresponding path program 1 times [2022-12-06 07:25:36,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:36,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340284318] [2022-12-06 07:25:36,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:36,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:36,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-06 07:25:36,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:36,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340284318] [2022-12-06 07:25:36,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340284318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:36,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:36,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:36,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688003907] [2022-12-06 07:25:36,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:36,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:36,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:36,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:36,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:36,971 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:36,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:36,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:36,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:36,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:37,029 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:37,029 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:37,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:37,030 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:37,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:37,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:37,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:37,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:37,031 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:37,031 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:37,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:37,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:37,032 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:37,032 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:37,033 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:37,033 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:37,033 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:37,033 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:37,033 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:37,033 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:37,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:37,037 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:37,037 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:37,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:37,038 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:37,038 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:37,134 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:37,134 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-06 07:25:37,134 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:37,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:37,135 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:37,135 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:37,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-12-06 07:25:37,135 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-06 07:25:37,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:37,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1313278933, now seen corresponding path program 1 times [2022-12-06 07:25:37,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:37,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341790852] [2022-12-06 07:25:37,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:37,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:37,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-06 07:25:37,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:37,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341790852] [2022-12-06 07:25:37,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341790852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:37,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:37,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:37,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497967599] [2022-12-06 07:25:37,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:37,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:37,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:37,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:37,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:37,227 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:37,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:37,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:37,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:37,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:37,281 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:37,281 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:37,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:37,282 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:37,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:37,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:37,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:37,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:37,283 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:37,283 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:37,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:37,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:37,287 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:37,287 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:37,287 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:37,287 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:37,287 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:37,288 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:37,288 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:37,288 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:37,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:37,292 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:37,292 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:37,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:37,292 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:37,292 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:37,385 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:37,386 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 07:25:37,386 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:37,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:37,386 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:37,386 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:37,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-12-06 07:25:37,387 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-06 07:25:37,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:37,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1282802740, now seen corresponding path program 1 times [2022-12-06 07:25:37,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:37,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966959089] [2022-12-06 07:25:37,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:37,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:37,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-06 07:25:37,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:37,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966959089] [2022-12-06 07:25:37,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966959089] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:37,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:37,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:37,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552874166] [2022-12-06 07:25:37,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:37,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:37,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:37,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:37,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:37,474 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:37,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:37,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:37,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:37,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:37,532 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:37,533 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:37,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:37,537 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:37,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:37,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:37,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:37,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:37,538 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:37,538 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:37,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:37,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:37,539 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:37,539 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:37,539 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:37,540 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:37,540 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:37,540 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:37,540 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:37,540 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:37,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:37,543 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:37,544 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:37,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:37,544 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:37,544 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:37,643 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:37,643 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-06 07:25:37,643 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:37,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:37,644 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:37,644 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:37,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-12-06 07:25:37,644 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-06 07:25:37,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:37,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1256020631, now seen corresponding path program 1 times [2022-12-06 07:25:37,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:37,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771538620] [2022-12-06 07:25:37,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:37,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:37,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-06 07:25:37,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:37,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771538620] [2022-12-06 07:25:37,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771538620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:37,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:37,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:37,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290883426] [2022-12-06 07:25:37,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:37,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:37,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:37,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:37,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:37,744 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:37,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:37,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:37,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:37,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:37,793 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:37,793 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:37,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:37,794 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:37,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:37,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:37,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:37,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:37,795 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:37,795 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:37,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:37,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:37,796 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:37,796 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:37,796 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:37,797 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:37,797 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:37,797 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:37,797 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:37,797 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:37,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:37,801 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:37,801 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:37,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:37,801 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:37,801 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:37,896 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:37,897 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 07:25:37,897 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:37,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:37,897 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:37,897 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:37,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-12-06 07:25:37,898 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-06 07:25:37,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:37,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1225544438, now seen corresponding path program 1 times [2022-12-06 07:25:37,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:37,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146419649] [2022-12-06 07:25:37,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:37,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:37,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-06 07:25:37,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:37,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146419649] [2022-12-06 07:25:37,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146419649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:37,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:37,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:37,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610315736] [2022-12-06 07:25:37,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:37,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:37,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:37,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:37,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:37,983 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:37,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:37,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:37,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:37,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:38,041 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:38,041 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:25:38,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:38,042 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:38,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:38,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:38,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:38,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:38,043 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:38,043 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:38,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:38,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:38,044 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:38,044 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:38,045 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:38,045 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:38,046 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:38,046 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:38,046 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:38,046 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:38,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:38,049 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:38,049 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:38,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:38,050 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:38,050 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:38,142 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:38,142 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 07:25:38,142 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:38,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:38,143 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:38,143 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:38,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-12-06 07:25:38,143 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-06 07:25:38,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:38,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1198762329, now seen corresponding path program 1 times [2022-12-06 07:25:38,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:38,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568542374] [2022-12-06 07:25:38,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:38,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:38,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-06 07:25:38,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:38,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568542374] [2022-12-06 07:25:38,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568542374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:38,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:38,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:38,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181540366] [2022-12-06 07:25:38,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:38,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:38,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:38,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:38,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:38,235 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:38,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:38,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:38,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:38,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:38,287 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:38,288 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:38,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:38,289 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:38,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:38,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:38,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:38,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:38,289 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:38,290 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:38,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:38,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:38,291 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:38,291 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:38,291 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:38,291 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:38,291 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:38,292 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:38,292 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:38,292 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:38,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:38,295 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:38,295 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:38,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:38,296 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:38,296 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:38,388 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:38,389 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 07:25:38,389 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:38,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:38,389 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:38,389 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:38,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-12-06 07:25:38,390 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-06 07:25:38,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:38,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1168286136, now seen corresponding path program 1 times [2022-12-06 07:25:38,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:38,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347912819] [2022-12-06 07:25:38,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:38,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:38,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-06 07:25:38,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:38,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347912819] [2022-12-06 07:25:38,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347912819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:38,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:38,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:38,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543596672] [2022-12-06 07:25:38,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:38,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:38,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:38,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:38,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:38,476 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:38,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:38,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:38,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:38,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:38,532 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:38,533 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:38,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:38,533 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:38,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:38,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:38,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:38,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:38,534 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:38,534 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:38,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:38,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:38,536 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:38,536 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:38,536 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:38,536 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:38,536 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:38,536 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:38,537 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:38,537 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:38,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:38,540 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:38,540 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:38,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:38,541 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:38,541 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:38,634 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:38,635 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 07:25:38,635 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:38,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:38,635 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:38,636 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:38,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-12-06 07:25:38,636 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-06 07:25:38,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:38,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1141504027, now seen corresponding path program 1 times [2022-12-06 07:25:38,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:38,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13158520] [2022-12-06 07:25:38,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:38,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:38,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-06 07:25:38,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:38,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13158520] [2022-12-06 07:25:38,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13158520] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:38,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:38,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:38,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861738143] [2022-12-06 07:25:38,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:38,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:38,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:38,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:38,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:38,726 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:38,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:38,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:38,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:38,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:38,782 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:38,782 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:38,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 376 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:38,783 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:38,783 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:38,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:38,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:38,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:38,788 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:38,788 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:38,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:38,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:38,789 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:38,789 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:38,790 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:38,790 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:38,790 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:38,790 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:38,790 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:38,791 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:38,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:38,795 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:38,795 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:38,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:38,796 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:38,796 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:38,890 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:38,891 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-06 07:25:38,891 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:38,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:38,891 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:38,891 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:38,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-12-06 07:25:38,891 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-06 07:25:38,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:38,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1111027834, now seen corresponding path program 1 times [2022-12-06 07:25:38,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:38,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151129220] [2022-12-06 07:25:38,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:38,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:38,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:38,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-06 07:25:38,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:38,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151129220] [2022-12-06 07:25:38,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151129220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:38,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:38,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:38,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736307419] [2022-12-06 07:25:38,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:38,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:38,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:38,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:38,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:38,989 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:38,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:38,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:38,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:38,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:39,047 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:39,047 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:25:39,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:39,048 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:39,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:39,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:39,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:39,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:39,050 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:39,050 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:39,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:39,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:39,052 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:39,052 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:39,053 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:39,053 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:39,053 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:39,053 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:39,053 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:39,053 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:39,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:39,057 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:39,057 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:39,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:39,057 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:39,057 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:39,150 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:39,151 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 07:25:39,151 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:39,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:39,151 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:39,151 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:39,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-12-06 07:25:39,151 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-06 07:25:39,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:39,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1084245725, now seen corresponding path program 1 times [2022-12-06 07:25:39,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:39,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350931332] [2022-12-06 07:25:39,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:39,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:39,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-06 07:25:39,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:39,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350931332] [2022-12-06 07:25:39,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350931332] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:39,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:39,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:39,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755001841] [2022-12-06 07:25:39,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:39,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:39,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:39,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:39,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:39,238 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:39,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:39,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:39,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:39,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:39,292 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:39,293 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:39,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:39,294 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:39,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:39,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:39,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:39,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:39,295 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:39,295 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:39,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:39,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:39,296 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:39,296 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:39,296 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:39,296 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:39,296 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:39,297 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:39,297 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:39,297 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:39,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:39,300 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:39,300 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:39,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:39,301 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:39,301 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:39,392 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:39,393 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 07:25:39,393 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:39,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:39,393 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:39,393 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:39,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-12-06 07:25:39,394 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-06 07:25:39,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:39,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1053769532, now seen corresponding path program 1 times [2022-12-06 07:25:39,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:39,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411894325] [2022-12-06 07:25:39,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:39,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:39,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-06 07:25:39,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:39,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411894325] [2022-12-06 07:25:39,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411894325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:39,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:39,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:39,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542156588] [2022-12-06 07:25:39,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:39,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:39,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:39,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:39,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:39,497 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:39,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:39,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:39,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:39,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:39,547 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:39,547 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:39,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:39,548 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:39,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:39,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:39,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:39,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:39,549 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:39,549 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:39,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:39,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:39,551 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:39,551 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:39,551 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:39,551 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:39,551 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:39,552 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:39,552 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:39,552 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:39,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:39,555 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:39,555 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:39,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:39,556 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:39,556 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:39,649 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:39,649 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 07:25:39,649 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:39,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:39,650 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:39,650 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:39,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-12-06 07:25:39,650 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-06 07:25:39,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:39,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1026987423, now seen corresponding path program 1 times [2022-12-06 07:25:39,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:39,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958393042] [2022-12-06 07:25:39,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:39,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:39,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:39,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-06 07:25:39,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:39,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958393042] [2022-12-06 07:25:39,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958393042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:39,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:39,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:39,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359749713] [2022-12-06 07:25:39,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:39,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:39,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:39,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:39,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:39,742 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:39,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:39,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:39,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:39,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:39,797 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:39,797 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:39,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:39,798 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:39,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:39,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:39,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:39,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:39,799 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:39,799 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:39,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:39,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:39,800 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:39,800 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:39,801 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:39,801 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:39,801 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:39,801 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:39,801 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:39,801 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:39,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:39,804 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:39,805 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:39,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:39,805 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:39,805 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:39,900 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:39,900 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 07:25:39,900 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:39,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:39,901 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:39,901 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:39,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-12-06 07:25:39,901 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-06 07:25:39,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:39,901 INFO L85 PathProgramCache]: Analyzing trace with hash -996511230, now seen corresponding path program 1 times [2022-12-06 07:25:39,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:39,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745197643] [2022-12-06 07:25:39,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:39,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25: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-06 07:25:39,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:39,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745197643] [2022-12-06 07:25:39,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745197643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:39,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:39,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:39,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947657456] [2022-12-06 07:25:39,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:39,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:39,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:39,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:39,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:39,984 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:39,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:39,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:39,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:39,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:40,041 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:40,041 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:25:40,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:40,042 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:40,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:40,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:40,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:40,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:40,043 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:40,043 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:40,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:40,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:40,044 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:40,044 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:40,044 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:40,045 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:40,045 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:40,045 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:40,045 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:40,045 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:40,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:40,048 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:40,048 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:40,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:40,049 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:40,049 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:40,139 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:40,140 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 07:25:40,140 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:40,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:40,140 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:40,140 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:40,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-12-06 07:25:40,141 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-06 07:25:40,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:40,141 INFO L85 PathProgramCache]: Analyzing trace with hash -969729121, now seen corresponding path program 1 times [2022-12-06 07:25:40,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:40,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003589353] [2022-12-06 07:25:40,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:40,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:40,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-06 07:25:40,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:40,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003589353] [2022-12-06 07:25:40,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003589353] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:40,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:40,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:40,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661814509] [2022-12-06 07:25:40,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:40,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:40,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:40,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:40,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:40,233 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:40,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:40,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:40,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:40,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:40,290 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:40,290 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:40,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:40,291 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:40,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:40,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:40,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:40,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:40,292 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:40,292 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:40,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:40,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:40,293 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:40,293 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:40,294 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:40,294 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:40,294 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:40,294 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:40,294 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:40,294 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:40,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:40,297 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:40,297 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:40,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:40,298 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:40,298 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:40,389 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:40,390 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:25:40,390 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:40,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:40,390 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:40,390 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:40,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-12-06 07:25:40,390 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-06 07:25:40,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:40,391 INFO L85 PathProgramCache]: Analyzing trace with hash -939252928, now seen corresponding path program 1 times [2022-12-06 07:25:40,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:40,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056042729] [2022-12-06 07:25:40,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:40,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25: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-06 07:25:40,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:40,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056042729] [2022-12-06 07:25:40,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056042729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:40,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:40,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:40,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191533608] [2022-12-06 07:25:40,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:40,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:40,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:40,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:40,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:40,471 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:40,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:40,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:40,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:40,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:40,521 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:40,521 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:40,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:40,522 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:40,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:40,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:40,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:40,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:40,523 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:40,523 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:40,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:40,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:40,524 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:40,525 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:40,525 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:40,525 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:40,525 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:40,525 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:40,525 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:40,526 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:40,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:40,529 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:40,529 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:40,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:40,530 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:40,530 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:40,622 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:40,623 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 07:25:40,623 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:40,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:40,623 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:40,623 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:40,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-12-06 07:25:40,623 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-06 07:25:40,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:40,624 INFO L85 PathProgramCache]: Analyzing trace with hash -912470819, now seen corresponding path program 1 times [2022-12-06 07:25:40,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:40,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937657666] [2022-12-06 07:25:40,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:40,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:40,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:40,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-06 07:25:40,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:40,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937657666] [2022-12-06 07:25:40,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937657666] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:40,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:40,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:40,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366823924] [2022-12-06 07:25:40,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:40,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:40,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:40,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:40,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:40,714 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:40,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:40,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:40,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:40,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:40,767 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:40,767 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:40,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:40,768 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:40,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:40,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:40,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:40,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:40,769 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:40,769 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:40,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:40,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:40,770 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:40,770 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:40,770 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:40,770 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:40,770 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:40,771 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:40,771 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:40,771 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:40,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:40,774 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:40,774 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:40,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 144 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:40,775 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:40,775 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:40,865 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:40,866 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:25:40,866 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:40,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:40,866 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:40,867 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:40,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-12-06 07:25:40,867 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-06 07:25:40,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:40,867 INFO L85 PathProgramCache]: Analyzing trace with hash -881994626, now seen corresponding path program 1 times [2022-12-06 07:25:40,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:40,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326002000] [2022-12-06 07:25:40,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:40,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:40,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-06 07:25:40,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:40,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326002000] [2022-12-06 07:25:40,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326002000] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:40,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:40,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:40,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644750397] [2022-12-06 07:25:40,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:40,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:40,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:40,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:40,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:40,950 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:40,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:40,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:40,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:40,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:41,008 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:41,008 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:41,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:41,009 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:41,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:41,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:41,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:41,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:41,010 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:41,010 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:41,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:41,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:41,011 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:41,011 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:41,011 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:41,011 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:41,012 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:41,012 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:41,012 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:41,012 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:41,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:41,015 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:41,015 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:41,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:41,016 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:41,016 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:41,109 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:41,109 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 07:25:41,109 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:41,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:41,110 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:41,110 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:41,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-12-06 07:25:41,110 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-06 07:25:41,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:41,110 INFO L85 PathProgramCache]: Analyzing trace with hash -855212517, now seen corresponding path program 1 times [2022-12-06 07:25:41,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:41,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110689656] [2022-12-06 07:25:41,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:41,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:41,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-06 07:25:41,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:41,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110689656] [2022-12-06 07:25:41,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110689656] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:41,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:41,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:41,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720338176] [2022-12-06 07:25:41,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:41,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:41,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:41,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:41,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:41,197 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:41,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:41,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:41,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:41,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:41,252 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:41,252 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:41,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:41,253 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:41,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:41,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:41,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:41,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:41,254 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:41,254 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:41,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:41,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:41,255 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:41,255 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:41,256 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:41,256 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:41,256 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:41,256 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:41,256 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:41,256 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:41,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:41,260 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:41,260 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:41,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:41,260 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:41,260 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:41,351 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:41,352 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:25:41,352 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:41,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:41,352 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:41,352 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:41,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-12-06 07:25:41,353 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-06 07:25:41,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:41,353 INFO L85 PathProgramCache]: Analyzing trace with hash -824736324, now seen corresponding path program 1 times [2022-12-06 07:25:41,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:41,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323758328] [2022-12-06 07:25:41,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:41,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:41,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:41,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-06 07:25:41,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:41,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323758328] [2022-12-06 07:25:41,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323758328] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:41,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:41,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:41,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260646996] [2022-12-06 07:25:41,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:41,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:41,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:41,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:41,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:41,438 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:41,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:41,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:41,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:41,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:41,494 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:41,494 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:25:41,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:41,495 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:41,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:41,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:41,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:41,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:41,496 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:41,496 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:41,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:41,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:41,497 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:41,498 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:41,498 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:41,498 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:41,498 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:41,498 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:41,498 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:41,498 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:41,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:41,502 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:41,502 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:41,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:41,502 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:41,502 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:41,593 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:41,594 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:25:41,594 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:41,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:41,594 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:41,594 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:41,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-12-06 07:25:41,595 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-06 07:25:41,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:41,595 INFO L85 PathProgramCache]: Analyzing trace with hash -797954215, now seen corresponding path program 1 times [2022-12-06 07:25:41,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:41,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219513157] [2022-12-06 07:25:41,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:41,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:41,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:41,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-06 07:25:41,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:41,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219513157] [2022-12-06 07:25:41,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219513157] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:41,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:41,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:41,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606632855] [2022-12-06 07:25:41,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:41,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:41,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:41,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:41,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:41,682 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:41,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:41,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:41,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:41,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:41,738 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:41,739 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:41,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:41,740 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:41,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:41,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:41,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:41,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:41,740 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:41,741 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:41,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:41,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:41,744 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:41,744 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:41,744 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:41,744 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:41,745 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:41,745 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:41,745 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:41,745 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:41,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:41,753 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:41,753 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:41,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:41,754 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:41,754 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:41,838 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:41,839 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 07:25:41,839 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:41,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:41,839 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:41,839 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:41,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-12-06 07:25:41,839 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-06 07:25:41,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:41,840 INFO L85 PathProgramCache]: Analyzing trace with hash -767478022, now seen corresponding path program 1 times [2022-12-06 07:25:41,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:41,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845219699] [2022-12-06 07:25:41,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:41,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:41,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:41,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-06 07:25:41,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:41,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845219699] [2022-12-06 07:25:41,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845219699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:41,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:41,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:41,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399956360] [2022-12-06 07:25:41,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:41,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:41,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:41,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:41,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:41,929 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:41,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:41,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:41,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:41,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:41,977 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:41,977 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:41,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:41,978 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:41,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:41,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:41,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:41,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:41,979 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:41,979 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:41,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:41,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:41,980 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:41,980 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:41,980 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:41,980 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:41,980 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:41,981 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:41,981 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:41,981 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:41,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:41,984 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:41,984 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:41,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 116 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:41,985 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:41,985 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:42,070 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:42,070 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-06 07:25:42,070 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:42,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:42,071 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:42,071 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:42,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-12-06 07:25:42,071 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-06 07:25:42,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:42,071 INFO L85 PathProgramCache]: Analyzing trace with hash -740695913, now seen corresponding path program 1 times [2022-12-06 07:25:42,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:42,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296418502] [2022-12-06 07:25:42,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:42,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:42,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:42,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-06 07:25:42,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:42,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296418502] [2022-12-06 07:25:42,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296418502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:42,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:42,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:42,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806484798] [2022-12-06 07:25:42,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:42,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:42,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:42,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:42,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:42,155 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:42,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:42,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:42,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:42,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:42,201 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:42,202 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:42,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:42,203 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:42,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:42,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:42,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:42,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:42,203 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:42,203 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:42,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:42,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:42,205 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:42,205 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:42,205 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:42,205 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:42,205 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:42,205 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:42,205 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:42,205 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:42,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:42,209 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:42,209 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:42,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:42,209 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:42,209 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:42,300 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:42,301 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:25:42,301 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:42,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:42,301 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:42,301 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:42,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-12-06 07:25:42,301 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-06 07:25:42,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:42,302 INFO L85 PathProgramCache]: Analyzing trace with hash -710219720, now seen corresponding path program 1 times [2022-12-06 07:25:42,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:42,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821457333] [2022-12-06 07:25:42,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:42,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:42,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-06 07:25:42,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:42,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821457333] [2022-12-06 07:25:42,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821457333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:42,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:42,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:42,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361046830] [2022-12-06 07:25:42,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:42,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:42,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:42,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:42,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:42,393 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:42,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:42,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:42,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:42,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:42,437 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:42,437 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:42,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:42,438 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:42,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:42,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:42,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:42,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:42,439 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:42,439 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:42,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:42,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:42,440 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:42,440 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:42,440 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:42,440 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:42,440 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:42,441 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:42,441 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:42,441 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:42,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:42,444 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:42,444 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:42,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:42,444 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:42,445 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:42,535 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:42,536 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:25:42,536 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:42,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:42,536 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:42,536 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:42,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-12-06 07:25:42,537 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-06 07:25:42,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:42,537 INFO L85 PathProgramCache]: Analyzing trace with hash -683437611, now seen corresponding path program 1 times [2022-12-06 07:25:42,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:42,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477582658] [2022-12-06 07:25:42,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:42,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:42,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-06 07:25:42,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:42,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477582658] [2022-12-06 07:25:42,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477582658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:42,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:42,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:42,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483098440] [2022-12-06 07:25:42,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:42,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:42,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:42,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:42,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:42,624 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:42,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:42,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:42,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:42,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:42,667 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:42,668 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:42,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:42,668 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:42,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:42,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:42,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:42,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:42,669 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:42,669 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:42,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:42,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:42,671 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:42,671 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:42,671 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:42,671 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:42,671 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:42,671 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:42,671 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:42,671 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:42,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:42,675 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:42,675 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:42,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:42,675 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:42,675 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:42,763 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:42,764 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-06 07:25:42,764 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:42,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:42,764 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:42,764 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:42,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-12-06 07:25:42,768 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-06 07:25:42,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:42,769 INFO L85 PathProgramCache]: Analyzing trace with hash -652961418, now seen corresponding path program 1 times [2022-12-06 07:25:42,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:42,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954980034] [2022-12-06 07:25:42,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:42,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:42,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:42,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-06 07:25:42,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:42,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954980034] [2022-12-06 07:25:42,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954980034] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:42,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:42,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:42,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709945498] [2022-12-06 07:25:42,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:42,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:42,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:42,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:42,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:42,857 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:42,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:42,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:42,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:42,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:42,901 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:42,901 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:42,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:42,902 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:42,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:42,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:42,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:42,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:42,903 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:42,903 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:42,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:42,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:42,904 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:42,904 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:42,905 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:42,905 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:42,905 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:42,905 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:42,905 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:42,905 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:42,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:42,909 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:42,909 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:42,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 117 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:42,909 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:42,909 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:43,007 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:43,008 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-06 07:25:43,008 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:43,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:43,008 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:43,008 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:43,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2022-12-06 07:25:43,009 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-06 07:25:43,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:43,009 INFO L85 PathProgramCache]: Analyzing trace with hash -626179309, now seen corresponding path program 1 times [2022-12-06 07:25:43,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:43,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309848862] [2022-12-06 07:25:43,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:43,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:43,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-06 07:25:43,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:43,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309848862] [2022-12-06 07:25:43,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309848862] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:43,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:43,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:43,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535359426] [2022-12-06 07:25:43,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:43,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:43,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:43,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:43,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:43,105 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:43,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:43,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:43,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:43,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:43,159 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:43,160 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:43,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:43,161 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:43,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:43,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:43,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:43,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:43,161 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:43,161 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:43,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:43,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:43,163 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:43,163 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:43,163 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:43,163 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:43,163 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:43,163 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:43,163 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:43,164 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:43,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:43,167 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:43,167 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:43,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:43,167 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:43,168 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:43,258 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:43,259 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:25:43,259 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:43,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:43,259 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:43,259 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:43,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2022-12-06 07:25:43,260 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-06 07:25:43,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:43,260 INFO L85 PathProgramCache]: Analyzing trace with hash -595703116, now seen corresponding path program 1 times [2022-12-06 07:25:43,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:43,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327606435] [2022-12-06 07:25:43,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:43,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:43,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-06 07:25:43,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:43,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327606435] [2022-12-06 07:25:43,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327606435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:43,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:43,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:43,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80657250] [2022-12-06 07:25:43,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:43,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:43,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:43,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:43,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:43,358 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:43,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:43,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:43,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:43,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:43,411 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:43,411 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:43,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:43,412 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:43,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:43,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:43,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:43,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:43,413 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:43,413 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:43,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:43,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:43,414 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:43,414 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:43,414 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:43,414 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:43,414 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:43,415 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:43,415 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:43,415 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:43,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:43,419 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:43,419 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:43,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:43,419 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:43,419 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:43,514 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:43,515 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-06 07:25:43,515 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:43,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:43,515 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:43,515 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:43,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2022-12-06 07:25:43,515 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-06 07:25:43,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:43,516 INFO L85 PathProgramCache]: Analyzing trace with hash -568921007, now seen corresponding path program 1 times [2022-12-06 07:25:43,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:43,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202780033] [2022-12-06 07:25:43,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:43,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:43,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-06 07:25:43,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:43,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202780033] [2022-12-06 07:25:43,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202780033] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:43,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:43,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:43,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499367901] [2022-12-06 07:25:43,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:43,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:43,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:43,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:43,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:43,599 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:43,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:43,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:43,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:43,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:43,654 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:43,654 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:43,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:43,655 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:43,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:43,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:43,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:43,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:43,656 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:43,656 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:43,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:43,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:43,657 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:43,657 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:43,658 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:43,658 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:43,658 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:43,658 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:43,658 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:43,658 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:43,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:43,661 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:43,661 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:43,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:43,662 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:43,662 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:43,752 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:43,752 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 07:25:43,752 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:43,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:43,753 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:43,753 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:43,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2022-12-06 07:25:43,753 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-06 07:25:43,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:43,753 INFO L85 PathProgramCache]: Analyzing trace with hash -538444814, now seen corresponding path program 1 times [2022-12-06 07:25:43,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:43,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955991396] [2022-12-06 07:25:43,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:43,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:43,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-06 07:25:43,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:43,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955991396] [2022-12-06 07:25:43,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955991396] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:43,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:43,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:43,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483991523] [2022-12-06 07:25:43,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:43,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:43,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:43,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:43,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:43,846 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:43,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:43,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:43,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:43,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:43,895 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:43,896 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:25:43,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:43,897 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:43,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:43,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:43,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:43,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:43,898 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:43,898 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:43,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:43,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:43,900 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:43,900 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:43,900 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:43,900 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:43,900 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:43,900 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:43,900 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:43,901 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:43,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:43,904 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:43,904 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:43,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:43,904 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:43,905 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:43,999 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:43,999 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 07:25:44,000 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:44,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:44,000 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:44,000 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:44,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2022-12-06 07:25:44,000 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-06 07:25:44,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:44,000 INFO L85 PathProgramCache]: Analyzing trace with hash -511662705, now seen corresponding path program 1 times [2022-12-06 07:25:44,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:44,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777776274] [2022-12-06 07:25:44,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:44,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:44,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:44,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-06 07:25:44,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:44,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777776274] [2022-12-06 07:25:44,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777776274] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:44,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:44,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:44,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713005759] [2022-12-06 07:25:44,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:44,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:44,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:44,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:44,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:44,083 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:44,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:44,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:44,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:44,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:44,145 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:44,145 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:44,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:44,146 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:44,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:44,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:44,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:44,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:44,147 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:44,147 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:44,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:44,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:44,149 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:44,149 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:44,149 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:44,149 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:44,149 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:44,149 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:44,150 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:44,150 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:44,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:44,153 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:44,153 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:44,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:44,154 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:44,154 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:44,229 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:44,230 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:25:44,230 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:44,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:44,230 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:44,230 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:44,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2022-12-06 07:25:44,231 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-06 07:25:44,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:44,231 INFO L85 PathProgramCache]: Analyzing trace with hash -481186512, now seen corresponding path program 1 times [2022-12-06 07:25:44,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:44,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493719126] [2022-12-06 07:25:44,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:44,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:44,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-06 07:25:44,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:44,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493719126] [2022-12-06 07:25:44,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493719126] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:44,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:44,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:44,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219208488] [2022-12-06 07:25:44,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:44,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:44,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:44,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:44,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:44,321 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:44,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:44,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:44,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:44,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:44,373 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:44,373 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:44,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:44,374 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:44,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:44,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:44,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:44,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:44,375 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:44,375 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:44,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:44,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:44,376 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:44,376 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:44,376 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:44,377 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:44,377 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:44,377 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:44,377 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:44,377 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:44,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:44,380 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:44,380 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:44,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:44,381 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:44,381 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:44,461 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:44,462 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 07:25:44,462 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:44,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:44,462 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:44,462 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:44,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2022-12-06 07:25:44,462 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-06 07:25:44,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:44,463 INFO L85 PathProgramCache]: Analyzing trace with hash -454404403, now seen corresponding path program 1 times [2022-12-06 07:25:44,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:44,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598219970] [2022-12-06 07:25:44,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:44,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:44,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-06 07:25:44,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:44,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598219970] [2022-12-06 07:25:44,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598219970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:44,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:44,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:44,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480037444] [2022-12-06 07:25:44,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:44,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:44,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:44,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:44,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:44,553 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:44,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:44,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:44,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:44,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:44,603 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:44,603 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:44,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:44,604 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:44,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:44,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:44,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:44,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:44,605 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:44,605 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:44,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:44,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:44,606 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:44,606 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:44,607 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:44,607 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:44,607 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:44,607 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:44,607 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:44,607 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:44,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:44,610 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:44,610 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:44,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:44,611 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:44,611 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:44,700 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:44,700 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-06 07:25:44,700 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:44,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:44,701 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:44,701 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:44,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2022-12-06 07:25:44,701 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-06 07:25:44,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:44,701 INFO L85 PathProgramCache]: Analyzing trace with hash -423928210, now seen corresponding path program 1 times [2022-12-06 07:25:44,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:44,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234088169] [2022-12-06 07:25:44,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:44,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:44,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-06 07:25:44,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:44,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234088169] [2022-12-06 07:25:44,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234088169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:44,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:44,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:44,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907874190] [2022-12-06 07:25:44,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:44,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:44,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:44,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:44,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:44,798 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:44,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:44,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:44,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:44,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:44,842 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:44,842 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:44,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:44,843 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:44,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:44,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:44,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:44,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:44,844 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:44,844 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:44,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:44,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:44,845 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:44,845 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:44,845 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:44,846 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:44,846 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:44,846 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:44,846 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:44,846 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:44,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:44,849 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:44,849 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:44,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 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 116. Up to 16 conditions per place. [2022-12-06 07:25:44,850 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:44,850 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:44,940 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:44,940 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 07:25:44,940 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:44,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:44,941 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:44,941 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:44,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2022-12-06 07:25:44,941 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-06 07:25:44,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:44,941 INFO L85 PathProgramCache]: Analyzing trace with hash -397146101, now seen corresponding path program 1 times [2022-12-06 07:25:44,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:44,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267126010] [2022-12-06 07:25:44,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:44,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25: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-06 07:25:45,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:45,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267126010] [2022-12-06 07:25:45,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267126010] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:45,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:45,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:45,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212434991] [2022-12-06 07:25:45,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:45,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:45,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:45,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:45,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:45,023 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:45,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:45,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:45,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:45,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:45,072 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:45,072 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:45,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:45,073 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:45,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:45,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:45,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:45,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:45,074 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:45,074 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:45,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:45,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:45,075 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:45,075 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:45,075 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:45,075 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:45,075 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:45,076 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:45,076 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:45,076 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:45,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:45,079 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:45,079 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:45,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:45,079 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:45,079 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:45,165 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:45,166 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-06 07:25:45,166 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:45,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:45,166 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:45,166 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:45,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2022-12-06 07:25:45,166 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-06 07:25:45,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:45,167 INFO L85 PathProgramCache]: Analyzing trace with hash -366669908, now seen corresponding path program 1 times [2022-12-06 07:25:45,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:45,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387977992] [2022-12-06 07:25:45,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:45,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:45,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-06 07:25:45,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:45,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387977992] [2022-12-06 07:25:45,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387977992] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:45,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:45,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:45,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778901419] [2022-12-06 07:25:45,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:45,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:45,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:45,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:45,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:45,246 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:45,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:45,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:45,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:45,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:45,292 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:45,292 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:45,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:45,293 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:45,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:45,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:45,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:45,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:45,294 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:45,294 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:45,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:45,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:45,295 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:45,295 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:45,296 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:45,296 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:45,296 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:45,296 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:45,296 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:45,296 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:45,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:45,300 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:45,300 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:45,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:45,300 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:45,300 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:45,392 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:45,392 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:25:45,393 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:45,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:45,393 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:45,393 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:45,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2022-12-06 07:25:45,393 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-06 07:25:45,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:45,393 INFO L85 PathProgramCache]: Analyzing trace with hash -339887799, now seen corresponding path program 1 times [2022-12-06 07:25:45,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:45,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299535420] [2022-12-06 07:25:45,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:45,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:45,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-06 07:25:45,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:45,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299535420] [2022-12-06 07:25:45,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299535420] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:45,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:45,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:45,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460692480] [2022-12-06 07:25:45,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:45,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:45,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:45,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:45,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:45,474 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:45,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:45,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:45,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:45,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:45,527 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:45,527 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:45,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:45,528 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:45,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:45,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:45,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:45,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:45,529 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:45,529 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:45,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:45,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:45,530 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:45,530 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:45,530 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:45,530 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:45,531 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:45,531 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:45,531 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:45,531 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:45,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:45,534 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:45,534 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:45,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:45,535 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:45,535 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:45,612 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:45,613 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 07:25:45,613 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:45,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:45,613 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:45,613 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:45,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2022-12-06 07:25:45,613 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-06 07:25:45,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:45,614 INFO L85 PathProgramCache]: Analyzing trace with hash -309411606, now seen corresponding path program 1 times [2022-12-06 07:25:45,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:45,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407190600] [2022-12-06 07:25:45,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:45,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:45,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-06 07:25:45,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:45,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407190600] [2022-12-06 07:25:45,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407190600] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:45,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:45,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:45,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846749002] [2022-12-06 07:25:45,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:45,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:45,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:45,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:45,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:45,720 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:45,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:45,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:45,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:45,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:45,774 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:45,774 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:45,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:45,775 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:45,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:45,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:45,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:45,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:45,776 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:45,776 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:45,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:45,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:45,778 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:45,778 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:45,778 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:45,778 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:45,778 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:45,778 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:45,778 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:45,779 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:45,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:45,781 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:45,781 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:45,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:45,782 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:45,782 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:45,864 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:45,865 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 07:25:45,865 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:45,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:45,865 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:45,865 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:45,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2022-12-06 07:25:45,865 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-06 07:25:45,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:45,866 INFO L85 PathProgramCache]: Analyzing trace with hash -282629497, now seen corresponding path program 1 times [2022-12-06 07:25:45,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:45,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300039941] [2022-12-06 07:25:45,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:45,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:45,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:45,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-06 07:25:45,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:45,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300039941] [2022-12-06 07:25:45,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300039941] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:45,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:45,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:45,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996921617] [2022-12-06 07:25:45,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:45,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:45,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:45,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:45,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:45,955 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:45,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:45,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:45,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:45,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:46,008 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:46,009 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:46,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:46,010 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:46,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:46,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:46,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:46,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:46,010 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:46,010 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:46,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:46,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:46,011 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:46,011 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:46,012 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:46,012 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:46,012 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:46,012 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:46,012 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:46,012 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:46,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:46,015 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:46,015 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:46,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:46,016 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:46,016 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:46,093 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:46,094 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:25:46,094 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:46,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:46,094 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:46,094 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:46,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2022-12-06 07:25:46,094 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-06 07:25:46,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:46,095 INFO L85 PathProgramCache]: Analyzing trace with hash -252153304, now seen corresponding path program 1 times [2022-12-06 07:25:46,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:46,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808352343] [2022-12-06 07:25:46,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:46,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:46,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:46,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-06 07:25:46,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:46,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808352343] [2022-12-06 07:25:46,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808352343] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:46,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:46,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:46,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006307432] [2022-12-06 07:25:46,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:46,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:46,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:46,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:46,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:46,180 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:46,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:46,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:46,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:46,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:46,221 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:46,221 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:46,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:46,222 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:46,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:46,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:46,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:46,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:46,223 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:46,223 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:46,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:46,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:46,224 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:46,224 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:46,224 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:46,225 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:46,225 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:46,225 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:46,225 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:46,225 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:46,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:46,228 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:46,229 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:46,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:46,229 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:46,229 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:46,311 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:46,312 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 07:25:46,312 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:46,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:46,312 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:46,312 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:46,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2022-12-06 07:25:46,313 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-06 07:25:46,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:46,313 INFO L85 PathProgramCache]: Analyzing trace with hash -225371195, now seen corresponding path program 1 times [2022-12-06 07:25:46,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:46,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110287604] [2022-12-06 07:25:46,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:46,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:46,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-06 07:25:46,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:46,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110287604] [2022-12-06 07:25:46,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110287604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:46,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:46,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:46,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151868248] [2022-12-06 07:25:46,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:46,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:46,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:46,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:46,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:46,407 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:46,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:46,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:46,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:46,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:46,454 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:46,455 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:46,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:46,455 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:46,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:46,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:46,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:46,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:46,456 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:46,456 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:46,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:46,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:46,457 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:46,457 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:46,457 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:46,458 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:46,458 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:46,458 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:46,458 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:46,458 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:46,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:46,461 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:46,461 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:46,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:46,461 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:46,462 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:46,540 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:46,541 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 07:25:46,541 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:46,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:46,541 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:46,541 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:46,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2022-12-06 07:25:46,542 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-06 07:25:46,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:46,542 INFO L85 PathProgramCache]: Analyzing trace with hash -194895002, now seen corresponding path program 1 times [2022-12-06 07:25:46,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:46,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616449068] [2022-12-06 07:25:46,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:46,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:46,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-06 07:25:46,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:46,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616449068] [2022-12-06 07:25:46,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616449068] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:46,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:46,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:46,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449048588] [2022-12-06 07:25:46,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:46,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:46,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:46,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:46,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:46,633 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:46,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:46,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:46,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:46,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:46,683 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:46,684 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:46,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:46,684 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:46,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:46,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:46,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:46,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:46,685 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:46,685 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:46,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:46,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:46,686 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:46,687 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:46,687 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:46,687 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:46,687 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:46,687 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:46,687 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:46,687 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:46,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:46,691 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:46,691 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:46,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 114 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:46,691 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:46,691 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:46,782 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:46,783 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:25:46,783 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:46,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:46,783 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:46,783 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:46,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2022-12-06 07:25:46,783 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-06 07:25:46,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:46,784 INFO L85 PathProgramCache]: Analyzing trace with hash -168112893, now seen corresponding path program 1 times [2022-12-06 07:25:46,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:46,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137755920] [2022-12-06 07:25:46,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:46,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:46,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-06 07:25:46,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:46,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137755920] [2022-12-06 07:25:46,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137755920] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:46,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:46,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:46,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531332078] [2022-12-06 07:25:46,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:46,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:46,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:46,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:46,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:46,867 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:46,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:46,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:46,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:46,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:46,917 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:46,917 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:46,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:46,918 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:46,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:46,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:46,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:46,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:46,919 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:46,919 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:46,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:46,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:46,920 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:46,920 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:46,920 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:46,920 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:46,920 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:46,921 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:46,921 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:46,921 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:46,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:46,924 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:46,924 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:46,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:46,925 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:46,925 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:47,015 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:47,016 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:25:47,016 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:47,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:47,016 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:47,016 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:47,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2022-12-06 07:25:47,016 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-06 07:25:47,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:47,017 INFO L85 PathProgramCache]: Analyzing trace with hash -137636700, now seen corresponding path program 1 times [2022-12-06 07:25:47,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:47,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377597998] [2022-12-06 07:25:47,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:47,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:47,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:47,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-06 07:25:47,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:47,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377597998] [2022-12-06 07:25:47,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377597998] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:47,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:47,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:47,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860583231] [2022-12-06 07:25:47,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:47,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:47,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:47,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:47,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:47,098 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:47,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:47,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:47,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:47,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:47,151 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:47,151 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:47,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:47,152 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:47,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:47,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:47,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:47,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:47,153 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:47,153 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:47,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:47,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:47,154 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:47,154 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:47,155 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:47,155 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:47,155 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:47,155 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:47,155 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:47,155 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:47,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:47,158 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:47,158 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:47,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:47,159 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:47,159 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:47,251 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:47,252 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 07:25:47,252 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:47,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:47,252 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:47,252 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:47,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2022-12-06 07:25:47,252 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-06 07:25:47,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:47,253 INFO L85 PathProgramCache]: Analyzing trace with hash -110854591, now seen corresponding path program 1 times [2022-12-06 07:25:47,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:47,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583115695] [2022-12-06 07:25:47,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:47,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:47,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:47,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-06 07:25:47,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:47,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583115695] [2022-12-06 07:25:47,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583115695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:47,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:47,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:47,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575094915] [2022-12-06 07:25:47,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:47,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:47,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:47,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:47,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:47,334 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:47,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:47,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:47,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:47,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:47,387 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:47,388 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:47,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:47,388 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:47,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:47,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:47,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:47,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:47,389 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:47,389 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:47,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:47,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:47,391 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:47,391 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:47,391 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:47,391 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:47,391 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:47,391 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:47,391 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:47,391 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:47,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:47,395 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:47,395 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:47,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:47,396 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:47,396 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:47,469 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:47,469 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:25:47,469 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:47,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:47,469 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:47,470 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:47,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2022-12-06 07:25:47,470 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-06 07:25:47,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:47,470 INFO L85 PathProgramCache]: Analyzing trace with hash -80378398, now seen corresponding path program 1 times [2022-12-06 07:25:47,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:47,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121693364] [2022-12-06 07:25:47,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:47,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:47,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-06 07:25:47,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:47,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121693364] [2022-12-06 07:25:47,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121693364] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:47,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:47,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:47,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798813020] [2022-12-06 07:25:47,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:47,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:47,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:47,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:47,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:47,550 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:47,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:47,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:47,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:47,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:47,616 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:47,616 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:25:47,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:47,619 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:47,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:47,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:47,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:47,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:47,620 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:47,620 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:47,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:47,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:47,624 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:47,624 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:47,624 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:47,624 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:47,624 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:47,624 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:47,624 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:47,625 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:47,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:47,629 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:47,629 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:47,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:47,630 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:47,630 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:47,722 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:47,723 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 07:25:47,723 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:47,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:47,723 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:47,723 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:47,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2022-12-06 07:25:47,724 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-06 07:25:47,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:47,724 INFO L85 PathProgramCache]: Analyzing trace with hash -53596289, now seen corresponding path program 1 times [2022-12-06 07:25:47,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:47,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246273405] [2022-12-06 07:25:47,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:47,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:47,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-06 07:25:47,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:47,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246273405] [2022-12-06 07:25:47,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246273405] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:47,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:47,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:47,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578965572] [2022-12-06 07:25:47,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:47,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:47,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:47,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:47,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:47,824 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:47,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:47,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:47,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:47,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:47,871 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:47,871 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:47,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:47,872 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:47,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:47,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:47,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:47,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:47,873 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:47,873 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:47,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:47,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:47,876 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:47,876 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:47,876 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:47,876 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:47,876 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:47,876 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:47,876 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:47,876 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:47,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:47,880 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:47,880 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:47,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:47,881 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:47,881 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:47,968 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:47,969 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-06 07:25:47,969 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:47,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:47,969 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:47,969 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:47,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2022-12-06 07:25:47,970 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-06 07:25:47,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:47,970 INFO L85 PathProgramCache]: Analyzing trace with hash -23120096, now seen corresponding path program 1 times [2022-12-06 07:25:47,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:47,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105930795] [2022-12-06 07:25:47,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:47,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:48,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-06 07:25:48,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:48,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105930795] [2022-12-06 07:25:48,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105930795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:48,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:48,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:48,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582322821] [2022-12-06 07:25:48,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:48,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:48,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:48,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:48,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:48,060 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:48,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:48,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:48,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:48,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:48,102 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:48,102 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:48,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:48,102 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:48,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:48,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:48,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:48,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:48,103 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:48,103 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:48,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:48,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:48,104 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:48,104 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:48,104 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:48,104 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:48,104 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:48,105 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:48,105 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:48,105 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:48,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:48,107 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:48,107 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:48,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:48,108 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:48,108 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:48,186 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:48,187 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 07:25:48,187 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:48,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:48,187 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:48,187 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:48,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2022-12-06 07:25:48,188 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-06 07:25:48,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:48,188 INFO L85 PathProgramCache]: Analyzing trace with hash 3662013, now seen corresponding path program 1 times [2022-12-06 07:25:48,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:48,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603393662] [2022-12-06 07:25:48,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:48,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:48,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-06 07:25:48,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:48,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603393662] [2022-12-06 07:25:48,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603393662] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:48,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:48,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:48,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410170194] [2022-12-06 07:25:48,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:48,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:48,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:48,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:48,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:48,276 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:48,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:48,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:48,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:48,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:48,326 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:48,326 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:48,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:48,327 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:48,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:48,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:48,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:48,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:48,328 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:48,328 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:48,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:48,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:48,329 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:48,329 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:48,329 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:48,329 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:48,329 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:48,330 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:48,330 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:48,330 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:48,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:48,333 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:48,333 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:48,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:48,334 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:48,334 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:48,409 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:48,409 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:25:48,410 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:48,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:48,410 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:48,410 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:48,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2022-12-06 07:25:48,410 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-06 07:25:48,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:48,410 INFO L85 PathProgramCache]: Analyzing trace with hash 34138206, now seen corresponding path program 1 times [2022-12-06 07:25:48,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:48,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018253969] [2022-12-06 07:25:48,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:48,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:48,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-06 07:25:48,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:48,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018253969] [2022-12-06 07:25:48,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018253969] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:48,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:48,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:48,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926294538] [2022-12-06 07:25:48,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:48,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:48,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:48,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:48,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:48,493 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:48,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:48,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:48,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:48,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:48,541 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:48,541 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:48,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:48,542 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:48,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:48,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:48,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:48,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:48,543 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:48,543 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:48,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:48,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:48,544 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:48,544 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:48,544 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:48,544 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:48,545 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:48,545 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:48,545 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:48,545 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:48,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:48,548 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:48,548 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:48,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:48,549 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:48,549 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:48,628 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:48,628 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:25:48,628 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:48,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:48,628 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:48,628 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:48,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2022-12-06 07:25:48,629 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-06 07:25:48,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:48,629 INFO L85 PathProgramCache]: Analyzing trace with hash 60920315, now seen corresponding path program 1 times [2022-12-06 07:25:48,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:48,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491952561] [2022-12-06 07:25:48,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:48,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:48,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-06 07:25:48,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:48,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491952561] [2022-12-06 07:25:48,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491952561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:48,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:48,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:48,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513992123] [2022-12-06 07:25:48,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:48,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:48,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:48,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:48,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:48,714 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:48,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:48,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:48,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:48,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:48,757 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:48,757 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:48,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:48,758 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:48,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:48,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:48,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:48,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:48,759 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:48,759 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:48,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:48,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:48,760 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:48,760 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:48,760 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:48,760 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:48,760 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:48,761 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:48,761 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:48,761 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:48,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:48,764 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:48,764 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:48,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:48,765 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:48,765 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:48,839 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:48,840 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:25:48,840 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:48,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:48,840 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:48,840 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:48,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2022-12-06 07:25:48,840 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-06 07:25:48,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:48,841 INFO L85 PathProgramCache]: Analyzing trace with hash 91396508, now seen corresponding path program 1 times [2022-12-06 07:25:48,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:48,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746102779] [2022-12-06 07:25:48,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:48,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:48,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-06 07:25:48,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:48,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746102779] [2022-12-06 07:25:48,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746102779] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:48,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:48,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:48,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24366119] [2022-12-06 07:25:48,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:48,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:48,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:48,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:48,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:48,926 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:48,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:48,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:48,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:48,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:48,974 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:48,975 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:48,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:48,975 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:48,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:48,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:48,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:48,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:48,976 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:48,976 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:48,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:48,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:48,977 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:48,977 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:48,978 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:48,978 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:48,978 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:48,978 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:48,978 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:48,978 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:48,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:48,982 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:48,982 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:48,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:48,982 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:48,982 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:49,063 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:49,064 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-06 07:25:49,064 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:49,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:49,064 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:49,064 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:49,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2022-12-06 07:25:49,064 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-06 07:25:49,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:49,064 INFO L85 PathProgramCache]: Analyzing trace with hash 118178617, now seen corresponding path program 1 times [2022-12-06 07:25:49,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:49,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542694887] [2022-12-06 07:25:49,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:49,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:49,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-06 07:25:49,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:49,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542694887] [2022-12-06 07:25:49,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542694887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:49,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:49,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:49,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089770563] [2022-12-06 07:25:49,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:49,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:49,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:49,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:49,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:49,145 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:49,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:49,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:49,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:49,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:49,185 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:49,186 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:49,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:49,187 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:49,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:49,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:49,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:49,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:49,187 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:49,187 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:49,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:49,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:49,189 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:49,189 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:49,189 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:49,189 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:49,189 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:49,189 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:49,190 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:49,190 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:49,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:49,193 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:49,193 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:49,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:49,193 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:49,193 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:49,283 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:49,284 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 07:25:49,284 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:49,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:49,284 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:49,284 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:49,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2022-12-06 07:25:49,285 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-06 07:25:49,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:49,285 INFO L85 PathProgramCache]: Analyzing trace with hash 148654810, now seen corresponding path program 1 times [2022-12-06 07:25:49,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:49,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914744648] [2022-12-06 07:25:49,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:49,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:49,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-06 07:25:49,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:49,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914744648] [2022-12-06 07:25:49,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914744648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:49,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:49,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:49,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861878165] [2022-12-06 07:25:49,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:49,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:49,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:49,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:49,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:49,358 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:49,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:49,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:49,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:49,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:49,406 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:49,406 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:25:49,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:49,407 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:49,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:49,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:49,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:49,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:49,407 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:49,408 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:49,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:49,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:49,409 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:49,409 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:49,409 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:49,409 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:49,409 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:49,409 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:49,409 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:49,410 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:49,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:49,413 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:49,413 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:49,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:49,413 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:49,413 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:49,504 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:49,505 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:25:49,505 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:49,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:49,505 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:49,505 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:49,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2022-12-06 07:25:49,505 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-06 07:25:49,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:49,505 INFO L85 PathProgramCache]: Analyzing trace with hash 175436919, now seen corresponding path program 1 times [2022-12-06 07:25:49,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:49,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778464352] [2022-12-06 07:25:49,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:49,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:49,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-06 07:25:49,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:49,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778464352] [2022-12-06 07:25:49,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778464352] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:49,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:49,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:49,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000259803] [2022-12-06 07:25:49,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:49,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:49,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:49,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:49,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:49,589 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:49,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:49,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:49,589 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:49,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:49,643 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:49,644 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:49,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:49,644 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:49,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:49,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:49,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:49,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:49,645 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:49,645 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:49,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:49,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:49,647 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:49,647 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:49,647 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:49,647 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:49,647 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:49,647 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:49,647 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:49,647 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:49,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:49,650 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:49,651 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:49,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:49,651 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:49,651 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:49,728 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:49,729 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:25:49,729 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:49,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:49,729 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:49,729 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:49,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2022-12-06 07:25:49,729 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-06 07:25:49,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:49,730 INFO L85 PathProgramCache]: Analyzing trace with hash 205913112, now seen corresponding path program 1 times [2022-12-06 07:25:49,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:49,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369102136] [2022-12-06 07:25:49,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:49,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:49,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:49,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-06 07:25:49,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:49,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369102136] [2022-12-06 07:25:49,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369102136] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:49,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:49,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:49,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946082940] [2022-12-06 07:25:49,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:49,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:49,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:49,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:49,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:49,804 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:49,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:49,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:49,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:49,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:49,859 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:49,859 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:25:49,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:49,860 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:49,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:49,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:49,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:49,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:49,861 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:49,861 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:49,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:49,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:49,862 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:49,862 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:49,862 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:49,862 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:49,862 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:49,863 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:49,863 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:49,863 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:49,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:49,866 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:49,866 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:49,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:49,867 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:49,867 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:49,958 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:49,958 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:25:49,958 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:49,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:49,959 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:49,959 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:49,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2022-12-06 07:25:49,959 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-06 07:25:49,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:49,959 INFO L85 PathProgramCache]: Analyzing trace with hash 232695221, now seen corresponding path program 1 times [2022-12-06 07:25:49,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:49,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120234712] [2022-12-06 07:25:49,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:49,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25: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-06 07:25:50,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:50,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120234712] [2022-12-06 07:25:50,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120234712] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:50,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:50,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:50,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032152900] [2022-12-06 07:25:50,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:50,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:50,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:50,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:50,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:50,038 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:50,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:50,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:50,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:50,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:50,086 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:50,086 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:50,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:50,087 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:50,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:50,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:50,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:50,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:50,088 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:50,088 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:50,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:50,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:50,089 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:50,089 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:50,089 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:50,089 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:50,089 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:50,090 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:50,090 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:50,090 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:50,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:50,093 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:50,093 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:50,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:50,093 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:50,093 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:50,187 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:50,188 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 07:25:50,188 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:50,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:50,188 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:50,188 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:50,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2022-12-06 07:25:50,188 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-06 07:25:50,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:50,189 INFO L85 PathProgramCache]: Analyzing trace with hash 263171414, now seen corresponding path program 1 times [2022-12-06 07:25:50,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:50,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923386751] [2022-12-06 07:25:50,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:50,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:50,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:50,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-06 07:25:50,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:50,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923386751] [2022-12-06 07:25:50,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923386751] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:50,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:50,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:50,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140898462] [2022-12-06 07:25:50,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:50,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:50,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:50,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:50,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:50,263 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:50,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:50,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:50,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:50,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:50,316 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:50,316 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:50,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:50,317 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:50,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:50,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:50,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:50,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:50,318 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:50,318 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:50,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:50,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:50,319 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:50,320 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:50,321 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:50,321 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:50,321 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:50,321 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:50,321 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:50,321 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:50,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:50,325 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:50,325 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:50,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:50,330 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:50,330 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:50,420 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:50,421 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 07:25:50,421 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:50,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:50,421 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:50,421 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:50,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2022-12-06 07:25:50,422 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-06 07:25:50,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:50,422 INFO L85 PathProgramCache]: Analyzing trace with hash 289953523, now seen corresponding path program 1 times [2022-12-06 07:25:50,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:50,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311662235] [2022-12-06 07:25:50,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:50,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:50,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-06 07:25:50,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:50,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311662235] [2022-12-06 07:25:50,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311662235] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:50,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:50,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:50,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876192432] [2022-12-06 07:25:50,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:50,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:50,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:50,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:50,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:50,527 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:50,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:50,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:50,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:50,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:50,577 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:50,577 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:50,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 373 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:50,578 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:50,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:50,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:50,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:50,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:50,579 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:50,579 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:50,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:50,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:50,580 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:50,580 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:50,580 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:50,581 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:50,581 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:50,581 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:50,581 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:50,581 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:50,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:50,584 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:50,584 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:50,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:50,585 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:50,585 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:50,663 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:50,664 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 07:25:50,664 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:50,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:50,664 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:50,664 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:50,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2022-12-06 07:25:50,665 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-06 07:25:50,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:50,665 INFO L85 PathProgramCache]: Analyzing trace with hash 320429716, now seen corresponding path program 1 times [2022-12-06 07:25:50,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:50,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075384781] [2022-12-06 07:25:50,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:50,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:50,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-06 07:25:50,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:50,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075384781] [2022-12-06 07:25:50,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075384781] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:50,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:50,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:50,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101624862] [2022-12-06 07:25:50,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:50,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:50,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:50,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:50,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:50,738 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:50,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:50,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:50,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:50,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:50,780 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:50,780 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:50,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:50,781 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:50,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:50,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:50,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:50,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:50,782 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:50,782 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:50,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:50,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:50,783 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:50,783 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:50,784 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:50,784 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:50,784 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:50,784 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:50,784 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:50,784 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:50,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:50,787 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:50,787 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:50,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:50,787 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:50,787 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:50,877 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:50,878 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 07:25:50,878 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:50,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:50,878 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:50,878 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:50,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2022-12-06 07:25:50,878 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-06 07:25:50,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:50,879 INFO L85 PathProgramCache]: Analyzing trace with hash 347211825, now seen corresponding path program 1 times [2022-12-06 07:25:50,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:50,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122197428] [2022-12-06 07:25:50,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:50,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:50,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-06 07:25:50,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:50,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122197428] [2022-12-06 07:25:50,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122197428] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:50,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:50,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:50,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434682099] [2022-12-06 07:25:50,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:50,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:50,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:50,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:50,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:50,970 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:50,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:50,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:50,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:50,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:51,011 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:51,011 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:51,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:51,012 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:51,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:51,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:51,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:51,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:51,012 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:51,012 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:51,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:51,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:51,014 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:51,014 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:51,014 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:51,014 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:51,014 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:51,014 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:51,014 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:51,015 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:51,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:51,018 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:51,018 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:51,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:51,018 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:51,018 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:51,111 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:51,112 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 07:25:51,112 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:51,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:51,112 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:51,112 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:51,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2022-12-06 07:25:51,112 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-06 07:25:51,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:51,113 INFO L85 PathProgramCache]: Analyzing trace with hash 377688018, now seen corresponding path program 1 times [2022-12-06 07:25:51,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:51,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349152159] [2022-12-06 07:25:51,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:51,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:51,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-06 07:25:51,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:51,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349152159] [2022-12-06 07:25:51,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349152159] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:51,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:51,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:51,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125681474] [2022-12-06 07:25:51,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:51,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:51,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:51,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:51,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:51,190 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:51,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:51,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:51,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:51,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:51,249 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:51,249 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:51,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:51,250 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:51,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:51,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:51,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:51,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:51,251 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:51,251 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:51,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:51,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:51,254 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:51,257 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:51,258 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:51,258 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:51,258 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:51,258 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:51,259 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:51,259 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:51,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:51,262 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:51,262 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:51,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:51,263 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:51,263 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:51,334 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:51,335 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:25:51,335 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:51,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:51,335 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:51,335 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:51,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2022-12-06 07:25:51,335 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-06 07:25:51,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:51,335 INFO L85 PathProgramCache]: Analyzing trace with hash 404470127, now seen corresponding path program 1 times [2022-12-06 07:25:51,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:51,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206521336] [2022-12-06 07:25:51,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:51,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:51,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:51,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-06 07:25:51,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:51,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206521336] [2022-12-06 07:25:51,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206521336] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:51,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:51,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:51,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762260893] [2022-12-06 07:25:51,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:51,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:51,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:51,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:51,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:51,411 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:51,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:51,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:51,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:51,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:51,456 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:51,456 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:51,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:51,457 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:51,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:51,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:51,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:51,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:51,458 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:51,458 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:51,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:51,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:51,459 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:51,459 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:51,459 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:51,460 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:51,460 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:51,460 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:51,460 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:51,460 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:51,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:51,464 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:51,464 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:51,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:51,464 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:51,464 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:51,537 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:51,538 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:25:51,538 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:51,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:51,538 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:51,538 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:51,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2022-12-06 07:25:51,539 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-06 07:25:51,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:51,539 INFO L85 PathProgramCache]: Analyzing trace with hash 434946320, now seen corresponding path program 1 times [2022-12-06 07:25:51,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:51,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833694418] [2022-12-06 07:25:51,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:51,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:51,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-06 07:25:51,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:51,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833694418] [2022-12-06 07:25:51,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833694418] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:51,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:51,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:51,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391110654] [2022-12-06 07:25:51,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:51,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:51,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:51,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:51,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:51,615 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:51,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:51,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:51,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:51,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:51,673 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:51,674 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:25:51,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:51,674 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:51,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:51,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:51,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:51,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:51,675 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:51,675 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:51,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:51,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:51,677 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:51,677 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:51,677 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:51,677 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:51,677 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:51,677 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:51,677 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:51,678 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:51,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:51,681 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:51,681 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:51,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:51,681 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:51,681 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:51,775 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:51,776 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 07:25:51,776 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:51,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:51,776 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:51,776 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:51,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2022-12-06 07:25:51,776 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-06 07:25:51,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:51,776 INFO L85 PathProgramCache]: Analyzing trace with hash 461728429, now seen corresponding path program 1 times [2022-12-06 07:25:51,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:51,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639539616] [2022-12-06 07:25:51,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:51,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:51,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-06 07:25:51,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:51,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639539616] [2022-12-06 07:25:51,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639539616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:51,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:51,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:51,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785433570] [2022-12-06 07:25:51,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:51,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:51,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:51,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:51,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:51,857 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:51,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:51,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:51,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:51,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:51,913 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:51,913 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:51,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:51,914 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:51,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:51,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:51,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:51,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:51,915 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:51,915 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:51,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:51,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:51,916 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:51,916 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:51,916 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:51,916 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:51,916 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:51,917 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:51,917 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:51,917 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:51,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:51,920 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:51,920 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:51,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:51,921 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:51,921 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:52,014 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:52,015 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 07:25:52,015 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:52,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:52,015 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:52,015 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:52,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2022-12-06 07:25:52,015 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-06 07:25:52,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:52,016 INFO L85 PathProgramCache]: Analyzing trace with hash 492204622, now seen corresponding path program 1 times [2022-12-06 07:25:52,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:52,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960157416] [2022-12-06 07:25:52,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:52,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:52,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-06 07:25:52,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:52,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960157416] [2022-12-06 07:25:52,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960157416] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:52,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:52,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:52,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994326198] [2022-12-06 07:25:52,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:52,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:52,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:52,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:52,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:52,095 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:52,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:52,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:52,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:52,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:52,151 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:52,151 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:52,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:52,152 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:52,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:52,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:52,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:52,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:52,153 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:52,153 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:52,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:52,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:52,154 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:52,154 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:52,154 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:52,154 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:52,155 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:52,155 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:52,155 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:52,155 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:52,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:52,158 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:52,158 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:52,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:52,159 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:52,159 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:52,242 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:52,242 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 07:25:52,242 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:52,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:52,243 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:52,243 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:52,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2022-12-06 07:25:52,243 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-06 07:25:52,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:52,243 INFO L85 PathProgramCache]: Analyzing trace with hash 518986731, now seen corresponding path program 1 times [2022-12-06 07:25:52,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:52,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808142693] [2022-12-06 07:25:52,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:52,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:52,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:52,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:52,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808142693] [2022-12-06 07:25:52,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808142693] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:52,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:52,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:52,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242919597] [2022-12-06 07:25:52,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:52,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:52,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:52,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:52,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:52,326 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:52,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:52,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:52,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:52,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:52,375 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:52,376 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:52,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:52,376 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:52,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:52,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:52,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:52,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:52,377 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:52,377 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:52,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:52,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:52,379 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:52,379 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:52,379 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:52,379 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:52,379 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:52,380 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:52,380 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:52,380 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:52,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:52,383 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:52,383 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:52,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:52,385 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:52,385 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:52,476 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:52,476 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 07:25:52,476 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:52,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:52,476 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:52,477 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:52,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2022-12-06 07:25:52,477 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-06 07:25:52,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:52,477 INFO L85 PathProgramCache]: Analyzing trace with hash 549462924, now seen corresponding path program 1 times [2022-12-06 07:25:52,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:52,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188772294] [2022-12-06 07:25:52,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:52,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:52,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-06 07:25:52,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:52,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188772294] [2022-12-06 07:25:52,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188772294] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:52,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:52,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:52,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394625155] [2022-12-06 07:25:52,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:52,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:52,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:52,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:52,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:52,563 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:52,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:52,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:52,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:52,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:52,622 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:52,622 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:25:52,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:52,623 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:52,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:52,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:52,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:52,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:52,624 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:52,624 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:52,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:52,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:52,625 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:52,625 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:52,625 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:52,625 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:52,625 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:52,625 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:52,625 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:52,626 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:52,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:52,629 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:52,629 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:52,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:52,629 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:52,629 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:52,706 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:52,706 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:25:52,706 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:52,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:52,706 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:52,706 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:52,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2022-12-06 07:25:52,707 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-06 07:25:52,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:52,707 INFO L85 PathProgramCache]: Analyzing trace with hash 576245033, now seen corresponding path program 1 times [2022-12-06 07:25:52,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:52,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529943724] [2022-12-06 07:25:52,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:52,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:52,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-06 07:25:52,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:52,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529943724] [2022-12-06 07:25:52,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529943724] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:52,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:52,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:52,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234155753] [2022-12-06 07:25:52,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:52,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:52,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:52,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:52,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:52,776 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:52,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:52,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:52,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:52,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:52,824 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:52,824 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:52,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:52,824 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:52,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:52,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:52,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:52,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:52,825 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:52,825 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:52,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:52,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:52,826 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:52,826 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:52,826 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:52,826 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:52,826 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:52,827 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:52,827 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:52,827 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:52,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:52,830 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:52,830 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:52,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:52,830 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:52,830 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:52,905 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:52,905 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:25:52,905 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:52,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:52,906 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:52,906 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:52,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2022-12-06 07:25:52,906 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-06 07:25:52,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:52,906 INFO L85 PathProgramCache]: Analyzing trace with hash 606721226, now seen corresponding path program 1 times [2022-12-06 07:25:52,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:52,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671523685] [2022-12-06 07:25:52,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:52,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:52,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-06 07:25:52,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:52,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671523685] [2022-12-06 07:25:52,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671523685] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:52,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:52,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:52,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430461451] [2022-12-06 07:25:52,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:52,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:52,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:52,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:52,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:52,978 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:52,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:52,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:52,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:52,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:53,017 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:53,017 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:25:53,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:53,017 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:53,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:53,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:53,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:53,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:53,018 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:53,018 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:53,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:53,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:53,019 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:53,019 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:53,019 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:53,019 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:53,019 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:53,020 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:53,020 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:53,020 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:53,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:53,023 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:53,023 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:53,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:53,023 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:53,023 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:53,107 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:53,108 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 07:25:53,108 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:53,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:53,108 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:53,108 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:53,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2022-12-06 07:25:53,108 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-06 07:25:53,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:53,109 INFO L85 PathProgramCache]: Analyzing trace with hash 633503335, now seen corresponding path program 1 times [2022-12-06 07:25:53,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:53,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897866439] [2022-12-06 07:25:53,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:53,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:53,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-06 07:25:53,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:53,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897866439] [2022-12-06 07:25:53,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897866439] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:53,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:53,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:53,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107041988] [2022-12-06 07:25:53,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:53,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:53,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:53,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:53,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:53,187 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:53,187 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:53,187 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:53,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:53,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:53,238 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:53,239 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:53,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:53,239 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:53,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:53,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:53,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:53,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:53,240 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:53,240 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:53,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:53,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:53,241 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:53,241 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:53,242 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:53,242 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:53,242 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:53,242 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:53,242 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:53,242 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:53,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:53,245 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:53,245 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:53,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:53,246 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:53,246 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:53,337 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:53,337 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 07:25:53,337 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:53,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:53,337 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:53,338 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:53,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2022-12-06 07:25:53,338 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-06 07:25:53,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:53,338 INFO L85 PathProgramCache]: Analyzing trace with hash 663979528, now seen corresponding path program 1 times [2022-12-06 07:25:53,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:53,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083495836] [2022-12-06 07:25:53,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:53,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:53,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-06 07:25:53,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:53,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083495836] [2022-12-06 07:25:53,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083495836] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:53,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:53,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:53,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327130635] [2022-12-06 07:25:53,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:53,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:53,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:53,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:53,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:53,418 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:53,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:53,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:53,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:53,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:53,472 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:53,472 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:53,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:53,472 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:53,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:53,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:53,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:53,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:53,473 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:53,473 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:53,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:53,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:53,474 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:53,475 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:53,475 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:53,475 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:53,475 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:53,475 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:53,475 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:53,475 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:53,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:53,479 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:53,479 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:53,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:53,479 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:53,479 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:53,571 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:53,571 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:25:53,572 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:53,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:53,572 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:53,572 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:53,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2022-12-06 07:25:53,572 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-06 07:25:53,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:53,572 INFO L85 PathProgramCache]: Analyzing trace with hash 690761637, now seen corresponding path program 1 times [2022-12-06 07:25:53,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:53,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234167227] [2022-12-06 07:25:53,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:53,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:53,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-06 07:25:53,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:53,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234167227] [2022-12-06 07:25:53,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234167227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:53,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:53,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:53,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147246790] [2022-12-06 07:25:53,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:53,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:53,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:53,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:53,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:53,647 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:53,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:53,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:53,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:53,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:53,697 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:53,697 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:53,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:53,698 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:53,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:53,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:53,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:53,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:53,698 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:53,698 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:53,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:53,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:53,699 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:53,699 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:53,699 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:53,700 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:53,700 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:53,700 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:53,700 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:53,700 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:53,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:53,703 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:53,703 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:53,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:53,703 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:53,703 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:53,779 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:53,781 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:25:53,781 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:53,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:53,781 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:53,781 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:53,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2022-12-06 07:25:53,781 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-06 07:25:53,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:53,782 INFO L85 PathProgramCache]: Analyzing trace with hash 721237830, now seen corresponding path program 1 times [2022-12-06 07:25:53,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:53,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112323446] [2022-12-06 07:25:53,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:53,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25: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-06 07:25:53,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:53,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112323446] [2022-12-06 07:25:53,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112323446] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:53,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:53,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:53,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056489910] [2022-12-06 07:25:53,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:53,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:53,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:53,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:53,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:53,854 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:53,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:53,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:53,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:53,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:53,910 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:53,910 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:25:53,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:53,911 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:53,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:53,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:53,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:53,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:53,912 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:53,912 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:53,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:53,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:53,913 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:53,913 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:53,914 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:53,914 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:53,914 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:53,914 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:53,914 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:53,914 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:53,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:53,918 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:53,918 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:53,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:53,918 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:53,918 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:53,995 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:53,996 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:25:53,996 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:53,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:53,996 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:53,996 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:53,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2022-12-06 07:25:53,996 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-06 07:25:53,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:53,997 INFO L85 PathProgramCache]: Analyzing trace with hash 748019939, now seen corresponding path program 1 times [2022-12-06 07:25:53,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:53,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806933164] [2022-12-06 07:25:53,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:53,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25: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-06 07:25:54,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:54,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806933164] [2022-12-06 07:25:54,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806933164] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:54,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:54,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:54,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245091810] [2022-12-06 07:25:54,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:54,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:54,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:54,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:54,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:54,076 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:54,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:54,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:54,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:54,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:54,124 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:54,124 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:54,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:54,125 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:54,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:54,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:54,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:54,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:54,125 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:54,125 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:54,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:54,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:54,126 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:54,127 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:54,127 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:54,127 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:54,127 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:54,127 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:54,127 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:54,127 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:54,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:54,130 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:54,130 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:54,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:54,131 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:54,131 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:54,225 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:54,225 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 07:25:54,225 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:54,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:54,226 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:54,226 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:54,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2022-12-06 07:25:54,226 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-06 07:25:54,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:54,226 INFO L85 PathProgramCache]: Analyzing trace with hash 778496132, now seen corresponding path program 1 times [2022-12-06 07:25:54,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:54,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218849589] [2022-12-06 07:25:54,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:54,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:54,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-06 07:25:54,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:54,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218849589] [2022-12-06 07:25:54,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218849589] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:54,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:54,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:54,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391075030] [2022-12-06 07:25:54,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:54,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:54,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:54,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:54,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:54,312 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:54,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:54,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:54,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:54,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:54,364 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:54,364 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:54,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:54,365 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:54,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:54,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:54,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:54,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:54,365 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:54,366 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:54,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:54,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:54,367 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:54,367 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:54,367 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:54,367 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:54,367 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:54,367 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:54,367 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:54,367 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:54,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:54,371 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:54,371 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:54,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:54,371 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:54,371 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:54,462 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:54,463 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:25:54,463 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:54,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:54,463 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:54,463 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:54,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2022-12-06 07:25:54,463 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-06 07:25:54,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:54,464 INFO L85 PathProgramCache]: Analyzing trace with hash 805278241, now seen corresponding path program 1 times [2022-12-06 07:25:54,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:54,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676020531] [2022-12-06 07:25:54,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:54,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:54,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-06 07:25:54,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:54,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676020531] [2022-12-06 07:25:54,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676020531] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:54,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:54,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:54,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740925141] [2022-12-06 07:25:54,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:54,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:54,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:54,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:54,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:54,543 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:54,543 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:54,543 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:54,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:54,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:54,592 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:54,592 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:54,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 372 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:54,593 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:54,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:54,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:54,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:54,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:54,594 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:54,594 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:54,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:54,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:54,595 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:54,595 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:54,595 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:54,595 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:54,595 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:54,596 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:54,596 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:54,596 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:54,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:54,599 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:54,599 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:54,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:54,600 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:54,600 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:54,689 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:54,689 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 07:25:54,690 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:54,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:54,690 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:54,690 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:54,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2022-12-06 07:25:54,690 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-06 07:25:54,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:54,690 INFO L85 PathProgramCache]: Analyzing trace with hash 835754434, now seen corresponding path program 1 times [2022-12-06 07:25:54,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:54,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431053719] [2022-12-06 07:25:54,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:54,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:54,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-06 07:25:54,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:54,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431053719] [2022-12-06 07:25:54,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431053719] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:54,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:54,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:54,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607504406] [2022-12-06 07:25:54,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:54,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:54,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:54,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:54,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:54,770 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:54,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:54,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:54,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:54,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:54,831 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:54,832 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:25:54,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:54,832 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:54,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:54,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:54,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:54,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:54,833 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:54,833 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:54,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:54,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:54,834 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:54,834 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:54,835 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:54,835 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:54,835 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:54,835 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:54,835 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:54,835 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:54,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:54,838 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:54,838 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:54,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:54,839 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:54,839 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:54,929 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:54,930 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 07:25:54,930 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:54,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:54,930 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:54,930 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:54,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2022-12-06 07:25:54,930 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-06 07:25:54,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:54,931 INFO L85 PathProgramCache]: Analyzing trace with hash 862536543, now seen corresponding path program 1 times [2022-12-06 07:25:54,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:54,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081353027] [2022-12-06 07:25:54,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:54,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:55,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-06 07:25:55,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:55,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081353027] [2022-12-06 07:25:55,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081353027] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:55,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:55,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:55,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674606727] [2022-12-06 07:25:55,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:55,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:55,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:55,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:55,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:55,012 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:55,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:55,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:55,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:55,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:55,058 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:55,059 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:55,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:55,059 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:55,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:55,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:55,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:55,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:55,060 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:55,060 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:55,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:55,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:55,062 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:55,062 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:55,062 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:55,062 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:55,062 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:55,062 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:55,063 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:55,063 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:55,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:55,066 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:55,066 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:55,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:55,066 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:55,067 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:55,148 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:55,148 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-06 07:25:55,149 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:55,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:55,149 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:55,149 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:55,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2022-12-06 07:25:55,149 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-06 07:25:55,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:55,149 INFO L85 PathProgramCache]: Analyzing trace with hash 893012736, now seen corresponding path program 1 times [2022-12-06 07:25:55,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:55,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532197145] [2022-12-06 07:25:55,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:55,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25: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-06 07:25:55,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:55,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532197145] [2022-12-06 07:25:55,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532197145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:55,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:55,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:55,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284544635] [2022-12-06 07:25:55,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:55,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:55,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:55,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:55,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:55,228 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:55,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:55,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:55,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:55,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:55,281 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:55,282 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:25:55,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:55,282 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:55,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:55,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:55,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:55,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:55,283 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:55,283 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:55,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:55,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:55,284 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:55,284 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:55,284 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:55,284 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:55,285 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:55,285 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:55,285 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:55,285 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:55,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:55,287 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:55,288 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:55,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:55,288 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:55,288 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:55,363 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:55,364 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:25:55,364 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:55,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:55,364 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:55,364 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:55,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2022-12-06 07:25:55,364 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-06 07:25:55,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:55,365 INFO L85 PathProgramCache]: Analyzing trace with hash 919794845, now seen corresponding path program 1 times [2022-12-06 07:25:55,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:55,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810923331] [2022-12-06 07:25:55,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:55,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:55,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-06 07:25:55,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:55,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810923331] [2022-12-06 07:25:55,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810923331] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:55,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:55,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:55,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398576422] [2022-12-06 07:25:55,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:55,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:55,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:55,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:55,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:55,444 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:55,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:55,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:55,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:55,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:55,492 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:55,493 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:55,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 378 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:55,493 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:55,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:55,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:55,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:55,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:55,494 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:55,494 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:55,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:55,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:55,495 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:55,495 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:55,496 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:55,496 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:55,496 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:55,496 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:55,496 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:55,496 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:55,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:55,499 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:55,499 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:55,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:55,500 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:55,500 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:55,587 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:55,588 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-06 07:25:55,588 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:55,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:55,588 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:55,588 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:55,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2022-12-06 07:25:55,588 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-06 07:25:55,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:55,589 INFO L85 PathProgramCache]: Analyzing trace with hash 950271038, now seen corresponding path program 1 times [2022-12-06 07:25:55,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:55,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54688816] [2022-12-06 07:25:55,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:55,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:55,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-06 07:25:55,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:55,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54688816] [2022-12-06 07:25:55,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54688816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:55,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:55,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:55,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778713481] [2022-12-06 07:25:55,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:55,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:55,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:55,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:55,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:55,666 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:55,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:55,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:55,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:55,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:55,714 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:55,714 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:55,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:55,715 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:55,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:55,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:55,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:55,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:55,715 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:55,716 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:55,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:55,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:55,717 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:55,717 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:55,717 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:55,717 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:55,717 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:55,717 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:55,717 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:55,717 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:55,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:55,720 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:55,721 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:55,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:55,721 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:55,721 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:55,813 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:55,814 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 07:25:55,814 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:55,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:55,814 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:55,814 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:55,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2022-12-06 07:25:55,815 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-06 07:25:55,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:55,815 INFO L85 PathProgramCache]: Analyzing trace with hash 977053147, now seen corresponding path program 1 times [2022-12-06 07:25:55,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:55,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404976130] [2022-12-06 07:25:55,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:55,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:55,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:55,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-06 07:25:55,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:55,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404976130] [2022-12-06 07:25:55,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404976130] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:55,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:55,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:55,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498859457] [2022-12-06 07:25:55,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:55,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:55,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:55,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:55,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:55,888 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:55,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:55,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:55,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:55,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:55,946 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:55,946 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:55,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:55,947 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:55,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:55,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:55,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:55,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:55,948 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:55,948 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:55,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:55,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:55,949 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:55,949 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:55,950 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:55,950 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:55,950 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:55,950 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:55,950 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:55,950 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:55,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:55,953 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:55,953 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:55,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:55,954 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:55,954 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:56,044 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:56,045 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 07:25:56,045 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:56,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:56,045 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:56,045 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:56,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2022-12-06 07:25:56,045 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-06 07:25:56,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:56,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1007529340, now seen corresponding path program 1 times [2022-12-06 07:25:56,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:56,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738580670] [2022-12-06 07:25:56,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:56,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:56,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-06 07:25:56,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:56,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738580670] [2022-12-06 07:25:56,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738580670] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:56,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:56,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:56,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439344296] [2022-12-06 07:25:56,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:56,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:56,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:56,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:56,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:56,126 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:56,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:56,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:56,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:56,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:56,169 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:56,170 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:56,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:56,170 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:56,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:56,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:56,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:56,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:56,171 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:56,171 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:56,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:56,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:56,172 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:56,172 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:56,173 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:56,173 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:56,173 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:56,173 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:56,173 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:56,173 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:56,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:56,177 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:56,177 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:56,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:56,177 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:56,177 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:56,277 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:56,278 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-06 07:25:56,278 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:56,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:56,278 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:56,278 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:56,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2022-12-06 07:25:56,278 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-06 07:25:56,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:56,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1034311449, now seen corresponding path program 1 times [2022-12-06 07:25:56,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:56,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163034354] [2022-12-06 07:25:56,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:56,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:56,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-06 07:25:56,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:56,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163034354] [2022-12-06 07:25:56,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163034354] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:56,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:56,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:56,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229275154] [2022-12-06 07:25:56,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:56,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:56,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:56,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:56,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:56,358 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:56,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:56,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:56,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:56,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:56,402 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:56,402 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:56,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:56,403 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:56,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:56,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:56,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:56,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:56,404 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:56,404 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:56,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:56,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:56,405 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:56,405 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:56,405 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:56,405 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:56,405 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:56,409 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:56,409 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:56,409 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:56,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:56,412 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:56,412 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:56,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:56,413 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:56,413 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:56,503 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:56,503 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 07:25:56,503 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:56,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:56,504 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:56,504 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:56,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2022-12-06 07:25:56,504 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-06 07:25:56,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:56,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1064787642, now seen corresponding path program 1 times [2022-12-06 07:25:56,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:56,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372185006] [2022-12-06 07:25:56,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:56,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:56,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-06 07:25:56,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:56,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372185006] [2022-12-06 07:25:56,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372185006] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:56,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:56,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:56,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045592880] [2022-12-06 07:25:56,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:56,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:56,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:56,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:56,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:56,578 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:56,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:56,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:56,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:56,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:56,627 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:56,627 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:56,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:56,628 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:56,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:56,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:56,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:56,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:56,628 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:56,629 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:56,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:56,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:56,631 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:56,631 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:56,631 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:56,631 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:56,631 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:56,632 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:56,632 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:56,632 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:56,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:56,635 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:56,635 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:56,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:56,635 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:56,635 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:56,714 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:56,714 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 07:25:56,714 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:56,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:56,715 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:56,715 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:56,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2022-12-06 07:25:56,715 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-06 07:25:56,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:56,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1091569751, now seen corresponding path program 1 times [2022-12-06 07:25:56,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:56,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037904592] [2022-12-06 07:25:56,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:56,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:56,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-06 07:25:56,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:56,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037904592] [2022-12-06 07:25:56,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037904592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:56,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:56,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:56,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413263373] [2022-12-06 07:25:56,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:56,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:56,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:56,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:56,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:56,791 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:56,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:56,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:56,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:56,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:56,834 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:56,834 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:56,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:56,834 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:56,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:56,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:56,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:56,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:56,835 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:56,835 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:56,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:56,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:56,836 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:56,836 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:56,837 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:56,837 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:56,837 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:56,837 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:56,837 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:56,837 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:56,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:56,841 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:56,841 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:56,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:56,841 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:56,841 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:56,921 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:56,921 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:25:56,921 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:56,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:56,922 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:56,922 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:56,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2022-12-06 07:25:56,922 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-06 07:25:56,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:56,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1122045944, now seen corresponding path program 1 times [2022-12-06 07:25:56,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:56,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541582678] [2022-12-06 07:25:56,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:56,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:56,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:56,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-06 07:25:56,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:56,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541582678] [2022-12-06 07:25:56,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541582678] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:56,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:56,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:56,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251221308] [2022-12-06 07:25:56,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:56,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:56,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:56,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:56,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:56,997 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:56,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:56,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:56,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:56,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:57,041 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:57,041 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:57,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:57,042 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:57,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:57,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:57,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:57,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:57,043 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:57,043 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:57,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:57,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:57,044 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:57,044 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:57,044 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:57,044 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:57,044 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:57,045 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:57,045 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:57,045 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:57,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:57,048 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:57,048 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:57,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:57,048 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:57,048 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:57,136 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:57,136 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-06 07:25:57,136 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:57,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:57,137 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:57,137 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:57,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2022-12-06 07:25:57,137 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-06 07:25:57,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:57,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1148828053, now seen corresponding path program 1 times [2022-12-06 07:25:57,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:57,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922670962] [2022-12-06 07:25:57,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:57,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:57,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-06 07:25:57,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:57,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922670962] [2022-12-06 07:25:57,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922670962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:57,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:57,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:57,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695386407] [2022-12-06 07:25:57,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:57,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:57,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:57,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:57,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:57,213 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:57,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:57,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:57,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:57,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:57,256 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:57,256 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:57,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 371 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:57,257 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:57,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:57,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:57,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:57,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:57,258 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:57,258 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:57,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:57,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:57,259 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:57,259 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:57,259 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:57,259 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:57,259 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:57,260 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:57,260 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:57,260 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:57,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:57,263 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:57,263 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:57,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:57,263 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:57,263 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:57,352 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:57,353 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 07:25:57,353 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:57,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:57,353 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:57,353 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:57,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2022-12-06 07:25:57,354 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-06 07:25:57,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:57,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1179304246, now seen corresponding path program 1 times [2022-12-06 07:25:57,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:57,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378225283] [2022-12-06 07:25:57,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:57,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:57,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-06 07:25:57,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:57,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378225283] [2022-12-06 07:25:57,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378225283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:57,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:57,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:57,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642161447] [2022-12-06 07:25:57,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:57,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:57,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:57,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:57,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:57,425 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:57,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:57,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:57,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:57,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:57,475 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:57,475 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:57,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:57,476 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:57,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:57,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:57,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:57,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:57,477 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:57,477 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:57,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:57,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:57,478 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:57,478 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:57,478 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:57,478 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:57,478 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:57,479 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:57,479 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:57,479 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:57,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:57,482 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:57,482 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:57,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:57,482 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:57,482 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:57,575 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:57,576 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 07:25:57,576 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:57,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:57,576 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:57,576 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:57,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2022-12-06 07:25:57,577 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-06 07:25:57,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:57,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1206086355, now seen corresponding path program 1 times [2022-12-06 07:25:57,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:57,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274315812] [2022-12-06 07:25:57,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:57,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:57,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:57,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-06 07:25:57,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:57,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274315812] [2022-12-06 07:25:57,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274315812] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:57,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:57,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:57,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848483367] [2022-12-06 07:25:57,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:57,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:57,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:57,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:57,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:57,659 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:57,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:57,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:57,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:57,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:57,704 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:57,704 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:57,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:57,705 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:57,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:57,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:57,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:57,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:57,706 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:57,706 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:57,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:57,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:57,707 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:57,707 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:57,707 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:57,707 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:57,707 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:57,708 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:57,708 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:57,708 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:57,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:57,711 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:57,711 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:57,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:57,712 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:57,712 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:57,797 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:57,798 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-06 07:25:57,798 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:57,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:57,798 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:57,798 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:57,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2022-12-06 07:25:57,798 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-06 07:25:57,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:57,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1236562548, now seen corresponding path program 1 times [2022-12-06 07:25:57,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:57,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498032504] [2022-12-06 07:25:57,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:57,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:57,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-06 07:25:57,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:57,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498032504] [2022-12-06 07:25:57,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498032504] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:57,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:57,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:57,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367133372] [2022-12-06 07:25:57,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:57,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:57,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:57,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:57,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:57,880 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:57,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:57,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:57,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:57,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:57,926 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:57,926 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:57,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:57,926 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:57,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:57,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:57,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:57,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:57,927 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:57,927 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:57,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:57,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:57,928 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:57,928 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:57,928 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:57,929 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:57,929 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:57,929 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:57,929 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:57,929 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:57,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:57,932 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:57,932 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:57,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:57,933 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:57,933 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:58,025 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:58,026 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 07:25:58,026 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:58,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:58,026 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:58,026 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:58,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2022-12-06 07:25:58,026 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-06 07:25:58,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:58,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1263344657, now seen corresponding path program 1 times [2022-12-06 07:25:58,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:58,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205808414] [2022-12-06 07:25:58,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:58,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:58,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-06 07:25:58,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:58,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205808414] [2022-12-06 07:25:58,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205808414] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:58,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:58,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:58,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500699843] [2022-12-06 07:25:58,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:58,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:58,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:58,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:58,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:58,106 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:58,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:58,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:58,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:58,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:58,162 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:58,162 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:58,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:58,163 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:58,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:58,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:58,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:58,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:58,164 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:58,164 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:58,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:58,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:58,165 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:58,165 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:58,165 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:58,165 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:58,165 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:58,166 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:58,166 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:58,166 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:58,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:58,169 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:58,169 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:58,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:58,170 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:58,170 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:58,248 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:58,249 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:25:58,249 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:58,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:58,249 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:58,249 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:58,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2022-12-06 07:25:58,249 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-06 07:25:58,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:58,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1293820850, now seen corresponding path program 1 times [2022-12-06 07:25:58,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:58,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63753601] [2022-12-06 07:25:58,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:58,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:58,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-06 07:25:58,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:58,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63753601] [2022-12-06 07:25:58,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63753601] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:58,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:58,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:58,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905161109] [2022-12-06 07:25:58,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:58,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:58,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:58,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:58,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:58,312 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:58,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:58,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:58,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:58,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:58,360 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:58,360 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:58,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:58,361 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:58,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:58,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:58,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:58,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:58,362 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:58,362 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:58,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:58,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:58,363 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:58,363 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:58,363 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:58,363 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:58,363 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:58,364 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:58,364 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:58,364 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:58,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:58,367 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:58,367 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:58,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:58,367 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:58,368 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:58,459 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:58,459 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:25:58,460 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:58,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:58,460 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:58,460 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:58,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2022-12-06 07:25:58,460 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-06 07:25:58,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:58,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1320602959, now seen corresponding path program 1 times [2022-12-06 07:25:58,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:58,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906927683] [2022-12-06 07:25:58,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:58,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:58,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-06 07:25:58,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:58,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906927683] [2022-12-06 07:25:58,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906927683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:58,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:58,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:58,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395384319] [2022-12-06 07:25:58,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:58,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:58,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:58,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:58,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:58,544 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:58,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:58,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:58,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:58,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:58,601 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:58,602 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:58,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:58,602 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:58,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:58,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:58,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:58,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:58,603 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:58,603 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:58,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:58,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:58,604 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:58,604 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:58,605 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:58,605 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:58,605 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:58,605 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:58,605 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:58,605 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:58,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:58,609 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:58,609 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:58,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:58,609 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:58,609 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:58,697 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:58,697 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-06 07:25:58,697 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:58,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:58,697 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:58,697 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:58,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2022-12-06 07:25:58,698 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-06 07:25:58,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:58,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1351079152, now seen corresponding path program 1 times [2022-12-06 07:25:58,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:58,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255414754] [2022-12-06 07:25:58,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:58,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:58,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-06 07:25:58,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:58,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255414754] [2022-12-06 07:25:58,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255414754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:58,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:58,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:58,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616772648] [2022-12-06 07:25:58,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:58,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:58,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:58,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:58,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:58,771 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:58,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:58,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:58,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:58,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:58,820 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:58,820 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:58,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:58,821 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:58,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:58,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:58,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:58,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:58,822 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:58,822 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:58,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:58,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:58,823 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:58,823 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:58,823 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:58,823 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:58,823 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:58,823 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:58,823 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:58,824 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:58,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:58,827 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:58,827 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:58,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:58,827 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:58,827 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:58,902 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:58,902 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:25:58,903 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:58,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:58,903 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:58,903 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:58,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2022-12-06 07:25:58,903 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-06 07:25:58,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:58,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1377861261, now seen corresponding path program 1 times [2022-12-06 07:25:58,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:58,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310075206] [2022-12-06 07:25:58,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:58,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:58,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-06 07:25:58,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:58,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310075206] [2022-12-06 07:25:58,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310075206] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:58,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:58,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:58,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177189558] [2022-12-06 07:25:58,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:58,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:58,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:58,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:58,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:58,980 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:58,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:58,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:58,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:58,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:59,026 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:59,026 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:59,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:59,027 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:59,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:59,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:59,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:59,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:59,028 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:59,028 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:59,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:59,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:59,029 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:59,029 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:59,029 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:59,029 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:59,029 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:59,030 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:59,030 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:59,030 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:59,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:59,033 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:59,033 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:59,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:59,034 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:59,034 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:59,121 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:59,121 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-06 07:25:59,122 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:59,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:59,122 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:59,122 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:59,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2022-12-06 07:25:59,122 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-06 07:25:59,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:59,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1408337454, now seen corresponding path program 1 times [2022-12-06 07:25:59,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:59,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912049811] [2022-12-06 07:25:59,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:59,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:59,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-06 07:25:59,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:59,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912049811] [2022-12-06 07:25:59,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912049811] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:59,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:59,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:59,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128018829] [2022-12-06 07:25:59,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:59,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:59,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:59,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:59,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:59,195 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:59,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:59,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:59,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:59,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:59,241 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:59,241 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:59,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:59,241 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:59,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:59,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:59,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:59,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:59,242 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:59,242 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:59,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:59,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:59,243 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:59,243 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:59,243 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:59,243 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:59,243 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:59,244 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:59,244 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:59,244 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:59,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:59,247 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:59,247 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:59,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:59,247 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:59,247 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:59,327 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:59,328 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 07:25:59,328 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:59,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:59,328 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:59,328 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:59,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2022-12-06 07:25:59,328 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-06 07:25:59,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:59,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1435119563, now seen corresponding path program 1 times [2022-12-06 07:25:59,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:59,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853182146] [2022-12-06 07:25:59,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:59,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:59,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-06 07:25:59,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:59,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853182146] [2022-12-06 07:25:59,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853182146] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:59,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:59,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:59,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201868030] [2022-12-06 07:25:59,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:59,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:59,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:59,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:59,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:59,406 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:59,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:59,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:59,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:59,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:59,443 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:59,444 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:59,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:59,444 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:59,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:59,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:59,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:59,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:59,445 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:59,445 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:59,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:59,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:59,446 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:59,446 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:59,446 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:59,446 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:59,446 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:59,446 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:59,446 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:59,446 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:59,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:59,449 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:59,449 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:59,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:59,449 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:59,449 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:59,523 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:59,523 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:25:59,523 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:59,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:59,524 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:59,524 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:59,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2022-12-06 07:25:59,524 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-06 07:25:59,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:59,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1465595756, now seen corresponding path program 1 times [2022-12-06 07:25:59,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:59,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950481185] [2022-12-06 07:25:59,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:59,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:59,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-06 07:25:59,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:59,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950481185] [2022-12-06 07:25:59,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950481185] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:59,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:59,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:59,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303913148] [2022-12-06 07:25:59,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:59,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:59,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:59,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:59,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:59,609 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:59,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:59,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:59,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:59,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:59,664 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:25:59,664 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:25:59,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:25:59,665 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:25:59,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:59,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:59,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:59,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:59,666 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:59,666 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:59,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:59,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:59,667 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:59,667 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:59,667 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:59,667 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:59,667 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:59,668 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:59,668 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:59,668 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:59,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:59,672 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:25:59,672 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:25:59,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:25:59,672 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:59,672 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:25:59,758 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:59,759 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-06 07:25:59,759 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:25:59,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:59,759 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:59,759 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:59,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2022-12-06 07:25:59,759 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-06 07:25:59,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:59,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1492377865, now seen corresponding path program 1 times [2022-12-06 07:25:59,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:59,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449223883] [2022-12-06 07:25:59,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:59,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:59,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:59,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:59,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449223883] [2022-12-06 07:25:59,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449223883] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:59,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:59,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:59,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690485346] [2022-12-06 07:25:59,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:59,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:59,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:59,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:59,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:59,838 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:25:59,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:59,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:59,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:25:59,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:59,884 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:25:59,885 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:25:59,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:25:59,885 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:25:59,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:59,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:59,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:59,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:25:59,886 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:25:59,886 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:25:59,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:25:59,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:59,888 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:59,888 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:25:59,888 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:25:59,888 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:59,888 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:59,888 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:59,888 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:59,888 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:59,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:59,892 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:25:59,892 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:25:59,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:25:59,892 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:25:59,892 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:25:59,981 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:59,982 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 07:25:59,982 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:25:59,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:59,982 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:59,982 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:59,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2022-12-06 07:25:59,982 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-06 07:25:59,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:59,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1522854058, now seen corresponding path program 1 times [2022-12-06 07:25:59,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:59,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737687094] [2022-12-06 07:25:59,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:59,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:00,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-06 07:26:00,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:00,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737687094] [2022-12-06 07:26:00,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737687094] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:00,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:00,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:00,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979622500] [2022-12-06 07:26:00,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:00,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:00,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:00,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:00,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:00,055 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:00,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:00,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:00,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:00,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:00,098 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:00,098 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:00,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:00,099 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:00,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:00,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:00,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:00,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:00,100 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:00,100 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:00,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:00,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:00,101 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:00,101 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:00,101 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:00,101 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:00,101 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:00,102 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:00,102 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:00,102 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:00,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:00,105 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:00,105 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:00,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:00,105 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:00,105 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:00,194 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:00,195 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 07:26:00,195 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:00,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:00,195 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:00,195 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:00,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2022-12-06 07:26:00,196 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-06 07:26:00,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:00,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1549636167, now seen corresponding path program 1 times [2022-12-06 07:26:00,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:00,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578355147] [2022-12-06 07:26:00,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:00,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:00,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-06 07:26:00,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:00,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578355147] [2022-12-06 07:26:00,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578355147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:00,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:00,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:00,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804833562] [2022-12-06 07:26:00,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:00,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:00,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:00,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:00,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:00,269 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:00,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:00,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:00,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:00,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:00,318 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:00,318 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:00,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:00,319 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:00,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:00,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:00,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:00,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:00,320 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:00,320 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:00,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:00,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:00,321 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:00,321 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:00,321 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:00,321 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:00,321 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:00,322 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:00,322 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:00,322 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:00,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:00,325 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:00,325 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:00,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:00,326 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:00,326 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:00,414 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:00,415 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 07:26:00,415 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:00,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:00,415 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:00,415 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:00,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2022-12-06 07:26:00,416 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-06 07:26:00,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:00,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1580112360, now seen corresponding path program 1 times [2022-12-06 07:26:00,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:00,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128893819] [2022-12-06 07:26:00,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:00,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:00,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-06 07:26:00,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:00,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128893819] [2022-12-06 07:26:00,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128893819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:00,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:00,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:00,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093359119] [2022-12-06 07:26:00,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:00,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:00,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:00,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:00,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:00,489 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:00,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:00,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:00,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:00,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:00,540 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:00,540 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:00,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:00,541 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:00,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:00,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:00,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:00,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:00,541 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:00,541 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:00,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:00,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:00,542 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:00,542 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:00,543 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:00,543 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:00,543 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:00,543 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:00,543 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:00,543 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:00,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:00,545 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:00,546 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:00,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:00,546 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:00,546 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:00,624 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:00,625 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:26:00,625 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:00,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:00,625 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:00,625 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:00,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable157 [2022-12-06 07:26:00,625 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-06 07:26:00,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:00,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1606894469, now seen corresponding path program 1 times [2022-12-06 07:26:00,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:00,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595249379] [2022-12-06 07:26:00,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:00,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:00,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-06 07:26:00,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:00,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595249379] [2022-12-06 07:26:00,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595249379] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:00,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:00,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:00,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398901032] [2022-12-06 07:26:00,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:00,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:00,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:00,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:00,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:00,696 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:00,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:00,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:00,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:00,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:00,737 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:00,737 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:00,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:00,738 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:00,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:00,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:00,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:00,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:00,739 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:00,739 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:00,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:00,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:00,740 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:00,740 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:00,740 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:00,740 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:00,740 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:00,741 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:00,741 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:00,741 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:00,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:00,744 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:00,744 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:00,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:00,744 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:00,744 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:00,820 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:00,821 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:26:00,821 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:00,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:00,821 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:00,821 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:00,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158 [2022-12-06 07:26:00,822 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-06 07:26:00,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:00,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1637370662, now seen corresponding path program 1 times [2022-12-06 07:26:00,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:00,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883477159] [2022-12-06 07:26:00,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:00,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:00,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-06 07:26:00,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:00,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883477159] [2022-12-06 07:26:00,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883477159] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:00,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:00,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:00,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936286189] [2022-12-06 07:26:00,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:00,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:00,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:00,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:00,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:00,896 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:00,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:00,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:00,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:00,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:00,940 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:00,941 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:00,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:00,941 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:00,942 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:00,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:00,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:00,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:00,942 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:00,942 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:00,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:00,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:00,943 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:00,943 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:00,944 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:00,944 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:00,944 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:00,944 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:00,944 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:00,944 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:00,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:00,948 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:00,948 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:00,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:00,948 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:00,948 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:01,021 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:01,021 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:01,021 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:01,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:01,021 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:01,021 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:01,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159 [2022-12-06 07:26:01,022 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-06 07:26:01,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:01,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1664152771, now seen corresponding path program 1 times [2022-12-06 07:26:01,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:01,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859968846] [2022-12-06 07:26:01,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:01,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:01,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-06 07:26:01,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:01,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859968846] [2022-12-06 07:26:01,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859968846] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:01,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:01,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:01,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248424012] [2022-12-06 07:26:01,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:01,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:01,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:01,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:01,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:01,093 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:01,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:01,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:01,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:01,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:01,133 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:01,133 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:01,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:01,133 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:01,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:01,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:01,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:01,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:01,134 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:01,134 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:01,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:01,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:01,135 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:01,135 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:01,135 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:01,135 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:01,135 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:01,135 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:01,135 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:01,136 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:01,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:01,138 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:01,138 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:01,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:01,139 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:01,139 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:01,210 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:01,210 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:26:01,210 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:01,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:01,210 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:01,211 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:01,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160 [2022-12-06 07:26:01,211 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-06 07:26:01,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:01,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1694628964, now seen corresponding path program 1 times [2022-12-06 07:26:01,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:01,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450748355] [2022-12-06 07:26:01,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:01,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:01,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-06 07:26:01,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:01,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450748355] [2022-12-06 07:26:01,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450748355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:01,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:01,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:01,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965716725] [2022-12-06 07:26:01,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:01,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:01,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:01,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:01,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:01,270 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:01,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:01,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:01,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:01,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:01,326 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:01,327 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:01,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 351 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:01,327 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:01,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:01,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:01,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:01,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:01,328 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:01,328 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:01,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:01,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:01,329 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:01,329 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:01,329 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:01,330 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:01,330 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:01,330 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:01,330 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:01,330 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:01,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:01,333 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:01,333 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:01,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:01,334 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:01,334 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:01,426 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:01,426 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:26:01,426 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:01,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:01,427 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:01,427 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:01,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2022-12-06 07:26:01,427 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-06 07:26:01,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:01,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1721411073, now seen corresponding path program 1 times [2022-12-06 07:26:01,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:01,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497590608] [2022-12-06 07:26:01,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:01,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:01,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-06 07:26:01,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:01,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497590608] [2022-12-06 07:26:01,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497590608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:01,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:01,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:01,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247647208] [2022-12-06 07:26:01,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:01,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:01,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:01,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:01,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:01,518 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:01,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:01,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:01,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:01,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:01,568 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:01,568 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:01,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:01,569 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:01,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:01,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:01,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:01,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:01,569 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:01,570 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:01,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:01,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:01,571 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:01,571 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:01,571 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:01,571 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:01,571 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:01,571 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:01,571 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:01,572 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:01,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:01,574 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:01,575 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:01,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:01,575 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:01,575 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:01,666 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:01,666 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 07:26:01,666 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:01,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:01,666 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:01,667 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:01,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162 [2022-12-06 07:26:01,667 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-06 07:26:01,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:01,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1751887266, now seen corresponding path program 1 times [2022-12-06 07:26:01,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:01,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125525122] [2022-12-06 07:26:01,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:01,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:01,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-06 07:26:01,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:01,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125525122] [2022-12-06 07:26:01,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125525122] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:01,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:01,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:01,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245240796] [2022-12-06 07:26:01,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:01,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:01,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:01,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:01,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:01,747 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:01,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:01,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:01,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:01,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:01,795 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:01,796 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:01,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:01,796 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:01,797 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:01,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:01,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:01,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:01,797 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:01,797 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:01,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:01,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:01,798 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:01,798 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:01,799 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:01,799 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:01,799 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:01,799 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:01,799 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:01,799 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:01,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:01,804 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:01,804 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:01,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:01,805 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:01,805 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:01,895 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:01,896 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 07:26:01,896 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:01,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:01,896 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:01,896 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:01,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163 [2022-12-06 07:26:01,896 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-06 07:26:01,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:01,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1778669375, now seen corresponding path program 1 times [2022-12-06 07:26:01,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:01,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885291483] [2022-12-06 07:26:01,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:01,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:01,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-06 07:26:01,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:01,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885291483] [2022-12-06 07:26:01,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885291483] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:01,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:01,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:01,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782426613] [2022-12-06 07:26:01,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:01,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:01,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:01,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:01,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:01,976 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:01,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:01,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:01,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:01,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:02,018 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:02,018 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:02,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:02,019 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:02,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:02,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:02,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:02,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:02,020 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:02,020 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:02,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:02,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:02,021 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:02,021 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:02,021 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:02,021 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:02,021 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:02,021 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:02,021 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:02,021 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:02,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:02,024 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:02,024 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:02,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:02,024 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:02,024 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:02,113 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:02,113 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-06 07:26:02,113 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:02,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:02,113 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:02,113 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:02,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164 [2022-12-06 07:26:02,114 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-06 07:26:02,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:02,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1809145568, now seen corresponding path program 1 times [2022-12-06 07:26:02,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:02,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105492825] [2022-12-06 07:26:02,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:02,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:02,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-06 07:26:02,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:02,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105492825] [2022-12-06 07:26:02,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105492825] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:02,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:02,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:02,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372664484] [2022-12-06 07:26:02,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:02,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:02,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:02,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:02,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:02,173 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:02,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:02,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:02,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:02,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:02,210 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:02,210 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:02,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 349 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:02,211 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:02,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:02,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:02,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:02,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:02,211 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:02,211 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:02,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:02,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:02,212 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:02,212 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:02,213 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:02,213 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:02,213 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:02,213 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:02,213 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:02,213 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:02,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:02,215 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:02,215 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:02,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:02,216 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:02,216 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:02,288 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:02,289 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:02,289 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:02,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:02,289 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:02,289 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:02,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165 [2022-12-06 07:26:02,289 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-06 07:26:02,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:02,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1835927677, now seen corresponding path program 1 times [2022-12-06 07:26:02,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:02,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921674459] [2022-12-06 07:26:02,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:02,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:02,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-06 07:26:02,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:02,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921674459] [2022-12-06 07:26:02,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921674459] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:02,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:02,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:02,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12667086] [2022-12-06 07:26:02,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:02,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:02,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:02,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:02,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:02,385 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:02,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:02,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:02,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:02,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:02,435 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:02,435 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:02,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:02,436 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:02,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:02,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:02,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:02,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:02,437 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:02,437 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:02,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:02,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:02,438 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:02,438 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:02,439 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:02,439 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:02,439 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:02,439 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:02,439 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:02,439 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:02,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:02,442 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:02,443 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:02,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:02,443 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:02,443 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:02,519 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:02,520 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:26:02,520 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:02,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:02,520 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:02,520 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:02,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable166 [2022-12-06 07:26:02,521 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-06 07:26:02,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:02,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1866403870, now seen corresponding path program 1 times [2022-12-06 07:26:02,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:02,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420588406] [2022-12-06 07:26:02,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:02,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:02,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-06 07:26:02,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:02,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420588406] [2022-12-06 07:26:02,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420588406] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:02,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:02,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:02,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140364629] [2022-12-06 07:26:02,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:02,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:02,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:02,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:02,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:02,600 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:02,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:02,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:02,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:02,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:02,651 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:02,651 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:02,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:02,652 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:02,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:02,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:02,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:02,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:02,653 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:02,653 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:02,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:02,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:02,654 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:02,654 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:02,654 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:02,654 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:02,654 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:02,655 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:02,655 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:02,655 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:02,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:02,658 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:02,658 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:02,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:02,658 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:02,658 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:02,732 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:02,733 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:26:02,733 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:02,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:02,733 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:02,733 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:02,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable167 [2022-12-06 07:26:02,735 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-06 07:26:02,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:02,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1893185979, now seen corresponding path program 1 times [2022-12-06 07:26:02,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:02,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538115279] [2022-12-06 07:26:02,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:02,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:02,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-06 07:26:02,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:02,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538115279] [2022-12-06 07:26:02,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538115279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:02,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:02,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:02,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037426231] [2022-12-06 07:26:02,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:02,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:02,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:02,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:02,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:02,802 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:02,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:02,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:02,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:02,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:02,843 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:02,844 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:02,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:02,844 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:02,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:02,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:02,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:02,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:02,845 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:02,845 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:02,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:02,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:02,846 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:02,846 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:02,847 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:02,847 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:02,847 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:02,847 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:02,847 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:02,847 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:02,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:02,850 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:02,850 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:02,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:02,851 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:02,851 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:02,938 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:02,938 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-06 07:26:02,938 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:02,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:02,939 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:02,939 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:02,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable168 [2022-12-06 07:26:02,939 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-06 07:26:02,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:02,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1923662172, now seen corresponding path program 1 times [2022-12-06 07:26:02,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:02,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485725208] [2022-12-06 07:26:02,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:02,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:03,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-06 07:26:03,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:03,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485725208] [2022-12-06 07:26:03,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485725208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:03,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:03,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:03,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159801908] [2022-12-06 07:26:03,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:03,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:03,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:03,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:03,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:03,004 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:03,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:03,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:03,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:03,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:03,055 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:03,055 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:03,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:03,056 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:03,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:03,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:03,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:03,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:03,056 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:03,056 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:03,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:03,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:03,057 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:03,058 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:03,058 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:03,058 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:03,058 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:03,058 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:03,058 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:03,058 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:03,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:03,062 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:03,062 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:03,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:03,062 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:03,062 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:03,138 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:03,138 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:26:03,138 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:03,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:03,139 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:03,139 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:03,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable169 [2022-12-06 07:26:03,139 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-06 07:26:03,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:03,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1950444281, now seen corresponding path program 1 times [2022-12-06 07:26:03,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:03,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779159552] [2022-12-06 07:26:03,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:03,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:03,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:03,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:03,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779159552] [2022-12-06 07:26:03,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779159552] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:03,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:03,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:03,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980559282] [2022-12-06 07:26:03,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:03,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:03,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:03,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:03,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:03,214 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:03,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:03,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:03,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:03,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:03,263 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:03,263 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:03,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:03,264 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:03,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:03,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:03,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:03,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:03,265 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:03,265 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:03,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:03,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:03,266 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:03,266 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:03,266 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:03,266 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:03,266 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:03,269 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:03,269 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:03,269 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:03,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:03,273 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:03,273 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:03,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:03,273 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:03,273 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:03,347 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:03,348 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:26:03,348 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:03,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:03,348 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:03,348 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:03,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170 [2022-12-06 07:26:03,348 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-06 07:26:03,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:03,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1980920474, now seen corresponding path program 1 times [2022-12-06 07:26:03,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:03,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489246800] [2022-12-06 07:26:03,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:03,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26: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-06 07:26:03,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:03,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489246800] [2022-12-06 07:26:03,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489246800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:03,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:03,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:03,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797623147] [2022-12-06 07:26:03,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:03,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:03,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:03,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:03,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:03,415 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:03,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:03,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:03,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:03,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:03,456 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:03,456 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:03,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:03,456 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:03,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:03,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:03,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:03,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:03,457 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:03,457 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:03,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:03,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:03,458 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:03,459 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:03,459 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:03,459 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:03,459 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:03,459 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:03,459 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:03,459 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:03,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:03,462 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:03,462 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:03,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:03,462 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:03,462 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:03,536 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:03,536 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:03,536 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:03,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:03,537 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:03,537 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:03,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable171 [2022-12-06 07:26:03,537 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-06 07:26:03,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:03,537 INFO L85 PathProgramCache]: Analyzing trace with hash 2007702583, now seen corresponding path program 1 times [2022-12-06 07:26:03,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:03,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269355098] [2022-12-06 07:26:03,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:03,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:03,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-06 07:26:03,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:03,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269355098] [2022-12-06 07:26:03,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269355098] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:03,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:03,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:03,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385388317] [2022-12-06 07:26:03,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:03,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:03,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:03,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:03,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:03,601 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:03,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:03,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:03,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:03,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:03,642 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:03,642 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:03,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:03,642 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:03,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:03,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:03,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:03,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:03,643 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:03,643 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:03,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:03,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:03,644 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:03,644 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:03,644 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:03,644 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:03,644 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:03,644 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:03,645 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:03,645 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:03,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:03,647 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:03,647 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:03,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:03,647 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:03,647 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:03,724 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:03,724 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:26:03,724 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:03,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:03,724 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:03,724 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:03,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable172 [2022-12-06 07:26:03,724 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-06 07:26:03,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:03,725 INFO L85 PathProgramCache]: Analyzing trace with hash 2038178776, now seen corresponding path program 1 times [2022-12-06 07:26:03,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:03,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60516805] [2022-12-06 07:26:03,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:03,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:03,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:03,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:03,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60516805] [2022-12-06 07:26:03,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60516805] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:03,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:03,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:03,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626841364] [2022-12-06 07:26:03,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:03,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:03,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:03,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:03,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:03,798 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:03,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:03,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:03,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:03,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:03,848 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:03,848 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:03,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:03,849 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:03,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:03,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:03,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:03,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:03,849 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:03,849 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:03,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:03,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:03,850 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:03,850 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:03,850 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:03,850 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:03,850 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:03,851 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:03,851 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:03,851 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:03,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:03,853 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:03,853 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:03,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:03,853 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:03,853 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:03,927 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:03,927 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:03,927 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:03,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:03,927 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:03,927 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:03,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173 [2022-12-06 07:26:03,928 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-06 07:26:03,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:03,928 INFO L85 PathProgramCache]: Analyzing trace with hash 2064960885, now seen corresponding path program 1 times [2022-12-06 07:26:03,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:03,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029101519] [2022-12-06 07:26:03,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:03,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:03,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:04,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-06 07:26:04,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:04,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029101519] [2022-12-06 07:26:04,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029101519] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:04,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:04,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:04,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214546332] [2022-12-06 07:26:04,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:04,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:04,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:04,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:04,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:04,005 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:04,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:04,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:04,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:04,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:04,046 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:04,047 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:04,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:04,047 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:04,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:04,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:04,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:04,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:04,048 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:04,048 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:04,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:04,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:04,049 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:04,049 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:04,049 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:04,049 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:04,049 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:04,049 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:04,049 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:04,050 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:04,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:04,052 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:04,052 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:04,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:04,052 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:04,053 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:04,144 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:04,145 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:26:04,145 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:04,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:04,145 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:04,145 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:04,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable174 [2022-12-06 07:26:04,145 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-06 07:26:04,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:04,145 INFO L85 PathProgramCache]: Analyzing trace with hash 2095437078, now seen corresponding path program 1 times [2022-12-06 07:26:04,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:04,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157655879] [2022-12-06 07:26:04,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:04,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:04,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-06 07:26:04,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:04,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157655879] [2022-12-06 07:26:04,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157655879] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:04,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:04,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:04,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522487578] [2022-12-06 07:26:04,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:04,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:04,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:04,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:04,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:04,206 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:04,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:04,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:04,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:04,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:04,265 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:04,265 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:04,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:04,266 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:04,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:04,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:04,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:04,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:04,267 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:04,267 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:04,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:04,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:04,268 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:04,268 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:04,268 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:04,269 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:04,269 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:04,269 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:04,269 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:04,269 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:04,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:04,272 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:04,272 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:04,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:04,273 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:04,273 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:04,360 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:04,361 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-06 07:26:04,361 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:04,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:04,361 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:04,361 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:04,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable175 [2022-12-06 07:26:04,361 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-06 07:26:04,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:04,361 INFO L85 PathProgramCache]: Analyzing trace with hash 2122219187, now seen corresponding path program 1 times [2022-12-06 07:26:04,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:04,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492851682] [2022-12-06 07:26:04,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:04,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:04,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-06 07:26:04,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:04,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492851682] [2022-12-06 07:26:04,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492851682] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:04,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:04,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:04,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55189202] [2022-12-06 07:26:04,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:04,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:04,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:04,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:04,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:04,431 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:04,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:04,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:04,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:04,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:04,471 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:04,471 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:04,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:04,472 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:04,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:04,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:04,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:04,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:04,472 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:04,472 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:04,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:04,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:04,473 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:04,473 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:04,473 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:04,473 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:04,474 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:04,474 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:04,474 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:04,474 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:04,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:04,477 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:04,477 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:04,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:04,478 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:04,478 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:04,554 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:04,555 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:26:04,555 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:04,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:04,555 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:04,555 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:04,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable176 [2022-12-06 07:26:04,555 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-06 07:26:04,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:04,555 INFO L85 PathProgramCache]: Analyzing trace with hash -2142271916, now seen corresponding path program 1 times [2022-12-06 07:26:04,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:04,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006876740] [2022-12-06 07:26:04,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:04,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:04,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-06 07:26:04,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:04,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006876740] [2022-12-06 07:26:04,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006876740] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:04,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:04,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:04,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719853611] [2022-12-06 07:26:04,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:04,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:04,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:04,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:04,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:04,622 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:04,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:04,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:04,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:04,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:04,667 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:04,667 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:04,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:04,668 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:04,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:04,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:04,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:04,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:04,669 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:04,669 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:04,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:04,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:04,670 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:04,670 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:04,670 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:04,670 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:04,670 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:04,670 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:04,671 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:04,671 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:04,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:04,674 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:04,674 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:04,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:04,674 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:04,675 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:04,748 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:04,748 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:26:04,748 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:04,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:04,748 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:04,748 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:04,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable177 [2022-12-06 07:26:04,748 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-06 07:26:04,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:04,749 INFO L85 PathProgramCache]: Analyzing trace with hash -2115489807, now seen corresponding path program 1 times [2022-12-06 07:26:04,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:04,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588789982] [2022-12-06 07:26:04,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:04,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:04,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-06 07:26:04,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:04,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588789982] [2022-12-06 07:26:04,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588789982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:04,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:04,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:04,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905963797] [2022-12-06 07:26:04,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:04,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:04,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:04,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:04,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:04,819 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:04,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:04,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:04,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:04,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:04,861 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:04,861 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:04,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:04,861 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:04,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:04,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:04,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:04,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:04,862 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:04,862 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:04,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:04,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:04,863 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:04,863 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:04,863 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:04,863 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:04,864 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:04,864 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:04,864 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:04,864 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:04,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:04,867 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:04,867 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:04,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:04,868 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:04,868 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:04,955 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:04,956 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-06 07:26:04,956 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:04,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:04,956 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:04,956 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:04,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable178 [2022-12-06 07:26:04,956 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-06 07:26:04,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:04,957 INFO L85 PathProgramCache]: Analyzing trace with hash -2085013614, now seen corresponding path program 1 times [2022-12-06 07:26:04,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:04,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23512028] [2022-12-06 07:26:04,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:04,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:05,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-06 07:26:05,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:05,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23512028] [2022-12-06 07:26:05,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23512028] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:05,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:05,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:05,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674101972] [2022-12-06 07:26:05,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:05,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:05,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:05,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:05,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:05,034 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:05,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:05,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:05,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:05,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:05,081 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:05,081 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:05,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:05,082 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:05,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:05,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:05,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:05,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:05,083 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:05,083 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:05,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:05,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:05,084 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:05,084 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:05,084 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:05,084 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:05,084 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:05,085 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:05,085 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:05,085 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:05,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:05,088 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:05,088 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:05,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:05,088 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:05,089 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:05,163 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:05,164 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:26:05,164 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:05,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:05,164 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:05,164 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:05,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable179 [2022-12-06 07:26:05,164 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-06 07:26:05,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:05,165 INFO L85 PathProgramCache]: Analyzing trace with hash -2058231505, now seen corresponding path program 1 times [2022-12-06 07:26:05,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:05,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44663305] [2022-12-06 07:26:05,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:05,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:05,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-06 07:26:05,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:05,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44663305] [2022-12-06 07:26:05,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44663305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:05,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:05,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:05,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960307746] [2022-12-06 07:26:05,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:05,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:05,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:05,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:05,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:05,226 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:05,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:05,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:05,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:05,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:05,269 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:05,269 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:05,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:05,269 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:05,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:05,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:05,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:05,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:05,271 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:05,271 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:05,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:05,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:05,272 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:05,272 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:05,272 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:05,272 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:05,272 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:05,273 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:05,273 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:05,273 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:05,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:05,275 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:05,275 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:05,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:05,276 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:05,276 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:05,348 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:05,348 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:05,348 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:05,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:05,348 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:05,348 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:05,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable180 [2022-12-06 07:26:05,349 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-06 07:26:05,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:05,349 INFO L85 PathProgramCache]: Analyzing trace with hash -2027755312, now seen corresponding path program 1 times [2022-12-06 07:26:05,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:05,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005996630] [2022-12-06 07:26:05,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:05,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:05,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-06 07:26:05,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:05,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005996630] [2022-12-06 07:26:05,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005996630] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:05,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:05,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:05,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808152088] [2022-12-06 07:26:05,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:05,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:05,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:05,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:05,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:05,407 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:05,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:05,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:05,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:05,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:05,451 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:05,451 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:05,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:05,452 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:05,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:05,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:05,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:05,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:05,452 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:05,452 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:05,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:05,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:05,453 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:05,453 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:05,453 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:05,453 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:05,454 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:05,454 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:05,454 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:05,454 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:05,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:05,457 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:05,457 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:05,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:05,458 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:05,458 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:05,532 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:05,533 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:26:05,533 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:05,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:05,533 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:05,533 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:05,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable181 [2022-12-06 07:26:05,533 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-06 07:26:05,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:05,534 INFO L85 PathProgramCache]: Analyzing trace with hash -2000973203, now seen corresponding path program 1 times [2022-12-06 07:26:05,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:05,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746900138] [2022-12-06 07:26:05,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:05,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:05,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:05,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-06 07:26:05,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:05,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746900138] [2022-12-06 07:26:05,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746900138] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:05,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:05,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:05,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526959364] [2022-12-06 07:26:05,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:05,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:05,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:05,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:05,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:05,614 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:05,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:05,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:05,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:05,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:05,660 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:05,661 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:05,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:05,661 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:05,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:05,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:05,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:05,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:05,664 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:05,664 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:05,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:05,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:05,665 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:05,665 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:05,665 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:05,665 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:05,665 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:05,665 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:05,665 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:05,666 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:05,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:05,669 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:05,669 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:05,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:05,669 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:05,669 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:05,762 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:05,762 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 07:26:05,762 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:05,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:05,763 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:05,763 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:05,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable182 [2022-12-06 07:26:05,763 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-06 07:26:05,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:05,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1970497010, now seen corresponding path program 1 times [2022-12-06 07:26:05,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:05,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202651924] [2022-12-06 07:26:05,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:05,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:05,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-06 07:26:05,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:05,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202651924] [2022-12-06 07:26:05,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202651924] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:05,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:05,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:05,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244951676] [2022-12-06 07:26:05,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:05,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:05,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:05,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:05,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:05,844 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:05,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:05,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:05,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:05,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:05,892 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:05,892 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:05,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:05,893 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:05,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:05,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:05,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:05,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:05,894 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:05,894 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:05,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:05,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:05,895 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:05,895 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:05,895 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:05,895 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:05,895 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:05,895 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:05,895 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:05,896 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:05,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:05,898 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:05,899 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:05,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:05,899 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:05,899 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:05,993 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:05,994 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 07:26:05,994 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:05,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:05,994 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:05,994 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:05,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable183 [2022-12-06 07:26:05,994 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-06 07:26:05,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:05,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1943714901, now seen corresponding path program 1 times [2022-12-06 07:26:05,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:05,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857008229] [2022-12-06 07:26:05,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:05,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07: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-06 07:26:06,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:06,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857008229] [2022-12-06 07:26:06,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857008229] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:06,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:06,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:06,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164379128] [2022-12-06 07:26:06,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:06,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:06,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:06,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:06,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:06,071 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:06,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:06,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:06,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:06,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:06,126 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:06,127 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:06,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:06,127 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:06,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:06,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:06,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:06,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:06,128 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:06,128 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:06,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:06,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:06,129 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:06,129 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:06,130 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:06,130 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:06,130 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:06,130 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:06,130 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:06,130 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:06,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:06,133 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:06,133 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:06,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:06,134 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:06,134 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:06,228 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:06,229 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 07:26:06,229 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:06,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:06,229 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:06,229 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:06,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable184 [2022-12-06 07:26:06,229 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-06 07:26:06,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:06,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1913238708, now seen corresponding path program 1 times [2022-12-06 07:26:06,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:06,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292353264] [2022-12-06 07:26:06,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:06,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:06,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:06,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-06 07:26:06,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:06,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292353264] [2022-12-06 07:26:06,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292353264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:06,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:06,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:06,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253351282] [2022-12-06 07:26:06,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:06,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:06,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:06,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:06,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:06,312 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:06,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:06,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:06,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:06,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:06,363 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:06,363 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:06,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:06,364 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:06,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:06,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:06,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:06,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:06,365 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:06,365 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:06,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:06,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:06,366 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:06,366 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:06,366 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:06,366 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:06,367 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:06,367 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:06,367 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:06,367 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:06,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:06,370 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:06,370 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:06,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:06,371 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:06,371 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:06,459 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:06,459 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-06 07:26:06,459 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:06,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:06,460 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:06,460 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:06,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185 [2022-12-06 07:26:06,460 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-06 07:26:06,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:06,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1886456599, now seen corresponding path program 1 times [2022-12-06 07:26:06,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:06,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218482123] [2022-12-06 07:26:06,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:06,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:06,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-06 07:26:06,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:06,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218482123] [2022-12-06 07:26:06,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218482123] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:06,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:06,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:06,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404418475] [2022-12-06 07:26:06,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:06,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:06,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:06,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:06,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:06,521 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:06,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:06,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:06,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:06,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:06,558 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:06,558 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:06,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:06,559 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:06,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:06,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:06,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:06,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:06,559 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:06,559 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:06,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:06,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:06,560 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:06,560 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:06,560 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:06,561 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:06,561 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:06,561 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:06,561 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:06,561 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:06,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:06,563 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:06,563 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:06,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:06,564 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:06,564 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:06,648 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:06,648 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 07:26:06,648 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:06,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:06,649 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:06,649 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:06,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable186 [2022-12-06 07:26:06,649 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-06 07:26:06,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:06,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1855980406, now seen corresponding path program 1 times [2022-12-06 07:26:06,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:06,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783651472] [2022-12-06 07:26:06,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:06,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:06,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-06 07:26:06,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:06,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783651472] [2022-12-06 07:26:06,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783651472] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:06,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:06,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:06,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043276642] [2022-12-06 07:26:06,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:06,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:06,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:06,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:06,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:06,714 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:06,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:06,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:06,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:06,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:06,750 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:06,750 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:06,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:06,751 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:06,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:06,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:06,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:06,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:06,752 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:06,752 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:06,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:06,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:06,752 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:06,753 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:06,753 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:06,753 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:06,753 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:06,753 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:06,753 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:06,753 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:06,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:06,755 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:06,756 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:06,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:06,756 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:06,756 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:06,829 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:06,829 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:06,829 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:06,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:06,830 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:06,830 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:06,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable187 [2022-12-06 07:26:06,830 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-06 07:26:06,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:06,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1829198297, now seen corresponding path program 1 times [2022-12-06 07:26:06,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:06,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908956513] [2022-12-06 07:26:06,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:06,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:06,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:06,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-06 07:26:06,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:06,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908956513] [2022-12-06 07:26:06,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908956513] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:06,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:06,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:06,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700543591] [2022-12-06 07:26:06,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:06,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:06,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:06,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:06,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:06,890 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:06,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:06,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:06,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:06,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:06,938 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:06,938 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:06,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:06,939 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:06,939 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:06,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:06,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:06,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:06,940 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:06,940 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:06,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:06,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:06,941 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:06,941 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:06,941 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:06,941 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:06,941 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:06,941 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:06,942 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:06,942 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:06,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:06,944 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:06,944 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:06,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:06,944 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:06,944 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:07,018 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:07,018 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:07,018 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:07,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:07,018 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:07,018 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:07,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable188 [2022-12-06 07:26:07,019 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-06 07:26:07,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:07,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1798722104, now seen corresponding path program 1 times [2022-12-06 07:26:07,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:07,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255116497] [2022-12-06 07:26:07,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:07,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:07,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:07,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-06 07:26:07,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:07,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255116497] [2022-12-06 07:26:07,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255116497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:07,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:07,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:07,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139046409] [2022-12-06 07:26:07,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:07,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:07,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:07,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:07,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:07,080 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:07,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:07,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:07,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:07,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:07,123 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:07,123 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:07,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:07,124 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:07,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:07,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:07,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:07,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:07,125 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:07,125 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:07,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:07,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:07,126 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:07,126 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:07,126 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:07,126 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:07,126 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:07,126 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:07,126 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:07,126 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:07,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:07,129 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:07,129 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:07,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:07,129 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:07,129 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:07,204 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:07,204 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:26:07,204 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:07,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:07,205 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:07,205 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:07,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable189 [2022-12-06 07:26:07,205 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-06 07:26:07,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:07,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1771939995, now seen corresponding path program 1 times [2022-12-06 07:26:07,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:07,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943319975] [2022-12-06 07:26:07,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:07,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:07,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-06 07:26:07,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:07,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943319975] [2022-12-06 07:26:07,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943319975] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:07,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:07,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:07,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107867329] [2022-12-06 07:26:07,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:07,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:07,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:07,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:07,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:07,270 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:07,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:07,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:07,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:07,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:07,310 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:07,311 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:07,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 371 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:07,311 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:07,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:07,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:07,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:07,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:07,312 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:07,312 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:07,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:07,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:07,313 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:07,313 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:07,313 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:07,313 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:07,313 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:07,313 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:07,313 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:07,314 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:07,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:07,317 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:07,317 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:07,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:07,317 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:07,318 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:07,407 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:07,407 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 07:26:07,407 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:07,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:07,408 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:07,408 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:07,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable190 [2022-12-06 07:26:07,408 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-06 07:26:07,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:07,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1741463802, now seen corresponding path program 1 times [2022-12-06 07:26:07,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:07,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986232464] [2022-12-06 07:26:07,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:07,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:07,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:07,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-06 07:26:07,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:07,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986232464] [2022-12-06 07:26:07,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986232464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:07,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:07,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:07,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812952402] [2022-12-06 07:26:07,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:07,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:07,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:07,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:07,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:07,475 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:07,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:07,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:07,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:07,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:07,512 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:07,513 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:07,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 336 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:07,513 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:07,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:07,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:07,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:07,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:07,514 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:07,514 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:07,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:07,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:07,515 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:07,515 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:07,515 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:07,515 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:07,515 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:07,516 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:07,516 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:07,516 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:07,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:07,518 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:07,518 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:07,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:07,519 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:07,519 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:07,592 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:07,592 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:07,593 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:07,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:07,593 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:07,593 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:07,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191 [2022-12-06 07:26:07,593 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-06 07:26:07,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:07,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1714681693, now seen corresponding path program 1 times [2022-12-06 07:26:07,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:07,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001428024] [2022-12-06 07:26:07,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:07,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:07,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-06 07:26:07,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:07,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001428024] [2022-12-06 07:26:07,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001428024] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:07,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:07,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:07,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457961342] [2022-12-06 07:26:07,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:07,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:07,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:07,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:07,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:07,677 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:07,677 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:07,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:07,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:07,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:07,724 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:07,724 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:07,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:07,725 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:07,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:07,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:07,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:07,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:07,726 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:07,726 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:07,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:07,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:07,727 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:07,727 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:07,727 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:07,727 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:07,727 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:07,727 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:07,727 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:07,727 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:07,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:07,730 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:07,730 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:07,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:07,730 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:07,730 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:07,805 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:07,805 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:26:07,805 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:07,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:07,805 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:07,805 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:07,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable192 [2022-12-06 07:26:07,806 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-06 07:26:07,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:07,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1684205500, now seen corresponding path program 1 times [2022-12-06 07:26:07,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:07,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66340324] [2022-12-06 07:26:07,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:07,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:07,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-06 07:26:07,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:07,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66340324] [2022-12-06 07:26:07,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66340324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:07,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:07,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:07,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959664951] [2022-12-06 07:26:07,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:07,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:07,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:07,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:07,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:07,865 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:07,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:07,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:07,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:07,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:07,902 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:07,902 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:07,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:07,902 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:07,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:07,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:07,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:07,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:07,903 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:07,903 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:07,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:07,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:07,904 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:07,904 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:07,904 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:07,904 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:07,904 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:07,904 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:07,904 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:07,904 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:07,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:07,907 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:07,907 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:07,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:07,907 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:07,907 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:07,983 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:07,984 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:26:07,984 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:07,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:07,984 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:07,984 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:07,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable193 [2022-12-06 07:26:07,984 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-06 07:26:07,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:07,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1657423391, now seen corresponding path program 1 times [2022-12-06 07:26:07,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:07,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632775069] [2022-12-06 07:26:07,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:07,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:07,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:08,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:08,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:08,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632775069] [2022-12-06 07:26:08,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632775069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:08,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:08,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:08,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181089564] [2022-12-06 07:26:08,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:08,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:08,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:08,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:08,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:08,043 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:08,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:08,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:08,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:08,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:08,079 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:08,079 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:08,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:08,080 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:08,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:08,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:08,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:08,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:08,080 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:08,080 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:08,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:08,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:08,081 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:08,081 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:08,081 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:08,081 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:08,082 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:08,082 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:08,082 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:08,082 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:08,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:08,085 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:08,085 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:08,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:08,086 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:08,086 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:08,160 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:08,161 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:26:08,161 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:08,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:08,161 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:08,161 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:08,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable194 [2022-12-06 07:26:08,161 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-06 07:26:08,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:08,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1626947198, now seen corresponding path program 1 times [2022-12-06 07:26:08,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:08,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884840452] [2022-12-06 07:26:08,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:08,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:08,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:08,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:08,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884840452] [2022-12-06 07:26:08,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884840452] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:08,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:08,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:08,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738959903] [2022-12-06 07:26:08,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:08,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:08,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:08,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:08,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:08,226 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:08,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:08,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:08,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:08,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:08,262 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:08,262 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:08,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:08,263 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:08,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:08,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:08,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:08,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:08,263 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:08,263 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:08,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:08,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:08,264 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:08,264 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:08,264 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:08,264 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:08,264 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:08,264 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:08,265 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:08,265 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:08,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:08,267 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:08,267 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:08,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:08,267 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:08,267 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:08,342 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:08,342 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:26:08,342 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:08,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:08,342 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:08,342 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:08,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable195 [2022-12-06 07:26:08,342 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-06 07:26:08,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:08,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1600165089, now seen corresponding path program 1 times [2022-12-06 07:26:08,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:08,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609943850] [2022-12-06 07:26:08,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:08,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:08,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:08,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-06 07:26:08,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:08,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609943850] [2022-12-06 07:26:08,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609943850] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:08,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:08,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:08,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887028054] [2022-12-06 07:26:08,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:08,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:08,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:08,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:08,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:08,405 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:08,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:08,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:08,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:08,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:08,444 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:08,444 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:08,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:08,445 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:08,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:08,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:08,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:08,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:08,445 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:08,446 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:08,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:08,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:08,446 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:08,446 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:08,447 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:08,447 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:08,447 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:08,447 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:08,447 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:08,447 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:08,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:08,449 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:08,449 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:08,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:08,449 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:08,450 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:08,522 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:08,522 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:26:08,522 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:08,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:08,523 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:08,523 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:08,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable196 [2022-12-06 07:26:08,523 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-06 07:26:08,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:08,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1569688896, now seen corresponding path program 1 times [2022-12-06 07:26:08,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:08,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801862825] [2022-12-06 07:26:08,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:08,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26: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-06 07:26:08,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:08,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801862825] [2022-12-06 07:26:08,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801862825] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:08,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:08,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:08,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231375509] [2022-12-06 07:26:08,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:08,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:08,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:08,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:08,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:08,597 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:08,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:08,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:08,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:08,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:08,641 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:08,641 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:08,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:08,642 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:08,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:08,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:08,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:08,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:08,643 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:08,643 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:08,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:08,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:08,644 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:08,644 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:08,644 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:08,644 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:08,644 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:08,644 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:08,644 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:08,645 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:08,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:08,648 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:08,648 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:08,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:08,648 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:08,648 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:08,741 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:08,742 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 07:26:08,742 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:08,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:08,742 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:08,742 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:08,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable197 [2022-12-06 07:26:08,742 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-06 07:26:08,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:08,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1542906787, now seen corresponding path program 1 times [2022-12-06 07:26:08,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:08,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898781775] [2022-12-06 07:26:08,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:08,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:08,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-06 07:26:08,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:08,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898781775] [2022-12-06 07:26:08,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898781775] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:08,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:08,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:08,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497560229] [2022-12-06 07:26:08,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:08,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:08,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:08,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:08,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:08,814 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:08,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:08,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:08,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:08,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:08,857 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:08,857 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:08,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:08,858 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:08,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:08,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:08,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:08,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:08,864 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:08,864 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:08,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:08,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:08,865 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:08,865 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:08,866 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:08,866 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:08,866 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:08,866 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:08,866 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:08,866 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:08,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:08,870 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:08,870 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:08,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:08,870 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:08,870 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:08,964 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:08,965 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 07:26:08,965 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:08,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:08,965 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:08,966 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:08,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable198 [2022-12-06 07:26:08,966 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-06 07:26:08,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:08,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1512430594, now seen corresponding path program 1 times [2022-12-06 07:26:08,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:08,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838803747] [2022-12-06 07:26:08,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:08,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:09,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:09,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:09,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838803747] [2022-12-06 07:26:09,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838803747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:09,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:09,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:09,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741782446] [2022-12-06 07:26:09,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:09,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:09,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:09,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:09,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:09,057 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:09,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:09,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:09,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:09,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:09,102 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:09,102 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:09,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:09,103 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:09,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:09,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:09,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:09,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:09,104 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:09,104 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:09,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:09,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:09,105 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:09,105 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:09,105 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:09,105 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:09,105 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:09,106 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:09,106 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:09,106 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:09,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:09,109 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:09,109 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:09,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:09,109 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:09,110 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:09,192 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:09,193 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 07:26:09,193 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:09,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:09,193 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:09,193 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:09,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable199 [2022-12-06 07:26:09,193 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-06 07:26:09,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:09,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1485648485, now seen corresponding path program 1 times [2022-12-06 07:26:09,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:09,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917556512] [2022-12-06 07:26:09,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:09,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:09,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-06 07:26:09,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:09,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917556512] [2022-12-06 07:26:09,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917556512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:09,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:09,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:09,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999956317] [2022-12-06 07:26:09,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:09,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:09,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:09,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:09,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:09,252 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:09,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:09,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:09,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:09,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:09,294 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:09,294 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:09,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:09,295 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:09,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:09,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:09,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:09,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:09,295 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:09,295 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:09,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:09,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:09,296 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:09,296 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:09,296 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:09,296 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:09,297 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:09,297 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:09,297 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:09,297 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:09,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:09,299 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:09,299 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:09,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:09,300 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:09,300 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:09,376 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:09,376 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:26:09,376 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:09,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:09,376 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:09,376 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:09,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable200 [2022-12-06 07:26:09,376 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-06 07:26:09,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:09,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1455172292, now seen corresponding path program 1 times [2022-12-06 07:26:09,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:09,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893466793] [2022-12-06 07:26:09,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:09,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:09,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-06 07:26:09,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:09,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893466793] [2022-12-06 07:26:09,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893466793] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:09,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:09,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:09,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834174255] [2022-12-06 07:26:09,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:09,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:09,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:09,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:09,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:09,436 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:09,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:09,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:09,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:09,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:09,475 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:09,475 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:09,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:09,475 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:09,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:09,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:09,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:09,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:09,476 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:09,476 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:09,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:09,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:09,477 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:09,477 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:09,477 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:09,477 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:09,477 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:09,477 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:09,477 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:09,477 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:09,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:09,480 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:09,480 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:09,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:09,480 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:09,480 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:09,555 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:09,556 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:26:09,556 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:09,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:09,556 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:09,556 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:09,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable201 [2022-12-06 07:26:09,556 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-06 07:26:09,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:09,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1428390183, now seen corresponding path program 1 times [2022-12-06 07:26:09,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:09,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988740759] [2022-12-06 07:26:09,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:09,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:09,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-06 07:26:09,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:09,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988740759] [2022-12-06 07:26:09,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988740759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:09,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:09,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:09,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479724317] [2022-12-06 07:26:09,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:09,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:09,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:09,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:09,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:09,645 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:09,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:09,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:09,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:09,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:09,682 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:09,682 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:09,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:09,683 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:09,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:09,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:09,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:09,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:09,683 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:09,683 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:09,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:09,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:09,684 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:09,684 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:09,684 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:09,684 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:09,684 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:09,685 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:09,685 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:09,685 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:09,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:09,687 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:09,687 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:09,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:09,688 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:09,688 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:09,760 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:09,761 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:09,761 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:09,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:09,761 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:09,761 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:09,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable202 [2022-12-06 07:26:09,761 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-06 07:26:09,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:09,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1397913990, now seen corresponding path program 1 times [2022-12-06 07:26:09,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:09,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313050512] [2022-12-06 07:26:09,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:09,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:09,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:09,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-06 07:26:09,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:09,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313050512] [2022-12-06 07:26:09,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313050512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:09,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:09,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:09,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721966602] [2022-12-06 07:26:09,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:09,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:09,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:09,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:09,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:09,833 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:09,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:09,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:09,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:09,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:09,879 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:09,879 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:09,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:09,879 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:09,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:09,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:09,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:09,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:09,880 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:09,880 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:09,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:09,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:09,881 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:09,881 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:09,881 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:09,881 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:09,881 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:09,881 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:09,881 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:09,881 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:09,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:09,884 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:09,884 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:09,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:09,884 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:09,884 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:09,959 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:09,960 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:26:09,960 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:09,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:09,960 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:09,960 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:09,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable203 [2022-12-06 07:26:09,961 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-06 07:26:09,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:09,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1371131881, now seen corresponding path program 1 times [2022-12-06 07:26:09,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:09,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193628707] [2022-12-06 07:26:09,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:09,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:10,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-06 07:26:10,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:10,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193628707] [2022-12-06 07:26:10,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193628707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:10,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:10,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:10,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838503921] [2022-12-06 07:26:10,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:10,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:10,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:10,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:10,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:10,039 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:10,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:10,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:10,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:10,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:10,089 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:10,089 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:10,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:10,090 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:10,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:10,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:10,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:10,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:10,091 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:10,091 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:10,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:10,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:10,092 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:10,092 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:10,092 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:10,092 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:10,092 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:10,092 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:10,092 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:10,093 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:10,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:10,095 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:10,096 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:10,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:10,096 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:10,096 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:10,188 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:10,188 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:26:10,188 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:10,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:10,188 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:10,189 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:10,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable204 [2022-12-06 07:26:10,189 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-06 07:26:10,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:10,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1340655688, now seen corresponding path program 1 times [2022-12-06 07:26:10,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:10,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045181955] [2022-12-06 07:26:10,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:10,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:10,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:10,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-06 07:26:10,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:10,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045181955] [2022-12-06 07:26:10,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045181955] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:10,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:10,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:10,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028614813] [2022-12-06 07:26:10,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:10,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:10,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:10,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:10,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:10,265 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:10,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:10,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:10,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:10,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:10,319 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:10,319 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:10,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:10,320 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:10,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:10,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:10,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:10,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:10,320 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:10,320 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:10,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:10,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:10,325 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:10,326 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:10,326 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:10,326 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:10,326 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:10,326 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:10,326 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:10,326 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:10,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:10,329 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:10,329 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:10,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:10,330 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:10,330 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:10,420 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:10,420 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 07:26:10,420 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:10,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:10,420 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:10,420 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:10,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable205 [2022-12-06 07:26:10,421 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-06 07:26:10,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:10,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1313873579, now seen corresponding path program 1 times [2022-12-06 07:26:10,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:10,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689008040] [2022-12-06 07:26:10,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:10,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26: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-06 07:26:10,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:10,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689008040] [2022-12-06 07:26:10,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689008040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:10,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:10,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:10,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238360036] [2022-12-06 07:26:10,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:10,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:10,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:10,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:10,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:10,498 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:10,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:10,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:10,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:10,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:10,544 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:10,544 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:10,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:10,545 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:10,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:10,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:10,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:10,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:10,545 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:10,545 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:10,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:10,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:10,547 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:10,547 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:10,547 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:10,547 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:10,547 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:10,547 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:10,547 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:10,548 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:10,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:10,551 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:10,551 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:10,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:10,551 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:10,551 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:10,642 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:10,643 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:26:10,643 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:10,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:10,643 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:10,643 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:10,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable206 [2022-12-06 07:26:10,644 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-06 07:26:10,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:10,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1283397386, now seen corresponding path program 1 times [2022-12-06 07:26:10,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:10,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444597192] [2022-12-06 07:26:10,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:10,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:10,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:10,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-06 07:26:10,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:10,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444597192] [2022-12-06 07:26:10,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444597192] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:10,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:10,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:10,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583608119] [2022-12-06 07:26:10,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:10,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:10,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:10,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:10,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:10,717 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:10,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:10,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:10,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:10,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:10,772 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:10,773 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:10,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:10,773 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:10,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:10,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:10,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:10,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:10,774 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:10,774 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:10,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:10,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:10,775 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:10,775 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:10,775 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:10,775 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:10,775 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:10,775 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:10,776 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:10,776 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:10,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:10,779 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:10,779 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:10,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:10,779 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:10,779 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:10,852 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:10,853 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:26:10,853 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:10,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:10,853 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:10,853 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:10,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable207 [2022-12-06 07:26:10,853 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-06 07:26:10,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:10,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1256615277, now seen corresponding path program 1 times [2022-12-06 07:26:10,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:10,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780780134] [2022-12-06 07:26:10,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:10,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:10,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-06 07:26:10,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:10,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780780134] [2022-12-06 07:26:10,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780780134] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:10,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:10,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:10,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767523997] [2022-12-06 07:26:10,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:10,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:10,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:10,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:10,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:10,920 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:10,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:10,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:10,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:10,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:10,982 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:10,983 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:10,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:10,983 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:10,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:10,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:10,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:10,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:10,984 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:10,984 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:10,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:10,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:10,985 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:10,986 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:10,986 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:10,986 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:10,986 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:10,986 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:10,986 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:10,986 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:10,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:10,990 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:10,990 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:10,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:10,990 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:10,990 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:11,065 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:11,065 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:26:11,065 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:11,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:11,066 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:11,066 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:11,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable208 [2022-12-06 07:26:11,066 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-06 07:26:11,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:11,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1226139084, now seen corresponding path program 1 times [2022-12-06 07:26:11,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:11,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625038497] [2022-12-06 07:26:11,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:11,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26: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-06 07:26:11,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:11,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625038497] [2022-12-06 07:26:11,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625038497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:11,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:11,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:11,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698521335] [2022-12-06 07:26:11,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:11,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:11,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:11,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:11,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:11,139 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:11,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:11,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:11,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:11,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:11,181 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:11,181 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:11,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:11,182 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:11,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:11,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:11,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:11,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:11,182 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:11,182 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:11,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:11,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:11,183 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:11,184 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:11,184 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:11,184 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:11,184 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:11,184 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:11,184 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:11,184 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:11,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:11,188 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:11,188 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:11,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:11,188 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:11,188 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:11,262 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:11,263 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:26:11,263 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:11,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:11,263 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:11,263 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:11,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable209 [2022-12-06 07:26:11,263 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-06 07:26:11,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:11,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1199356975, now seen corresponding path program 1 times [2022-12-06 07:26:11,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:11,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691603985] [2022-12-06 07:26:11,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:11,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:11,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-06 07:26:11,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:11,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691603985] [2022-12-06 07:26:11,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691603985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:11,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:11,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:11,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199021910] [2022-12-06 07:26:11,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:11,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:11,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:11,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:11,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:11,328 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:11,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:11,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:11,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:11,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:11,367 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:11,368 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:11,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:11,368 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:11,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:11,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:11,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:11,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:11,369 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:11,369 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:11,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:11,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:11,370 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:11,370 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:11,370 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:11,370 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:11,370 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:11,370 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:11,371 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:11,371 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:11,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:11,374 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:11,374 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:11,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:11,375 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:11,375 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:11,452 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:11,452 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:26:11,452 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:11,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:11,452 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:11,452 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:11,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable210 [2022-12-06 07:26:11,452 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-06 07:26:11,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:11,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1168880782, now seen corresponding path program 1 times [2022-12-06 07:26:11,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:11,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470558501] [2022-12-06 07:26:11,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:11,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:11,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:11,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-06 07:26:11,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:11,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470558501] [2022-12-06 07:26:11,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470558501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:11,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:11,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:11,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507232082] [2022-12-06 07:26:11,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:11,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:11,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:11,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:11,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:11,514 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:11,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:11,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:11,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:11,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:11,551 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:11,551 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:11,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:11,551 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:11,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:11,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:11,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:11,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:11,552 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:11,552 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:11,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:11,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:11,553 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:11,553 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:11,553 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:11,553 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:11,553 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:11,553 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:11,553 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:11,553 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:11,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:11,556 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:11,556 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:11,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:11,556 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:11,556 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:11,634 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:11,635 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:26:11,635 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:11,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:11,635 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:11,635 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:11,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable211 [2022-12-06 07:26:11,635 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-06 07:26:11,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:11,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1142098673, now seen corresponding path program 1 times [2022-12-06 07:26:11,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:11,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158027232] [2022-12-06 07:26:11,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:11,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:11,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-06 07:26:11,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:11,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158027232] [2022-12-06 07:26:11,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158027232] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:11,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:11,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:11,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752180145] [2022-12-06 07:26:11,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:11,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:11,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:11,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:11,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:11,697 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:11,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:11,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:11,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:11,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:11,733 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:11,733 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:11,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 370 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:11,734 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:11,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:11,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:11,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:11,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:11,735 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:11,735 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:11,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:11,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:11,736 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:11,736 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:11,737 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:11,737 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:11,737 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:11,737 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:11,737 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:11,737 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:11,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:11,741 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:11,741 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:11,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:11,741 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:11,741 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:11,833 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:11,833 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:26:11,834 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:11,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:11,834 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:11,834 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:11,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable212 [2022-12-06 07:26:11,834 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-06 07:26:11,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:11,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1111622480, now seen corresponding path program 1 times [2022-12-06 07:26:11,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:11,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872325337] [2022-12-06 07:26:11,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:11,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:11,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-06 07:26:11,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:11,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872325337] [2022-12-06 07:26:11,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872325337] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:11,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:11,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:11,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308840963] [2022-12-06 07:26:11,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:11,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:11,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:11,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:11,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:11,908 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:11,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:11,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:11,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:11,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:11,956 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:11,956 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:11,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:11,957 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:11,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:11,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:11,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:11,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:11,958 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:11,958 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:11,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:11,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:11,959 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:11,959 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:11,959 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:11,959 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:11,959 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:11,959 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:11,960 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:11,960 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:11,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:11,963 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:11,963 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:11,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:11,963 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:11,963 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:12,055 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:12,056 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 07:26:12,056 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:12,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:12,056 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:12,056 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:12,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable213 [2022-12-06 07:26:12,056 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-06 07:26:12,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:12,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1084840371, now seen corresponding path program 1 times [2022-12-06 07:26:12,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:12,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715285311] [2022-12-06 07:26:12,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:12,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:12,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-06 07:26:12,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:12,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715285311] [2022-12-06 07:26:12,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715285311] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:12,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:12,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:12,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515635824] [2022-12-06 07:26:12,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:12,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:12,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:12,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:12,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:12,136 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:12,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:12,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:12,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:12,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:12,184 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:12,184 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:12,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:12,185 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:12,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:12,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:12,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:12,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:12,186 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:12,186 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:12,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:12,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:12,186 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:12,186 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:12,187 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:12,187 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:12,187 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:12,187 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:12,187 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:12,187 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:12,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:12,189 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:12,189 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:12,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:12,190 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:12,190 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:12,264 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:12,264 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:12,264 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:12,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:12,265 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:12,265 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:12,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable214 [2022-12-06 07:26:12,265 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-06 07:26:12,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:12,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1054364178, now seen corresponding path program 1 times [2022-12-06 07:26:12,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:12,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110664572] [2022-12-06 07:26:12,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:12,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:12,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:12,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:12,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110664572] [2022-12-06 07:26:12,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110664572] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:12,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:12,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:12,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410141374] [2022-12-06 07:26:12,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:12,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:12,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:12,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:12,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:12,321 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:12,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:12,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:12,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:12,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:12,357 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:12,357 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:12,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:12,358 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:12,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:12,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:12,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:12,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:12,359 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:12,359 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:12,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:12,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:12,359 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:12,360 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:12,360 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:12,360 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:12,360 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:12,360 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:12,360 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:12,360 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:12,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:12,363 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:12,363 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:12,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:12,363 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:12,363 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:12,438 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:12,438 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:26:12,438 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:12,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:12,438 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:12,439 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:12,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable215 [2022-12-06 07:26:12,439 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-06 07:26:12,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:12,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1027582069, now seen corresponding path program 1 times [2022-12-06 07:26:12,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:12,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428396247] [2022-12-06 07:26:12,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:12,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:12,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-06 07:26:12,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:12,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428396247] [2022-12-06 07:26:12,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428396247] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:12,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:12,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:12,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691316335] [2022-12-06 07:26:12,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:12,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:12,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:12,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:12,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:12,519 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:12,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:12,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:12,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:12,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:12,563 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:12,563 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:12,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:12,564 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:12,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:12,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:12,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:12,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:12,564 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:12,564 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:12,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:12,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:12,565 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:12,565 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:12,565 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:12,565 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:12,565 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:12,566 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:12,566 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:12,566 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:12,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:12,568 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:12,568 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:12,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:12,569 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:12,569 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:12,642 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:12,642 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:12,642 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:12,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:12,643 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:12,643 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:12,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable216 [2022-12-06 07:26:12,643 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-06 07:26:12,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:12,643 INFO L85 PathProgramCache]: Analyzing trace with hash -997105876, now seen corresponding path program 1 times [2022-12-06 07:26:12,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:12,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698304276] [2022-12-06 07:26:12,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:12,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:12,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-06 07:26:12,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:12,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698304276] [2022-12-06 07:26:12,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698304276] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:12,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:12,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:12,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101338830] [2022-12-06 07:26:12,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:12,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:12,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:12,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:12,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:12,724 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:12,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:12,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:12,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:12,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:12,767 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:12,767 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:12,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:12,768 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:12,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:12,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:12,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:12,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:12,768 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:12,768 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:12,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:12,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:12,769 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:12,769 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:12,769 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:12,769 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:12,769 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:12,770 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:12,770 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:12,770 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:12,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:12,772 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:12,772 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:12,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:12,772 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:12,772 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:12,846 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:12,846 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:12,846 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:12,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:12,846 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:12,846 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:12,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable217 [2022-12-06 07:26:12,846 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-06 07:26:12,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:12,847 INFO L85 PathProgramCache]: Analyzing trace with hash -970323767, now seen corresponding path program 1 times [2022-12-06 07:26:12,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:12,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796290903] [2022-12-06 07:26:12,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:12,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:12,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-06 07:26:12,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:12,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796290903] [2022-12-06 07:26:12,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796290903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:12,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:12,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:12,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339657598] [2022-12-06 07:26:12,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:12,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:12,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:12,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:12,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:12,917 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:12,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:12,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:12,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:12,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:12,963 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:12,963 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:12,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:12,963 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:12,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:12,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:12,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:12,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:12,964 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:12,964 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:12,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:12,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:12,965 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:12,965 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:12,965 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:12,965 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:12,965 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:12,965 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:12,965 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:12,965 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:12,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:12,968 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:12,968 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:12,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:12,968 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:12,968 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:13,041 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:13,042 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:13,042 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:13,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:13,042 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:13,042 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:13,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable218 [2022-12-06 07:26:13,042 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-06 07:26:13,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:13,043 INFO L85 PathProgramCache]: Analyzing trace with hash -939847574, now seen corresponding path program 1 times [2022-12-06 07:26:13,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:13,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137826153] [2022-12-06 07:26:13,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:13,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:13,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-06 07:26:13,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:13,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137826153] [2022-12-06 07:26:13,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137826153] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:13,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:13,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:13,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643152] [2022-12-06 07:26:13,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:13,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:13,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:13,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:13,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:13,098 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:13,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:13,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:13,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:13,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:13,147 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:13,148 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:13,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:13,148 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:13,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:13,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:13,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:13,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:13,149 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:13,149 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:13,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:13,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:13,150 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:13,150 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:13,150 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:13,150 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:13,150 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:13,150 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:13,150 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:13,150 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:13,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:13,153 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:13,153 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:13,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:13,153 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:13,153 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:13,228 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:13,228 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:26:13,228 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:13,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:13,228 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:13,228 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:13,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable219 [2022-12-06 07:26:13,229 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-06 07:26:13,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:13,229 INFO L85 PathProgramCache]: Analyzing trace with hash -913065465, now seen corresponding path program 1 times [2022-12-06 07:26:13,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:13,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200968484] [2022-12-06 07:26:13,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:13,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:13,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:13,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:13,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:13,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200968484] [2022-12-06 07:26:13,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200968484] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:13,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:13,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:13,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846160189] [2022-12-06 07:26:13,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:13,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:13,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:13,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:13,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:13,299 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:13,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:13,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:13,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:13,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:13,341 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:13,341 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:13,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:13,342 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:13,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:13,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:13,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:13,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:13,343 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:13,343 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:13,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:13,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:13,344 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:13,344 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:13,344 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:13,344 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:13,344 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:13,345 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:13,345 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:13,345 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:13,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:13,348 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:13,348 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:13,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:13,349 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:13,349 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:13,423 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:13,423 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:26:13,423 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:13,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:13,423 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:13,424 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:13,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable220 [2022-12-06 07:26:13,424 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-06 07:26:13,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:13,424 INFO L85 PathProgramCache]: Analyzing trace with hash -882589272, now seen corresponding path program 1 times [2022-12-06 07:26:13,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:13,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460407654] [2022-12-06 07:26:13,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:13,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:13,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-06 07:26:13,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:13,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460407654] [2022-12-06 07:26:13,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460407654] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:13,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:13,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:13,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650696259] [2022-12-06 07:26:13,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:13,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:13,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:13,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:13,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:13,494 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:13,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:13,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:13,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:13,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:13,540 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:13,540 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:13,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:13,541 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:13,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:13,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:13,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:13,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:13,542 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:13,542 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:13,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:13,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:13,543 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:13,543 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:13,543 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:13,543 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:13,543 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:13,543 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:13,543 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:13,544 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:13,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:13,547 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:13,547 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:13,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 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 116. Up to 16 conditions per place. [2022-12-06 07:26:13,547 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:13,547 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:13,640 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:13,640 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 07:26:13,640 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:13,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:13,640 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:13,640 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:13,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable221 [2022-12-06 07:26:13,641 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-06 07:26:13,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:13,641 INFO L85 PathProgramCache]: Analyzing trace with hash -855807163, now seen corresponding path program 1 times [2022-12-06 07:26:13,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:13,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196603610] [2022-12-06 07:26:13,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:13,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:13,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-06 07:26:13,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:13,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196603610] [2022-12-06 07:26:13,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196603610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:13,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:13,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:13,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33827585] [2022-12-06 07:26:13,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:13,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:13,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:13,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:13,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:13,719 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:13,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:13,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:13,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:13,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:13,764 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:13,765 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:13,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:13,765 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:13,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:13,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:13,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:13,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:13,766 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:13,766 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:13,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:13,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:13,767 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:13,767 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:13,768 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:13,768 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:13,768 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:13,768 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:13,768 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:13,768 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:13,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:13,771 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:13,771 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:13,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:13,772 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:13,772 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:13,847 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:13,847 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:26:13,847 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:13,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:13,848 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:13,848 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:13,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable222 [2022-12-06 07:26:13,848 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-06 07:26:13,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:13,848 INFO L85 PathProgramCache]: Analyzing trace with hash -825330970, now seen corresponding path program 1 times [2022-12-06 07:26:13,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:13,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412328439] [2022-12-06 07:26:13,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:13,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:13,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-06 07:26:13,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:13,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412328439] [2022-12-06 07:26:13,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412328439] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:13,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:13,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:13,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412293840] [2022-12-06 07:26:13,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:13,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:13,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:13,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:13,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:13,912 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:13,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:13,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:13,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:13,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:13,969 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:13,970 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:13,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:13,970 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:13,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:13,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:13,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:13,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:13,971 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:13,971 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:13,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:13,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:13,972 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:13,972 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:13,973 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:13,973 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:13,973 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:13,973 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:13,973 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:13,973 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:13,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:13,976 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:13,976 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:13,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:13,977 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:13,977 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:14,052 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:14,052 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:26:14,052 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:14,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:14,053 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:14,053 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:14,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable223 [2022-12-06 07:26:14,053 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-06 07:26:14,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:14,053 INFO L85 PathProgramCache]: Analyzing trace with hash -798548861, now seen corresponding path program 1 times [2022-12-06 07:26:14,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:14,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488414294] [2022-12-06 07:26:14,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:14,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:14,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-06 07:26:14,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:14,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488414294] [2022-12-06 07:26:14,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488414294] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:14,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:14,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:14,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861220578] [2022-12-06 07:26:14,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:14,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:14,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:14,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:14,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:14,125 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:14,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:14,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:14,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:14,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:14,171 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:14,172 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:14,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:14,172 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:14,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:14,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:14,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:14,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:14,173 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:14,173 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:14,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:14,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:14,174 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:14,174 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:14,174 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:14,174 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:14,174 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:14,174 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:14,174 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:14,174 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:14,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:14,177 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:14,177 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:14,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:14,177 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:14,177 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:14,250 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:14,250 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:14,250 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:14,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:14,250 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:14,250 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:14,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable224 [2022-12-06 07:26:14,250 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-06 07:26:14,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:14,251 INFO L85 PathProgramCache]: Analyzing trace with hash -768072668, now seen corresponding path program 1 times [2022-12-06 07:26:14,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:14,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248695139] [2022-12-06 07:26:14,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:14,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:14,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-06 07:26:14,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:14,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248695139] [2022-12-06 07:26:14,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248695139] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:14,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:14,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:14,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281166623] [2022-12-06 07:26:14,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:14,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:14,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:14,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:14,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:14,330 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:14,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:14,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:14,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:14,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:14,387 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:14,387 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:14,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:14,388 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:14,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:14,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:14,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:14,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:14,388 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:14,389 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:14,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:14,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:14,389 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:14,389 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:14,390 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:14,390 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:14,390 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:14,390 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:14,390 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:14,390 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:14,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:14,393 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:14,394 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:14,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:14,394 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:14,394 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:14,467 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:14,468 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:26:14,468 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:14,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:14,468 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:14,468 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:14,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable225 [2022-12-06 07:26:14,468 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-06 07:26:14,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:14,468 INFO L85 PathProgramCache]: Analyzing trace with hash -741290559, now seen corresponding path program 1 times [2022-12-06 07:26:14,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:14,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128266360] [2022-12-06 07:26:14,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:14,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:14,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-06 07:26:14,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:14,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128266360] [2022-12-06 07:26:14,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128266360] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:14,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:14,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:14,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142696461] [2022-12-06 07:26:14,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:14,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:14,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:14,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:14,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:14,557 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:14,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:14,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:14,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:14,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:14,603 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:14,603 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:14,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:14,604 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:14,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:14,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:14,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:14,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:14,605 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:14,605 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:14,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:14,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:14,606 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:14,606 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:14,606 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:14,606 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:14,606 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:14,607 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:14,607 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:14,607 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:14,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:14,610 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:14,610 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:14,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:14,610 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:14,611 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:14,703 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:14,704 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 07:26:14,704 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:14,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:14,704 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:14,704 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:14,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable226 [2022-12-06 07:26:14,705 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-06 07:26:14,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:14,705 INFO L85 PathProgramCache]: Analyzing trace with hash -710814366, now seen corresponding path program 1 times [2022-12-06 07:26:14,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:14,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774235064] [2022-12-06 07:26:14,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:14,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:14,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-06 07:26:14,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:14,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774235064] [2022-12-06 07:26:14,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774235064] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:14,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:14,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:14,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795214635] [2022-12-06 07:26:14,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:14,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:14,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:14,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:14,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:14,777 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:14,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:14,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:14,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:14,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:14,835 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:14,835 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:14,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 336 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:14,836 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:14,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:14,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:14,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:14,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:14,836 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:14,836 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:14,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:14,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:14,838 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:14,838 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:14,838 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:14,838 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:14,838 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:14,838 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:14,838 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:14,839 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:14,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:14,841 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:14,842 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:14,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:14,842 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:14,842 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:14,927 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:14,928 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-06 07:26:14,928 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:14,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:14,928 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:14,928 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:14,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable227 [2022-12-06 07:26:14,928 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-06 07:26:14,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:14,929 INFO L85 PathProgramCache]: Analyzing trace with hash -684032257, now seen corresponding path program 1 times [2022-12-06 07:26:14,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:14,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782508677] [2022-12-06 07:26:14,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:14,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:14,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-06 07:26:14,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:14,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782508677] [2022-12-06 07:26:14,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782508677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:14,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:14,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:14,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781782191] [2022-12-06 07:26:14,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:14,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:14,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:14,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:14,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:14,993 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:14,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:14,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:14,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:14,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:15,034 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:15,034 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:15,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:15,035 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:15,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:15,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:15,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:15,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:15,036 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:15,036 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:15,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:15,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:15,036 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:15,037 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:15,037 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:15,037 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:15,037 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:15,037 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:15,037 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:15,037 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:15,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:15,040 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:15,040 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:15,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:15,040 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:15,040 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:15,117 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:15,117 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:26:15,117 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:15,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:15,118 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:15,118 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:15,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable228 [2022-12-06 07:26:15,118 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-06 07:26:15,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:15,118 INFO L85 PathProgramCache]: Analyzing trace with hash -653556064, now seen corresponding path program 1 times [2022-12-06 07:26:15,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:15,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373065747] [2022-12-06 07:26:15,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:15,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:15,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-06 07:26:15,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:15,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373065747] [2022-12-06 07:26:15,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373065747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:15,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:15,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:15,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743715669] [2022-12-06 07:26:15,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:15,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:15,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:15,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:15,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:15,185 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:15,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:15,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:15,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:15,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:15,246 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:15,247 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:15,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:15,248 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:15,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:15,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:15,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:15,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:15,248 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:15,249 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:15,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:15,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:15,250 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:15,250 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:15,250 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:15,250 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:15,250 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:15,250 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:15,250 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:15,251 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:15,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:15,254 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:15,254 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:15,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:15,254 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:15,254 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:15,345 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:15,346 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:26:15,346 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:15,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:15,346 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:15,346 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:15,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable229 [2022-12-06 07:26:15,346 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-06 07:26:15,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:15,347 INFO L85 PathProgramCache]: Analyzing trace with hash -626773955, now seen corresponding path program 1 times [2022-12-06 07:26:15,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:15,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904221015] [2022-12-06 07:26:15,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:15,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:15,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-06 07:26:15,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:15,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904221015] [2022-12-06 07:26:15,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904221015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:15,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:15,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:15,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769091891] [2022-12-06 07:26:15,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:15,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:15,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:15,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:15,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:15,425 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:15,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:15,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:15,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:15,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:15,463 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:15,463 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:15,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:15,464 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:15,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:15,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:15,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:15,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:15,467 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:15,468 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:15,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:15,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:15,469 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:15,469 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:15,469 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:15,469 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:15,469 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:15,469 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:15,469 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:15,470 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:15,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:15,473 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:15,473 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:15,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:15,473 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:15,473 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:15,547 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:15,548 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:26:15,548 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:15,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:15,548 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:15,548 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:15,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable230 [2022-12-06 07:26:15,548 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-06 07:26:15,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:15,548 INFO L85 PathProgramCache]: Analyzing trace with hash -596297762, now seen corresponding path program 1 times [2022-12-06 07:26:15,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:15,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232593477] [2022-12-06 07:26:15,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:15,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:15,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-06 07:26:15,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:15,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232593477] [2022-12-06 07:26:15,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232593477] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:15,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:15,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:15,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962030690] [2022-12-06 07:26:15,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:15,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:15,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:15,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:15,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:15,604 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:15,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:15,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:15,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:15,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:15,641 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:15,641 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:15,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:15,642 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:15,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:15,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:15,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:15,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:15,642 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:15,642 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:15,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:15,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:15,643 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:15,643 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:15,643 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:15,643 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:15,644 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:15,644 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:15,644 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:15,644 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:15,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:15,646 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:15,647 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:15,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:15,647 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:15,647 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:15,742 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:15,742 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 07:26:15,742 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:15,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:15,743 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:15,743 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:15,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable231 [2022-12-06 07:26:15,743 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-06 07:26:15,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:15,743 INFO L85 PathProgramCache]: Analyzing trace with hash -569515653, now seen corresponding path program 1 times [2022-12-06 07:26:15,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:15,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083924744] [2022-12-06 07:26:15,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:15,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:15,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-06 07:26:15,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:15,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083924744] [2022-12-06 07:26:15,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083924744] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:15,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:15,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:15,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806451173] [2022-12-06 07:26:15,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:15,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:15,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:15,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:15,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:15,812 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:15,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:15,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:15,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:15,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:15,851 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:15,851 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:15,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:15,852 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:15,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:15,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:15,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:15,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:15,852 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:15,852 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:15,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:15,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:15,853 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:15,853 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:15,854 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:15,854 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:15,854 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:15,854 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:15,854 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:15,854 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:15,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:15,856 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:15,856 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:15,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:15,857 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:15,857 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:15,930 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:15,931 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:15,931 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:15,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:15,931 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:15,931 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:15,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable232 [2022-12-06 07:26:15,931 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-06 07:26:15,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:15,931 INFO L85 PathProgramCache]: Analyzing trace with hash -539039460, now seen corresponding path program 1 times [2022-12-06 07:26:15,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:15,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383024354] [2022-12-06 07:26:15,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:15,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:15,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-06 07:26:15,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:15,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383024354] [2022-12-06 07:26:15,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383024354] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:15,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:15,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:15,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109044092] [2022-12-06 07:26:15,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:15,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:15,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:15,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:15,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:15,992 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:15,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:15,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:15,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:15,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:16,028 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:16,028 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:16,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:16,029 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:16,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:16,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:16,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:16,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:16,030 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:16,030 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:16,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:16,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:16,031 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:16,031 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:16,031 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:16,031 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:16,031 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:16,031 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:16,031 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:16,031 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:16,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:16,034 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:16,034 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:16,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:16,034 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:16,034 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:16,109 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:16,109 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:26:16,109 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:16,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:16,110 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:16,110 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:16,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable233 [2022-12-06 07:26:16,110 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-06 07:26:16,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:16,110 INFO L85 PathProgramCache]: Analyzing trace with hash -512257351, now seen corresponding path program 1 times [2022-12-06 07:26:16,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:16,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873722741] [2022-12-06 07:26:16,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:16,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:16,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-06 07:26:16,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:16,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873722741] [2022-12-06 07:26:16,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873722741] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:16,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:16,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:16,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399878866] [2022-12-06 07:26:16,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:16,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:16,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:16,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:16,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:16,173 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:16,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:16,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:16,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:16,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:16,215 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:16,215 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:16,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:16,216 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:16,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:16,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:16,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:16,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:16,217 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:16,217 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:16,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:16,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:16,217 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:16,218 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:16,218 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:16,218 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:16,218 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:16,218 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:16,218 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:16,218 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:16,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:16,221 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:16,221 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:16,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:16,221 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:16,221 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:16,296 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:16,297 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:26:16,297 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:16,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:16,297 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:16,297 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:16,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable234 [2022-12-06 07:26:16,297 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-06 07:26:16,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:16,298 INFO L85 PathProgramCache]: Analyzing trace with hash -481781158, now seen corresponding path program 1 times [2022-12-06 07:26:16,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:16,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307474996] [2022-12-06 07:26:16,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:16,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:16,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-06 07:26:16,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:16,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307474996] [2022-12-06 07:26:16,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307474996] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:16,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:16,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:16,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446254720] [2022-12-06 07:26:16,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:16,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:16,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:16,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:16,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:16,356 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:16,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:16,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:16,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:16,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:16,398 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:16,398 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:16,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:16,399 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:16,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:16,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:16,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:16,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:16,399 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:16,399 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:16,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:16,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:16,400 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:16,400 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:16,400 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:16,400 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:16,400 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:16,401 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:16,401 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:16,401 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:16,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:16,403 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:16,403 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:16,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:16,403 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:16,403 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:16,477 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:16,478 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:26:16,478 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:16,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:16,478 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:16,478 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:16,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable235 [2022-12-06 07:26:16,478 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-06 07:26:16,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:16,478 INFO L85 PathProgramCache]: Analyzing trace with hash -454999049, now seen corresponding path program 1 times [2022-12-06 07:26:16,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:16,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126534018] [2022-12-06 07:26:16,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:16,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:16,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-06 07:26:16,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:16,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126534018] [2022-12-06 07:26:16,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126534018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:16,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:16,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:16,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189783462] [2022-12-06 07:26:16,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:16,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:16,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:16,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:16,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:16,542 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:16,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:16,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:16,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:16,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:16,587 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:16,587 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:16,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:16,588 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:16,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:16,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:16,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:16,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:16,589 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:16,589 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:16,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:16,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:16,589 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:16,589 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:16,590 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:16,590 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:16,590 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:16,590 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:16,590 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:16,590 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:16,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:16,592 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:16,592 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:16,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:16,593 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:16,593 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:16,676 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:16,677 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 07:26:16,677 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:16,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:16,677 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:16,677 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:16,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable236 [2022-12-06 07:26:16,677 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-06 07:26:16,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:16,677 INFO L85 PathProgramCache]: Analyzing trace with hash -424522856, now seen corresponding path program 1 times [2022-12-06 07:26:16,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:16,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102130793] [2022-12-06 07:26:16,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:16,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:16,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-06 07:26:16,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:16,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102130793] [2022-12-06 07:26:16,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102130793] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:16,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:16,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:16,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500611892] [2022-12-06 07:26:16,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:16,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:16,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:16,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:16,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:16,735 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:16,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:16,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:16,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:16,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:16,780 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:16,780 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:16,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:16,781 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:16,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:16,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:16,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:16,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:16,781 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:16,782 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:16,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:16,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:16,782 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:16,782 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:16,783 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:16,783 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:16,783 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:16,783 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:16,783 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:16,783 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:16,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:16,785 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:16,785 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:16,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:16,786 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:16,786 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:16,863 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:16,863 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:26:16,863 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:16,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:16,863 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:16,863 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:16,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable237 [2022-12-06 07:26:16,864 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-06 07:26:16,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:16,864 INFO L85 PathProgramCache]: Analyzing trace with hash -397740747, now seen corresponding path program 1 times [2022-12-06 07:26:16,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:16,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973977129] [2022-12-06 07:26:16,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:16,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:16,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:16,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-06 07:26:16,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:16,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973977129] [2022-12-06 07:26:16,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973977129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:16,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:16,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:16,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174346721] [2022-12-06 07:26:16,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:16,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:16,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:16,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:16,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:16,927 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:16,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:16,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:16,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:16,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:16,968 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:16,968 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:16,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:16,968 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:16,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:16,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:16,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:16,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:16,970 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:16,970 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:16,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:16,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:16,971 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:16,971 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:16,971 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:16,971 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:16,971 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:16,971 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:16,971 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:16,971 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:16,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:16,974 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:16,974 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:16,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:16,974 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:16,974 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:17,046 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:17,047 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:17,047 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:17,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:17,047 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:17,047 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:17,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable238 [2022-12-06 07:26:17,047 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-06 07:26:17,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:17,048 INFO L85 PathProgramCache]: Analyzing trace with hash -367264554, now seen corresponding path program 1 times [2022-12-06 07:26:17,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:17,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284482172] [2022-12-06 07:26:17,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:17,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:17,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-06 07:26:17,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:17,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284482172] [2022-12-06 07:26:17,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284482172] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:17,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:17,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:17,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622569984] [2022-12-06 07:26:17,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:17,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:17,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:17,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:17,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:17,103 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:17,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:17,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:17,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:17,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:17,140 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:17,140 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:17,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:17,141 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:17,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:17,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:17,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:17,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:17,141 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:17,142 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:17,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:17,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:17,142 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:17,142 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:17,143 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:17,143 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:17,143 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:17,143 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:17,143 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:17,143 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:17,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:17,145 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:17,145 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:17,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:17,146 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:17,146 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:17,218 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:17,218 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:26:17,218 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:17,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:17,218 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:17,218 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:17,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable239 [2022-12-06 07:26:17,219 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-06 07:26:17,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:17,219 INFO L85 PathProgramCache]: Analyzing trace with hash -340482445, now seen corresponding path program 1 times [2022-12-06 07:26:17,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:17,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110129412] [2022-12-06 07:26:17,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:17,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:17,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-06 07:26:17,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:17,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110129412] [2022-12-06 07:26:17,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110129412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:17,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:17,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:17,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577949737] [2022-12-06 07:26:17,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:17,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:17,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:17,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:17,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:17,279 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:17,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:17,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:17,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:17,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:17,315 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:17,315 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:17,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:17,315 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:17,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:17,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:17,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:17,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:17,316 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:17,316 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:17,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:17,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:17,317 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:17,317 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:17,317 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:17,317 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:17,317 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:17,317 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:17,317 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:17,318 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:17,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:17,325 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:17,325 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:17,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:17,326 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:17,326 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:17,400 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:17,400 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 07:26:17,400 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:17,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:17,400 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:17,401 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:17,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable240 [2022-12-06 07:26:17,401 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-06 07:26:17,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:17,401 INFO L85 PathProgramCache]: Analyzing trace with hash -310006252, now seen corresponding path program 1 times [2022-12-06 07:26:17,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:17,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558868208] [2022-12-06 07:26:17,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:17,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:17,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:17,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-06 07:26:17,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:17,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558868208] [2022-12-06 07:26:17,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558868208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:17,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:17,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:17,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927513807] [2022-12-06 07:26:17,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:17,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:17,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:17,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:17,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:17,475 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:17,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:17,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:17,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:17,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:17,523 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:17,523 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:17,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:17,524 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:17,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:17,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:17,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:17,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:17,524 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:17,525 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:17,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:17,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:17,526 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:17,526 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:17,527 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:17,527 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:17,527 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:17,527 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:17,527 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:17,528 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:17,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:17,531 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:17,531 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:17,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:17,532 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:17,532 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:17,619 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:17,620 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-06 07:26:17,620 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:17,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:17,620 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:17,620 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:17,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable241 [2022-12-06 07:26:17,620 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-06 07:26:17,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:17,620 INFO L85 PathProgramCache]: Analyzing trace with hash -283224143, now seen corresponding path program 1 times [2022-12-06 07:26:17,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:17,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678368438] [2022-12-06 07:26:17,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:17,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:17,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-06 07:26:17,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:17,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678368438] [2022-12-06 07:26:17,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678368438] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:17,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:17,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:17,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167252874] [2022-12-06 07:26:17,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:17,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:17,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:17,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:17,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:17,697 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:17,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:17,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:17,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:17,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:17,740 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:17,740 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:17,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:17,741 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:17,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:17,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:17,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:17,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:17,742 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:17,742 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:17,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:17,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:17,743 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:17,743 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:17,743 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:17,743 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:17,743 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:17,744 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:17,744 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:17,744 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:17,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:17,747 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:17,747 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:17,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:17,747 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:17,747 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:17,832 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:17,832 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 07:26:17,832 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:17,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:17,832 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:17,832 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:17,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable242 [2022-12-06 07:26:17,833 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-06 07:26:17,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:17,833 INFO L85 PathProgramCache]: Analyzing trace with hash -252747950, now seen corresponding path program 1 times [2022-12-06 07:26:17,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:17,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336815162] [2022-12-06 07:26:17,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:17,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26: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-06 07:26:17,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:17,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336815162] [2022-12-06 07:26:17,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336815162] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:17,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:17,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:17,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668241323] [2022-12-06 07:26:17,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:17,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:17,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:17,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:17,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:17,900 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:17,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:17,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:17,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:17,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:17,942 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:17,942 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:17,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:17,943 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:17,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:17,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:17,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:17,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:17,943 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:17,944 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:17,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:17,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:17,944 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:17,944 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:17,944 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:17,945 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:17,945 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:17,945 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:17,945 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:17,945 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:17,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:17,947 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:17,947 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:17,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:17,948 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:17,948 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:18,038 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:18,039 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 07:26:18,039 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:18,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:18,039 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:18,039 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:18,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable243 [2022-12-06 07:26:18,039 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-06 07:26:18,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:18,040 INFO L85 PathProgramCache]: Analyzing trace with hash -225965841, now seen corresponding path program 1 times [2022-12-06 07:26:18,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:18,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273301676] [2022-12-06 07:26:18,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:18,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:18,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-06 07:26:18,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:18,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273301676] [2022-12-06 07:26:18,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273301676] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:18,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:18,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:18,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773779400] [2022-12-06 07:26:18,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:18,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:18,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:18,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:18,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:18,099 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:18,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:18,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:18,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:18,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:18,137 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:18,137 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:18,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:18,137 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:18,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:18,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:18,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:18,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:18,138 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:18,138 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:18,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:18,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:18,139 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:18,139 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:18,139 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:18,139 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:18,139 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:18,140 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:18,140 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:18,140 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:18,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:18,143 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:18,143 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:18,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:18,143 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:18,143 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:18,218 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:18,218 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:26:18,218 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:18,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:18,218 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:18,218 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:18,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable244 [2022-12-06 07:26:18,219 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-06 07:26:18,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:18,219 INFO L85 PathProgramCache]: Analyzing trace with hash -195489648, now seen corresponding path program 1 times [2022-12-06 07:26:18,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:18,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456182456] [2022-12-06 07:26:18,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:18,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:18,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-06 07:26:18,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:18,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456182456] [2022-12-06 07:26:18,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456182456] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:18,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:18,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:18,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579453086] [2022-12-06 07:26:18,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:18,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:18,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:18,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:18,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:18,283 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:18,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:18,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:18,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:18,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:18,326 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:18,326 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:18,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:18,326 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:18,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:18,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:18,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:18,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:18,327 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:18,327 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:18,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:18,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:18,328 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:18,328 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:18,328 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:18,328 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:18,328 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:18,329 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:18,329 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:18,329 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:18,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:18,331 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:18,331 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:18,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:18,332 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:18,332 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:18,405 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:18,405 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:18,405 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:18,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:18,405 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:18,406 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:18,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable245 [2022-12-06 07:26:18,406 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-06 07:26:18,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:18,406 INFO L85 PathProgramCache]: Analyzing trace with hash -168707539, now seen corresponding path program 1 times [2022-12-06 07:26:18,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:18,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111662083] [2022-12-06 07:26:18,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:18,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:18,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-06 07:26:18,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:18,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111662083] [2022-12-06 07:26:18,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111662083] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:18,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:18,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:18,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592462522] [2022-12-06 07:26:18,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:18,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:18,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:18,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:18,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:18,472 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:18,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:18,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:18,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:18,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:18,509 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:18,509 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:18,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:18,509 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:18,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:18,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:18,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:18,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:18,510 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:18,510 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:18,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:18,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:18,511 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:18,511 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:18,511 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:18,511 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:18,511 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:18,511 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:18,511 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:18,512 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:18,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:18,514 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:18,514 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:18,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:18,515 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:18,515 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:18,587 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:18,588 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:18,588 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:18,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:18,588 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:18,588 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:18,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable246 [2022-12-06 07:26:18,589 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-06 07:26:18,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:18,589 INFO L85 PathProgramCache]: Analyzing trace with hash -138231346, now seen corresponding path program 1 times [2022-12-06 07:26:18,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:18,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354006987] [2022-12-06 07:26:18,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:18,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:18,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-06 07:26:18,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:18,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354006987] [2022-12-06 07:26:18,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354006987] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:18,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:18,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:18,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562326755] [2022-12-06 07:26:18,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:18,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:18,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:18,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:18,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:18,646 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:18,646 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:18,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:18,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:18,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:18,684 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:18,684 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:18,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:18,685 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:18,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:18,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:18,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:18,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:18,685 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:18,685 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:18,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:18,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:18,686 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:18,686 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:18,686 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:18,686 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:18,686 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:18,687 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:18,687 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:18,687 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:18,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:18,689 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:18,689 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:18,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:18,689 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:18,689 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:18,762 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:18,763 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:18,763 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:18,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:18,763 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:18,763 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:18,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable247 [2022-12-06 07:26:18,763 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-06 07:26:18,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:18,764 INFO L85 PathProgramCache]: Analyzing trace with hash -111449237, now seen corresponding path program 1 times [2022-12-06 07:26:18,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:18,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920202124] [2022-12-06 07:26:18,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:18,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:18,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-06 07:26:18,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:18,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920202124] [2022-12-06 07:26:18,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920202124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:18,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:18,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:18,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543312859] [2022-12-06 07:26:18,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:18,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:18,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:18,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:18,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:18,823 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:18,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:18,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:18,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:18,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:18,860 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:18,860 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:18,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:18,861 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:18,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:18,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:18,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:18,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:18,861 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:18,861 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:18,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:18,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:18,862 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:18,862 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:18,862 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:18,863 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:18,863 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:18,863 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:18,863 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:18,863 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:18,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:18,865 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:18,866 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:18,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:18,866 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:18,866 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:18,941 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:18,941 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:26:18,942 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:18,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:18,942 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:18,942 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:18,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable248 [2022-12-06 07:26:18,942 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-06 07:26:18,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:18,942 INFO L85 PathProgramCache]: Analyzing trace with hash -80973044, now seen corresponding path program 1 times [2022-12-06 07:26:18,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:18,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083130645] [2022-12-06 07:26:18,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:18,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:19,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-06 07:26:19,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:19,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083130645] [2022-12-06 07:26:19,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083130645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:19,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:19,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:19,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653502288] [2022-12-06 07:26:19,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:19,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:19,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:19,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:19,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:19,010 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:19,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:19,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:19,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:19,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:19,046 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:19,047 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:19,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:19,047 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:19,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:19,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:19,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:19,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:19,048 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:19,048 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:19,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:19,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:19,049 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:19,049 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:19,049 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:19,049 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:19,049 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:19,050 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:19,050 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:19,050 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:19,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:19,053 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:19,053 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:19,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:19,053 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:19,053 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:19,126 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:19,127 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:26:19,127 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:19,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:19,127 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:19,127 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:19,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable249 [2022-12-06 07:26:19,127 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-06 07:26:19,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:19,128 INFO L85 PathProgramCache]: Analyzing trace with hash -54190935, now seen corresponding path program 1 times [2022-12-06 07:26:19,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:19,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490712636] [2022-12-06 07:26:19,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:19,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:19,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-06 07:26:19,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:19,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490712636] [2022-12-06 07:26:19,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490712636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:19,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:19,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:19,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295901826] [2022-12-06 07:26:19,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:19,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:19,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:19,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:19,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:19,190 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:19,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:19,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:19,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:19,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:19,233 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:19,233 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:19,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:19,234 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:19,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:19,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:19,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:19,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:19,234 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:19,234 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:19,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:19,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:19,235 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:19,236 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:19,236 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:19,236 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:19,236 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:19,236 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:19,236 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:19,236 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:19,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:19,239 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:19,239 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:19,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:19,239 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:19,239 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:19,314 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:19,314 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:26:19,315 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:19,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:19,315 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:19,315 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:19,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable250 [2022-12-06 07:26:19,315 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-06 07:26:19,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:19,315 INFO L85 PathProgramCache]: Analyzing trace with hash -23714742, now seen corresponding path program 1 times [2022-12-06 07:26:19,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:19,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568486939] [2022-12-06 07:26:19,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:19,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:19,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:19,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-06 07:26:19,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:19,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568486939] [2022-12-06 07:26:19,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568486939] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:19,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:19,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:19,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116932911] [2022-12-06 07:26:19,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:19,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:19,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:19,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:19,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:19,372 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:19,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:19,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:19,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:19,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:19,409 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:19,410 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:19,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:19,410 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:19,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:19,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:19,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:19,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:19,411 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:19,411 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:19,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:19,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:19,412 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:19,412 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:19,412 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:19,412 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:19,412 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:19,412 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:19,412 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:19,412 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:19,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:19,415 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:19,415 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:19,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:19,415 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:19,415 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:19,489 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:19,489 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:19,490 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:19,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:19,490 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:19,490 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:19,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable251 [2022-12-06 07:26:19,490 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-06 07:26:19,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:19,490 INFO L85 PathProgramCache]: Analyzing trace with hash 3067367, now seen corresponding path program 1 times [2022-12-06 07:26:19,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:19,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727893326] [2022-12-06 07:26:19,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:19,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:19,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:19,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:19,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727893326] [2022-12-06 07:26:19,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727893326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:19,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:19,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:19,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808169283] [2022-12-06 07:26:19,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:19,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:19,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:19,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:19,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:19,559 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:19,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:19,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:19,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:19,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:19,598 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:19,598 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:19,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:19,599 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:19,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:19,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:19,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:19,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:19,600 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:19,600 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:19,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:19,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:19,601 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:19,601 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:19,601 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:19,601 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:19,601 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:19,601 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:19,601 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:19,601 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:19,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:19,604 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:19,604 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:19,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:19,604 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:19,604 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:19,678 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:19,678 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:19,679 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:19,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:19,679 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:19,679 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:19,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable252 [2022-12-06 07:26:19,679 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-06 07:26:19,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:19,679 INFO L85 PathProgramCache]: Analyzing trace with hash 33543560, now seen corresponding path program 1 times [2022-12-06 07:26:19,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:19,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254892975] [2022-12-06 07:26:19,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:19,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:19,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-06 07:26:19,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:19,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254892975] [2022-12-06 07:26:19,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254892975] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:19,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:19,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:19,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262465018] [2022-12-06 07:26:19,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:19,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:19,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:19,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:19,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:19,745 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:19,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:19,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:19,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:19,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:19,787 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:19,787 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:19,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:19,788 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:19,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:19,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:19,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:19,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:19,788 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:19,788 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:19,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:19,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:19,789 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:19,789 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:19,790 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:19,790 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:19,790 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:19,790 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:19,790 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:19,790 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:19,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:19,793 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:19,793 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:19,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:19,793 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:19,793 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:19,866 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:19,867 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:19,867 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:19,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:19,867 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:19,867 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:19,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable253 [2022-12-06 07:26:19,867 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-06 07:26:19,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:19,868 INFO L85 PathProgramCache]: Analyzing trace with hash 60325669, now seen corresponding path program 1 times [2022-12-06 07:26:19,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:19,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905138820] [2022-12-06 07:26:19,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:19,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:19,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-06 07:26:19,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:19,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905138820] [2022-12-06 07:26:19,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905138820] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:19,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:19,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:19,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308464280] [2022-12-06 07:26:19,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:19,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:19,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:19,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:19,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:19,933 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:19,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:19,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:19,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:19,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:19,976 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:19,976 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:19,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 355 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:19,977 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:19,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:19,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:19,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:19,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:19,978 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:19,978 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:19,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:19,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:19,979 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:19,979 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:19,979 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:19,980 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:19,980 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:19,980 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:19,980 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:19,980 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:19,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:19,983 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:19,983 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:19,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:19,984 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:19,984 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:20,058 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:20,059 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:26:20,059 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:20,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:20,059 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:20,059 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:20,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable254 [2022-12-06 07:26:20,060 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-06 07:26:20,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:20,060 INFO L85 PathProgramCache]: Analyzing trace with hash 90801862, now seen corresponding path program 1 times [2022-12-06 07:26:20,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:20,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965331307] [2022-12-06 07:26:20,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:20,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:20,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-06 07:26:20,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:20,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965331307] [2022-12-06 07:26:20,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965331307] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:20,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:20,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:20,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41122479] [2022-12-06 07:26:20,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:20,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:20,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:20,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:20,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:20,123 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:20,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:20,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:20,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:20,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:20,161 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:20,161 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:20,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:20,162 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:20,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:20,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:20,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:20,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:20,163 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:20,163 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:20,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:20,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:20,164 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:20,164 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:20,164 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:20,164 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:20,164 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:20,165 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:20,165 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:20,165 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:20,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:20,168 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:20,168 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:20,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:20,169 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:20,169 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:20,246 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:20,246 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:26:20,246 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:20,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:20,247 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:20,247 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:20,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable255 [2022-12-06 07:26:20,247 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-06 07:26:20,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:20,247 INFO L85 PathProgramCache]: Analyzing trace with hash 117583971, now seen corresponding path program 1 times [2022-12-06 07:26:20,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:20,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485270672] [2022-12-06 07:26:20,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:20,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:20,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-06 07:26:20,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:20,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485270672] [2022-12-06 07:26:20,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485270672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:20,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:20,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:20,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833463166] [2022-12-06 07:26:20,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:20,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:20,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:20,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:20,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:20,325 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:20,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:20,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:20,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:20,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:20,375 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:20,376 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:20,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:20,377 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:20,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:20,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:20,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:20,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:20,377 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:20,378 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:20,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:20,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:20,379 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:20,379 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:20,379 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:20,379 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:20,379 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:20,379 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:20,380 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:20,380 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:20,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:20,383 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:20,383 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:20,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:20,384 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:20,384 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:20,464 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:20,464 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 07:26:20,465 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:20,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:20,465 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:20,465 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:20,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable256 [2022-12-06 07:26:20,465 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-06 07:26:20,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:20,465 INFO L85 PathProgramCache]: Analyzing trace with hash 148060164, now seen corresponding path program 1 times [2022-12-06 07:26:20,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:20,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90376500] [2022-12-06 07:26:20,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:20,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:20,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-06 07:26:20,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:20,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90376500] [2022-12-06 07:26:20,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90376500] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:20,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:20,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:20,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939253983] [2022-12-06 07:26:20,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:20,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:20,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:20,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:20,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:20,538 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:20,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:20,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:20,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:20,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:20,581 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:20,581 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:20,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:20,582 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:20,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:20,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:20,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:20,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:20,582 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:20,582 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:20,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:20,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:20,583 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:20,583 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:20,583 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:20,583 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:20,583 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:20,583 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:20,583 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:20,584 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:20,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:20,586 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:20,586 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:20,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:20,586 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:20,586 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:20,658 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:20,659 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:20,659 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:20,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:20,659 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:20,659 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:20,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable257 [2022-12-06 07:26:20,659 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-06 07:26:20,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:20,660 INFO L85 PathProgramCache]: Analyzing trace with hash 174842273, now seen corresponding path program 1 times [2022-12-06 07:26:20,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:20,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004499070] [2022-12-06 07:26:20,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:20,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:20,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:20,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:20,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004499070] [2022-12-06 07:26:20,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004499070] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:20,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:20,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:20,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497254148] [2022-12-06 07:26:20,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:20,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:20,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:20,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:20,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:20,718 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:20,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:20,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:20,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:20,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:20,759 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:20,759 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:20,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:20,760 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:20,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:20,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:20,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:20,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:20,760 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:20,760 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:20,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:20,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:20,761 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:20,761 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:20,761 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:20,761 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:20,761 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:20,761 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:20,761 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:20,762 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:20,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:20,764 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:20,764 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:20,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:20,764 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:20,764 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:20,841 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:20,841 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:26:20,842 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:20,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:20,842 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:20,842 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:20,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable258 [2022-12-06 07:26:20,842 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-06 07:26:20,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:20,842 INFO L85 PathProgramCache]: Analyzing trace with hash 205318466, now seen corresponding path program 1 times [2022-12-06 07:26:20,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:20,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759600304] [2022-12-06 07:26:20,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:20,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:20,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-06 07:26:20,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:20,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759600304] [2022-12-06 07:26:20,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759600304] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:20,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:20,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:20,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586297179] [2022-12-06 07:26:20,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:20,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:20,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:20,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:20,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:20,898 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:20,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:20,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:20,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:20,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:20,940 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:20,940 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:20,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:20,940 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:20,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:20,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:20,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:20,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:20,941 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:20,941 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:20,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:20,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:20,942 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:20,942 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:20,942 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:20,942 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:20,942 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:20,942 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:20,942 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:20,942 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:20,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:20,945 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:20,945 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:20,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:20,945 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:20,945 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:21,018 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:21,018 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:21,018 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:21,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:21,019 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:21,019 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:21,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable259 [2022-12-06 07:26:21,019 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-06 07:26:21,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:21,019 INFO L85 PathProgramCache]: Analyzing trace with hash 232100575, now seen corresponding path program 1 times [2022-12-06 07:26:21,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:21,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81349412] [2022-12-06 07:26:21,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:21,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:21,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-06 07:26:21,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:21,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81349412] [2022-12-06 07:26:21,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81349412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:21,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:21,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:21,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572285486] [2022-12-06 07:26:21,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:21,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:21,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:21,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:21,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:21,076 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:21,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:21,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:21,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:21,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:21,126 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:21,126 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:21,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:21,126 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:21,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:21,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:21,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:21,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:21,127 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:21,127 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:21,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:21,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:21,128 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:21,128 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:21,128 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:21,128 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:21,128 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:21,128 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:21,128 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:21,129 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:21,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:21,131 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:21,131 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:21,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:21,131 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:21,131 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:21,203 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:21,204 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:21,204 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:21,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:21,204 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:21,204 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:21,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable260 [2022-12-06 07:26:21,204 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-06 07:26:21,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:21,204 INFO L85 PathProgramCache]: Analyzing trace with hash 262576768, now seen corresponding path program 1 times [2022-12-06 07:26:21,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:21,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030787992] [2022-12-06 07:26:21,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:21,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:21,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:21,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:21,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030787992] [2022-12-06 07:26:21,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030787992] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:21,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:21,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:21,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789429656] [2022-12-06 07:26:21,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:21,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:21,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:21,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:21,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:21,272 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:21,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:21,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:21,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:21,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:21,314 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:21,314 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:21,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:21,315 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:21,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:21,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:21,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:21,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:21,318 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:21,318 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:21,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:21,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:21,319 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:21,319 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:21,319 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:21,319 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:21,319 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:21,320 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:21,320 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:21,320 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:21,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:21,322 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:21,322 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:21,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:21,322 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:21,322 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:21,396 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:21,397 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:26:21,397 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:21,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:21,397 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:21,397 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:21,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable261 [2022-12-06 07:26:21,397 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-06 07:26:21,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:21,397 INFO L85 PathProgramCache]: Analyzing trace with hash 289358877, now seen corresponding path program 1 times [2022-12-06 07:26:21,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:21,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472457789] [2022-12-06 07:26:21,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:21,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:21,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-06 07:26:21,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:21,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472457789] [2022-12-06 07:26:21,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472457789] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:21,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:21,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:21,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856851033] [2022-12-06 07:26:21,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:21,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:21,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:21,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:21,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:21,456 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:21,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:21,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:21,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:21,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:21,493 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:21,493 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:21,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:21,494 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:21,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:21,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:21,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:21,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:21,494 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:21,494 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:21,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:21,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:21,495 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:21,496 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:21,496 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:21,496 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:21,496 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:21,496 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:21,496 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:21,496 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:21,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:21,499 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:21,500 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:21,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:21,500 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:21,500 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:21,579 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:21,579 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 07:26:21,579 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:21,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:21,579 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:21,580 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:21,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable262 [2022-12-06 07:26:21,580 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-06 07:26:21,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:21,580 INFO L85 PathProgramCache]: Analyzing trace with hash 319835070, now seen corresponding path program 1 times [2022-12-06 07:26:21,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:21,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345922204] [2022-12-06 07:26:21,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:21,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:21,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-06 07:26:21,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:21,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345922204] [2022-12-06 07:26:21,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345922204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:21,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:21,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:21,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554293441] [2022-12-06 07:26:21,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:21,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:21,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:21,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:21,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:21,662 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:21,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:21,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:21,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:21,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:21,713 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:21,713 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:21,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:21,713 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:21,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:21,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:21,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:21,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:21,714 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:21,714 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:21,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:21,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:21,715 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:21,715 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:21,715 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:21,715 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:21,715 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:21,715 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:21,716 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:21,716 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:21,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:21,718 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:21,718 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:21,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:21,718 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:21,718 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:21,793 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:21,794 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:26:21,794 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:21,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:21,794 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:21,794 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:21,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable263 [2022-12-06 07:26:21,794 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-06 07:26:21,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:21,794 INFO L85 PathProgramCache]: Analyzing trace with hash 346617179, now seen corresponding path program 1 times [2022-12-06 07:26:21,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:21,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715026468] [2022-12-06 07:26:21,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:21,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:21,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:21,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:21,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715026468] [2022-12-06 07:26:21,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715026468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:21,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:21,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:21,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564814760] [2022-12-06 07:26:21,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:21,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:21,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:21,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:21,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:21,859 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:21,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:21,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:21,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:21,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:21,899 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:21,899 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:21,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:21,899 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:21,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:21,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:21,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:21,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:21,900 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:21,900 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:21,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:21,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:21,901 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:21,901 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:21,901 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:21,901 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:21,901 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:21,901 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:21,901 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:21,902 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:21,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:21,904 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:21,904 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:21,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:21,904 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:21,904 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:21,984 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:21,984 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 07:26:21,984 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:21,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:21,984 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:21,984 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:21,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable264 [2022-12-06 07:26:21,985 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-06 07:26:21,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:21,985 INFO L85 PathProgramCache]: Analyzing trace with hash 377093372, now seen corresponding path program 1 times [2022-12-06 07:26:21,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:21,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877695965] [2022-12-06 07:26:21,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:21,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:22,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:22,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:22,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877695965] [2022-12-06 07:26:22,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877695965] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:22,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:22,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:22,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171438628] [2022-12-06 07:26:22,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:22,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:22,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:22,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:22,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:22,065 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:22,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:22,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:22,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:22,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:22,103 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:22,103 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:22,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:22,103 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:22,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:22,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:22,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:22,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:22,104 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:22,104 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:22,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:22,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:22,105 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:22,105 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:22,105 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:22,105 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:22,105 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:22,105 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:22,105 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:22,105 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:22,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:22,107 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:22,108 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:22,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:22,108 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:22,108 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:22,182 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:22,183 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:26:22,183 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:22,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:22,183 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:22,183 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:22,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable265 [2022-12-06 07:26:22,183 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-06 07:26:22,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:22,184 INFO L85 PathProgramCache]: Analyzing trace with hash 403875481, now seen corresponding path program 1 times [2022-12-06 07:26:22,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:22,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918581652] [2022-12-06 07:26:22,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:22,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:22,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-06 07:26:22,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:22,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918581652] [2022-12-06 07:26:22,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918581652] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:22,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:22,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:22,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303030723] [2022-12-06 07:26:22,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:22,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:22,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:22,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:22,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:22,243 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:22,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:22,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:22,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:22,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:22,278 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:22,278 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:22,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:22,279 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:22,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:22,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:22,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:22,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:22,279 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:22,280 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:22,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:22,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:22,280 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:22,280 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:22,281 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:22,281 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:22,281 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:22,281 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:22,281 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:22,281 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:22,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:22,284 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:22,284 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:22,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:22,285 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:22,285 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:22,358 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:22,358 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:22,358 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:22,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:22,358 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:22,358 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:22,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable266 [2022-12-06 07:26:22,358 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-06 07:26:22,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:22,359 INFO L85 PathProgramCache]: Analyzing trace with hash 434351674, now seen corresponding path program 1 times [2022-12-06 07:26:22,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:22,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089336340] [2022-12-06 07:26:22,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:22,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:22,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-06 07:26:22,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:22,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089336340] [2022-12-06 07:26:22,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089336340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:22,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:22,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:22,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818589165] [2022-12-06 07:26:22,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:22,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:22,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:22,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:22,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:22,418 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:22,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:22,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:22,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:22,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:22,460 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:22,461 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:22,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:22,461 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:22,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:22,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:22,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:22,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:22,462 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:22,462 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:22,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:22,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:22,463 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:22,463 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:22,463 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:22,463 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:22,463 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:22,463 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:22,463 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:22,463 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:22,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:22,465 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:22,466 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:22,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:22,466 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:22,466 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:22,541 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:22,542 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:26:22,542 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:22,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:22,542 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:22,542 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:22,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable267 [2022-12-06 07:26:22,542 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-06 07:26:22,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:22,543 INFO L85 PathProgramCache]: Analyzing trace with hash 461133783, now seen corresponding path program 1 times [2022-12-06 07:26:22,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:22,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200107962] [2022-12-06 07:26:22,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:22,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:22,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-06 07:26:22,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:22,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200107962] [2022-12-06 07:26:22,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200107962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:22,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:22,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:22,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952001830] [2022-12-06 07:26:22,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:22,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:22,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:22,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:22,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:22,604 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:22,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:22,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:22,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:22,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:22,639 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:22,639 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:22,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:22,640 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:22,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:22,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:22,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:22,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:22,640 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:22,640 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:22,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:22,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:22,641 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:22,641 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:22,642 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:22,642 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:22,642 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:22,642 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:22,642 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:22,642 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:22,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:22,644 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:22,644 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:22,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:22,645 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:22,645 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:22,717 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:22,718 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:22,718 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:22,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:22,718 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:22,718 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:22,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable268 [2022-12-06 07:26:22,718 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-06 07:26:22,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:22,719 INFO L85 PathProgramCache]: Analyzing trace with hash 491609976, now seen corresponding path program 1 times [2022-12-06 07:26:22,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:22,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788440007] [2022-12-06 07:26:22,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:22,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:22,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-06 07:26:22,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:22,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788440007] [2022-12-06 07:26:22,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788440007] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:22,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:22,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:22,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673694505] [2022-12-06 07:26:22,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:22,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:22,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:22,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:22,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:22,784 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:22,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:22,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:22,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:22,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:22,828 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:22,828 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:22,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:22,828 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:22,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:22,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:22,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:22,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:22,829 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:22,829 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:22,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:22,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:22,830 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:22,830 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:22,830 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:22,830 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:22,830 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:22,830 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:22,830 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:22,831 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:22,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:22,833 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:22,833 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:22,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:22,833 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:22,833 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:22,906 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:22,906 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:22,906 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:22,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:22,907 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:22,907 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:22,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable269 [2022-12-06 07:26:22,907 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-06 07:26:22,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:22,907 INFO L85 PathProgramCache]: Analyzing trace with hash 518392085, now seen corresponding path program 1 times [2022-12-06 07:26:22,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:22,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76068807] [2022-12-06 07:26:22,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:22,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:22,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-06 07:26:22,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:22,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76068807] [2022-12-06 07:26:22,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76068807] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:22,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:22,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:22,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024521412] [2022-12-06 07:26:22,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:22,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:22,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:22,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:22,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:22,967 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:22,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:22,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:22,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:22,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:23,002 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:23,002 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:23,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:23,002 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:23,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:23,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:23,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:23,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:23,003 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:23,003 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:23,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:23,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:23,004 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:23,004 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:23,004 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:23,004 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:23,004 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:23,004 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:23,004 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:23,004 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:23,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:23,007 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:23,007 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:23,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:23,007 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:23,007 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:23,078 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:23,078 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:26:23,078 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:23,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:23,079 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:23,079 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:23,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable270 [2022-12-06 07:26:23,079 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-06 07:26:23,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:23,079 INFO L85 PathProgramCache]: Analyzing trace with hash 548868278, now seen corresponding path program 1 times [2022-12-06 07:26:23,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:23,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365368318] [2022-12-06 07:26:23,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:23,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:23,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-06 07:26:23,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:23,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365368318] [2022-12-06 07:26:23,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365368318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:23,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:23,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:23,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473186538] [2022-12-06 07:26:23,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:23,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:23,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:23,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:23,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:23,137 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:23,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:23,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:23,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:23,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:23,175 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:23,175 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:23,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:23,175 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:23,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:23,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:23,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:23,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:23,176 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:23,176 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:23,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:23,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:23,177 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:23,177 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:23,177 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:23,177 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:23,177 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:23,177 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:23,177 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:23,177 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:23,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:23,180 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:23,180 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:23,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:23,180 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:23,180 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:23,251 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:23,252 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:26:23,252 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:23,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:23,252 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:23,252 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:23,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable271 [2022-12-06 07:26:23,252 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-06 07:26:23,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:23,252 INFO L85 PathProgramCache]: Analyzing trace with hash 575650387, now seen corresponding path program 1 times [2022-12-06 07:26:23,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:23,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654239226] [2022-12-06 07:26:23,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:23,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:23,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:23,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:23,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654239226] [2022-12-06 07:26:23,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654239226] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:23,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:23,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:23,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967963671] [2022-12-06 07:26:23,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:23,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:23,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:23,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:23,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:23,318 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:23,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:23,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:23,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:23,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:23,359 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:23,359 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:23,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:23,360 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:23,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:23,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:23,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:23,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:23,360 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:23,360 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:23,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:23,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:23,361 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:23,361 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:23,361 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:23,362 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:23,362 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:23,362 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:23,362 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:23,362 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:23,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:23,364 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:23,364 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:23,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:23,364 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:23,365 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:23,438 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:23,438 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:23,438 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:23,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:23,438 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:23,439 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:23,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable272 [2022-12-06 07:26:23,439 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-06 07:26:23,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:23,439 INFO L85 PathProgramCache]: Analyzing trace with hash 606126580, now seen corresponding path program 1 times [2022-12-06 07:26:23,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:23,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473803834] [2022-12-06 07:26:23,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:23,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26: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-06 07:26:23,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:23,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473803834] [2022-12-06 07:26:23,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473803834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:23,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:23,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:23,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904071714] [2022-12-06 07:26:23,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:23,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:23,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:23,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:23,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:23,510 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:23,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:23,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:23,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:23,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:23,555 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:23,555 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:23,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:23,555 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:23,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:23,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:23,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:23,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:23,556 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:23,556 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:23,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:23,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:23,557 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:23,557 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:23,557 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:23,557 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:23,557 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:23,557 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:23,557 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:23,557 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:23,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:23,560 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:23,560 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:23,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:23,560 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:23,560 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:23,633 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:23,633 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:23,633 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:23,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:23,633 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:23,633 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:23,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable273 [2022-12-06 07:26:23,633 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-06 07:26:23,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:23,634 INFO L85 PathProgramCache]: Analyzing trace with hash 632908689, now seen corresponding path program 1 times [2022-12-06 07:26:23,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:23,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591655544] [2022-12-06 07:26:23,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:23,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:23,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26: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-06 07:26:23,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:23,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591655544] [2022-12-06 07:26:23,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591655544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:23,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:23,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:23,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293019139] [2022-12-06 07:26:23,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:23,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:23,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:23,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:23,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:23,709 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:23,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:23,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:23,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:23,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:23,755 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:23,755 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:23,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:23,756 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:23,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:23,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:23,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:23,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:23,756 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:23,757 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:23,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:23,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:23,758 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:23,758 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:23,758 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:23,758 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:23,758 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:23,758 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:23,758 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:23,758 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:23,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:23,761 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:23,762 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:23,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:23,762 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:23,762 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:23,842 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:23,842 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:26:23,842 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:23,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:23,842 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:23,843 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:23,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable274 [2022-12-06 07:26:23,843 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-06 07:26:23,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:23,843 INFO L85 PathProgramCache]: Analyzing trace with hash 663384882, now seen corresponding path program 1 times [2022-12-06 07:26:23,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:23,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113791207] [2022-12-06 07:26:23,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:23,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:23,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-06 07:26:23,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:23,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113791207] [2022-12-06 07:26:23,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113791207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:23,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:23,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:23,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883966850] [2022-12-06 07:26:23,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:23,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:23,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:23,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:23,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:23,917 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:23,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:23,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:23,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:23,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:23,959 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:23,959 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:23,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:23,960 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:23,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:23,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:23,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:23,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:23,960 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:23,960 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:23,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:23,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:23,961 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:23,961 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:23,961 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:23,961 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:23,961 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:23,962 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:23,962 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:23,962 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:23,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:23,964 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:23,964 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:23,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:23,964 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:23,964 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:24,038 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:24,038 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:24,038 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:24,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:24,038 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:24,039 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:24,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable275 [2022-12-06 07:26:24,039 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-06 07:26:24,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:24,039 INFO L85 PathProgramCache]: Analyzing trace with hash 690166991, now seen corresponding path program 1 times [2022-12-06 07:26:24,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:24,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325144650] [2022-12-06 07:26:24,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:24,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:24,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-06 07:26:24,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:24,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325144650] [2022-12-06 07:26:24,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325144650] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:24,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:24,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:24,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115665179] [2022-12-06 07:26:24,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:24,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:24,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:24,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:24,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:24,097 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:24,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:24,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:24,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:24,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:24,135 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:24,135 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:24,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:24,135 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:24,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:24,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:24,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:24,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:24,136 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:24,136 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:24,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:24,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:24,137 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:24,137 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:24,137 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:24,137 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:24,137 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:24,137 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:24,137 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:24,137 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:24,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:24,140 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:24,140 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:24,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:24,140 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:24,140 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:24,223 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:24,224 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 07:26:24,224 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:24,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:24,224 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:24,224 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:24,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable276 [2022-12-06 07:26:24,224 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-06 07:26:24,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:24,224 INFO L85 PathProgramCache]: Analyzing trace with hash 720643184, now seen corresponding path program 1 times [2022-12-06 07:26:24,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:24,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873475577] [2022-12-06 07:26:24,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:24,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:24,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-06 07:26:24,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:24,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873475577] [2022-12-06 07:26:24,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873475577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:24,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:24,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:24,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962578358] [2022-12-06 07:26:24,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:24,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:24,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:24,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:24,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:24,283 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:24,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:24,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:24,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:24,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:24,331 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:24,331 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:24,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:24,332 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:24,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:24,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:24,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:24,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:24,333 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:24,333 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:24,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:24,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:24,333 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:24,333 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:24,334 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:24,334 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:24,334 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:24,334 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:24,334 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:24,334 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:24,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:24,336 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:24,336 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:24,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:24,337 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:24,337 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:24,409 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:24,410 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:24,410 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:24,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:24,410 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:24,410 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:24,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable277 [2022-12-06 07:26:24,410 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-06 07:26:24,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:24,411 INFO L85 PathProgramCache]: Analyzing trace with hash 747425293, now seen corresponding path program 1 times [2022-12-06 07:26:24,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:24,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220755240] [2022-12-06 07:26:24,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:24,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:24,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-06 07:26:24,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:24,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220755240] [2022-12-06 07:26:24,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220755240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:24,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:24,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:24,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765016553] [2022-12-06 07:26:24,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:24,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:24,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:24,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:24,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:24,470 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:24,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:24,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:24,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:24,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:24,506 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:24,507 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:24,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:24,507 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:24,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:24,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:24,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:24,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:24,508 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:24,508 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:24,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:24,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:24,508 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:24,508 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:24,509 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:24,509 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:24,509 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:24,509 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:24,509 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:24,509 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:24,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:24,511 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:24,511 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:24,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:24,512 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:24,512 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:24,584 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:24,585 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:24,585 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:24,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:24,585 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:24,585 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:24,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable278 [2022-12-06 07:26:24,585 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-06 07:26:24,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:24,585 INFO L85 PathProgramCache]: Analyzing trace with hash 777901486, now seen corresponding path program 1 times [2022-12-06 07:26:24,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:24,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183680514] [2022-12-06 07:26:24,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:24,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:24,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-06 07:26:24,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:24,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183680514] [2022-12-06 07:26:24,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183680514] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:24,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:24,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:24,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125705071] [2022-12-06 07:26:24,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:24,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:24,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:24,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:24,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:24,648 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:24,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:24,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:24,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:24,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:24,698 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:24,698 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:24,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:24,699 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:24,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:24,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:24,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:24,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:24,700 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:24,700 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:24,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:24,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:24,701 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:24,701 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:24,701 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:24,701 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:24,701 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:24,702 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:24,702 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:24,702 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:24,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:24,705 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:24,705 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:24,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:24,705 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:24,705 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:24,799 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:24,800 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 07:26:24,800 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:24,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:24,800 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:24,800 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:24,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable279 [2022-12-06 07:26:24,800 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-06 07:26:24,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:24,801 INFO L85 PathProgramCache]: Analyzing trace with hash 804683595, now seen corresponding path program 1 times [2022-12-06 07:26:24,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:24,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635447596] [2022-12-06 07:26:24,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:24,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:24,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-06 07:26:24,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:24,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635447596] [2022-12-06 07:26:24,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635447596] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:24,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:24,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:24,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826890698] [2022-12-06 07:26:24,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:24,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:24,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:24,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:24,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:24,867 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:24,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:24,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:24,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:24,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:24,902 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:24,902 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:24,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 371 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:24,903 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:24,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:24,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:24,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:24,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:24,903 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:24,903 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:24,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:24,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:24,904 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:24,904 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:24,904 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:24,904 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:24,904 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:24,905 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:24,905 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:24,905 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:24,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:24,907 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:24,907 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:24,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:24,907 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:24,907 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:24,978 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:24,979 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:26:24,979 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:24,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:24,979 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:24,979 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:24,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable280 [2022-12-06 07:26:24,979 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-06 07:26:24,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:24,979 INFO L85 PathProgramCache]: Analyzing trace with hash 835159788, now seen corresponding path program 1 times [2022-12-06 07:26:24,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:24,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085935511] [2022-12-06 07:26:24,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:24,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:25,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-06 07:26:25,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:25,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085935511] [2022-12-06 07:26:25,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085935511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:25,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:25,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:25,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417336891] [2022-12-06 07:26:25,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:25,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:25,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:25,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:25,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:25,050 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:25,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:25,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:25,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:25,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:25,095 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:25,095 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:25,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:25,096 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:25,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:25,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:25,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:25,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:25,096 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:25,097 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:25,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:25,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:25,098 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:25,098 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:25,098 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:25,098 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:25,098 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:25,098 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:25,098 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:25,098 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:25,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:25,101 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:25,102 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:25,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:25,102 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:25,102 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:25,185 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:25,186 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 07:26:25,186 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:25,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:25,186 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:25,186 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:25,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable281 [2022-12-06 07:26:25,186 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-06 07:26:25,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:25,186 INFO L85 PathProgramCache]: Analyzing trace with hash 861941897, now seen corresponding path program 1 times [2022-12-06 07:26:25,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:25,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122688713] [2022-12-06 07:26:25,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:25,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:25,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:25,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:25,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122688713] [2022-12-06 07:26:25,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122688713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:25,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:25,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:25,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320332433] [2022-12-06 07:26:25,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:25,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:25,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:25,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:25,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:25,246 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:25,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:25,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:25,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:25,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:25,288 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:25,288 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:25,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:25,289 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:25,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:25,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:25,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:25,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:25,290 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:25,290 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:25,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:25,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:25,290 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:25,291 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:25,291 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:25,291 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:25,291 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:25,291 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:25,291 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:25,291 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:25,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:25,293 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:25,294 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:25,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:25,294 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:25,294 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:25,366 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:25,367 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:25,367 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:25,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:25,367 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:25,367 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:25,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable282 [2022-12-06 07:26:25,367 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-06 07:26:25,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:25,368 INFO L85 PathProgramCache]: Analyzing trace with hash 892418090, now seen corresponding path program 1 times [2022-12-06 07:26:25,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:25,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300611903] [2022-12-06 07:26:25,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:25,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:25,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-06 07:26:25,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:25,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300611903] [2022-12-06 07:26:25,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300611903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:25,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:25,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:25,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549597590] [2022-12-06 07:26:25,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:25,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:25,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:25,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:25,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:25,436 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:25,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:25,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:25,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:25,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:25,472 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:25,472 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:25,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:25,472 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:25,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:25,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:25,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:25,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:25,473 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:25,473 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:25,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:25,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:25,473 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:25,474 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:25,474 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:25,474 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:25,474 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:25,474 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:25,474 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:25,474 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:25,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:25,477 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:25,477 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:25,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:25,477 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:25,477 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:25,550 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:25,550 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:25,550 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:25,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:25,550 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:25,550 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:25,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable283 [2022-12-06 07:26:25,551 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-06 07:26:25,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:25,551 INFO L85 PathProgramCache]: Analyzing trace with hash 919200199, now seen corresponding path program 1 times [2022-12-06 07:26:25,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:25,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634369217] [2022-12-06 07:26:25,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:25,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:25,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-06 07:26:25,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:25,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634369217] [2022-12-06 07:26:25,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634369217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:25,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:25,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:25,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592426555] [2022-12-06 07:26:25,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:25,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:25,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:25,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:25,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:25,610 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:25,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:25,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:25,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:25,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:25,648 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:25,648 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:25,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:25,648 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:25,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:25,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:25,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:25,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:25,649 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:25,649 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:25,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:25,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:25,650 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:25,650 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:25,650 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:25,650 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:25,650 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:25,650 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:25,650 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:25,650 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:25,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:25,653 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:25,653 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:25,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:25,653 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:25,653 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:25,726 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:25,727 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:25,727 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:25,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:25,727 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:25,727 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:25,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable284 [2022-12-06 07:26:25,727 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-06 07:26:25,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:25,727 INFO L85 PathProgramCache]: Analyzing trace with hash 949676392, now seen corresponding path program 1 times [2022-12-06 07:26:25,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:25,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733222567] [2022-12-06 07:26:25,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:25,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:25,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-06 07:26:25,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:25,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733222567] [2022-12-06 07:26:25,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733222567] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:25,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:25,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:25,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443856056] [2022-12-06 07:26:25,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:25,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:25,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:25,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:25,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:25,785 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:25,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:25,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:25,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:25,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:25,821 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:25,821 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:25,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:25,822 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:25,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:25,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:25,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:25,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:25,822 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:25,822 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:25,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:25,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:25,823 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:25,823 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:25,823 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:25,823 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:25,823 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:25,824 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:25,824 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:25,824 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:25,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:25,826 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:25,826 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:25,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:25,826 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:25,826 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:25,904 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:25,905 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:26:25,905 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:25,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:25,905 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:25,905 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:25,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable285 [2022-12-06 07:26:25,905 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-06 07:26:25,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:25,905 INFO L85 PathProgramCache]: Analyzing trace with hash 976458501, now seen corresponding path program 1 times [2022-12-06 07:26:25,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:25,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496545495] [2022-12-06 07:26:25,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:25,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26: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-06 07:26:25,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:25,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496545495] [2022-12-06 07:26:25,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496545495] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:25,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:25,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:25,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522406803] [2022-12-06 07:26:25,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:25,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:25,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:25,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:25,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:25,976 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:25,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:25,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:25,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:25,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:26,019 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:26,019 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:26,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:26,020 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:26,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:26,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:26,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:26,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:26,020 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:26,020 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:26,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:26,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:26,021 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:26,021 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:26,022 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:26,022 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:26,022 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:26,022 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:26,022 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:26,022 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:26,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:26,025 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:26,025 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:26,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:26,026 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:26,026 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:26,114 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:26,115 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-06 07:26:26,115 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:26,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:26,115 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:26,115 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:26,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable286 [2022-12-06 07:26:26,116 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-06 07:26:26,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:26,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1006934694, now seen corresponding path program 1 times [2022-12-06 07:26:26,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:26,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051376041] [2022-12-06 07:26:26,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:26,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:26,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-06 07:26:26,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:26,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051376041] [2022-12-06 07:26:26,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051376041] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:26,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:26,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:26,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374177617] [2022-12-06 07:26:26,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:26,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:26,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:26,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:26,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:26,177 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:26,177 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:26,177 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:26,177 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:26,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:26,233 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:26,233 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:26,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 349 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:26,234 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:26,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:26,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:26,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:26,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:26,235 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:26,235 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:26,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:26,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:26,236 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:26,236 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:26,236 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:26,236 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:26,236 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:26,236 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:26,236 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:26,237 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:26,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:26,240 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:26,240 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:26,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:26,240 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:26,240 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:26,333 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:26,333 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 07:26:26,333 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:26,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:26,334 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:26,334 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:26,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable287 [2022-12-06 07:26:26,334 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-06 07:26:26,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:26,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1033716803, now seen corresponding path program 1 times [2022-12-06 07:26:26,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:26,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555518187] [2022-12-06 07:26:26,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:26,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:26,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-06 07:26:26,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:26,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555518187] [2022-12-06 07:26:26,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555518187] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:26,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:26,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:26,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116237348] [2022-12-06 07:26:26,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:26,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:26,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:26,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:26,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:26,413 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:26,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:26,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:26,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:26,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:26,465 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:26,466 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:26,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 372 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:26,466 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:26,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:26,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:26,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:26,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:26,467 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:26,467 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:26,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:26,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:26,468 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:26,468 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:26,468 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:26,468 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:26,469 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:26,469 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:26,469 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:26,469 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:26,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:26,472 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:26,472 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:26,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:26,472 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:26,472 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:26,566 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:26,566 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 07:26:26,566 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:26,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:26,567 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:26,567 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:26,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable288 [2022-12-06 07:26:26,567 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-06 07:26:26,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:26,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1064192996, now seen corresponding path program 1 times [2022-12-06 07:26:26,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:26,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851965952] [2022-12-06 07:26:26,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:26,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:26,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:26,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-06 07:26:26,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:26,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851965952] [2022-12-06 07:26:26,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851965952] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:26,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:26,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:26,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713740370] [2022-12-06 07:26:26,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:26,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:26,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:26,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:26,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:26,630 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:26,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:26,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:26,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:26,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:26,673 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:26,673 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:26,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:26,673 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:26,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:26,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:26,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:26,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:26,674 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:26,674 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:26,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:26,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:26,675 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:26,675 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:26,675 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:26,675 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:26,675 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:26,675 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:26,675 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:26,676 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:26,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:26,678 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:26,678 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:26,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:26,678 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:26,678 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:26,752 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:26,759 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:26:26,759 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:26,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:26,759 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:26,759 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:26,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable289 [2022-12-06 07:26:26,759 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-06 07:26:26,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:26,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1090975105, now seen corresponding path program 1 times [2022-12-06 07:26:26,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:26,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556764713] [2022-12-06 07:26:26,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:26,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:26,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-06 07:26:26,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:26,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556764713] [2022-12-06 07:26:26,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556764713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:26,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:26,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:26,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514938521] [2022-12-06 07:26:26,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:26,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:26,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:26,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:26,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:26,824 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:26,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:26,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:26,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:26,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:26,870 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:26,870 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:26,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:26,871 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:26,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:26,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:26,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:26,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:26,871 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:26,871 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:26,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:26,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:26,872 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:26,872 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:26,872 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:26,873 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:26,873 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:26,873 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:26,873 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:26,873 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:26,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:26,875 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:26,875 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:26,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:26,875 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:26,875 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:26,949 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:26,949 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:26,949 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:26,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:26,949 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:26,949 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:26,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable290 [2022-12-06 07:26:26,950 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-06 07:26:26,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:26,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1121451298, now seen corresponding path program 1 times [2022-12-06 07:26:26,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:26,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9807438] [2022-12-06 07:26:26,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:26,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:27,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:27,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:27,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9807438] [2022-12-06 07:26:27,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9807438] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:27,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:27,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:27,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61224800] [2022-12-06 07:26:27,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:27,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:27,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:27,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:27,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:27,009 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:27,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:27,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:27,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:27,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:27,045 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:27,045 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:27,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:27,046 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:27,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:27,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:27,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:27,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:27,046 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:27,046 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:27,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:27,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:27,047 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:27,047 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:27,047 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:27,047 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:27,047 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:27,047 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:27,048 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:27,048 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:27,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:27,050 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:27,050 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:27,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:27,051 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:27,051 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:27,134 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:27,135 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 07:26:27,135 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:27,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:27,135 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:27,135 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:27,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable291 [2022-12-06 07:26:27,135 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-06 07:26:27,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:27,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1148233407, now seen corresponding path program 1 times [2022-12-06 07:26:27,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:27,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192021921] [2022-12-06 07:26:27,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:27,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:27,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-06 07:26:27,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:27,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192021921] [2022-12-06 07:26:27,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192021921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:27,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:27,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:27,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369366508] [2022-12-06 07:26:27,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:27,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:27,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:27,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:27,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:27,194 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:27,194 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:27,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:27,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:27,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:27,236 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:27,237 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:27,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:27,237 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:27,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:27,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:27,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:27,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:27,238 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:27,238 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:27,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:27,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:27,238 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:27,238 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:27,239 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:27,239 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:27,239 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:27,239 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:27,239 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:27,239 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:27,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:27,241 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:27,242 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:27,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:27,242 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:27,242 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:27,314 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:27,315 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:27,315 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:27,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:27,315 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:27,315 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:27,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable292 [2022-12-06 07:26:27,315 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-06 07:26:27,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:27,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1178709600, now seen corresponding path program 1 times [2022-12-06 07:26:27,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:27,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380562271] [2022-12-06 07:26:27,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:27,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:27,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-06 07:26:27,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:27,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380562271] [2022-12-06 07:26:27,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380562271] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:27,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:27,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:27,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446580801] [2022-12-06 07:26:27,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:27,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:27,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:27,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:27,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:27,373 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:27,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:27,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:27,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:27,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:27,414 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:27,415 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:27,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:27,415 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:27,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:27,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:27,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:27,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:27,416 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:27,416 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:27,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:27,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:27,416 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:27,417 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:27,417 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:27,417 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:27,417 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:27,417 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:27,417 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:27,417 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:27,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:27,419 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:27,419 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:27,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:27,420 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:27,420 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:27,493 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:27,493 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:27,494 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:27,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:27,494 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:27,494 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:27,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable293 [2022-12-06 07:26:27,494 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-06 07:26:27,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:27,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1205491709, now seen corresponding path program 1 times [2022-12-06 07:26:27,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:27,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173942454] [2022-12-06 07:26:27,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:27,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:27,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-06 07:26:27,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:27,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173942454] [2022-12-06 07:26:27,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173942454] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:27,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:27,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:27,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769487155] [2022-12-06 07:26:27,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:27,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:27,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:27,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:27,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:27,563 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:27,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:27,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:27,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:27,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:27,619 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:27,619 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:27,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:27,620 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:27,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:27,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:27,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:27,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:27,621 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:27,621 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:27,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:27,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:27,622 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:27,622 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:27,622 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:27,622 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:27,622 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:27,622 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:27,622 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:27,623 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:27,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:27,626 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:27,626 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:27,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:27,626 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:27,626 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:27,719 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:27,719 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 07:26:27,719 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:27,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:27,720 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:27,720 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:27,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable294 [2022-12-06 07:26:27,720 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-06 07:26:27,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:27,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1235967902, now seen corresponding path program 1 times [2022-12-06 07:26:27,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:27,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056718813] [2022-12-06 07:26:27,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:27,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:27,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-06 07:26:27,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:27,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056718813] [2022-12-06 07:26:27,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056718813] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:27,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:27,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:27,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064843891] [2022-12-06 07:26:27,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:27,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:27,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:27,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:27,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:27,783 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:27,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:27,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:27,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:27,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:27,826 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:27,826 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:27,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:27,826 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:27,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:27,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:27,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:27,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:27,827 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:27,827 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:27,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:27,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:27,828 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:27,828 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:27,828 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:27,828 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:27,828 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:27,828 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:27,828 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:27,828 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:27,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:27,831 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:27,831 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:27,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:27,831 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:27,831 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:27,904 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:27,905 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:27,905 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:27,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:27,905 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:27,905 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:27,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable295 [2022-12-06 07:26:27,905 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-06 07:26:27,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:27,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1262750011, now seen corresponding path program 1 times [2022-12-06 07:26:27,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:27,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541483244] [2022-12-06 07:26:27,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:27,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:27,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:27,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-06 07:26:27,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:27,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541483244] [2022-12-06 07:26:27,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541483244] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:27,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:27,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:27,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441887721] [2022-12-06 07:26:27,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:27,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:27,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:27,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:27,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:27,966 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:27,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:27,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:27,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:27,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:28,006 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:28,006 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:28,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:28,007 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:28,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:28,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:28,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:28,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:28,007 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:28,007 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:28,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:28,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:28,008 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:28,008 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:28,009 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:28,009 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:28,009 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:28,009 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:28,009 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:28,009 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:28,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:28,012 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:28,012 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:28,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:28,013 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:28,013 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:28,086 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:28,086 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:28,086 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:28,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:28,087 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:28,087 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:28,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable296 [2022-12-06 07:26:28,087 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-06 07:26:28,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:28,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1293226204, now seen corresponding path program 1 times [2022-12-06 07:26:28,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:28,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214962895] [2022-12-06 07:26:28,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:28,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:28,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-06 07:26:28,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:28,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214962895] [2022-12-06 07:26:28,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214962895] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:28,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:28,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:28,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657379439] [2022-12-06 07:26:28,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:28,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:28,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:28,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:28,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:28,146 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:28,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:28,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:28,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:28,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:28,188 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:28,188 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:28,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:28,189 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:28,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:28,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:28,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:28,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:28,190 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:28,190 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:28,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:28,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:28,191 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:28,191 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:28,191 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:28,191 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:28,192 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:28,192 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:28,192 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:28,192 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:28,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:28,195 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:28,195 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:28,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:28,196 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:28,196 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:28,287 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:28,287 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:26:28,287 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:28,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:28,287 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:28,287 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:28,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable297 [2022-12-06 07:26:28,288 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-06 07:26:28,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:28,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1320008313, now seen corresponding path program 1 times [2022-12-06 07:26:28,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:28,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390055841] [2022-12-06 07:26:28,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:28,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:28,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-06 07:26:28,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:28,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390055841] [2022-12-06 07:26:28,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390055841] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:28,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:28,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:28,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044994735] [2022-12-06 07:26:28,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:28,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:28,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:28,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:28,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:28,354 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:28,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:28,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:28,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:28,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:28,403 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:28,404 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:28,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:28,404 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:28,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:28,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:28,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:28,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:28,405 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:28,405 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:28,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:28,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:28,406 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:28,406 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:28,406 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:28,406 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:28,406 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:28,406 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:28,406 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:28,406 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:28,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:28,408 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:28,409 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:28,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:28,409 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:28,409 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:28,481 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:28,481 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:26:28,481 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:28,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:28,481 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:28,482 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:28,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable298 [2022-12-06 07:26:28,482 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-06 07:26:28,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:28,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1350484506, now seen corresponding path program 1 times [2022-12-06 07:26:28,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:28,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477517458] [2022-12-06 07:26:28,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:28,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:28,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-06 07:26:28,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:28,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477517458] [2022-12-06 07:26:28,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477517458] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:28,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:28,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:28,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081010557] [2022-12-06 07:26:28,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:28,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:28,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:28,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:28,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:28,538 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:28,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:28,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:28,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:28,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:28,594 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:28,594 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:28,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:28,594 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:28,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:28,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:28,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:28,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:28,595 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:28,595 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:28,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:28,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:28,596 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:28,596 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:28,596 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:28,596 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:28,596 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:28,597 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:28,597 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:28,597 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:28,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:28,600 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:28,600 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:28,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:28,600 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:28,601 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:28,673 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:28,674 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:26:28,674 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:28,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:28,674 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:28,674 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:28,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable299 [2022-12-06 07:26:28,674 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-06 07:26:28,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:28,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1377266615, now seen corresponding path program 1 times [2022-12-06 07:26:28,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:28,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331023181] [2022-12-06 07:26:28,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:28,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:28,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:28,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:28,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331023181] [2022-12-06 07:26:28,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331023181] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:28,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:28,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:28,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947010691] [2022-12-06 07:26:28,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:28,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:28,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:28,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:28,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:28,734 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:28,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:28,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:28,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:28,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:28,775 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:28,775 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:28,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:28,776 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:28,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:28,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:28,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:28,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:28,776 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:28,776 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:28,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:28,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:28,777 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:28,777 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:28,777 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:28,777 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:28,777 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:28,777 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:28,777 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:28,778 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:28,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:28,780 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:28,780 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:28,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 145 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:28,780 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:28,780 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:28,854 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:28,855 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:26:28,855 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:28,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:28,855 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:28,855 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:28,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable300 [2022-12-06 07:26:28,855 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-06 07:26:28,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:28,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1407742808, now seen corresponding path program 1 times [2022-12-06 07:26:28,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:28,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056909816] [2022-12-06 07:26:28,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:28,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:28,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-06 07:26:28,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:28,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056909816] [2022-12-06 07:26:28,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056909816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:28,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:28,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:28,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56798137] [2022-12-06 07:26:28,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:28,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:28,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:28,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:28,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:28,911 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:28,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:28,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:28,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:28,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:28,952 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:28,952 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:28,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:28,953 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:28,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:28,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:28,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:28,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:28,953 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:28,953 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:28,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:28,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:28,954 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:28,954 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:28,954 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:28,954 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:28,954 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:28,954 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:28,954 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:28,955 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:28,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:28,957 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:28,957 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:28,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:28,957 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:28,957 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:29,030 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:29,030 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:29,030 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:29,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:29,030 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:29,030 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:29,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable301 [2022-12-06 07:26:29,031 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-06 07:26:29,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:29,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1434524917, now seen corresponding path program 1 times [2022-12-06 07:26:29,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:29,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386684367] [2022-12-06 07:26:29,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:29,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:29,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-06 07:26:29,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:29,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386684367] [2022-12-06 07:26:29,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386684367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:29,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:29,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:29,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821352414] [2022-12-06 07:26:29,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:29,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:29,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:29,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:29,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:29,096 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:29,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:29,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:29,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:29,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:29,137 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:29,137 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:29,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 371 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:29,138 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:29,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:29,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:29,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:29,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:29,138 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:29,138 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:29,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:29,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:29,139 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:29,139 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:29,139 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:29,139 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:29,140 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:29,140 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:29,140 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:29,140 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:29,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:29,142 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:29,142 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:29,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:29,142 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:29,142 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:29,225 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:29,226 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 07:26:29,226 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:29,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:29,226 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:29,226 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:29,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable302 [2022-12-06 07:26:29,226 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-06 07:26:29,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:29,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1465001110, now seen corresponding path program 1 times [2022-12-06 07:26:29,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:29,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910349663] [2022-12-06 07:26:29,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:29,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:29,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-06 07:26:29,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:29,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910349663] [2022-12-06 07:26:29,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910349663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:29,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:29,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:29,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864475465] [2022-12-06 07:26:29,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:29,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:29,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:29,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:29,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:29,286 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:29,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:29,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:29,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:29,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:29,328 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:29,328 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:29,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:29,329 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:29,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:29,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:29,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:29,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:29,329 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:29,329 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:29,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:29,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:29,330 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:29,330 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:29,330 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:29,330 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:29,330 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:29,330 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:29,331 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:29,331 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:29,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:29,333 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:29,333 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:29,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:29,333 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:29,333 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:29,406 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:29,407 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:29,407 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:29,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:29,407 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:29,407 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:29,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable303 [2022-12-06 07:26:29,407 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-06 07:26:29,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:29,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1491783219, now seen corresponding path program 1 times [2022-12-06 07:26:29,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:29,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036566949] [2022-12-06 07:26:29,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:29,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:29,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-06 07:26:29,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:29,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036566949] [2022-12-06 07:26:29,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036566949] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:29,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:29,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:29,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717404322] [2022-12-06 07:26:29,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:29,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:29,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:29,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:29,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:29,470 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:29,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:29,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:29,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:29,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:29,511 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:29,511 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:29,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 372 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:29,512 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:29,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:29,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:29,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:29,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:29,512 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:29,512 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:29,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:29,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:29,513 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:29,513 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:29,514 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:29,514 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:29,514 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:29,514 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:29,514 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:29,514 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:29,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:29,517 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:29,517 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:29,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:29,518 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:29,518 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:29,592 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:29,592 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:26:29,592 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:29,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:29,592 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:29,592 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:29,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable304 [2022-12-06 07:26:29,593 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-06 07:26:29,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:29,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1522259412, now seen corresponding path program 1 times [2022-12-06 07:26:29,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:29,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409923843] [2022-12-06 07:26:29,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:29,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:29,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-06 07:26:29,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:29,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409923843] [2022-12-06 07:26:29,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409923843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:29,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:29,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:29,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123137584] [2022-12-06 07:26:29,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:29,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:29,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:29,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:29,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:29,648 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:29,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:29,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:29,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:29,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:29,685 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:29,685 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:29,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:29,685 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:29,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:29,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:29,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:29,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:29,686 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:29,686 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:29,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:29,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:29,686 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:29,687 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:29,687 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:29,687 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:29,687 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:29,687 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:29,687 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:29,687 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:29,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:29,689 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:29,689 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:29,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:29,690 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:29,690 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:29,765 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:29,765 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:26:29,765 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:29,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:29,766 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:29,766 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:29,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable305 [2022-12-06 07:26:29,766 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-06 07:26:29,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:29,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1549041521, now seen corresponding path program 1 times [2022-12-06 07:26:29,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:29,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467420480] [2022-12-06 07:26:29,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:29,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:29,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-06 07:26:29,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:29,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467420480] [2022-12-06 07:26:29,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467420480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:29,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:29,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:29,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110945059] [2022-12-06 07:26:29,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:29,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:29,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:29,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:29,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:29,832 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:29,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:29,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:29,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:29,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:29,873 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:29,873 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:29,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:29,874 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:29,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:29,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:29,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:29,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:29,874 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:29,874 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:29,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:29,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:29,875 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:29,875 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:29,875 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:29,875 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:29,875 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:29,876 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:29,876 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:29,876 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:29,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:29,878 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:29,878 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:29,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:29,878 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:29,878 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:29,955 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:29,956 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:26:29,956 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:29,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:29,956 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:29,956 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:29,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable306 [2022-12-06 07:26:29,956 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-06 07:26:29,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:29,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1579517714, now seen corresponding path program 1 times [2022-12-06 07:26:29,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:29,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229999163] [2022-12-06 07:26:29,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:29,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:30,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:30,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:30,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229999163] [2022-12-06 07:26:30,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229999163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:30,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:30,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:30,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326334906] [2022-12-06 07:26:30,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:30,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:30,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:30,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:30,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:30,029 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:30,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:30,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:30,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:30,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:30,071 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:30,071 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:30,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:30,071 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:30,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:30,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:30,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:30,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:30,072 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:30,072 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:30,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:30,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:30,073 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:30,073 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:30,073 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:30,073 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:30,073 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:30,074 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:30,074 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:30,074 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:30,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:30,077 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:30,077 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:30,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:30,077 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:30,078 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:30,159 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:30,159 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-06 07:26:30,159 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:30,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:30,159 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:30,159 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:30,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable307 [2022-12-06 07:26:30,160 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-06 07:26:30,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:30,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1606299823, now seen corresponding path program 1 times [2022-12-06 07:26:30,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:30,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631310445] [2022-12-06 07:26:30,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:30,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:30,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-06 07:26:30,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:30,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631310445] [2022-12-06 07:26:30,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631310445] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:30,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:30,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:30,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924075405] [2022-12-06 07:26:30,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:30,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:30,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:30,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:30,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:30,218 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:30,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:30,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:30,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:30,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:30,254 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:30,255 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:30,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:30,255 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:30,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:30,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:30,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:30,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:30,256 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:30,256 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:30,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:30,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:30,256 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:30,256 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:30,257 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:30,257 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:30,257 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:30,257 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:30,257 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:30,257 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:30,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:30,259 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:30,259 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:30,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:30,260 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:30,260 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:30,331 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:30,332 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:26:30,332 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:30,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:30,332 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:30,332 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:30,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable308 [2022-12-06 07:26:30,332 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-06 07:26:30,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:30,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1636776016, now seen corresponding path program 1 times [2022-12-06 07:26:30,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:30,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690010211] [2022-12-06 07:26:30,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:30,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:30,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:30,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-06 07:26:30,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:30,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690010211] [2022-12-06 07:26:30,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690010211] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:30,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:30,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:30,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438260587] [2022-12-06 07:26:30,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:30,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:30,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:30,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:30,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:30,387 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:30,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:30,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:30,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:30,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:30,424 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:30,424 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:30,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:30,424 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:30,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:30,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:30,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:30,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:30,425 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:30,425 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:30,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:30,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:30,426 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:30,426 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:30,426 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:30,426 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:30,426 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:30,426 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:30,426 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:30,426 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:30,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:30,428 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:30,429 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:30,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:30,429 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:30,429 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:30,502 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:30,503 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:30,503 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:30,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:30,503 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:30,503 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:30,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable309 [2022-12-06 07:26:30,503 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-06 07:26:30,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:30,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1663558125, now seen corresponding path program 1 times [2022-12-06 07:26:30,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:30,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685090192] [2022-12-06 07:26:30,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:30,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:30,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-06 07:26:30,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:30,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685090192] [2022-12-06 07:26:30,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685090192] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:30,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:30,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:30,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173202471] [2022-12-06 07:26:30,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:30,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:30,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:30,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:30,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:30,568 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:30,568 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:30,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:30,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:30,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:30,609 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:30,609 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:30,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 371 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:30,610 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:30,610 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:30,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:30,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:30,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:30,610 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:30,610 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:30,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:30,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:30,611 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:30,611 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:30,611 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:30,611 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:30,611 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:30,611 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:30,611 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:30,612 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:30,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:30,614 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:30,614 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:30,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:30,614 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:30,614 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:30,687 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:30,687 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:30,687 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:30,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:30,687 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:30,687 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:30,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable310 [2022-12-06 07:26:30,687 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-06 07:26:30,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:30,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1694034318, now seen corresponding path program 1 times [2022-12-06 07:26:30,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:30,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218239071] [2022-12-06 07:26:30,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:30,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:30,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-06 07:26:30,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:30,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218239071] [2022-12-06 07:26:30,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218239071] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:30,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:30,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:30,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808476902] [2022-12-06 07:26:30,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:30,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:30,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:30,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:30,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:30,761 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:30,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:30,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:30,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:30,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:30,812 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:30,812 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:30,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:30,812 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:30,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:30,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:30,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:30,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:30,813 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:30,813 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:30,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:30,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:30,814 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:30,814 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:30,814 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:30,814 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:30,815 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:30,815 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:30,815 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:30,815 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:30,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:30,818 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:30,818 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:30,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 116 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:30,818 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:30,818 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:30,915 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:30,915 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-06 07:26:30,915 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:30,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:30,915 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:30,916 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:30,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable311 [2022-12-06 07:26:30,916 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-06 07:26:30,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:30,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1720816427, now seen corresponding path program 1 times [2022-12-06 07:26:30,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:30,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523401520] [2022-12-06 07:26:30,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:30,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:30,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-06 07:26:30,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:30,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523401520] [2022-12-06 07:26:30,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523401520] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:30,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:30,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:30,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695457749] [2022-12-06 07:26:30,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:30,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:30,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:30,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:30,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:30,997 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:30,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:30,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:30,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:30,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:31,052 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:31,053 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:31,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:31,053 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:31,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:31,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:31,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:31,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:31,054 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:31,054 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:31,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:31,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:31,055 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:31,055 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:31,055 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:31,055 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:31,055 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:31,056 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:31,056 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:31,056 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:31,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:31,059 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:31,059 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:31,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:31,059 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:31,060 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:31,136 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:31,136 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:26:31,137 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:31,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:31,137 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:31,137 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:31,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable312 [2022-12-06 07:26:31,137 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-06 07:26:31,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:31,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1751292620, now seen corresponding path program 1 times [2022-12-06 07:26:31,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:31,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131383645] [2022-12-06 07:26:31,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:31,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:31,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-06 07:26:31,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:31,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131383645] [2022-12-06 07:26:31,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131383645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:31,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:31,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:31,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299663888] [2022-12-06 07:26:31,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:31,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:31,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:31,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:31,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:31,211 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:31,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:31,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:31,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:31,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:31,264 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:31,265 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:31,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:31,265 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:31,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:31,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:31,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:31,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:31,266 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:31,266 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:31,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:31,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:31,267 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:31,267 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:31,267 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:31,268 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:31,268 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:31,268 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:31,268 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:31,268 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:31,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:31,271 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:31,271 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:31,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:31,272 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:31,272 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:31,362 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:31,363 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 07:26:31,363 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:31,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:31,363 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:31,363 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:31,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable313 [2022-12-06 07:26:31,363 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-06 07:26:31,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:31,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1778074729, now seen corresponding path program 1 times [2022-12-06 07:26:31,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:31,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362954432] [2022-12-06 07:26:31,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:31,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:31,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-06 07:26:31,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:31,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362954432] [2022-12-06 07:26:31,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362954432] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:31,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:31,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:31,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384262538] [2022-12-06 07:26:31,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:31,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:31,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:31,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:31,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:31,454 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:31,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:31,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:31,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:31,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:31,494 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:31,495 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:31,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:31,495 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:31,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:31,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:31,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:31,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:31,496 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:31,496 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:31,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:31,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:31,497 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:31,497 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:31,497 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:31,497 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:31,497 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:31,497 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:31,497 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:31,497 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:31,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:31,500 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:31,500 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:31,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:31,501 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:31,501 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:31,577 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:31,577 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:26:31,577 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:31,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:31,577 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:31,577 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:31,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable314 [2022-12-06 07:26:31,577 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-06 07:26:31,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:31,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1808550922, now seen corresponding path program 1 times [2022-12-06 07:26:31,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:31,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740097539] [2022-12-06 07:26:31,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:31,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:31,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-06 07:26:31,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:31,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740097539] [2022-12-06 07:26:31,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740097539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:31,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:31,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:31,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901793042] [2022-12-06 07:26:31,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:31,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:31,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:31,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:31,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:31,639 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:31,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:31,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:31,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:31,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:31,683 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:31,683 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:31,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:31,684 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:31,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:31,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:31,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:31,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:31,684 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:31,685 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:31,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:31,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:31,686 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:31,686 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:31,686 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:31,686 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:31,686 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:31,686 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:31,686 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:31,687 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:31,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:31,690 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:31,690 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:31,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:31,690 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:31,690 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:31,776 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:31,776 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-06 07:26:31,776 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:31,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:31,776 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:31,777 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:31,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable315 [2022-12-06 07:26:31,777 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-06 07:26:31,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:31,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1835333031, now seen corresponding path program 1 times [2022-12-06 07:26:31,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:31,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354154870] [2022-12-06 07:26:31,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:31,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:31,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-06 07:26:31,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:31,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354154870] [2022-12-06 07:26:31,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354154870] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:31,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:31,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:31,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179417663] [2022-12-06 07:26:31,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:31,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:31,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:31,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:31,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:31,849 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:31,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:31,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:31,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:31,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:31,901 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:31,901 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:31,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:31,902 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:31,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:31,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:31,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:31,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:31,903 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:31,903 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:31,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:31,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:31,904 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:31,904 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:31,904 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:31,904 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:31,904 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:31,904 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:31,904 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:31,905 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:31,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:31,908 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:31,908 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:31,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:31,908 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:31,908 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:32,001 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:32,001 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 07:26:32,001 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:32,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:32,002 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:32,002 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:32,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable316 [2022-12-06 07:26:32,002 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-06 07:26:32,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:32,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1865809224, now seen corresponding path program 1 times [2022-12-06 07:26:32,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:32,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741636617] [2022-12-06 07:26:32,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:32,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:32,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-06 07:26:32,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:32,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741636617] [2022-12-06 07:26:32,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741636617] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:32,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:32,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:32,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295612542] [2022-12-06 07:26:32,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:32,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:32,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:32,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:32,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:32,080 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:32,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:32,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:32,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:32,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:32,128 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:32,129 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:32,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:32,129 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:32,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:32,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:32,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:32,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:32,130 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:32,130 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:32,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:32,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:32,131 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:32,131 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:32,131 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:32,131 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:32,131 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:32,131 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:32,131 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:32,131 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:32,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:32,134 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:32,134 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:32,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:32,134 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:32,134 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:32,207 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:32,208 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:32,208 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:32,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:32,208 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:32,208 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:32,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable317 [2022-12-06 07:26:32,208 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-06 07:26:32,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:32,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1892591333, now seen corresponding path program 1 times [2022-12-06 07:26:32,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:32,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724351777] [2022-12-06 07:26:32,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:32,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:32,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:32,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-06 07:26:32,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:32,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724351777] [2022-12-06 07:26:32,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724351777] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:32,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:32,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:32,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23056] [2022-12-06 07:26:32,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:32,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:32,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:32,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:32,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:32,278 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:32,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:32,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:32,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:32,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:32,319 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:32,319 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:32,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 356 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:32,320 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:32,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:32,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:32,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:32,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:32,320 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:32,320 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:32,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:32,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:32,321 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:32,321 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:32,321 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:32,321 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:32,321 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:32,321 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:32,322 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:32,322 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:32,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:32,325 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:32,325 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:32,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:32,325 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:32,325 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:32,401 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:32,401 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:26:32,401 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:32,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:32,401 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:32,402 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:32,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable318 [2022-12-06 07:26:32,402 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-06 07:26:32,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:32,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1923067526, now seen corresponding path program 1 times [2022-12-06 07:26:32,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:32,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124398052] [2022-12-06 07:26:32,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:32,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:32,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-06 07:26:32,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:32,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124398052] [2022-12-06 07:26:32,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124398052] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:32,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:32,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:32,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537380326] [2022-12-06 07:26:32,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:32,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:32,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:32,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:32,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:32,462 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:32,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:32,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:32,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:32,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:32,500 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:32,500 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:32,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:32,500 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:32,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:32,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:32,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:32,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:32,501 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:32,501 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:32,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:32,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:32,502 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:32,502 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:32,502 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:32,502 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:32,502 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:32,502 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:32,502 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:32,503 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:32,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:32,505 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:32,505 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:32,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:32,506 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:32,506 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:32,581 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:32,582 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:26:32,582 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:32,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:32,582 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:32,582 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:32,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable319 [2022-12-06 07:26:32,582 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-06 07:26:32,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:32,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1949849635, now seen corresponding path program 1 times [2022-12-06 07:26:32,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:32,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186356044] [2022-12-06 07:26:32,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:32,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:32,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-06 07:26:32,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:32,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186356044] [2022-12-06 07:26:32,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186356044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:32,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:32,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:32,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987239825] [2022-12-06 07:26:32,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:32,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:32,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:32,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:32,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:32,641 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:32,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:32,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:32,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:32,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:32,677 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:32,677 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:32,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:32,678 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:32,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:32,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:32,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:32,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:32,678 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:32,678 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:32,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:32,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:32,679 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:32,679 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:32,679 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:32,680 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:32,680 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:32,680 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:32,680 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:32,680 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:32,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:32,682 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:32,682 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:32,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:32,682 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:32,682 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:32,757 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:32,758 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:26:32,758 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:32,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:32,758 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:32,758 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:32,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable320 [2022-12-06 07:26:32,758 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-06 07:26:32,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:32,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1980325828, now seen corresponding path program 1 times [2022-12-06 07:26:32,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:32,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422252946] [2022-12-06 07:26:32,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:32,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:32,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-06 07:26:32,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:32,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422252946] [2022-12-06 07:26:32,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422252946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:32,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:32,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:32,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709633164] [2022-12-06 07:26:32,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:32,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:32,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:32,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:32,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:32,816 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:32,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:32,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:32,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:32,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:32,851 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:32,852 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:32,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:32,852 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:32,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:32,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:32,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:32,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:32,853 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:32,853 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:32,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:32,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:32,853 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:32,853 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:32,854 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:32,854 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:32,854 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:32,854 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:32,854 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:32,854 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:32,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:32,856 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:32,856 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:32,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:32,857 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:32,857 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:32,932 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:32,933 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:26:32,933 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:32,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:32,933 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:32,933 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:32,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable321 [2022-12-06 07:26:32,933 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-06 07:26:32,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:32,933 INFO L85 PathProgramCache]: Analyzing trace with hash 2007107937, now seen corresponding path program 1 times [2022-12-06 07:26:32,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:32,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012145210] [2022-12-06 07:26:32,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:32,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:32,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-06 07:26:32,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:32,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012145210] [2022-12-06 07:26:32,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012145210] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:32,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:32,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:33,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128393935] [2022-12-06 07:26:33,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:33,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:33,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:33,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:33,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:33,000 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:33,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:33,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:33,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:33,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:33,042 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:33,042 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:33,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:33,043 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:33,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:33,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:33,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:33,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:33,043 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:33,043 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:33,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:33,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:33,044 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:33,044 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:33,044 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:33,044 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:33,044 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:33,045 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:33,045 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:33,045 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:33,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:33,047 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:33,047 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:33,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:33,047 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:33,047 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:33,121 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:33,121 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:33,122 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:33,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:33,122 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:33,122 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:33,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable322 [2022-12-06 07:26:33,122 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-06 07:26:33,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:33,122 INFO L85 PathProgramCache]: Analyzing trace with hash 2037584130, now seen corresponding path program 1 times [2022-12-06 07:26:33,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:33,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502309766] [2022-12-06 07:26:33,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:33,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:33,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-06 07:26:33,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:33,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502309766] [2022-12-06 07:26:33,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502309766] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:33,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:33,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:33,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224997811] [2022-12-06 07:26:33,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:33,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:33,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:33,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:33,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:33,180 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:33,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:33,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:33,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:33,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:33,218 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:33,219 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:33,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:33,219 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:33,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:33,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:33,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:33,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:33,220 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:33,220 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:33,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:33,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:33,220 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:33,221 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:33,221 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:33,221 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:33,221 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:33,221 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:33,221 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:33,221 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:33,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:33,223 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:33,223 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:33,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:33,224 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:33,224 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:33,296 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:33,296 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:26:33,296 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:33,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:33,296 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:33,296 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:33,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable323 [2022-12-06 07:26:33,297 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-06 07:26:33,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:33,297 INFO L85 PathProgramCache]: Analyzing trace with hash 2064366239, now seen corresponding path program 1 times [2022-12-06 07:26:33,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:33,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542592220] [2022-12-06 07:26:33,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:33,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:33,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-06 07:26:33,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:33,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542592220] [2022-12-06 07:26:33,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542592220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:33,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:33,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:33,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700826675] [2022-12-06 07:26:33,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:33,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:33,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:33,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:33,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:33,355 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:33,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:33,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:33,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:33,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:33,391 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:33,391 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:33,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:33,391 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:33,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:33,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:33,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:33,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:33,392 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:33,392 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:33,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:33,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:33,393 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:33,393 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:33,393 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:33,393 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:33,393 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:33,393 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:33,393 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:33,393 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:33,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:33,396 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:33,396 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:33,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:33,396 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:33,396 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:33,469 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:33,470 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:33,470 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:33,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:33,470 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:33,470 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:33,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable324 [2022-12-06 07:26:33,470 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-06 07:26:33,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:33,470 INFO L85 PathProgramCache]: Analyzing trace with hash 2094842432, now seen corresponding path program 1 times [2022-12-06 07:26:33,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:33,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136138718] [2022-12-06 07:26:33,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:33,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:33,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:33,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-06 07:26:33,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:33,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136138718] [2022-12-06 07:26:33,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136138718] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:33,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:33,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:33,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187396649] [2022-12-06 07:26:33,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:33,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:33,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:33,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:33,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:33,526 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:33,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:33,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:33,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:33,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:33,568 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:33,568 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:33,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:33,568 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:33,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:33,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:33,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:33,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:33,569 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:33,569 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:33,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:33,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:33,570 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:33,570 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:33,570 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:33,570 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:33,570 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:33,570 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:33,570 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:33,570 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:33,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:33,572 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:33,572 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:33,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:33,573 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:33,573 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:33,646 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:33,647 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:33,647 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:33,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:33,647 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:33,647 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:33,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable325 [2022-12-06 07:26:33,647 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-06 07:26:33,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:33,647 INFO L85 PathProgramCache]: Analyzing trace with hash 2121624541, now seen corresponding path program 1 times [2022-12-06 07:26:33,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:33,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017836660] [2022-12-06 07:26:33,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:33,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:33,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-06 07:26:33,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:33,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017836660] [2022-12-06 07:26:33,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017836660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:33,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:33,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:33,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617497159] [2022-12-06 07:26:33,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:33,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:33,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:33,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:33,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:33,724 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:33,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:33,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:33,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:33,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:33,767 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:33,768 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:33,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 372 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:33,768 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:33,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:33,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:33,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:33,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:33,769 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:33,769 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:33,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:33,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:33,770 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:33,770 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:33,770 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:33,770 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:33,770 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:33,770 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:33,770 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:33,771 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:33,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:33,774 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:33,774 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:33,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:33,774 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:33,774 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:33,860 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:33,861 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-06 07:26:33,861 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:33,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:33,861 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:33,861 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:33,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable326 [2022-12-06 07:26:33,861 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-06 07:26:33,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:33,861 INFO L85 PathProgramCache]: Analyzing trace with hash -2142866562, now seen corresponding path program 1 times [2022-12-06 07:26:33,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:33,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379961452] [2022-12-06 07:26:33,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:33,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:33,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-06 07:26:33,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:33,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379961452] [2022-12-06 07:26:33,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379961452] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:33,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:33,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:33,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063105462] [2022-12-06 07:26:33,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:33,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:33,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:33,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:33,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:33,920 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:33,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:33,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:33,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:33,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:33,973 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:33,973 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:33,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:33,973 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:33,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:33,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:33,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:33,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:33,974 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:33,974 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:33,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:33,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:33,975 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:33,975 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:33,975 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:33,975 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:33,975 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:33,975 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:33,975 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:33,976 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:33,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:33,978 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:33,978 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:33,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:33,978 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:33,978 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:34,052 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:34,052 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:34,052 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:34,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:34,052 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:34,052 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:34,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable327 [2022-12-06 07:26:34,052 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-06 07:26:34,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:34,053 INFO L85 PathProgramCache]: Analyzing trace with hash -2116084453, now seen corresponding path program 1 times [2022-12-06 07:26:34,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:34,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933401578] [2022-12-06 07:26:34,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:34,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:34,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:34,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:34,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933401578] [2022-12-06 07:26:34,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933401578] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:34,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:34,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:34,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605694229] [2022-12-06 07:26:34,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:34,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:34,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:34,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:34,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:34,113 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:34,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:34,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:34,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:34,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:34,154 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:34,155 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:34,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:34,155 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:34,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:34,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:34,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:34,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:34,156 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:34,156 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:34,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:34,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:34,157 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:34,157 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:34,157 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:34,157 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:34,157 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:34,157 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:34,157 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:34,157 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:34,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:34,159 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:34,159 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:34,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:34,160 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:34,160 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:34,233 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:34,234 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:34,234 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:34,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:34,234 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:34,234 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:34,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable328 [2022-12-06 07:26:34,234 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-06 07:26:34,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:34,234 INFO L85 PathProgramCache]: Analyzing trace with hash -2085608260, now seen corresponding path program 1 times [2022-12-06 07:26:34,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:34,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537563144] [2022-12-06 07:26:34,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:34,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:34,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-06 07:26:34,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:34,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537563144] [2022-12-06 07:26:34,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537563144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:34,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:34,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:34,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145840640] [2022-12-06 07:26:34,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:34,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:34,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:34,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:34,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:34,292 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:34,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:34,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:34,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:34,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:34,332 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:34,333 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:34,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:34,333 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:34,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:34,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:34,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:34,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:34,334 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:34,334 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:34,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:34,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:34,334 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:34,334 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:34,335 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:34,335 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:34,335 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:34,335 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:34,335 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:34,335 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:34,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:34,337 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:34,337 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:34,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:34,338 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:34,338 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:34,411 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:34,411 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:34,411 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:34,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:34,411 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:34,412 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:34,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable329 [2022-12-06 07:26:34,412 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-06 07:26:34,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:34,412 INFO L85 PathProgramCache]: Analyzing trace with hash -2058826151, now seen corresponding path program 1 times [2022-12-06 07:26:34,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:34,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877385948] [2022-12-06 07:26:34,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:34,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:34,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-06 07:26:34,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:34,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877385948] [2022-12-06 07:26:34,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877385948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:34,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:34,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:34,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218659745] [2022-12-06 07:26:34,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:34,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:34,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:34,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:34,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:34,471 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:34,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:34,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:34,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:34,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:34,512 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:34,512 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:34,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:34,513 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:34,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:34,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:34,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:34,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:34,513 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:34,513 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:34,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:34,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:34,514 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:34,514 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:34,514 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:34,514 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:34,515 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:34,515 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:34,515 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:34,515 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:34,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:34,518 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:34,518 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:34,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:34,519 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:34,519 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:34,602 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:34,603 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 07:26:34,603 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:34,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:34,603 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:34,603 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:34,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable330 [2022-12-06 07:26:34,603 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-06 07:26:34,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:34,603 INFO L85 PathProgramCache]: Analyzing trace with hash -2028349958, now seen corresponding path program 1 times [2022-12-06 07:26:34,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:34,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020939423] [2022-12-06 07:26:34,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:34,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:34,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-06 07:26:34,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:34,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020939423] [2022-12-06 07:26:34,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020939423] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:34,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:34,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:34,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889844970] [2022-12-06 07:26:34,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:34,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:34,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:34,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:34,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:34,660 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:34,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:34,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:34,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:34,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:34,695 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:34,695 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:34,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:34,696 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:34,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:34,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:34,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:34,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:34,696 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:34,696 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:34,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:34,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:34,697 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:34,697 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:34,697 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:34,697 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:34,697 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:34,698 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:34,698 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:34,698 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:34,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:34,700 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:34,700 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:34,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:34,700 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:34,700 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:34,773 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:34,774 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:34,774 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:34,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:34,774 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:34,774 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:34,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable331 [2022-12-06 07:26:34,774 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-06 07:26:34,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:34,774 INFO L85 PathProgramCache]: Analyzing trace with hash -2001567849, now seen corresponding path program 1 times [2022-12-06 07:26:34,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:34,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278579793] [2022-12-06 07:26:34,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:34,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:34,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:34,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:34,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:34,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278579793] [2022-12-06 07:26:34,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278579793] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:34,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:34,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:34,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300605950] [2022-12-06 07:26:34,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:34,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:34,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:34,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:34,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:34,833 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:34,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:34,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:34,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:34,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:34,869 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:34,869 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:34,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:34,869 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:34,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:34,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:34,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:34,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:34,870 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:34,870 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:34,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:34,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:34,870 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:34,871 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:34,871 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:34,871 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:34,871 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:34,871 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:34,871 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:34,871 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:34,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:34,873 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:34,873 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:34,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:34,874 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:34,874 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:34,950 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:34,950 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:26:34,950 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:34,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:34,950 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:34,950 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:34,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable332 [2022-12-06 07:26:34,950 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-06 07:26:34,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:34,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1971091656, now seen corresponding path program 1 times [2022-12-06 07:26:34,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:34,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403138610] [2022-12-06 07:26:34,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:34,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:35,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-06 07:26:35,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:35,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403138610] [2022-12-06 07:26:35,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403138610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:35,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:35,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:35,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939373875] [2022-12-06 07:26:35,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:35,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:35,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:35,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:35,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:35,006 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:35,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:35,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:35,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:35,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:35,049 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:35,049 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:35,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:35,049 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:35,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:35,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:35,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:35,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:35,050 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:35,050 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:35,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:35,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:35,051 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:35,051 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:35,051 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:35,052 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:35,052 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:35,052 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:35,052 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:35,052 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:35,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:35,055 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:35,055 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:35,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:35,056 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:35,056 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:35,142 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:35,143 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-06 07:26:35,143 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:35,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:35,143 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:35,143 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:35,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable333 [2022-12-06 07:26:35,143 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-06 07:26:35,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:35,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1944309547, now seen corresponding path program 1 times [2022-12-06 07:26:35,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:35,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218504975] [2022-12-06 07:26:35,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:35,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:35,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:35,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:35,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218504975] [2022-12-06 07:26:35,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218504975] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:35,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:35,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:35,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823996071] [2022-12-06 07:26:35,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:35,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:35,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:35,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:35,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:35,221 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:35,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:35,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:35,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:35,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:35,270 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:35,270 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:35,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 376 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:35,271 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:35,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:35,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:35,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:35,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:35,272 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:35,272 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:35,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:35,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:35,273 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:35,273 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:35,273 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:35,273 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:35,273 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:35,274 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:35,274 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:35,274 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:35,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:35,277 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:35,277 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:35,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:35,277 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:35,277 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:35,380 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:35,380 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-06 07:26:35,380 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:35,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:35,381 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:35,381 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:35,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable334 [2022-12-06 07:26:35,381 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-06 07:26:35,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:35,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1913833354, now seen corresponding path program 1 times [2022-12-06 07:26:35,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:35,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596571732] [2022-12-06 07:26:35,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:35,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:35,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-06 07:26:35,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:35,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596571732] [2022-12-06 07:26:35,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596571732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:35,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:35,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:35,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704410918] [2022-12-06 07:26:35,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:35,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:35,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:35,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:35,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:35,438 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:35,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:35,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:35,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:35,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:35,474 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:35,475 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:35,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:35,475 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:35,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:35,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:35,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:35,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:35,476 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:35,476 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:35,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:35,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:35,476 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:35,476 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:35,477 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:35,477 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:35,477 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:35,477 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:35,477 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:35,477 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:35,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:35,479 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:35,479 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:35,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:35,480 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:35,480 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:35,552 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:35,552 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:26:35,552 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:35,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:35,552 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:35,552 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:35,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable335 [2022-12-06 07:26:35,553 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-06 07:26:35,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:35,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1887051245, now seen corresponding path program 1 times [2022-12-06 07:26:35,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:35,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763399235] [2022-12-06 07:26:35,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:35,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:35,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-06 07:26:35,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:35,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763399235] [2022-12-06 07:26:35,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763399235] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:35,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:35,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:35,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521066302] [2022-12-06 07:26:35,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:35,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:35,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:35,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:35,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:35,630 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:35,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:35,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:35,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:35,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:35,682 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:35,683 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:35,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:35,683 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:35,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:35,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:35,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:35,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:35,684 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:35,684 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:35,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:35,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:35,685 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:35,685 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:35,686 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:35,686 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:35,686 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:35,686 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:35,686 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:35,686 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:35,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:35,689 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:35,689 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:35,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:35,690 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:35,690 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:35,768 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:35,768 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:26:35,768 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:35,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:35,768 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:35,768 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:35,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable336 [2022-12-06 07:26:35,769 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-06 07:26:35,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:35,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1856575052, now seen corresponding path program 1 times [2022-12-06 07:26:35,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:35,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639632663] [2022-12-06 07:26:35,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:35,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:35,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:35,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:35,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639632663] [2022-12-06 07:26:35,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639632663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:35,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:35,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:35,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014061422] [2022-12-06 07:26:35,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:35,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:35,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:35,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:35,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:35,825 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:35,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:35,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:35,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:35,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:35,868 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:35,868 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:35,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:35,869 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:35,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:35,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:35,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:35,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:35,869 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:35,869 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:35,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:35,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:35,870 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:35,870 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:35,870 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:35,870 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:35,870 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:35,870 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:35,871 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:35,871 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:35,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:35,873 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:35,873 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:35,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:35,873 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:35,873 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:35,945 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:35,945 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:26:35,946 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:35,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:35,946 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:35,946 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:35,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable337 [2022-12-06 07:26:35,946 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-06 07:26:35,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:35,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1829792943, now seen corresponding path program 1 times [2022-12-06 07:26:35,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:35,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265449788] [2022-12-06 07:26:35,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:35,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:36,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:36,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:36,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265449788] [2022-12-06 07:26:36,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265449788] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:36,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:36,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:36,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513369146] [2022-12-06 07:26:36,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:36,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:36,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:36,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:36,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:36,007 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:36,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:36,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:36,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:36,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:36,055 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:36,055 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:36,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:36,056 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:36,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:36,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:36,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:36,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:36,056 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:36,056 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:36,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:36,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:36,057 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:36,057 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:36,057 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:36,057 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:36,057 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:36,057 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:36,058 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:36,058 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:36,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:36,060 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:36,060 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:36,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:36,060 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:36,060 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:36,134 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:36,135 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:26:36,135 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:36,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:36,135 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:36,135 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:36,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable338 [2022-12-06 07:26:36,135 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-06 07:26:36,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:36,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1799316750, now seen corresponding path program 1 times [2022-12-06 07:26:36,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:36,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239487725] [2022-12-06 07:26:36,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:36,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:36,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-06 07:26:36,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:36,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239487725] [2022-12-06 07:26:36,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239487725] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:36,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:36,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:36,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551243704] [2022-12-06 07:26:36,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:36,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:36,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:36,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:36,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:36,215 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:36,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:36,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:36,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:36,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:36,257 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:36,257 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:36,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:36,257 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:36,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:36,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:36,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:36,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:36,258 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:36,258 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:36,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:36,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:36,258 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:36,259 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:36,259 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:36,259 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:36,259 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:36,259 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:36,259 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:36,259 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:36,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:36,261 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:36,261 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:36,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:36,262 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:36,262 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:36,349 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:36,350 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-06 07:26:36,350 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:36,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:36,350 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:36,350 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:36,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable339 [2022-12-06 07:26:36,350 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-06 07:26:36,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:36,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1772534641, now seen corresponding path program 1 times [2022-12-06 07:26:36,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:36,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482839396] [2022-12-06 07:26:36,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:36,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:36,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-06 07:26:36,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:36,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482839396] [2022-12-06 07:26:36,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482839396] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:36,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:36,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:36,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119743605] [2022-12-06 07:26:36,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:36,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:36,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:36,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:36,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:36,412 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:36,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:36,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:36,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:36,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:36,448 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:36,448 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:36,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:36,448 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:36,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:36,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:36,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:36,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:36,449 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:36,449 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:36,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:36,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:36,450 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:36,450 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:36,450 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:36,450 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:36,450 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:36,450 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:36,450 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:36,451 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:36,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:36,453 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:36,453 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:36,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:36,453 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:36,453 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:36,525 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:36,526 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:36,526 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:36,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:36,526 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:36,526 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:36,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable340 [2022-12-06 07:26:36,526 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-06 07:26:36,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:36,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1742058448, now seen corresponding path program 1 times [2022-12-06 07:26:36,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:36,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972587507] [2022-12-06 07:26:36,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:36,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:36,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-06 07:26:36,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:36,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972587507] [2022-12-06 07:26:36,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972587507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:36,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:36,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:36,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597922974] [2022-12-06 07:26:36,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:36,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:36,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:36,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:36,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:36,591 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:36,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:36,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:36,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:36,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:36,632 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:36,632 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:36,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:36,633 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:36,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:36,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:36,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:36,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:36,633 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:36,633 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:36,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:36,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:36,634 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:36,634 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:36,635 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:36,635 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:36,635 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:36,635 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:36,635 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:36,635 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:36,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:36,638 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:36,639 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:36,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:36,639 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:36,639 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:36,721 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:36,722 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 07:26:36,722 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:36,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:36,722 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:36,722 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:36,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable341 [2022-12-06 07:26:36,722 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-06 07:26:36,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:36,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1715276339, now seen corresponding path program 1 times [2022-12-06 07:26:36,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:36,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968326384] [2022-12-06 07:26:36,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:36,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:36,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:36,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-06 07:26:36,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:36,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968326384] [2022-12-06 07:26:36,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968326384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:36,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:36,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:36,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577585477] [2022-12-06 07:26:36,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:36,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:36,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:36,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:36,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:36,799 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:36,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:36,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:36,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:36,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:36,846 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:36,847 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:36,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:36,847 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:36,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:36,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:36,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:36,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:36,848 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:36,848 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:36,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:36,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:36,849 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:36,849 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:36,849 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:36,850 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:36,850 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:36,850 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:36,850 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:36,850 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:36,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:36,853 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:36,853 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:36,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:36,854 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:36,854 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:36,945 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:36,946 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:26:36,946 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:36,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:36,946 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:36,946 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:36,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable342 [2022-12-06 07:26:36,947 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-06 07:26:36,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:36,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1684800146, now seen corresponding path program 1 times [2022-12-06 07:26:36,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:36,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293531898] [2022-12-06 07:26:36,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:36,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:37,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-06 07:26:37,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:37,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293531898] [2022-12-06 07:26:37,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293531898] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:37,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:37,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:37,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381580686] [2022-12-06 07:26:37,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:37,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:37,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:37,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:37,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:37,038 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:37,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:37,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:37,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:37,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:37,081 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:37,082 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:37,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:37,082 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:37,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:37,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:37,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:37,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:37,083 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:37,083 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:37,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:37,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:37,083 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:37,084 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:37,084 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:37,084 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:37,084 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:37,084 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:37,084 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:37,084 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:37,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:37,087 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:37,088 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:37,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:37,088 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:37,088 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:37,184 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:37,184 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 07:26:37,184 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:37,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:37,185 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:37,185 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:37,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable343 [2022-12-06 07:26:37,185 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-06 07:26:37,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:37,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1658018037, now seen corresponding path program 1 times [2022-12-06 07:26:37,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:37,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445214120] [2022-12-06 07:26:37,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:37,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:37,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26: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-06 07:26:37,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:37,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445214120] [2022-12-06 07:26:37,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445214120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:37,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:37,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:37,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824523350] [2022-12-06 07:26:37,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:37,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:37,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:37,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:37,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:37,262 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:37,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:37,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:37,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:37,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:37,302 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:37,302 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:37,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:37,303 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:37,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:37,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:37,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:37,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:37,303 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:37,303 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:37,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:37,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:37,304 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:37,304 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:37,304 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:37,304 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:37,304 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:37,305 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:37,305 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:37,305 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:37,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:37,307 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:37,307 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:37,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:37,307 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:37,307 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:37,380 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:37,381 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:37,381 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:37,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:37,381 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:37,381 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:37,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable344 [2022-12-06 07:26:37,381 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-06 07:26:37,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:37,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1627541844, now seen corresponding path program 1 times [2022-12-06 07:26:37,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:37,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155228147] [2022-12-06 07:26:37,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:37,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:37,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:37,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-06 07:26:37,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:37,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155228147] [2022-12-06 07:26:37,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155228147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:37,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:37,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:37,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383378262] [2022-12-06 07:26:37,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:37,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:37,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:37,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:37,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:37,438 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:37,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:37,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:37,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:37,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:37,474 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:37,474 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:37,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:37,474 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:37,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:37,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:37,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:37,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:37,475 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:37,475 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:37,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:37,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:37,476 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:37,476 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:37,476 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:37,476 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:37,476 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:37,476 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:37,476 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:37,476 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:37,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:37,478 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:37,478 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:37,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:37,479 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:37,479 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:37,551 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:37,552 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:37,552 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:37,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:37,552 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:37,552 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:37,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable345 [2022-12-06 07:26:37,552 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-06 07:26:37,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:37,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1600759735, now seen corresponding path program 1 times [2022-12-06 07:26:37,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:37,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822923466] [2022-12-06 07:26:37,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:37,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:37,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:37,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:37,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822923466] [2022-12-06 07:26:37,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822923466] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:37,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:37,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:37,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422056948] [2022-12-06 07:26:37,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:37,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:37,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:37,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:37,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:37,611 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:37,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:37,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:37,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:37,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:37,652 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:37,652 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:37,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:37,653 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:37,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:37,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:37,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:37,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:37,653 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:37,653 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:37,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:37,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:37,654 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:37,654 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:37,654 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:37,654 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:37,654 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:37,654 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:37,655 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:37,655 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:37,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:37,657 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:37,657 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:37,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:37,657 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:37,657 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:37,731 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:37,731 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:37,731 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:37,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:37,731 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:37,732 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:37,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable346 [2022-12-06 07:26:37,732 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-06 07:26:37,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:37,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1570283542, now seen corresponding path program 1 times [2022-12-06 07:26:37,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:37,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652379984] [2022-12-06 07:26:37,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:37,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:37,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-06 07:26:37,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:37,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652379984] [2022-12-06 07:26:37,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652379984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:37,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:37,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:37,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519187007] [2022-12-06 07:26:37,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:37,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:37,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:37,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:37,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:37,795 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:37,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:37,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:37,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:37,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:37,831 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:37,831 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:37,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:37,832 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:37,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:37,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:37,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:37,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:37,832 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:37,833 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:37,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:37,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:37,833 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:37,833 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:37,833 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:37,834 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:37,834 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:37,834 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:37,834 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:37,834 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:37,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:37,836 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:37,836 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:37,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:37,836 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:37,836 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:37,909 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:37,909 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:26:37,909 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:37,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:37,909 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:37,909 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:37,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable347 [2022-12-06 07:26:37,909 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-06 07:26:37,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:37,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1543501433, now seen corresponding path program 1 times [2022-12-06 07:26:37,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:37,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483491841] [2022-12-06 07:26:37,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:37,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:37,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-06 07:26:37,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:37,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483491841] [2022-12-06 07:26:37,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483491841] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:37,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:37,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:37,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79182019] [2022-12-06 07:26:37,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:37,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:37,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:37,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:37,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:37,967 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:37,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:37,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:37,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:37,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:38,003 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:38,003 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:38,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:38,004 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:38,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:38,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:38,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:38,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:38,004 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:38,004 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:38,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:38,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:38,005 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:38,005 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:38,005 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:38,005 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:38,005 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:38,005 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:38,005 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:38,006 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:38,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:38,008 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:38,008 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:38,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:38,008 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:38,008 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:38,081 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:38,081 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:38,081 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:38,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:38,081 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:38,081 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:38,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable348 [2022-12-06 07:26:38,081 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-06 07:26:38,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:38,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1513025240, now seen corresponding path program 1 times [2022-12-06 07:26:38,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:38,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855853432] [2022-12-06 07:26:38,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:38,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:38,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-06 07:26:38,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:38,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855853432] [2022-12-06 07:26:38,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855853432] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:38,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:38,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:38,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228983550] [2022-12-06 07:26:38,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:38,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:38,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:38,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:38,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:38,138 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:38,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:38,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:38,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:38,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:38,180 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:38,180 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:38,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:38,180 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:38,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:38,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:38,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:38,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:38,181 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:38,181 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:38,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:38,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:38,181 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:38,182 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:38,182 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:38,182 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:38,182 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:38,182 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:38,182 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:38,182 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:38,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:38,185 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:38,185 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:38,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:38,185 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:38,185 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:38,257 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:38,258 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:38,258 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:38,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:38,258 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:38,258 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:38,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable349 [2022-12-06 07:26:38,258 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-06 07:26:38,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:38,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1486243131, now seen corresponding path program 1 times [2022-12-06 07:26:38,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:38,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787658779] [2022-12-06 07:26:38,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:38,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:38,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-06 07:26:38,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:38,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787658779] [2022-12-06 07:26:38,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787658779] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:38,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:38,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:38,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911759625] [2022-12-06 07:26:38,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:38,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:38,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:38,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:38,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:38,319 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:38,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:38,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:38,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:38,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:38,355 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:38,355 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:38,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 356 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:38,355 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:38,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:38,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:38,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:38,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:38,356 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:38,356 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:38,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:38,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:38,356 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:38,357 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:38,357 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:38,357 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:38,357 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:38,357 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:38,357 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:38,357 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:38,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:38,359 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:38,359 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:38,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:38,360 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:38,360 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:38,433 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:38,433 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:38,434 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:38,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:38,434 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:38,434 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:38,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable350 [2022-12-06 07:26:38,434 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-06 07:26:38,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:38,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1455766938, now seen corresponding path program 1 times [2022-12-06 07:26:38,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:38,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530838268] [2022-12-06 07:26:38,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:38,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:38,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-06 07:26:38,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:38,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530838268] [2022-12-06 07:26:38,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530838268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:38,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:38,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:38,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992127673] [2022-12-06 07:26:38,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:38,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:38,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:38,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:38,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:38,516 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:38,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:38,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:38,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:38,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:38,568 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:38,569 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:38,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:38,569 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:38,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:38,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:38,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:38,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:38,570 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:38,570 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:38,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:38,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:38,571 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:38,571 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:38,571 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:38,572 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:38,572 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:38,572 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:38,572 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:38,572 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:38,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:38,575 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:38,575 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:38,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:38,576 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:38,576 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:38,667 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:38,668 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:26:38,668 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:38,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:38,668 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:38,668 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:38,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable351 [2022-12-06 07:26:38,668 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-06 07:26:38,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:38,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1428984829, now seen corresponding path program 1 times [2022-12-06 07:26:38,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:38,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799243497] [2022-12-06 07:26:38,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:38,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:38,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-06 07:26:38,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:38,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799243497] [2022-12-06 07:26:38,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799243497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:38,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:38,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:38,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931301479] [2022-12-06 07:26:38,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:38,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:38,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:38,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:38,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:38,735 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:38,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:38,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:38,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:38,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:38,774 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:38,774 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:38,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:38,775 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:38,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:38,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:38,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:38,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:38,775 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:38,775 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:38,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:38,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:38,776 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:38,776 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:38,776 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:38,776 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:38,777 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:38,777 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:38,777 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:38,777 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:38,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:38,779 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:38,779 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:38,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:38,779 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:38,779 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:38,853 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:38,853 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:38,854 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:38,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:38,854 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:38,854 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:38,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable352 [2022-12-06 07:26:38,854 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-06 07:26:38,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:38,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1398508636, now seen corresponding path program 1 times [2022-12-06 07:26:38,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:38,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761849392] [2022-12-06 07:26:38,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:38,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:38,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-06 07:26:38,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:38,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761849392] [2022-12-06 07:26:38,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761849392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:38,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:38,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:38,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172243468] [2022-12-06 07:26:38,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:38,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:38,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:38,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:38,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:38,917 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:38,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:38,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:38,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:38,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:38,953 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:38,954 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:38,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:38,954 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:38,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:38,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:38,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:38,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:38,955 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:38,955 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:38,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:38,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:38,955 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:38,956 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:38,956 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:38,956 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:38,956 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:38,956 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:38,956 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:38,956 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:38,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:38,958 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:38,958 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:38,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 115 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:38,959 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:38,959 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:39,031 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:39,031 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:26:39,031 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:39,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:39,031 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:39,031 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:39,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable353 [2022-12-06 07:26:39,032 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-06 07:26:39,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:39,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1371726527, now seen corresponding path program 1 times [2022-12-06 07:26:39,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:39,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106488781] [2022-12-06 07:26:39,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:39,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:39,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-06 07:26:39,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:39,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106488781] [2022-12-06 07:26:39,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106488781] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:39,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:39,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:39,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631643867] [2022-12-06 07:26:39,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:39,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:39,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:39,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:39,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:39,092 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:39,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:39,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:39,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:39,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:39,129 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:39,129 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:39,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:39,129 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:39,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:39,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:39,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:39,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:39,130 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:39,130 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:39,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:39,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:39,131 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:39,131 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:39,131 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:39,131 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:39,131 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:39,131 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:39,131 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:39,131 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:39,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:39,133 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:39,133 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:39,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:39,134 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:39,134 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:39,207 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:39,208 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:39,208 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:39,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:39,208 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:39,208 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:39,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable354 [2022-12-06 07:26:39,208 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-06 07:26:39,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:39,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1341250334, now seen corresponding path program 1 times [2022-12-06 07:26:39,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:39,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157538416] [2022-12-06 07:26:39,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:39,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:39,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-06 07:26:39,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:39,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157538416] [2022-12-06 07:26:39,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157538416] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:39,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:39,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:39,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171983939] [2022-12-06 07:26:39,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:39,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:39,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:39,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:39,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:39,270 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:39,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:39,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:39,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:39,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:39,307 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:39,307 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:39,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:39,308 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:39,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:39,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:39,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:39,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:39,308 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:39,308 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:39,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:39,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:39,309 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:39,309 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:39,309 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:39,309 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:39,309 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:39,310 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:39,310 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:39,310 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:39,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:39,312 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:39,312 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:39,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:39,312 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:39,312 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:39,385 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:39,386 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:39,386 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:39,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:39,386 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:39,386 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:39,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable355 [2022-12-06 07:26:39,386 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-06 07:26:39,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:39,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1314468225, now seen corresponding path program 1 times [2022-12-06 07:26:39,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:39,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079508327] [2022-12-06 07:26:39,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:39,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:39,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-06 07:26:39,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:39,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079508327] [2022-12-06 07:26:39,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079508327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:39,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:39,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:39,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479675670] [2022-12-06 07:26:39,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:39,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:39,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:39,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:39,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:39,444 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:39,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:39,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:39,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:39,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:39,486 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:39,486 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:39,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:39,487 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:39,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:39,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:39,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:39,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:39,487 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:39,487 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:39,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:39,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:39,488 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:39,488 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:39,488 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:39,488 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:39,488 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:39,489 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:39,489 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:39,489 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:39,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:39,491 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:39,491 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:39,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:39,491 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:39,491 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:39,564 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:39,565 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:39,565 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:39,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:39,565 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:39,565 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:39,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable356 [2022-12-06 07:26:39,565 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-06 07:26:39,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:39,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1283992032, now seen corresponding path program 1 times [2022-12-06 07:26:39,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:39,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806427145] [2022-12-06 07:26:39,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:39,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:39,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:39,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-06 07:26:39,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:39,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806427145] [2022-12-06 07:26:39,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806427145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:39,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:39,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:39,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902863828] [2022-12-06 07:26:39,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:39,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:39,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:39,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:39,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:39,624 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:39,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:39,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:39,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:39,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:39,660 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:39,660 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:39,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 349 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:39,661 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:39,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:39,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:39,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:39,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:39,661 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:39,661 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:39,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:39,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:39,662 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:39,662 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:39,662 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:39,662 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:39,663 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:39,663 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:39,663 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:39,663 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:39,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:39,666 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:39,666 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:39,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:39,666 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:39,667 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:39,740 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:39,740 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:26:39,741 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:39,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:39,741 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:39,741 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:39,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable357 [2022-12-06 07:26:39,741 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-06 07:26:39,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:39,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1257209923, now seen corresponding path program 1 times [2022-12-06 07:26:39,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:39,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663520740] [2022-12-06 07:26:39,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:39,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:39,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-06 07:26:39,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:39,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663520740] [2022-12-06 07:26:39,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663520740] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:39,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:39,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:39,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926554595] [2022-12-06 07:26:39,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:39,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:39,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:39,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:39,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:39,800 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:39,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:39,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:39,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:39,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:39,836 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:39,836 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:39,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 356 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:39,836 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:39,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:39,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:39,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:39,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:39,837 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:39,837 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:39,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:39,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:39,838 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:39,838 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:39,838 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:39,838 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:39,838 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:39,838 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:39,838 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:39,838 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:39,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:39,840 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:39,840 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:39,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:39,841 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:39,841 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:39,914 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:39,914 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:39,914 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:39,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:39,914 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:39,914 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:39,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable358 [2022-12-06 07:26:39,914 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-06 07:26:39,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:39,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1226733730, now seen corresponding path program 1 times [2022-12-06 07:26:39,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:39,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546312253] [2022-12-06 07:26:39,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:39,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:39,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-06 07:26:39,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:39,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546312253] [2022-12-06 07:26:39,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546312253] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:39,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:39,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:39,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438126110] [2022-12-06 07:26:39,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:39,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:39,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:39,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:39,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:39,977 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:39,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:39,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:39,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:39,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:40,023 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:40,023 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:40,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:40,024 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:40,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:40,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:40,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:40,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:40,024 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:40,024 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:40,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:40,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:40,025 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:40,025 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:40,025 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:40,025 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:40,025 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:40,026 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:40,026 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:40,026 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:40,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:40,028 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:40,028 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:40,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:40,028 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:40,028 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:40,102 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:40,102 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:40,103 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:40,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:40,103 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:40,103 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:40,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable359 [2022-12-06 07:26:40,103 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-06 07:26:40,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:40,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1199951621, now seen corresponding path program 1 times [2022-12-06 07:26:40,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:40,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559094023] [2022-12-06 07:26:40,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:40,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:40,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-06 07:26:40,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:40,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559094023] [2022-12-06 07:26:40,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559094023] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:40,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:40,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:40,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470569464] [2022-12-06 07:26:40,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:40,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:40,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:40,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:40,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:40,163 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:40,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:40,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:40,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:40,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:40,199 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:40,199 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:40,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 356 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:40,199 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:40,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:40,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:40,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:40,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:40,200 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:40,200 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:40,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:40,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:40,201 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:40,201 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:40,201 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:40,201 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:40,201 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:40,201 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:40,201 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:40,201 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:40,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:40,204 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:40,204 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:40,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:40,204 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:40,204 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:40,279 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:40,279 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:26:40,279 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:40,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:40,279 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:40,279 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:40,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable360 [2022-12-06 07:26:40,279 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-06 07:26:40,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:40,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1169475428, now seen corresponding path program 1 times [2022-12-06 07:26:40,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:40,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161814326] [2022-12-06 07:26:40,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:40,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:40,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-06 07:26:40,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:40,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161814326] [2022-12-06 07:26:40,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161814326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:40,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:40,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:40,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678270514] [2022-12-06 07:26:40,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:40,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:40,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:40,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:40,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:40,340 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:40,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:40,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:40,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:40,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:40,377 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:40,377 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:40,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:40,377 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:40,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:40,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:40,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:40,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:40,378 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:40,378 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:40,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:40,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:40,379 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:40,379 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:40,379 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:40,379 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:40,379 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:40,379 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:40,379 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:40,379 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:40,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:40,382 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:40,382 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:40,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:40,382 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:40,382 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:40,455 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:40,455 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:40,456 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:40,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:40,456 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:40,456 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:40,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable361 [2022-12-06 07:26:40,456 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-06 07:26:40,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:40,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1142693319, now seen corresponding path program 1 times [2022-12-06 07:26:40,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:40,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919276105] [2022-12-06 07:26:40,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:40,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:40,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-06 07:26:40,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:40,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919276105] [2022-12-06 07:26:40,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919276105] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:40,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:40,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:40,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214797205] [2022-12-06 07:26:40,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:40,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:40,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:40,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:40,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:40,518 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:40,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:40,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:40,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:40,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:40,556 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:40,557 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:40,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:40,557 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:40,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:40,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:40,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:40,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:40,558 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:40,558 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:40,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:40,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:40,559 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:40,559 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:40,559 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:40,559 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:40,559 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:40,559 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:40,559 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:40,560 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:40,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:40,563 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:40,563 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:40,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:40,563 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:40,564 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:40,657 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:40,658 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 07:26:40,658 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:40,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:40,658 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:40,658 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:40,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable362 [2022-12-06 07:26:40,659 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-06 07:26:40,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:40,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1112217126, now seen corresponding path program 1 times [2022-12-06 07:26:40,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:40,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303140560] [2022-12-06 07:26:40,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:40,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:40,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-06 07:26:40,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:40,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303140560] [2022-12-06 07:26:40,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303140560] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:40,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:40,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:40,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831281470] [2022-12-06 07:26:40,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:40,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:40,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:40,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:40,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:40,737 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:40,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:40,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:40,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:40,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:40,788 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:40,788 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:40,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:40,789 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:40,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:40,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:40,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:40,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:40,789 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:40,789 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:40,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:40,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:40,790 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:40,790 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:40,791 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:40,791 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:40,791 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:40,791 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:40,791 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:40,791 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:40,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:40,794 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:40,794 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:40,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 118 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:40,795 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:40,795 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:40,883 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:40,884 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-06 07:26:40,884 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:40,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:40,884 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:40,884 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:40,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable363 [2022-12-06 07:26:40,885 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-06 07:26:40,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:40,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1085435017, now seen corresponding path program 1 times [2022-12-06 07:26:40,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:40,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213563697] [2022-12-06 07:26:40,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:40,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:40,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-06 07:26:40,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:40,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213563697] [2022-12-06 07:26:40,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213563697] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:40,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:40,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:40,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082020991] [2022-12-06 07:26:40,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:40,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:40,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:40,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:40,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:40,956 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:40,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:40,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:40,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:40,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:41,005 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:41,005 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:41,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:41,006 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:41,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:41,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:41,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:41,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:41,006 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:41,007 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:41,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:41,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:41,007 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:41,007 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:41,007 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:41,008 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:41,008 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:41,008 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:41,008 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:41,008 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:41,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:41,010 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:41,010 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:41,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:41,010 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:41,010 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:41,084 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:41,084 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:41,085 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:41,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:41,085 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:41,085 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:41,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable364 [2022-12-06 07:26:41,085 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-06 07:26:41,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:41,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1054958824, now seen corresponding path program 1 times [2022-12-06 07:26:41,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:41,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921285477] [2022-12-06 07:26:41,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:41,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:41,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-06 07:26:41,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:41,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921285477] [2022-12-06 07:26:41,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921285477] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:41,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:41,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:41,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326721897] [2022-12-06 07:26:41,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:41,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:41,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:41,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:41,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:41,141 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:41,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:41,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:41,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:41,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:41,182 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:41,182 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:41,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:41,183 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:41,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:41,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:41,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:41,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:41,183 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:41,183 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:41,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:41,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:41,184 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:41,184 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:41,184 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:41,184 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:41,184 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:41,184 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:41,184 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:41,185 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:41,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:41,187 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:41,187 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:41,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:41,188 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:41,188 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:41,260 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:41,261 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:41,261 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:41,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:41,261 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:41,261 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:41,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable365 [2022-12-06 07:26:41,261 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-06 07:26:41,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:41,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1028176715, now seen corresponding path program 1 times [2022-12-06 07:26:41,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:41,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843317489] [2022-12-06 07:26:41,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:41,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:41,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:41,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:41,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843317489] [2022-12-06 07:26:41,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843317489] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:41,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:41,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:41,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477047507] [2022-12-06 07:26:41,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:41,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:41,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:41,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:41,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:41,321 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:41,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:41,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:41,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:41,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:41,357 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:41,357 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:41,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:41,358 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:41,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:41,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:41,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:41,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:41,359 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:41,360 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:41,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:41,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:41,360 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:41,361 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:41,361 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:41,361 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:41,361 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:41,361 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:41,361 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:41,361 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:41,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:41,365 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:41,365 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:41,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:41,365 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:41,365 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:41,442 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:41,442 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:26:41,442 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:41,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:41,442 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:41,442 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:41,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable366 [2022-12-06 07:26:41,442 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-06 07:26:41,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:41,443 INFO L85 PathProgramCache]: Analyzing trace with hash -997700522, now seen corresponding path program 1 times [2022-12-06 07:26:41,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:41,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799900894] [2022-12-06 07:26:41,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:41,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:41,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-06 07:26:41,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:41,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799900894] [2022-12-06 07:26:41,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799900894] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:41,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:41,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:41,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416979662] [2022-12-06 07:26:41,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:41,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:41,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:41,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:41,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:41,506 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:41,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:41,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:41,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:41,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:41,542 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:41,542 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:41,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:41,542 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:41,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:41,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:41,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:41,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:41,543 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:41,543 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:41,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:41,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:41,544 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:41,544 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:41,544 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:41,544 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:41,544 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:41,544 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:41,544 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:41,544 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:41,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:41,546 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:41,547 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:41,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:41,547 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:41,547 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:41,620 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:41,620 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:41,620 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:41,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:41,620 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:41,620 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:41,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable367 [2022-12-06 07:26:41,621 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-06 07:26:41,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:41,621 INFO L85 PathProgramCache]: Analyzing trace with hash -970918413, now seen corresponding path program 1 times [2022-12-06 07:26:41,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:41,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442054261] [2022-12-06 07:26:41,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:41,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:41,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:41,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-06 07:26:41,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:41,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442054261] [2022-12-06 07:26:41,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442054261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:41,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:41,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:41,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103241509] [2022-12-06 07:26:41,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:41,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:41,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:41,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:41,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:41,680 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:41,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:41,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:41,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:41,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:41,716 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:41,716 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:41,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:41,716 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:41,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:41,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:41,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:41,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:41,717 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:41,717 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:41,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:41,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:41,718 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:41,718 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:41,718 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:41,718 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:41,718 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:41,718 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:41,718 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:41,718 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:41,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:41,720 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:41,721 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:41,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:41,721 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:41,721 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:41,796 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:41,797 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:26:41,797 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:41,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:41,797 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:41,797 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:41,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable368 [2022-12-06 07:26:41,797 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-06 07:26:41,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:41,797 INFO L85 PathProgramCache]: Analyzing trace with hash -940442220, now seen corresponding path program 1 times [2022-12-06 07:26:41,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:41,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039642529] [2022-12-06 07:26:41,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:41,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:41,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-06 07:26:41,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:41,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039642529] [2022-12-06 07:26:41,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039642529] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:41,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:41,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:41,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849152965] [2022-12-06 07:26:41,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:41,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:41,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:41,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:41,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:41,853 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:41,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:41,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:41,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:41,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:41,889 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:41,889 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:41,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:41,889 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:41,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:41,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:41,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:41,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:41,890 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:41,890 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:41,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:41,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:41,891 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:41,891 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:41,891 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:41,891 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:41,891 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:41,891 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:41,891 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:41,891 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:41,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:41,894 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:41,894 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:41,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:41,894 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:41,894 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:41,969 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:41,969 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:26:41,969 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:41,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:41,969 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:41,969 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:41,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable369 [2022-12-06 07:26:41,969 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-06 07:26:41,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:41,970 INFO L85 PathProgramCache]: Analyzing trace with hash -913660111, now seen corresponding path program 1 times [2022-12-06 07:26:41,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:41,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920121780] [2022-12-06 07:26:41,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:41,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:42,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:42,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:42,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920121780] [2022-12-06 07:26:42,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920121780] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:42,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:42,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:42,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409437290] [2022-12-06 07:26:42,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:42,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:42,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:42,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:42,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:42,029 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:42,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:42,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:42,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:42,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:42,065 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:42,065 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:42,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:42,065 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:42,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:42,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:42,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:42,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:42,066 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:42,066 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:42,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:42,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:42,067 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:42,067 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:42,067 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:42,067 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:42,067 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:42,067 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:42,067 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:42,067 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:42,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:42,069 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:42,069 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:42,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:42,070 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:42,070 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:42,143 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:42,143 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:42,143 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:42,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:42,144 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:42,144 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:42,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable370 [2022-12-06 07:26:42,144 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-06 07:26:42,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:42,144 INFO L85 PathProgramCache]: Analyzing trace with hash -883183918, now seen corresponding path program 1 times [2022-12-06 07:26:42,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:42,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925098824] [2022-12-06 07:26:42,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:42,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:42,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:42,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:42,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925098824] [2022-12-06 07:26:42,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925098824] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:42,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:42,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:42,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567281828] [2022-12-06 07:26:42,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:42,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:42,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:42,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:42,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:42,208 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:42,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:42,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:42,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:42,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:42,250 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:42,250 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:42,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:42,251 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:42,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:42,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:42,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:42,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:42,251 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:42,251 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:42,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:42,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:42,252 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:42,252 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:42,252 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:42,252 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:42,252 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:42,252 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:42,253 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:42,253 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:42,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:42,255 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:42,255 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:42,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:42,255 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:42,255 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:42,328 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:42,328 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:42,328 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:42,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:42,328 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:42,328 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:42,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable371 [2022-12-06 07:26:42,328 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-06 07:26:42,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:42,329 INFO L85 PathProgramCache]: Analyzing trace with hash -856401809, now seen corresponding path program 1 times [2022-12-06 07:26:42,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:42,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678744864] [2022-12-06 07:26:42,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:42,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:42,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:42,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:42,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678744864] [2022-12-06 07:26:42,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678744864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:42,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:42,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:42,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673669829] [2022-12-06 07:26:42,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:42,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:42,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:42,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:42,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:42,390 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:42,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:42,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:42,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:42,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:42,431 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:42,431 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:42,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:42,431 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:42,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:42,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:42,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:42,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:42,432 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:42,432 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:42,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:42,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:42,432 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:42,432 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:42,433 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:42,433 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:42,433 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:42,433 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:42,433 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:42,433 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:42,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:42,435 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:42,435 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:42,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:42,436 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:42,436 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:42,507 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:42,507 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:26:42,507 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:42,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:42,507 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:42,507 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:42,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable372 [2022-12-06 07:26:42,507 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-06 07:26:42,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:42,508 INFO L85 PathProgramCache]: Analyzing trace with hash -825925616, now seen corresponding path program 1 times [2022-12-06 07:26:42,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:42,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209561447] [2022-12-06 07:26:42,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:42,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:42,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-06 07:26:42,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:42,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209561447] [2022-12-06 07:26:42,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209561447] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:42,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:42,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:42,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608988969] [2022-12-06 07:26:42,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:42,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:42,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:42,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:42,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:42,564 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:42,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:42,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:42,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:42,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:42,605 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:42,605 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:42,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:42,605 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:42,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:42,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:42,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:42,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:42,606 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:42,606 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:42,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:42,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:42,607 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:42,607 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:42,607 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:42,607 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:42,607 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:42,607 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:42,607 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:42,607 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:42,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:42,609 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:42,609 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:42,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:42,610 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:42,610 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:42,684 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:42,684 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:42,684 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:42,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:42,684 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:42,684 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:42,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable373 [2022-12-06 07:26:42,684 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-06 07:26:42,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:42,685 INFO L85 PathProgramCache]: Analyzing trace with hash -799143507, now seen corresponding path program 1 times [2022-12-06 07:26:42,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:42,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658356300] [2022-12-06 07:26:42,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:42,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:42,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-06 07:26:42,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:42,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658356300] [2022-12-06 07:26:42,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658356300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:42,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:42,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:42,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359628692] [2022-12-06 07:26:42,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:42,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:42,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:42,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:42,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:42,744 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:42,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:42,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:42,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:42,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:42,785 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:42,785 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:42,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 356 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:42,786 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:42,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:42,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:42,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:42,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:42,786 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:42,786 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:42,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:42,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:42,787 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:42,787 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:42,787 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:42,787 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:42,787 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:42,787 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:42,787 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:42,788 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:42,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:42,790 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:42,790 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:42,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:42,790 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:42,790 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:42,862 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:42,863 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:42,863 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:42,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:42,863 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:42,863 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:42,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable374 [2022-12-06 07:26:42,863 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-06 07:26:42,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:42,863 INFO L85 PathProgramCache]: Analyzing trace with hash -768667314, now seen corresponding path program 1 times [2022-12-06 07:26:42,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:42,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265501511] [2022-12-06 07:26:42,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:42,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:42,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-06 07:26:42,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:42,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265501511] [2022-12-06 07:26:42,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265501511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:42,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:42,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:42,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920056450] [2022-12-06 07:26:42,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:42,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:42,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:42,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:42,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:42,928 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:42,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:42,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:42,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:42,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:42,971 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:42,971 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:42,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:42,972 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:42,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:42,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:42,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:42,972 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:42,972 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:42,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:42,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:42,973 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:42,973 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:42,973 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:42,973 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:42,973 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:42,973 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:42,973 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:42,974 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:42,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:42,976 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:42,976 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:42,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:42,976 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:42,976 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:43,050 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:43,051 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:43,051 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:43,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:43,051 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:43,051 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:43,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable375 [2022-12-06 07:26:43,051 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-06 07:26:43,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:43,051 INFO L85 PathProgramCache]: Analyzing trace with hash -741885205, now seen corresponding path program 1 times [2022-12-06 07:26:43,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:43,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224166291] [2022-12-06 07:26:43,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:43,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:43,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:43,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:43,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:43,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224166291] [2022-12-06 07:26:43,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224166291] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:43,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:43,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:43,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596595147] [2022-12-06 07:26:43,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:43,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:43,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:43,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:43,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:43,108 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:43,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:43,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:43,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:43,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:43,150 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:43,150 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:43,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:43,150 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:43,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:43,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:43,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:43,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:43,151 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:43,151 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:43,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:43,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:43,152 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:43,152 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:43,152 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:43,152 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:43,152 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:43,152 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:43,152 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:43,152 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:43,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:43,154 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:43,154 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:43,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:43,155 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:43,155 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:43,228 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:43,228 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:43,228 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:43,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:43,228 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:43,228 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:43,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable376 [2022-12-06 07:26:43,228 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-06 07:26:43,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:43,229 INFO L85 PathProgramCache]: Analyzing trace with hash -711409012, now seen corresponding path program 1 times [2022-12-06 07:26:43,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:43,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549894098] [2022-12-06 07:26:43,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:43,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:43,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-06 07:26:43,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:43,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549894098] [2022-12-06 07:26:43,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549894098] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:43,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:43,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:43,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064749398] [2022-12-06 07:26:43,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:43,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:43,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:43,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:43,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:43,286 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:43,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:43,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:43,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:43,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:43,321 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:43,322 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:43,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:43,322 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:43,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:43,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:43,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:43,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:43,323 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:43,323 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:43,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:43,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:43,323 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:43,323 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:43,324 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:43,324 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:43,324 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:43,324 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:43,324 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:43,324 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:43,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:43,326 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:43,326 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:43,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:43,327 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:43,327 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:43,400 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:43,401 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:43,401 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:43,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:43,401 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:43,401 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:43,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable377 [2022-12-06 07:26:43,401 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-06 07:26:43,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:43,402 INFO L85 PathProgramCache]: Analyzing trace with hash -684626903, now seen corresponding path program 1 times [2022-12-06 07:26:43,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:43,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159522415] [2022-12-06 07:26:43,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:43,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:43,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-06 07:26:43,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:43,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159522415] [2022-12-06 07:26:43,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159522415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:43,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:43,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:43,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626134444] [2022-12-06 07:26:43,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:43,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:43,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:43,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:43,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:43,461 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:43,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:43,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:43,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:43,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:43,497 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:43,497 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:43,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:43,498 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:43,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:43,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:43,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:43,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:43,498 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:43,498 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:43,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:43,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:43,499 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:43,499 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:43,499 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:43,500 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:43,500 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:43,500 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:43,500 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:43,500 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:43,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:43,502 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:43,502 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:43,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:43,502 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:43,502 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:43,575 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:43,575 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:26:43,575 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:43,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:43,575 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:43,576 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:43,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable378 [2022-12-06 07:26:43,576 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-06 07:26:43,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:43,576 INFO L85 PathProgramCache]: Analyzing trace with hash -654150710, now seen corresponding path program 1 times [2022-12-06 07:26:43,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:43,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569599659] [2022-12-06 07:26:43,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:43,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:43,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-06 07:26:43,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:43,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569599659] [2022-12-06 07:26:43,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569599659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:43,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:43,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:43,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061195054] [2022-12-06 07:26:43,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:43,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:43,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:43,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:43,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:43,640 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:43,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:43,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:43,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:43,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:43,682 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:43,682 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:43,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:43,682 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:43,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:43,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:43,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:43,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:43,683 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:43,683 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:43,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:43,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:43,684 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:43,684 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:43,684 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:43,684 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:43,684 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:43,684 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:43,684 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:43,684 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:43,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:43,686 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:43,687 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:43,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:43,687 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:43,687 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:43,759 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:43,760 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:43,760 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:43,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:43,760 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:43,760 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:43,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable379 [2022-12-06 07:26:43,760 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-06 07:26:43,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:43,760 INFO L85 PathProgramCache]: Analyzing trace with hash -627368601, now seen corresponding path program 1 times [2022-12-06 07:26:43,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:43,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480045844] [2022-12-06 07:26:43,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:43,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:43,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-06 07:26:43,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:43,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480045844] [2022-12-06 07:26:43,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480045844] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:43,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:43,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:43,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750189876] [2022-12-06 07:26:43,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:43,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:43,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:43,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:43,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:43,821 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:43,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:43,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:43,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:43,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:43,855 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:43,855 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:43,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:43,856 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:43,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:43,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:43,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:43,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:43,856 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:43,857 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:43,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:43,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:43,857 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:43,857 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:43,857 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:43,858 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:43,858 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:43,858 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:43,858 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:43,858 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:43,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:43,860 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:43,860 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:43,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:43,860 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:43,860 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:43,935 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:43,935 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:43,935 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:43,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:43,935 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:43,935 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:43,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable380 [2022-12-06 07:26:43,935 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-06 07:26:43,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:43,936 INFO L85 PathProgramCache]: Analyzing trace with hash -596892408, now seen corresponding path program 1 times [2022-12-06 07:26:43,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:43,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889815157] [2022-12-06 07:26:43,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:43,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:43,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:43,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:43,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889815157] [2022-12-06 07:26:43,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889815157] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:43,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:43,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:43,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841649698] [2022-12-06 07:26:44,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:44,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:44,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:44,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:44,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:44,000 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:44,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:44,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:44,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:44,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:44,043 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:44,043 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:44,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:44,043 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:44,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:44,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:44,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:44,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:44,044 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:44,044 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:44,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:44,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:44,045 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:44,045 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:44,045 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:44,045 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:44,045 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:44,045 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:44,045 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:44,045 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:44,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:44,048 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:44,048 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:44,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:44,048 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:44,048 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:44,119 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:44,120 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:26:44,120 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:44,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:44,120 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:44,120 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:44,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable381 [2022-12-06 07:26:44,120 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-06 07:26:44,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:44,121 INFO L85 PathProgramCache]: Analyzing trace with hash -570110299, now seen corresponding path program 1 times [2022-12-06 07:26:44,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:44,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112145845] [2022-12-06 07:26:44,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:44,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26: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-06 07:26:44,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:44,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112145845] [2022-12-06 07:26:44,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112145845] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:44,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:44,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:44,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217662910] [2022-12-06 07:26:44,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:44,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:44,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:44,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:44,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:44,182 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:44,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:44,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:44,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:44,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:44,223 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:44,223 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:44,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:44,223 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:44,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:44,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:44,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:44,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:44,224 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:44,224 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:44,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:44,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:44,225 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:44,225 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:44,225 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:44,225 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:44,225 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:44,225 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:44,225 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:44,225 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:44,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:44,228 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:44,229 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:44,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:44,229 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:44,229 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:44,302 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:44,303 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:26:44,303 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:44,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:44,303 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:44,303 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:44,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable382 [2022-12-06 07:26:44,303 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-06 07:26:44,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:44,304 INFO L85 PathProgramCache]: Analyzing trace with hash -539634106, now seen corresponding path program 1 times [2022-12-06 07:26:44,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:44,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445519024] [2022-12-06 07:26:44,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:44,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:44,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-06 07:26:44,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:44,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445519024] [2022-12-06 07:26:44,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445519024] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:44,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:44,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:44,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994721307] [2022-12-06 07:26:44,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:44,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:44,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:44,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:44,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:44,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:44,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:44,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:44,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:44,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:44,415 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:44,415 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:44,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:44,416 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:44,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:44,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:44,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:44,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:44,417 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:44,417 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:44,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:44,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:44,418 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:44,418 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:44,418 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:44,418 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:44,418 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:44,418 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:44,419 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:44,419 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:44,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:44,422 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:44,422 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:44,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:44,422 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:44,422 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:44,495 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:44,495 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:44,495 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:44,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:44,496 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:44,496 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:44,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable383 [2022-12-06 07:26:44,496 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-06 07:26:44,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:44,496 INFO L85 PathProgramCache]: Analyzing trace with hash -512851997, now seen corresponding path program 1 times [2022-12-06 07:26:44,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:44,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432341474] [2022-12-06 07:26:44,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:44,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:44,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-06 07:26:44,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:44,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432341474] [2022-12-06 07:26:44,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432341474] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:44,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:44,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:44,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490856966] [2022-12-06 07:26:44,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:44,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:44,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:44,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:44,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:44,554 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:44,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:44,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:44,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:44,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:44,593 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:44,593 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:44,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:44,593 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:44,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:44,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:44,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:44,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:44,594 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:44,594 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:44,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:44,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:44,595 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:44,595 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:44,595 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:44,595 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:44,595 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:44,595 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:44,595 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:44,595 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:44,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:44,597 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:44,598 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:44,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:44,598 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:44,598 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:44,671 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:44,671 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:44,671 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:44,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:44,671 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:44,671 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:44,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable384 [2022-12-06 07:26:44,672 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-06 07:26:44,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:44,672 INFO L85 PathProgramCache]: Analyzing trace with hash -482375804, now seen corresponding path program 1 times [2022-12-06 07:26:44,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:44,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684747649] [2022-12-06 07:26:44,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:44,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:44,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:44,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:44,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684747649] [2022-12-06 07:26:44,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684747649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:44,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:44,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:44,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077726632] [2022-12-06 07:26:44,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:44,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:44,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:44,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:44,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:44,728 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:44,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:44,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:44,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:44,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:44,766 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:44,766 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:44,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:44,766 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:44,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:44,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:44,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:44,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:44,767 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:44,767 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:44,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:44,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:44,768 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:44,768 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:44,768 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:44,768 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:44,768 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:44,768 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:44,768 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:44,768 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:44,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:44,771 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:44,771 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:44,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:44,771 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:44,771 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:44,844 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:44,844 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:44,844 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:44,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:44,844 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:44,844 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:44,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable385 [2022-12-06 07:26:44,845 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-06 07:26:44,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:44,845 INFO L85 PathProgramCache]: Analyzing trace with hash -455593695, now seen corresponding path program 1 times [2022-12-06 07:26:44,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:44,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306812002] [2022-12-06 07:26:44,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:44,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:44,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-06 07:26:44,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:44,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306812002] [2022-12-06 07:26:44,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306812002] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:44,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:44,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:44,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902765538] [2022-12-06 07:26:44,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:44,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:44,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:44,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:44,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:44,904 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:44,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:44,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:44,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:44,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:44,950 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:44,950 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:44,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 376 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:44,951 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:44,951 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:44,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:44,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:44,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:44,951 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:44,951 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:44,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:44,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:44,952 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:44,952 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:44,952 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:44,952 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:44,952 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:44,952 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:44,953 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:44,953 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:44,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:44,955 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:44,955 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:44,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:44,955 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:44,955 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:45,029 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:45,030 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:26:45,030 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:45,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:45,030 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:45,030 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:45,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable386 [2022-12-06 07:26:45,030 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-06 07:26:45,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:45,031 INFO L85 PathProgramCache]: Analyzing trace with hash -425117502, now seen corresponding path program 1 times [2022-12-06 07:26:45,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:45,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488578829] [2022-12-06 07:26:45,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:45,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:45,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-06 07:26:45,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:45,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488578829] [2022-12-06 07:26:45,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488578829] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:45,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:45,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:45,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541698470] [2022-12-06 07:26:45,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:45,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:45,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:45,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:45,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:45,088 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:45,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:45,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:45,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:45,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:45,141 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:45,141 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:45,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:45,142 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:45,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:45,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:45,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:45,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:45,142 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:45,142 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:45,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:45,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:45,143 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:45,143 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:45,143 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:45,143 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:45,143 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:45,144 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:45,144 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:45,144 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:45,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:45,146 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:45,146 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:45,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:45,146 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:45,146 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:45,219 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:45,220 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:45,220 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:45,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:45,220 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:45,220 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:45,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable387 [2022-12-06 07:26:45,220 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-06 07:26:45,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:45,220 INFO L85 PathProgramCache]: Analyzing trace with hash -398335393, now seen corresponding path program 1 times [2022-12-06 07:26:45,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:45,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147900286] [2022-12-06 07:26:45,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:45,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:45,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:45,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-06 07:26:45,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:45,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147900286] [2022-12-06 07:26:45,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147900286] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:45,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:45,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:45,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429779800] [2022-12-06 07:26:45,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:45,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:45,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:45,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:45,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:45,278 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:45,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:45,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:45,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:45,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:45,317 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:45,317 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:45,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:45,317 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:45,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:45,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:45,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:45,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:45,318 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:45,318 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:45,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:45,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:45,319 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:45,319 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:45,319 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:45,319 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:45,319 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:45,319 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:45,319 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:45,319 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:45,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:45,322 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:45,322 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:45,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:45,322 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:45,322 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:45,393 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:45,393 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:26:45,393 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:45,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:45,394 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:45,394 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:45,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable388 [2022-12-06 07:26:45,394 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-06 07:26:45,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:45,394 INFO L85 PathProgramCache]: Analyzing trace with hash -367859200, now seen corresponding path program 1 times [2022-12-06 07:26:45,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:45,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140539141] [2022-12-06 07:26:45,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:45,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:45,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-06 07:26:45,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:45,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140539141] [2022-12-06 07:26:45,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140539141] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:45,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:45,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:45,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540070262] [2022-12-06 07:26:45,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:45,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:45,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:45,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:45,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:45,452 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:45,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:45,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:45,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:45,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:45,494 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:45,494 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:45,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:45,495 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:45,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:45,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:45,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:45,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:45,495 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:45,496 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:45,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:45,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:45,496 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:45,496 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:45,496 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:45,496 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:45,497 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:45,497 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:45,497 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:45,497 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:45,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:45,499 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:45,499 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:45,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:45,499 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:45,499 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:45,573 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:45,573 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:45,573 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:45,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:45,573 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:45,573 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:45,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable389 [2022-12-06 07:26:45,574 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-06 07:26:45,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:45,574 INFO L85 PathProgramCache]: Analyzing trace with hash -341077091, now seen corresponding path program 1 times [2022-12-06 07:26:45,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:45,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736532589] [2022-12-06 07:26:45,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:45,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:45,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-06 07:26:45,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:45,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736532589] [2022-12-06 07:26:45,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736532589] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:45,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:45,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:45,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141749704] [2022-12-06 07:26:45,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:45,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:45,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:45,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:45,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:45,635 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:45,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:45,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:45,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:45,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:45,669 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:45,669 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:45,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:45,670 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:45,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:45,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:45,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:45,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:45,670 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:45,670 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:45,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:45,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:45,671 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:45,671 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:45,671 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:45,671 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:45,671 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:45,671 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:45,671 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:45,672 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:45,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:45,674 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:45,674 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:45,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:45,674 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:45,674 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:45,760 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:45,761 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-06 07:26:45,761 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:45,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:45,761 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:45,761 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:45,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable390 [2022-12-06 07:26:45,761 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-06 07:26:45,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:45,761 INFO L85 PathProgramCache]: Analyzing trace with hash -310600898, now seen corresponding path program 1 times [2022-12-06 07:26:45,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:45,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35530932] [2022-12-06 07:26:45,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:45,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:45,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-06 07:26:45,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:45,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35530932] [2022-12-06 07:26:45,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35530932] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:45,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:45,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:45,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998201464] [2022-12-06 07:26:45,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:45,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:45,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:45,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:45,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:45,827 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:45,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:45,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:45,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:45,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:45,876 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:45,876 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:45,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:45,876 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:45,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:45,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:45,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:45,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:45,877 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:45,877 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:45,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:45,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:45,877 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:45,878 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:45,878 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:45,878 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:45,878 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:45,878 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:45,878 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:45,878 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:45,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:45,880 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:45,880 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:45,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:45,881 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:45,881 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:45,965 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:45,965 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 07:26:45,965 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:45,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:45,965 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:45,965 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:45,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable391 [2022-12-06 07:26:45,965 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-06 07:26:45,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:45,966 INFO L85 PathProgramCache]: Analyzing trace with hash -283818789, now seen corresponding path program 1 times [2022-12-06 07:26:45,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:45,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256897811] [2022-12-06 07:26:45,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:45,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:46,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-06 07:26:46,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:46,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256897811] [2022-12-06 07:26:46,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256897811] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:46,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:46,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:46,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676216377] [2022-12-06 07:26:46,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:46,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:46,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:46,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:46,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:46,026 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:46,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:46,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:46,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:46,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:46,061 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:46,062 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:46,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:46,062 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:46,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:46,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:46,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:46,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:46,063 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:46,063 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:46,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:46,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:46,063 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:46,063 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:46,064 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:46,064 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:46,064 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:46,064 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:46,064 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:46,064 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:46,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:46,066 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:46,066 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:46,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:46,066 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:46,066 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:46,139 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:46,140 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:46,140 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:46,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:46,140 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:46,140 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:46,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable392 [2022-12-06 07:26:46,140 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-06 07:26:46,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:46,141 INFO L85 PathProgramCache]: Analyzing trace with hash -253342596, now seen corresponding path program 1 times [2022-12-06 07:26:46,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:46,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861137394] [2022-12-06 07:26:46,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:46,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:46,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-06 07:26:46,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:46,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861137394] [2022-12-06 07:26:46,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861137394] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:46,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:46,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:46,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91203272] [2022-12-06 07:26:46,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:46,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:46,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:46,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:46,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:46,209 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:46,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:46,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:46,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:46,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:46,251 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:46,251 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:46,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:46,251 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:46,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:46,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:46,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:46,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:46,252 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:46,252 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:46,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:46,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:46,252 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:46,253 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:46,253 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:46,253 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:46,253 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:46,253 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:46,253 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:46,253 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:46,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:46,255 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:46,255 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:46,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:46,256 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:46,256 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:46,328 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:46,328 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:26:46,329 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:46,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:46,329 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:46,329 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:46,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable393 [2022-12-06 07:26:46,329 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-06 07:26:46,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:46,329 INFO L85 PathProgramCache]: Analyzing trace with hash -226560487, now seen corresponding path program 1 times [2022-12-06 07:26:46,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:46,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527885702] [2022-12-06 07:26:46,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:46,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:46,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-06 07:26:46,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:46,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527885702] [2022-12-06 07:26:46,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527885702] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:46,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:46,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:46,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065796991] [2022-12-06 07:26:46,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:46,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:46,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:46,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:46,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:46,387 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:46,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:46,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:46,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:46,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:46,422 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:46,422 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:46,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:46,423 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:46,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:46,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:46,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:46,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:46,423 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:46,423 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:46,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:46,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:46,424 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:46,424 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:46,424 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:46,424 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:46,424 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:46,424 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:46,424 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:46,424 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:46,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:46,427 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:46,427 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:46,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:46,427 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:46,427 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:46,499 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:46,500 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:46,500 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:46,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:46,500 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:46,500 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:46,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable394 [2022-12-06 07:26:46,500 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-06 07:26:46,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:46,500 INFO L85 PathProgramCache]: Analyzing trace with hash -196084294, now seen corresponding path program 1 times [2022-12-06 07:26:46,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:46,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785177083] [2022-12-06 07:26:46,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:46,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:46,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-06 07:26:46,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:46,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785177083] [2022-12-06 07:26:46,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785177083] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:46,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:46,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:46,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817783249] [2022-12-06 07:26:46,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:46,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:46,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:46,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:46,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:46,563 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:46,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:46,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:46,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:46,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:46,606 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:46,606 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:46,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:46,613 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:46,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:46,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:46,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:46,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:46,613 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:46,613 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:46,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:46,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:46,614 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:46,614 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:46,614 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:46,614 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:46,614 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:46,615 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:46,615 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:46,615 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:46,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:46,617 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:46,617 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:46,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:46,618 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:46,618 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:46,690 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:46,690 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:46,690 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:46,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:46,690 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:46,690 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:46,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable395 [2022-12-06 07:26:46,691 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-06 07:26:46,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:46,691 INFO L85 PathProgramCache]: Analyzing trace with hash -169302185, now seen corresponding path program 1 times [2022-12-06 07:26:46,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:46,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806573495] [2022-12-06 07:26:46,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:46,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:46,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-06 07:26:46,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:46,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806573495] [2022-12-06 07:26:46,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806573495] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:46,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:46,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:46,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081726814] [2022-12-06 07:26:46,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:46,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:46,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:46,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:46,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:46,749 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:46,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:46,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:46,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:46,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:46,785 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:46,785 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:46,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:46,785 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:46,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:46,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:46,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:46,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:46,786 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:46,786 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:46,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:46,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:46,787 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:46,787 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:46,787 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:46,787 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:46,787 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:46,787 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:46,787 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:46,787 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:46,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:46,790 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:46,790 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:46,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:46,790 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:46,790 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:46,863 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:46,864 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:46,864 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:46,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:46,864 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:46,864 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:46,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable396 [2022-12-06 07:26:46,864 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-06 07:26:46,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:46,864 INFO L85 PathProgramCache]: Analyzing trace with hash -138825992, now seen corresponding path program 1 times [2022-12-06 07:26:46,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:46,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100912634] [2022-12-06 07:26:46,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:46,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:46,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-06 07:26:46,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:46,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100912634] [2022-12-06 07:26:46,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100912634] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:46,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:46,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:46,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270872505] [2022-12-06 07:26:46,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:46,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:46,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:46,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:46,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:46,924 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:46,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:46,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:46,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:46,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:46,980 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:46,980 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:46,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:46,981 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:46,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:46,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:46,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:46,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:46,982 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:46,982 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:46,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:46,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:46,983 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:46,983 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:46,983 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:46,983 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:46,983 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:46,983 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:46,984 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:46,984 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:46,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:46,987 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:46,987 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:46,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:46,987 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:46,987 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:47,062 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:47,062 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:26:47,062 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:47,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:47,062 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:47,062 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:47,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable397 [2022-12-06 07:26:47,062 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-06 07:26:47,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:47,063 INFO L85 PathProgramCache]: Analyzing trace with hash -112043883, now seen corresponding path program 1 times [2022-12-06 07:26:47,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:47,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101480105] [2022-12-06 07:26:47,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:47,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:47,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-06 07:26:47,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:47,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101480105] [2022-12-06 07:26:47,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101480105] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:47,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:47,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:47,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732122623] [2022-12-06 07:26:47,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:47,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:47,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:47,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:47,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:47,124 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:47,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:47,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:47,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:47,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:47,165 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:47,165 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:47,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:47,165 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:47,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:47,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:47,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:47,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:47,166 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:47,166 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:47,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:47,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:47,167 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:47,167 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:47,167 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:47,167 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:47,167 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:47,167 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:47,167 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:47,167 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:47,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:47,170 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:47,170 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:47,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:47,171 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:47,171 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:47,245 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:47,246 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:26:47,246 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:47,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:47,246 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:47,246 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:47,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable398 [2022-12-06 07:26:47,246 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-06 07:26:47,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:47,246 INFO L85 PathProgramCache]: Analyzing trace with hash -81567690, now seen corresponding path program 1 times [2022-12-06 07:26:47,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:47,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422495740] [2022-12-06 07:26:47,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:47,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:47,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:47,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-06 07:26:47,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:47,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422495740] [2022-12-06 07:26:47,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422495740] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:47,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:47,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:47,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273298238] [2022-12-06 07:26:47,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:47,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:47,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:47,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:47,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:47,313 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:47,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:47,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:47,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:47,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:47,354 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:47,354 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:47,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:47,354 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:47,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:47,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:47,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:47,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:47,355 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:47,355 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:47,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:47,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:47,356 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:47,356 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:47,356 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:47,356 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:47,356 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:47,356 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:47,356 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:47,356 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:47,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:47,365 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:47,365 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:47,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:47,365 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:47,365 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:47,439 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:47,439 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 07:26:47,439 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:47,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:47,439 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:47,439 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:47,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable399 [2022-12-06 07:26:47,440 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-06 07:26:47,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:47,440 INFO L85 PathProgramCache]: Analyzing trace with hash -54785581, now seen corresponding path program 1 times [2022-12-06 07:26:47,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:47,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389268112] [2022-12-06 07:26:47,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:47,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:47,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-06 07:26:47,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:47,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389268112] [2022-12-06 07:26:47,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389268112] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:47,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:47,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:47,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100391047] [2022-12-06 07:26:47,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:47,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:47,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:47,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:47,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:47,499 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:47,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:47,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:47,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:47,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:47,535 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:47,535 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:47,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:47,536 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:47,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:47,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:47,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:47,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:47,536 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:47,536 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:47,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:47,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:47,537 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:47,537 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:47,537 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:47,537 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:47,537 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:47,537 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:47,538 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:47,538 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:47,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:47,541 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:47,541 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:47,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:47,541 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:47,541 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:47,613 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:47,614 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:47,614 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:47,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:47,614 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:47,614 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:47,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable400 [2022-12-06 07:26:47,614 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-06 07:26:47,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:47,614 INFO L85 PathProgramCache]: Analyzing trace with hash -24309388, now seen corresponding path program 1 times [2022-12-06 07:26:47,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:47,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29425294] [2022-12-06 07:26:47,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:47,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:47,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-06 07:26:47,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:47,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29425294] [2022-12-06 07:26:47,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29425294] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:47,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:47,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:47,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601378198] [2022-12-06 07:26:47,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:47,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:47,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:47,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:47,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:47,683 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:47,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:47,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:47,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:47,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:47,728 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:47,728 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:47,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:47,729 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:47,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:47,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:47,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:47,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:47,729 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:47,729 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:47,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:47,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:47,730 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:47,730 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:47,730 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:47,730 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:47,731 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:47,731 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:47,731 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:47,731 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:47,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:47,733 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:47,733 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:47,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:47,733 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:47,733 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:47,806 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:47,807 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:47,807 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:47,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:47,807 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:47,807 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:47,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable401 [2022-12-06 07:26:47,807 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-06 07:26:47,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:47,807 INFO L85 PathProgramCache]: Analyzing trace with hash 2472721, now seen corresponding path program 1 times [2022-12-06 07:26:47,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:47,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280099951] [2022-12-06 07:26:47,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:47,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:47,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:47,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:47,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280099951] [2022-12-06 07:26:47,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280099951] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:47,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:47,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:47,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977929682] [2022-12-06 07:26:47,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:47,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:47,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:47,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:47,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:47,866 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:47,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:47,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:47,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:47,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:47,901 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:47,901 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:47,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:47,901 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:47,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:47,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:47,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:47,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:47,902 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:47,902 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:47,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:47,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:47,903 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:47,903 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:47,903 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:47,903 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:47,903 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:47,903 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:47,903 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:47,903 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:47,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:47,906 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:47,906 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:47,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:47,906 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:47,906 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:47,978 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:47,979 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:47,979 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:47,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:47,979 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:47,979 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:47,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable402 [2022-12-06 07:26:47,979 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-06 07:26:47,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:47,979 INFO L85 PathProgramCache]: Analyzing trace with hash 32948914, now seen corresponding path program 1 times [2022-12-06 07:26:47,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:47,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424242512] [2022-12-06 07:26:47,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:47,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:48,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-06 07:26:48,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:48,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424242512] [2022-12-06 07:26:48,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424242512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:48,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:48,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:48,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410866450] [2022-12-06 07:26:48,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:48,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:48,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:48,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:48,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:48,036 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:48,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:48,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:48,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:48,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:48,077 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:48,077 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:48,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:48,077 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:48,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:48,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:48,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:48,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:48,078 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:48,078 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:48,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:48,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:48,078 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:48,078 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:48,079 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:48,079 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:48,079 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:48,079 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:48,079 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:48,079 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:48,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:48,081 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:48,081 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:48,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:48,081 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:48,082 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:48,161 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:48,161 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:26:48,161 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:48,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:48,161 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:48,161 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:48,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable403 [2022-12-06 07:26:48,162 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-06 07:26:48,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:48,162 INFO L85 PathProgramCache]: Analyzing trace with hash 59731023, now seen corresponding path program 1 times [2022-12-06 07:26:48,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:48,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217967479] [2022-12-06 07:26:48,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:48,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:48,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-06 07:26:48,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:48,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217967479] [2022-12-06 07:26:48,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217967479] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:48,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:48,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:48,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809324932] [2022-12-06 07:26:48,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:48,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:48,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:48,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:48,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:48,218 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:48,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:48,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:48,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:48,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:48,255 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:48,256 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:48,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:48,256 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:48,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:48,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:48,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:48,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:48,257 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:48,257 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:48,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:48,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:48,257 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:48,257 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:48,258 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:48,258 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:48,258 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:48,258 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:48,258 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:48,258 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:48,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:48,260 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:48,260 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:48,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:48,261 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:48,261 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:48,332 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:48,333 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:26:48,333 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:48,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:48,333 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:48,333 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:48,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable404 [2022-12-06 07:26:48,333 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-06 07:26:48,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:48,333 INFO L85 PathProgramCache]: Analyzing trace with hash 90207216, now seen corresponding path program 1 times [2022-12-06 07:26:48,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:48,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728125399] [2022-12-06 07:26:48,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:48,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:48,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-06 07:26:48,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:48,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728125399] [2022-12-06 07:26:48,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728125399] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:48,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:48,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:48,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140478531] [2022-12-06 07:26:48,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:48,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:48,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:48,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:48,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:48,394 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:48,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:48,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:48,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:48,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:48,436 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:48,436 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:48,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:48,436 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:48,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:48,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:48,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:48,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:48,437 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:48,437 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:48,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:48,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:48,438 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:48,438 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:48,438 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:48,438 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:48,438 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:48,438 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:48,438 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:48,438 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:48,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:48,440 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:48,440 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:48,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:48,441 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:48,441 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:48,513 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:48,514 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:48,514 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:48,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:48,514 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:48,514 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:48,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable405 [2022-12-06 07:26:48,514 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-06 07:26:48,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:48,514 INFO L85 PathProgramCache]: Analyzing trace with hash 116989325, now seen corresponding path program 1 times [2022-12-06 07:26:48,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:48,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498771417] [2022-12-06 07:26:48,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:48,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:48,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-06 07:26:48,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:48,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498771417] [2022-12-06 07:26:48,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498771417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:48,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:48,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:48,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853155258] [2022-12-06 07:26:48,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:48,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:48,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:48,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:48,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:48,573 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:48,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:48,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:48,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:48,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:48,608 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:48,608 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:48,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:48,609 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:48,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:48,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:48,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:48,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:48,609 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:48,609 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:48,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:48,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:48,610 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:48,610 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:48,610 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:48,610 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:48,610 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:48,610 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:48,611 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:48,611 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:48,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:48,613 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:48,613 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:48,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:48,613 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:48,613 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:48,694 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:48,694 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:26:48,694 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:48,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:48,695 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:48,695 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:48,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable406 [2022-12-06 07:26:48,695 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-06 07:26:48,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:48,695 INFO L85 PathProgramCache]: Analyzing trace with hash 147465518, now seen corresponding path program 1 times [2022-12-06 07:26:48,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:48,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543062003] [2022-12-06 07:26:48,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:48,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:48,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-06 07:26:48,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:48,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543062003] [2022-12-06 07:26:48,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543062003] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:48,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:48,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:48,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760943843] [2022-12-06 07:26:48,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:48,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:48,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:48,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:48,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:48,750 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:48,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:48,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:48,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:48,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:48,792 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:48,793 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:48,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:48,793 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:48,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:48,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:48,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:48,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:48,794 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:48,794 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:48,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:48,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:48,794 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:48,794 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:48,795 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:48,795 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:48,795 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:48,795 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:48,795 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:48,795 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:48,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:48,797 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:48,797 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:48,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:48,797 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:48,798 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:48,877 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:48,878 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 07:26:48,878 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:48,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:48,878 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:48,878 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:48,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable407 [2022-12-06 07:26:48,878 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-06 07:26:48,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:48,878 INFO L85 PathProgramCache]: Analyzing trace with hash 174247627, now seen corresponding path program 1 times [2022-12-06 07:26:48,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:48,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40311961] [2022-12-06 07:26:48,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:48,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:48,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-06 07:26:48,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:48,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40311961] [2022-12-06 07:26:48,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40311961] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:48,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:48,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:48,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074910266] [2022-12-06 07:26:48,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:48,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:48,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:48,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:48,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:48,943 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:48,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:48,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:48,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:48,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:48,977 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:48,977 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:48,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 370 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:48,977 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:48,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:48,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:48,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:48,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:48,978 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:48,978 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:48,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:48,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:48,979 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:48,979 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:48,979 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:48,979 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:48,979 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:48,979 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:48,979 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:48,979 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:48,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:48,982 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:48,982 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:48,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:48,982 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:48,982 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:49,053 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:49,053 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:26:49,053 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:49,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:49,053 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:49,053 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:49,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable408 [2022-12-06 07:26:49,054 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-06 07:26:49,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:49,054 INFO L85 PathProgramCache]: Analyzing trace with hash 204723820, now seen corresponding path program 1 times [2022-12-06 07:26:49,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:49,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679961643] [2022-12-06 07:26:49,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:49,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:49,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-06 07:26:49,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:49,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679961643] [2022-12-06 07:26:49,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679961643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:49,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:49,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:49,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75017503] [2022-12-06 07:26:49,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:49,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:49,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:49,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:49,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:49,116 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:49,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:49,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:49,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:49,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:49,154 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:49,154 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:49,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:49,155 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:49,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:49,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:49,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:49,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:49,155 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:49,155 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:49,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:49,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:49,156 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:49,156 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:49,157 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:49,157 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:49,157 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:49,157 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:49,157 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:49,157 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:49,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:49,160 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:49,160 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:49,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:49,161 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:49,161 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:49,242 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:49,243 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-06 07:26:49,243 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:49,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:49,243 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:49,243 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:49,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable409 [2022-12-06 07:26:49,243 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-06 07:26:49,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:49,243 INFO L85 PathProgramCache]: Analyzing trace with hash 231505929, now seen corresponding path program 1 times [2022-12-06 07:26:49,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:49,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660892135] [2022-12-06 07:26:49,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:49,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:49,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-06 07:26:49,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:49,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660892135] [2022-12-06 07:26:49,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660892135] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:49,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:49,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:49,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557850061] [2022-12-06 07:26:49,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:49,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:49,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:49,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:49,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:49,303 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:49,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:49,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:49,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:49,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:49,339 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:49,339 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:49,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:49,340 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:49,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:49,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:49,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:49,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:49,340 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:49,340 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:49,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:49,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:49,341 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:49,341 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:49,342 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:49,342 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:49,342 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:49,342 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:49,342 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:49,342 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:49,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:49,344 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:49,344 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:49,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:49,345 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:49,345 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:49,419 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:49,419 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:49,419 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:49,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:49,419 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:49,419 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:49,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable410 [2022-12-06 07:26:49,419 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-06 07:26:49,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:49,420 INFO L85 PathProgramCache]: Analyzing trace with hash 261982122, now seen corresponding path program 1 times [2022-12-06 07:26:49,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:49,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490491141] [2022-12-06 07:26:49,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:49,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:49,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-06 07:26:49,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:49,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490491141] [2022-12-06 07:26:49,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490491141] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:49,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:49,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:49,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299696957] [2022-12-06 07:26:49,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:49,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:49,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:49,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:49,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:49,479 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:49,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:49,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:49,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:49,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:49,520 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:49,520 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:49,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:49,521 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:49,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:49,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:49,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:49,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:49,521 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:49,521 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:49,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:49,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:49,522 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:49,522 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:49,522 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:49,522 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:49,522 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:49,523 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:49,523 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:49,523 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:49,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:49,525 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:49,525 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:49,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:49,525 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:49,525 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:49,605 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:49,605 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 07:26:49,605 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:49,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:49,605 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:49,605 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:49,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable411 [2022-12-06 07:26:49,605 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-06 07:26:49,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:49,606 INFO L85 PathProgramCache]: Analyzing trace with hash 288764231, now seen corresponding path program 1 times [2022-12-06 07:26:49,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:49,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106370750] [2022-12-06 07:26:49,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:49,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:49,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-06 07:26:49,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:49,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106370750] [2022-12-06 07:26:49,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106370750] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:49,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:49,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:49,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119994907] [2022-12-06 07:26:49,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:49,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:49,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:49,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:49,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:49,662 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:49,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:49,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:49,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:49,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:49,700 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:49,700 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:49,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:49,701 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:49,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:49,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:49,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:49,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:49,701 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:49,701 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:49,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:49,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:49,702 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:49,702 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:49,702 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:49,702 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:49,702 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:49,703 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:49,703 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:49,703 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:49,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:49,705 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:49,705 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:49,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:49,705 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:49,705 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:49,777 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:49,778 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:49,778 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:49,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:49,778 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:49,778 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:49,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable412 [2022-12-06 07:26:49,778 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-06 07:26:49,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:49,778 INFO L85 PathProgramCache]: Analyzing trace with hash 319240424, now seen corresponding path program 1 times [2022-12-06 07:26:49,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:49,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914539861] [2022-12-06 07:26:49,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:49,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:49,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-06 07:26:49,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:49,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914539861] [2022-12-06 07:26:49,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914539861] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:49,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:49,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:49,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846602287] [2022-12-06 07:26:49,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:49,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:49,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:49,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:49,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:49,834 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:49,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:49,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:49,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:49,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:49,876 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:49,876 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:49,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:49,877 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:49,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:49,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:49,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:49,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:49,879 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:49,880 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:49,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:49,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:49,881 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:49,881 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:49,881 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:49,881 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:49,881 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:49,881 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:49,881 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:49,882 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:49,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:49,885 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:49,885 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:49,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:49,886 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:49,886 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:49,977 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:49,978 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 07:26:49,978 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:49,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:49,978 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:49,978 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:49,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable413 [2022-12-06 07:26:49,978 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-06 07:26:49,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:49,978 INFO L85 PathProgramCache]: Analyzing trace with hash 346022533, now seen corresponding path program 1 times [2022-12-06 07:26:49,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:49,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295256671] [2022-12-06 07:26:49,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:49,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:50,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-06 07:26:50,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:50,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295256671] [2022-12-06 07:26:50,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295256671] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:50,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:50,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:50,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854278019] [2022-12-06 07:26:50,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:50,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:50,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:50,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:50,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:50,057 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:50,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:50,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:50,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:50,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:50,104 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:50,105 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:50,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:50,105 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:50,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:50,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:50,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:50,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:50,106 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:50,106 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:50,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:50,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:50,107 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:50,107 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:50,107 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:50,108 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:50,108 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:50,108 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:50,108 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:50,108 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:50,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:50,111 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:50,111 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:50,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:50,111 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:50,111 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:50,198 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:50,199 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-06 07:26:50,199 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:50,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:50,199 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:50,199 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:50,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable414 [2022-12-06 07:26:50,199 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-06 07:26:50,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:50,199 INFO L85 PathProgramCache]: Analyzing trace with hash 376498726, now seen corresponding path program 1 times [2022-12-06 07:26:50,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:50,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380316396] [2022-12-06 07:26:50,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:50,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:50,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:50,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-06 07:26:50,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:50,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380316396] [2022-12-06 07:26:50,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380316396] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:50,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:50,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:50,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555615458] [2022-12-06 07:26:50,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:50,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:50,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:50,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:50,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:50,258 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:50,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:50,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:50,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:50,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:50,299 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:50,299 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:50,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:50,299 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:50,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:50,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:50,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:50,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:50,300 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:50,300 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:50,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:50,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:50,301 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:50,301 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:50,301 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:50,301 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:50,302 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:50,302 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:50,302 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:50,302 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:50,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:50,305 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:50,305 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:50,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:50,306 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:50,306 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:50,401 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:50,401 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 07:26:50,402 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:50,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:50,402 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:50,402 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:50,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable415 [2022-12-06 07:26:50,402 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-06 07:26:50,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:50,403 INFO L85 PathProgramCache]: Analyzing trace with hash 403280835, now seen corresponding path program 1 times [2022-12-06 07:26:50,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:50,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340994310] [2022-12-06 07:26:50,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:50,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:50,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:50,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:50,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340994310] [2022-12-06 07:26:50,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340994310] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:50,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:50,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:50,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352391068] [2022-12-06 07:26:50,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:50,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:50,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:50,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:50,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:50,478 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:50,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:50,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:50,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:50,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:50,532 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:50,532 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:50,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:50,533 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:50,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:50,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:50,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:50,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:50,534 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:50,534 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:50,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:50,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:50,535 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:50,535 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:50,535 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:50,536 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:50,536 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:50,536 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:50,536 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:50,536 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:50,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:50,539 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:50,539 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:50,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:50,540 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:50,540 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:50,632 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:50,633 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 07:26:50,633 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:50,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:50,633 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:50,633 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:50,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable416 [2022-12-06 07:26:50,634 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-06 07:26:50,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:50,634 INFO L85 PathProgramCache]: Analyzing trace with hash 433757028, now seen corresponding path program 1 times [2022-12-06 07:26:50,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:50,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134491855] [2022-12-06 07:26:50,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:50,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:50,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-06 07:26:50,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:50,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134491855] [2022-12-06 07:26:50,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134491855] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:50,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:50,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:50,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930255019] [2022-12-06 07:26:50,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:50,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:50,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:50,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:50,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:50,708 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:50,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:50,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:50,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:50,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:50,744 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:50,745 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:50,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:50,745 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:50,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:50,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:50,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:50,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:50,746 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:50,746 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:50,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:50,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:50,746 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:50,746 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:50,747 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:50,747 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:50,747 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:50,747 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:50,747 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:50,747 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:50,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:50,749 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:50,749 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:50,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:50,750 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:50,750 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:50,824 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:50,824 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:50,824 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:50,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:50,824 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:50,824 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:50,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable417 [2022-12-06 07:26:50,825 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-06 07:26:50,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:50,825 INFO L85 PathProgramCache]: Analyzing trace with hash 460539137, now seen corresponding path program 1 times [2022-12-06 07:26:50,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:50,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160320938] [2022-12-06 07:26:50,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:50,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:50,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-06 07:26:50,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:50,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160320938] [2022-12-06 07:26:50,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160320938] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:50,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:50,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:50,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026329086] [2022-12-06 07:26:50,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:50,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:50,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:50,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:50,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:50,888 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:50,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:50,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:50,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:50,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:50,930 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:50,930 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:50,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:50,930 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:50,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:50,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:50,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:50,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:50,931 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:50,931 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:50,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:50,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:50,932 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:50,932 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:50,932 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:50,932 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:50,932 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:50,932 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:50,932 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:50,932 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:50,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:50,934 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:50,934 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:50,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:50,935 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:50,935 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:51,009 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:51,010 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:26:51,010 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:51,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:51,010 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:51,010 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:51,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable418 [2022-12-06 07:26:51,010 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-06 07:26:51,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:51,010 INFO L85 PathProgramCache]: Analyzing trace with hash 491015330, now seen corresponding path program 1 times [2022-12-06 07:26:51,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:51,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627538687] [2022-12-06 07:26:51,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:51,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:51,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-06 07:26:51,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:51,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627538687] [2022-12-06 07:26:51,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627538687] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:51,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:51,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:51,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384681001] [2022-12-06 07:26:51,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:51,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:51,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:51,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:51,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:51,066 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:51,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:51,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:51,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:51,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:51,110 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:51,111 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:51,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:51,111 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:51,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:51,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:51,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:51,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:51,112 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:51,112 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:51,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:51,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:51,112 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:51,112 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:51,113 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:51,113 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:51,113 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:51,113 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:51,113 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:51,113 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:51,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:51,115 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:51,115 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:51,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:51,115 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:51,115 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:51,189 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:51,189 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:51,189 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:51,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:51,189 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:51,189 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:51,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable419 [2022-12-06 07:26:51,190 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-06 07:26:51,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:51,190 INFO L85 PathProgramCache]: Analyzing trace with hash 517797439, now seen corresponding path program 1 times [2022-12-06 07:26:51,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:51,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659784169] [2022-12-06 07:26:51,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:51,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:51,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-06 07:26:51,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:51,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659784169] [2022-12-06 07:26:51,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659784169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:51,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:51,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:51,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229285450] [2022-12-06 07:26:51,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:51,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:51,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:51,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:51,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:51,264 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:51,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:51,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:51,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:51,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:51,319 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:51,320 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:51,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:51,320 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:51,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:51,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:51,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:51,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:51,321 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:51,321 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:51,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:51,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:51,322 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:51,322 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:51,322 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:51,322 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:51,322 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:51,323 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:51,323 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:51,323 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:51,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:51,326 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:51,326 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:51,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:51,326 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:51,326 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:51,419 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:51,420 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 07:26:51,420 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:51,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:51,420 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:51,420 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:51,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable420 [2022-12-06 07:26:51,421 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-06 07:26:51,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:51,421 INFO L85 PathProgramCache]: Analyzing trace with hash 548273632, now seen corresponding path program 1 times [2022-12-06 07:26:51,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:51,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490183218] [2022-12-06 07:26:51,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:51,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:51,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-06 07:26:51,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:51,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490183218] [2022-12-06 07:26:51,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490183218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:51,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:51,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:51,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557794988] [2022-12-06 07:26:51,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:51,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:51,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:51,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:51,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:51,495 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:51,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:51,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:51,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:51,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:51,549 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:51,549 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:51,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:51,550 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:51,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:51,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:51,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:51,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:51,550 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:51,550 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:51,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:51,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:51,551 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:51,551 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:51,552 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:51,552 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:51,552 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:51,552 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:51,552 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:51,552 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:51,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:51,555 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:51,555 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:51,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:51,556 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:51,556 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:51,647 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:51,647 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 07:26:51,647 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:51,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:51,648 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:51,648 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:51,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable421 [2022-12-06 07:26:51,648 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-06 07:26:51,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:51,648 INFO L85 PathProgramCache]: Analyzing trace with hash 575055741, now seen corresponding path program 1 times [2022-12-06 07:26:51,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:51,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832671962] [2022-12-06 07:26:51,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:51,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:51,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-06 07:26:51,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:51,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832671962] [2022-12-06 07:26:51,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832671962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:51,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:51,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:51,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812552785] [2022-12-06 07:26:51,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:51,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:51,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:51,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:51,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:51,723 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:51,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:51,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:51,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:51,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:51,809 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:51,809 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:51,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:51,810 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:51,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:51,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:51,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:51,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:51,824 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:51,824 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:51,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:51,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:51,825 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:51,825 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:51,825 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:51,825 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:51,825 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:51,825 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:51,825 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:51,826 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:51,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:51,829 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:51,829 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:51,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:51,829 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:51,829 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:51,962 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:51,962 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-06 07:26:51,962 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:51,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:51,963 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:51,963 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:51,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable422 [2022-12-06 07:26:51,963 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-06 07:26:51,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:51,963 INFO L85 PathProgramCache]: Analyzing trace with hash 605531934, now seen corresponding path program 1 times [2022-12-06 07:26:51,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:51,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049704799] [2022-12-06 07:26:51,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:51,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:52,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-06 07:26:52,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:52,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049704799] [2022-12-06 07:26:52,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049704799] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:52,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:52,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:52,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972736199] [2022-12-06 07:26:52,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:52,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:52,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:52,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:52,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:52,035 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:52,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:52,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:52,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:52,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:52,076 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:52,077 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:52,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:52,077 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:52,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:52,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:52,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:52,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:52,078 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:52,078 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:52,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:52,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:52,079 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:52,079 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:52,080 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:52,080 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:52,080 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:52,080 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:52,080 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:52,080 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:52,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:52,083 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:52,083 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:52,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:52,084 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:52,084 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:52,176 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:52,177 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 07:26:52,177 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:52,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:52,177 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:52,177 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:52,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable423 [2022-12-06 07:26:52,177 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-06 07:26:52,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:52,178 INFO L85 PathProgramCache]: Analyzing trace with hash 632314043, now seen corresponding path program 1 times [2022-12-06 07:26:52,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:52,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991361212] [2022-12-06 07:26:52,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:52,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:52,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-06 07:26:52,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:52,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991361212] [2022-12-06 07:26:52,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991361212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:52,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:52,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:52,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049199790] [2022-12-06 07:26:52,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:52,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:52,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:52,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:52,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:52,257 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:52,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:52,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:52,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:52,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:52,298 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:52,298 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:52,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:52,298 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:52,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:52,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:52,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:52,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:52,299 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:52,299 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:52,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:52,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:52,300 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:52,300 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:52,300 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:52,300 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:52,300 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:52,300 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:52,300 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:52,300 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:52,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:52,303 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:52,303 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:52,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:52,303 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:52,303 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:52,375 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:52,375 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:26:52,375 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:52,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:52,376 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:52,376 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:52,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable424 [2022-12-06 07:26:52,376 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-06 07:26:52,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:52,376 INFO L85 PathProgramCache]: Analyzing trace with hash 662790236, now seen corresponding path program 1 times [2022-12-06 07:26:52,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:52,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275110296] [2022-12-06 07:26:52,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:52,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:52,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-06 07:26:52,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:52,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275110296] [2022-12-06 07:26:52,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275110296] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:52,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:52,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:52,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625187595] [2022-12-06 07:26:52,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:52,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:52,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:52,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:52,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:52,433 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:52,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:52,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:52,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:52,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:52,469 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:52,469 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:52,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:52,469 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:52,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:52,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:52,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:52,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:52,470 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:52,470 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:52,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:52,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:52,471 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:52,471 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:52,471 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:52,471 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:52,471 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:52,472 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:52,472 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:52,472 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:52,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:52,475 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:52,475 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:52,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:52,475 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:52,475 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:52,550 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:52,550 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:26:52,551 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:52,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:52,551 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:52,551 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:52,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable425 [2022-12-06 07:26:52,551 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-06 07:26:52,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:52,551 INFO L85 PathProgramCache]: Analyzing trace with hash 689572345, now seen corresponding path program 1 times [2022-12-06 07:26:52,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:52,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940454327] [2022-12-06 07:26:52,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:52,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:52,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-06 07:26:52,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:52,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940454327] [2022-12-06 07:26:52,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940454327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:52,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:52,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:52,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717708571] [2022-12-06 07:26:52,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:52,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:52,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:52,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:52,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:52,612 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:52,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:52,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:52,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:52,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:52,648 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:52,648 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:52,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:52,649 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:52,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:52,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:52,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:52,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:52,649 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:52,649 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:52,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:52,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:52,650 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:52,650 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:52,650 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:52,651 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:52,651 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:52,651 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:52,651 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:52,651 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:52,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:52,653 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:52,653 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:52,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:52,653 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:52,653 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:52,725 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:52,726 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:26:52,726 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:52,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:52,726 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:52,726 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:52,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable426 [2022-12-06 07:26:52,726 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-06 07:26:52,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:52,727 INFO L85 PathProgramCache]: Analyzing trace with hash 720048538, now seen corresponding path program 1 times [2022-12-06 07:26:52,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:52,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925911905] [2022-12-06 07:26:52,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:52,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:52,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:52,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-06 07:26:52,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:52,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925911905] [2022-12-06 07:26:52,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925911905] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:52,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:52,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:52,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070936397] [2022-12-06 07:26:52,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:52,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:52,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:52,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:52,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:52,785 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:52,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:52,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:52,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:52,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:52,826 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:52,826 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:52,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:52,826 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:52,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:52,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:52,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:52,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:52,827 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:52,827 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:52,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:52,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:52,828 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:52,828 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:52,828 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:52,828 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:52,828 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:52,828 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:52,828 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:52,828 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:52,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:52,831 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:52,831 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:52,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:52,831 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:52,831 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:52,904 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:52,904 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:52,904 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:52,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:52,905 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:52,905 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:52,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable427 [2022-12-06 07:26:52,905 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-06 07:26:52,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:52,905 INFO L85 PathProgramCache]: Analyzing trace with hash 746830647, now seen corresponding path program 1 times [2022-12-06 07:26:52,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:52,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755474380] [2022-12-06 07:26:52,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:52,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:52,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-06 07:26:52,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:52,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755474380] [2022-12-06 07:26:52,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755474380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:52,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:52,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:52,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987089678] [2022-12-06 07:26:52,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:52,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:52,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:52,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:52,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:52,971 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:52,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:52,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:52,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:52,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:53,007 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:53,007 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:53,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 371 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:53,008 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:53,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:53,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:53,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:53,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:53,008 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:53,008 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:53,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:53,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:53,009 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:53,009 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:53,009 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:53,009 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:53,009 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:53,009 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:53,009 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:53,009 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:53,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:53,012 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:53,012 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:53,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:53,012 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:53,012 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:53,084 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:53,084 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:26:53,084 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:53,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:53,084 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:53,084 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:53,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable428 [2022-12-06 07:26:53,084 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-06 07:26:53,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:53,085 INFO L85 PathProgramCache]: Analyzing trace with hash 777306840, now seen corresponding path program 1 times [2022-12-06 07:26:53,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:53,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975725351] [2022-12-06 07:26:53,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:53,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:53,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:53,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-06 07:26:53,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:53,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975725351] [2022-12-06 07:26:53,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975725351] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:53,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:53,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:53,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700544281] [2022-12-06 07:26:53,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:53,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:53,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:53,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:53,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:53,141 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:53,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:53,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:53,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:53,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:53,182 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:53,182 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:53,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:53,183 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:53,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:53,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:53,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:53,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:53,183 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:53,183 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:53,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:53,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:53,184 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:53,184 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:53,184 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:53,184 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:53,184 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:53,184 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:53,184 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:53,184 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:53,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:53,187 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:53,187 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:53,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:53,187 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:53,187 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:53,260 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:53,261 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:53,261 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:53,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:53,261 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:53,261 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:53,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable429 [2022-12-06 07:26:53,261 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-06 07:26:53,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:53,262 INFO L85 PathProgramCache]: Analyzing trace with hash 804088949, now seen corresponding path program 1 times [2022-12-06 07:26:53,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:53,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572894719] [2022-12-06 07:26:53,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:53,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:53,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-06 07:26:53,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:53,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572894719] [2022-12-06 07:26:53,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572894719] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:53,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:53,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:53,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646638086] [2022-12-06 07:26:53,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:53,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:53,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:53,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:53,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:53,319 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:53,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:53,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:53,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:53,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:53,359 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:53,359 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:53,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:53,360 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:53,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:53,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:53,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:53,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:53,360 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:53,360 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:53,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:53,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:53,361 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:53,361 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:53,361 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:53,361 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:53,361 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:53,362 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:53,362 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:53,362 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:53,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:53,365 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:53,365 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:53,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:53,365 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:53,365 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:53,451 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:53,452 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-06 07:26:53,452 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:53,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:53,452 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:53,452 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:53,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable430 [2022-12-06 07:26:53,452 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-06 07:26:53,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:53,452 INFO L85 PathProgramCache]: Analyzing trace with hash 834565142, now seen corresponding path program 1 times [2022-12-06 07:26:53,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:53,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338808412] [2022-12-06 07:26:53,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:53,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:53,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-06 07:26:53,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:53,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338808412] [2022-12-06 07:26:53,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338808412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:53,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:53,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:53,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845265170] [2022-12-06 07:26:53,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:53,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:53,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:53,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:53,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:53,510 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:53,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:53,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:53,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:53,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:53,545 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:53,545 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:53,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:53,545 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:53,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:53,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:53,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:53,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:53,546 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:53,546 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:53,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:53,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:53,547 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:53,547 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:53,547 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:53,547 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:53,547 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:53,547 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:53,547 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:53,547 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:53,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:53,549 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:53,550 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:53,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:53,550 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:53,550 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:53,640 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:53,640 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-06 07:26:53,640 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:53,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:53,641 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:53,641 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:53,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable431 [2022-12-06 07:26:53,641 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-06 07:26:53,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:53,641 INFO L85 PathProgramCache]: Analyzing trace with hash 861347251, now seen corresponding path program 1 times [2022-12-06 07:26:53,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:53,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617052506] [2022-12-06 07:26:53,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:53,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:53,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-06 07:26:53,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:53,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617052506] [2022-12-06 07:26:53,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617052506] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:53,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:53,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:53,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531507732] [2022-12-06 07:26:53,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:53,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:53,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:53,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:53,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:53,706 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:53,706 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:53,706 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:53,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:53,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:53,742 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:53,742 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:53,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:53,742 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:53,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:53,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:53,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:53,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:53,743 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:53,743 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:53,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:53,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:53,744 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:53,744 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:53,744 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:53,744 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:53,744 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:53,744 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:53,744 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:53,744 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:53,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:53,746 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:53,746 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:53,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:53,747 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:53,747 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:53,820 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:53,821 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:53,821 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:53,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:53,821 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:53,821 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:53,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable432 [2022-12-06 07:26:53,821 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-06 07:26:53,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:53,821 INFO L85 PathProgramCache]: Analyzing trace with hash 891823444, now seen corresponding path program 1 times [2022-12-06 07:26:53,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:53,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685379741] [2022-12-06 07:26:53,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:53,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:53,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-06 07:26:53,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:53,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685379741] [2022-12-06 07:26:53,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685379741] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:53,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:53,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:53,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172864972] [2022-12-06 07:26:53,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:53,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:53,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:53,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:53,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:53,892 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:53,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:53,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:53,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:53,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:53,939 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:53,939 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:53,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:53,940 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:53,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:53,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:53,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:53,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:53,940 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:53,940 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:53,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:53,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:53,941 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:53,941 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:53,941 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:53,941 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:53,941 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:53,942 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:53,942 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:53,942 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:53,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:53,944 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:53,944 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:53,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:53,944 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:53,944 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:54,016 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:54,016 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:26:54,016 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:54,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:54,017 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:54,017 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:54,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable433 [2022-12-06 07:26:54,017 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-06 07:26:54,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:54,017 INFO L85 PathProgramCache]: Analyzing trace with hash 918605553, now seen corresponding path program 1 times [2022-12-06 07:26:54,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:54,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22332980] [2022-12-06 07:26:54,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:54,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:54,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-06 07:26:54,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:54,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22332980] [2022-12-06 07:26:54,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22332980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:54,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:54,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:54,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250123825] [2022-12-06 07:26:54,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:54,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:54,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:54,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:54,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:54,076 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:54,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:54,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:54,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:54,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:54,110 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:54,110 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:54,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:54,110 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:54,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:54,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:54,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:54,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:54,111 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:54,111 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:54,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:54,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:54,111 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:54,111 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:54,112 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:54,112 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:54,112 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:54,112 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:54,112 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:54,112 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:54,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:54,114 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:54,114 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:54,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:54,114 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:54,115 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:54,187 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:54,187 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:26:54,187 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:54,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:54,187 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:54,187 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:54,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable434 [2022-12-06 07:26:54,188 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-06 07:26:54,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:54,188 INFO L85 PathProgramCache]: Analyzing trace with hash 949081746, now seen corresponding path program 1 times [2022-12-06 07:26:54,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:54,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691926295] [2022-12-06 07:26:54,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:54,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:54,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-06 07:26:54,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:54,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691926295] [2022-12-06 07:26:54,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691926295] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:54,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:54,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:54,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298482191] [2022-12-06 07:26:54,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:54,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:54,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:54,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:54,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:54,245 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:54,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:54,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:54,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:54,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:54,287 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:54,287 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:54,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:54,288 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:54,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:54,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:54,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:54,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:54,288 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:54,288 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:54,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:54,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:54,289 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:54,289 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:54,289 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:54,289 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:54,289 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:54,290 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:54,290 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:54,290 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:54,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:54,292 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:54,292 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:54,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:54,292 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:54,292 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:54,363 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:54,363 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:26:54,363 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:54,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:54,363 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:54,363 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:54,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable435 [2022-12-06 07:26:54,363 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-06 07:26:54,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:54,364 INFO L85 PathProgramCache]: Analyzing trace with hash 975863855, now seen corresponding path program 1 times [2022-12-06 07:26:54,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:54,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157904441] [2022-12-06 07:26:54,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:54,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:54,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-06 07:26:54,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:54,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157904441] [2022-12-06 07:26:54,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157904441] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:54,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:54,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:54,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949233989] [2022-12-06 07:26:54,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:54,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:54,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:54,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:54,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:54,427 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:54,427 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:54,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:54,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:54,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:54,468 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:54,468 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:54,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:54,469 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:54,469 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:54,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:54,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:54,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:54,469 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:54,469 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:54,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:54,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:54,470 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:54,470 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:54,470 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:54,470 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:54,470 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:54,471 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:54,471 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:54,471 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:54,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:54,473 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:54,473 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:54,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:54,473 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:54,473 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:54,554 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:54,554 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:26:54,555 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:54,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:54,555 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:54,555 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:54,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable436 [2022-12-06 07:26:54,555 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-06 07:26:54,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:54,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1006340048, now seen corresponding path program 1 times [2022-12-06 07:26:54,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:54,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098296917] [2022-12-06 07:26:54,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:54,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:54,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-06 07:26:54,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:54,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098296917] [2022-12-06 07:26:54,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098296917] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:54,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:54,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:54,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608059461] [2022-12-06 07:26:54,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:54,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:54,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:54,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:54,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:54,611 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:54,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:54,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:54,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:54,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:54,647 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:54,647 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:54,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:54,648 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:54,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:54,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:54,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:54,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:54,648 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:54,649 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:54,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:54,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:54,649 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:54,649 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:54,649 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:54,650 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:54,650 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:54,650 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:54,650 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:54,650 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:54,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:54,652 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:54,652 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:54,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:54,652 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:54,652 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:54,725 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:54,726 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:54,726 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:54,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:54,726 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:54,726 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:54,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable437 [2022-12-06 07:26:54,726 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-06 07:26:54,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:54,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1033122157, now seen corresponding path program 1 times [2022-12-06 07:26:54,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:54,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929400462] [2022-12-06 07:26:54,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:54,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:54,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:54,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:54,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929400462] [2022-12-06 07:26:54,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929400462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:54,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:54,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:54,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875779703] [2022-12-06 07:26:54,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:54,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:54,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:54,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:54,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:54,787 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:54,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:54,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:54,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:54,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:54,827 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:54,828 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:54,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:54,828 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:54,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:54,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:54,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:54,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:54,829 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:54,829 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:54,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:54,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:54,829 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:54,829 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:54,830 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:54,830 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:54,830 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:54,830 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:54,830 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:54,830 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:54,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:54,832 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:54,832 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:54,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:54,833 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:54,833 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:54,905 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:54,905 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:26:54,905 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:54,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:54,906 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:54,906 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:54,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable438 [2022-12-06 07:26:54,906 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-06 07:26:54,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:54,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1063598350, now seen corresponding path program 1 times [2022-12-06 07:26:54,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:54,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509117475] [2022-12-06 07:26:54,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:54,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:54,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-06 07:26:54,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:54,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509117475] [2022-12-06 07:26:54,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509117475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:54,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:54,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:54,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916994316] [2022-12-06 07:26:54,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:54,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:54,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:54,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:54,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:54,962 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:54,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:54,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:54,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:54,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:55,003 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:55,003 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:55,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:55,003 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:55,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:55,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:55,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:55,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:55,004 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:55,004 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:55,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:55,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:55,005 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:55,005 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:55,005 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:55,005 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:55,005 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:55,005 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:55,005 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:55,005 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:55,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:55,008 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:55,008 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:55,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 118 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:55,008 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:55,008 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:55,092 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:55,093 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 07:26:55,093 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:55,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:55,093 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:55,093 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:55,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable439 [2022-12-06 07:26:55,093 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-06 07:26:55,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:55,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1090380459, now seen corresponding path program 1 times [2022-12-06 07:26:55,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:55,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775982841] [2022-12-06 07:26:55,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:55,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:55,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:55,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-06 07:26:55,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:55,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775982841] [2022-12-06 07:26:55,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775982841] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:55,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:55,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:55,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015387169] [2022-12-06 07:26:55,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:55,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:55,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:55,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:55,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:55,162 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:55,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:55,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:55,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:55,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:55,203 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:55,203 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:55,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:55,203 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:55,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:55,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:55,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:55,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:55,204 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:55,204 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:55,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:55,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:55,205 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:55,205 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:55,205 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:55,205 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:55,205 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:55,205 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:55,205 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:55,205 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:55,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:55,207 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:55,208 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:55,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:55,208 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:55,208 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:55,281 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:55,281 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:55,281 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:55,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:55,281 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:55,281 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:55,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable440 [2022-12-06 07:26:55,282 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-06 07:26:55,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:55,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1120856652, now seen corresponding path program 1 times [2022-12-06 07:26:55,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:55,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670868146] [2022-12-06 07:26:55,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:55,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:55,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-06 07:26:55,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:55,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670868146] [2022-12-06 07:26:55,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670868146] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:55,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:55,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:55,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675954206] [2022-12-06 07:26:55,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:55,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:55,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:55,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:55,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:55,338 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:55,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:55,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:55,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:55,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:55,379 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:55,380 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:55,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:55,380 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:55,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:55,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:55,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:55,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:55,381 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:55,381 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:55,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:55,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:55,381 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:55,381 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:55,382 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:55,382 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:55,382 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:55,382 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:55,382 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:55,382 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:55,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:55,384 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:55,384 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:55,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:55,385 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:55,385 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:55,458 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:55,459 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:26:55,459 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:55,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:55,459 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:55,459 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:55,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable441 [2022-12-06 07:26:55,459 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-06 07:26:55,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:55,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1147638761, now seen corresponding path program 1 times [2022-12-06 07:26:55,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:55,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699697163] [2022-12-06 07:26:55,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:55,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:55,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-06 07:26:55,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:55,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699697163] [2022-12-06 07:26:55,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699697163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:55,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:55,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:55,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227774957] [2022-12-06 07:26:55,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:55,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:55,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:55,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:55,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:55,517 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:55,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:55,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:55,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:55,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:55,558 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:55,558 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:55,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:55,558 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:55,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:55,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:55,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:55,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:55,561 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:55,561 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:55,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:55,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:55,562 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:55,562 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:55,562 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:55,562 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:55,562 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:55,562 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:55,562 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:55,562 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:55,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:55,564 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:55,565 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:55,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:55,565 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:55,565 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:55,637 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:55,638 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:55,638 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:55,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:55,638 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:55,638 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:55,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable442 [2022-12-06 07:26:55,638 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-06 07:26:55,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:55,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1178114954, now seen corresponding path program 1 times [2022-12-06 07:26:55,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:55,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630163461] [2022-12-06 07:26:55,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:55,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:55,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-06 07:26:55,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:55,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630163461] [2022-12-06 07:26:55,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630163461] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:55,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:55,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:55,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764613757] [2022-12-06 07:26:55,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:55,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:55,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:55,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:55,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:55,697 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:55,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:55,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:55,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:55,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:55,739 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:55,739 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:55,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:55,739 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:55,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:55,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:55,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:55,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:55,740 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:55,740 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:55,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:55,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:55,741 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:55,741 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:55,741 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:55,741 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:55,741 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:55,741 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:55,741 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:55,741 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:55,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:55,744 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:55,744 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:55,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:55,744 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:55,744 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:55,817 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:55,817 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:55,817 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:55,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:55,818 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:55,818 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:55,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable443 [2022-12-06 07:26:55,818 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-06 07:26:55,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:55,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1204897063, now seen corresponding path program 1 times [2022-12-06 07:26:55,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:55,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291556646] [2022-12-06 07:26:55,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:55,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:55,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:55,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:55,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291556646] [2022-12-06 07:26:55,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291556646] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:55,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:55,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:55,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488201302] [2022-12-06 07:26:55,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:55,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:55,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:55,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:55,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:55,885 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:55,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:55,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:55,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:55,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:55,921 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:55,921 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:55,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:55,921 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:55,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:55,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:55,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:55,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:55,922 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:55,922 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:55,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:55,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:55,923 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:55,923 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:55,923 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:55,923 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:55,923 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:55,923 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:55,923 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:55,923 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:55,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:55,926 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:55,926 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:55,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:55,926 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:55,926 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:55,999 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:55,999 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:55,999 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:56,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:56,000 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:56,000 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:56,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable444 [2022-12-06 07:26:56,000 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-06 07:26:56,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:56,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1235373256, now seen corresponding path program 1 times [2022-12-06 07:26:56,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:56,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018733029] [2022-12-06 07:26:56,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:56,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:56,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-06 07:26:56,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:56,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018733029] [2022-12-06 07:26:56,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018733029] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:56,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:56,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:56,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555000623] [2022-12-06 07:26:56,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:56,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:56,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:56,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:56,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:56,059 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:56,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:56,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:56,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:56,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:56,103 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:56,103 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:56,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:56,104 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:56,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:56,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:56,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:56,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:56,105 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:56,105 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:56,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:56,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:56,105 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:56,105 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:56,106 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:56,106 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:56,106 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:56,106 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:56,106 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:56,106 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:56,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:56,108 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:56,108 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:56,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:56,109 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:56,109 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:56,181 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:56,182 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:56,182 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:56,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:56,182 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:56,182 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:56,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable445 [2022-12-06 07:26:56,182 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-06 07:26:56,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:56,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1262155365, now seen corresponding path program 1 times [2022-12-06 07:26:56,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:56,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799679979] [2022-12-06 07:26:56,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:56,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:56,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-06 07:26:56,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:56,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799679979] [2022-12-06 07:26:56,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799679979] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:56,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:56,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:56,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048292830] [2022-12-06 07:26:56,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:56,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:56,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:56,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:56,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:56,242 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:56,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:56,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:56,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:56,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:56,282 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:56,282 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:56,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:56,283 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:56,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:56,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:56,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:56,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:56,283 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:56,284 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:56,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:56,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:56,284 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:56,284 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:56,284 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:56,285 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:56,285 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:56,285 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:56,285 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:56,285 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:56,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:56,287 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:56,287 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:56,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:56,287 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:56,288 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:56,359 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:56,360 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:26:56,360 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:56,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:56,360 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:56,360 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:56,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable446 [2022-12-06 07:26:56,360 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-06 07:26:56,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:56,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1292631558, now seen corresponding path program 1 times [2022-12-06 07:26:56,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:56,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142226087] [2022-12-06 07:26:56,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:56,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26: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-06 07:26:56,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:56,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142226087] [2022-12-06 07:26:56,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142226087] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:56,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:56,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:56,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907545560] [2022-12-06 07:26:56,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:56,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:56,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:56,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:56,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:56,431 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:56,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:56,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:56,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:56,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:56,472 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:56,472 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:56,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:56,473 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:56,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:56,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:56,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:56,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:56,473 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:56,473 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:56,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:56,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:56,474 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:56,474 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:56,474 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:56,474 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:56,475 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:56,475 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:56,475 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:56,475 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:56,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:56,477 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:56,477 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:56,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:56,478 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:56,478 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:56,550 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:56,550 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:56,550 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:56,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:56,550 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:56,550 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:56,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable447 [2022-12-06 07:26:56,551 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-06 07:26:56,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:56,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1319413667, now seen corresponding path program 1 times [2022-12-06 07:26:56,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:56,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111964263] [2022-12-06 07:26:56,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:56,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:56,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-06 07:26:56,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:56,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111964263] [2022-12-06 07:26:56,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111964263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:56,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:56,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:56,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879756421] [2022-12-06 07:26:56,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:56,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:56,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:56,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:56,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:56,632 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:56,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:56,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:56,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:56,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:56,667 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:56,668 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:56,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:56,668 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:56,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:56,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:56,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:56,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:56,669 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:56,669 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:56,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:56,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:56,669 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:56,669 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:56,670 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:56,670 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:56,670 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:56,670 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:56,670 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:56,670 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:56,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:56,672 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:56,672 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:56,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:56,673 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:56,673 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:56,744 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:56,745 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:26:56,745 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:56,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:56,745 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:56,745 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:56,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable448 [2022-12-06 07:26:56,745 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-06 07:26:56,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:56,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1349889860, now seen corresponding path program 1 times [2022-12-06 07:26:56,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:56,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85899041] [2022-12-06 07:26:56,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:56,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:56,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-06 07:26:56,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:56,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85899041] [2022-12-06 07:26:56,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85899041] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:56,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:56,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:56,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292887772] [2022-12-06 07:26:56,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:56,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:56,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:56,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:56,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:56,800 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:56,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:56,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:56,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:56,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:56,842 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:56,843 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:56,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:56,843 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:56,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:56,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:56,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:56,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:56,844 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:56,844 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:56,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:56,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:56,844 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:56,844 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:56,845 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:56,845 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:56,845 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:56,845 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:56,845 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:56,845 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:56,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:56,847 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:56,847 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:56,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:56,848 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:56,848 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:56,921 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:56,921 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:56,921 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:56,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:56,921 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:56,921 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:56,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable449 [2022-12-06 07:26:56,921 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-06 07:26:56,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:56,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1376671969, now seen corresponding path program 1 times [2022-12-06 07:26:56,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:56,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334288081] [2022-12-06 07:26:56,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:56,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:56,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-06 07:26:56,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:56,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334288081] [2022-12-06 07:26:56,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334288081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:56,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:56,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:56,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881396645] [2022-12-06 07:26:56,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:56,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:56,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:56,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:56,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:56,983 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:56,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:56,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:56,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:56,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:57,022 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:57,022 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:57,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 373 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:57,022 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:57,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:57,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:57,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:57,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:57,023 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:57,023 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:57,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:57,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:57,024 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:57,024 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:57,024 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:57,024 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:57,024 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:57,024 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:57,024 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:57,024 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:57,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:57,027 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:57,027 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:57,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:57,027 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:57,027 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:57,100 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:57,100 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:57,100 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:57,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:57,101 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:57,101 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:57,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable450 [2022-12-06 07:26:57,101 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-06 07:26:57,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:57,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1407148162, now seen corresponding path program 1 times [2022-12-06 07:26:57,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:57,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919458931] [2022-12-06 07:26:57,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:57,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:57,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-06 07:26:57,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:57,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919458931] [2022-12-06 07:26:57,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919458931] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:57,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:57,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:57,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854297598] [2022-12-06 07:26:57,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:57,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:57,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:57,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:57,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:57,158 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:57,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:57,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:57,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:57,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:57,200 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:57,200 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:57,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:57,201 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:57,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:57,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:57,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:57,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:57,201 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:57,201 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:57,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:57,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:57,202 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:57,202 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:57,202 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:57,202 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:57,202 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:57,202 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:57,202 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:57,203 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:57,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:57,205 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:57,205 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:57,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:57,205 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:57,205 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:57,277 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:57,278 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:57,278 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:57,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:57,278 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:57,278 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:57,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable451 [2022-12-06 07:26:57,278 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-06 07:26:57,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:57,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1433930271, now seen corresponding path program 1 times [2022-12-06 07:26:57,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:57,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279340934] [2022-12-06 07:26:57,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:57,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:57,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:57,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:57,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279340934] [2022-12-06 07:26:57,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279340934] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:57,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:57,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:57,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716756104] [2022-12-06 07:26:57,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:57,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:57,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:57,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:57,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:57,344 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:57,344 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:57,344 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:57,344 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:57,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:57,379 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:57,379 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:57,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:57,380 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:57,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:57,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:57,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:57,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:57,381 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:57,381 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:57,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:57,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:57,381 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:57,381 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:57,382 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:57,382 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:57,382 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:57,382 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:57,382 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:57,382 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:57,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:57,384 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:57,384 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:57,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:57,385 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:57,385 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:57,457 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:57,457 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:26:57,457 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:57,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:57,457 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:57,457 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:57,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable452 [2022-12-06 07:26:57,457 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-06 07:26:57,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:57,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1464406464, now seen corresponding path program 1 times [2022-12-06 07:26:57,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:57,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437857337] [2022-12-06 07:26:57,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:57,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:57,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-06 07:26:57,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:57,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437857337] [2022-12-06 07:26:57,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437857337] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:57,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:57,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:57,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427995688] [2022-12-06 07:26:57,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:57,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:57,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:57,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:57,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:57,514 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:57,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:57,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:57,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:57,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:57,550 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:57,550 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:57,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:57,551 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:57,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:57,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:57,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:57,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:57,551 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:57,551 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:57,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:57,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:57,552 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:57,552 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:57,552 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:57,552 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:57,552 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:57,553 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:57,553 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:57,553 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:57,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:57,555 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:57,555 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:57,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:57,555 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:57,555 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:57,627 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:57,628 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:57,628 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:57,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:57,628 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:57,628 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:57,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable453 [2022-12-06 07:26:57,628 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-06 07:26:57,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:57,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1491188573, now seen corresponding path program 1 times [2022-12-06 07:26:57,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:57,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397512369] [2022-12-06 07:26:57,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:57,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:57,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:57,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-06 07:26:57,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:57,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397512369] [2022-12-06 07:26:57,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397512369] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:57,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:57,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:57,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629874462] [2022-12-06 07:26:57,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:57,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:57,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:57,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:57,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:57,688 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:57,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:57,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:57,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:57,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:57,724 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:57,724 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:57,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:57,725 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:57,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:57,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:57,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:57,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:57,725 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:57,725 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:57,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:57,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:57,726 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:57,726 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:57,726 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:57,727 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:57,727 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:57,727 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:57,727 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:57,727 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:57,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:57,729 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:57,729 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:57,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:57,730 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:57,730 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:57,800 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:57,800 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 73 [2022-12-06 07:26:57,800 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:57,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:57,801 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:57,801 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:57,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable454 [2022-12-06 07:26:57,801 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-06 07:26:57,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:57,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1521664766, now seen corresponding path program 1 times [2022-12-06 07:26:57,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:57,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267929291] [2022-12-06 07:26:57,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:57,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26: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-06 07:26:57,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:57,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267929291] [2022-12-06 07:26:57,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267929291] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:57,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:57,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:57,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276954409] [2022-12-06 07:26:57,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:57,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:57,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:57,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:57,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:57,857 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:57,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:57,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:57,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:57,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:57,895 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:57,895 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:57,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:57,895 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:57,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:57,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:57,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:57,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:57,896 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:57,896 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:57,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:57,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:57,897 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:57,897 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:57,899 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:57,899 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:57,899 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:57,899 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:57,899 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:57,899 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:57,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:57,901 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:57,901 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:57,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:57,902 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:57,902 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:57,974 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:57,975 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:57,975 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:57,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:57,975 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:57,975 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:57,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable455 [2022-12-06 07:26:57,975 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-06 07:26:57,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:57,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1548446875, now seen corresponding path program 1 times [2022-12-06 07:26:57,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:57,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958241796] [2022-12-06 07:26:57,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:57,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26: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-06 07:26:58,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:58,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958241796] [2022-12-06 07:26:58,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958241796] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:58,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:58,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:58,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900500220] [2022-12-06 07:26:58,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:58,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:58,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:58,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:58,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:58,045 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:58,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:58,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:58,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:58,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:58,082 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:58,082 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:58,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:58,083 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:58,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:58,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:58,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:58,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:58,083 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:58,083 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:58,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:58,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:58,084 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:58,084 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:58,084 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:58,084 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:58,085 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:58,085 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:58,085 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:58,085 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:58,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:58,087 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:58,087 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:58,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:58,087 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:58,087 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:58,158 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:58,159 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:26:58,159 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:58,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:58,159 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:58,159 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:58,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable456 [2022-12-06 07:26:58,159 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-06 07:26:58,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:58,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1578923068, now seen corresponding path program 1 times [2022-12-06 07:26:58,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:58,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061244114] [2022-12-06 07:26:58,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:58,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:58,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-06 07:26:58,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:58,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061244114] [2022-12-06 07:26:58,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061244114] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:58,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:58,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:58,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473908955] [2022-12-06 07:26:58,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:58,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:58,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:58,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:58,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:58,215 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:58,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:58,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:58,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:58,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:58,252 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:58,252 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:58,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:58,253 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:58,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:58,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:58,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:58,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:58,253 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:58,253 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:58,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:58,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:58,254 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:58,254 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:58,254 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:58,254 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:58,254 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:58,254 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:58,254 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:58,255 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:58,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:58,257 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:58,257 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:58,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:58,257 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:58,257 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:58,330 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:58,330 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:58,330 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:58,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:58,330 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:58,330 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:58,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable457 [2022-12-06 07:26:58,331 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-06 07:26:58,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:58,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1605705177, now seen corresponding path program 1 times [2022-12-06 07:26:58,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:58,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921077945] [2022-12-06 07:26:58,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:58,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:58,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-06 07:26:58,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:58,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921077945] [2022-12-06 07:26:58,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921077945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:58,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:58,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:58,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187463017] [2022-12-06 07:26:58,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:58,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:58,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:58,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:58,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:58,390 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:58,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:58,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:58,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:58,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:58,426 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:58,426 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:58,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:58,427 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:58,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:58,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:58,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:58,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:58,428 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:58,428 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:58,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:58,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:58,428 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:58,428 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:58,428 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:58,429 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:58,429 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:58,429 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:58,429 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:58,429 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:58,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:58,431 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:58,431 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:58,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:58,431 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:58,431 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:58,502 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:58,502 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 73 [2022-12-06 07:26:58,503 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:58,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:58,503 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:58,503 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:58,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable458 [2022-12-06 07:26:58,503 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-06 07:26:58,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:58,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1636181370, now seen corresponding path program 1 times [2022-12-06 07:26:58,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:58,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202014970] [2022-12-06 07:26:58,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:58,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:58,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-06 07:26:58,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:58,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202014970] [2022-12-06 07:26:58,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202014970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:58,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:58,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:58,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123735066] [2022-12-06 07:26:58,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:58,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:58,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:58,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:58,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:58,562 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:58,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:58,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:58,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:58,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:58,603 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:58,603 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:58,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:58,604 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:58,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:58,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:58,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:58,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:58,604 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:58,604 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:58,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:58,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:58,605 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:58,605 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:58,605 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:58,605 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:58,605 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:58,606 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:58,606 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:58,606 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:58,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:58,608 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:58,608 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:58,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 118 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:58,608 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:58,608 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:58,680 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:58,681 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:58,681 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:58,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:58,681 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:58,681 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:58,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable459 [2022-12-06 07:26:58,681 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-06 07:26:58,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:58,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1662963479, now seen corresponding path program 1 times [2022-12-06 07:26:58,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:58,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555282444] [2022-12-06 07:26:58,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:58,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:58,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-06 07:26:58,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:58,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555282444] [2022-12-06 07:26:58,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555282444] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:58,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:58,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:58,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943804475] [2022-12-06 07:26:58,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:58,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:58,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:58,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:58,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:58,750 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:58,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:58,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:58,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:58,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:58,786 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:58,786 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:58,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:58,787 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:58,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:58,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:58,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:58,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:58,787 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:58,787 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:58,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:58,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:58,788 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:58,788 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:58,788 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:58,788 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:58,788 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:58,788 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:58,788 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:58,788 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:58,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:58,791 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:58,791 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:58,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:58,791 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:58,791 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:58,866 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:58,867 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:26:58,867 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:58,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:58,867 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:58,867 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:58,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable460 [2022-12-06 07:26:58,867 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-06 07:26:58,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:58,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1693439672, now seen corresponding path program 1 times [2022-12-06 07:26:58,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:58,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372485917] [2022-12-06 07:26:58,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:58,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:58,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-06 07:26:58,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:58,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372485917] [2022-12-06 07:26:58,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372485917] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:58,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:58,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:58,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599392090] [2022-12-06 07:26:58,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:58,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:58,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:58,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:58,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:58,927 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:58,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:58,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:58,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:58,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:58,970 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:58,970 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:58,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:58,971 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:58,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:58,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:58,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:58,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:58,971 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:58,971 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:58,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:58,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:58,972 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:58,972 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:58,972 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:58,972 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:58,972 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:58,972 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:58,972 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:58,972 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:58,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:58,975 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:58,975 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:58,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:58,975 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:58,975 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:59,046 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:59,047 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:26:59,047 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:59,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:59,047 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:59,047 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:59,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable461 [2022-12-06 07:26:59,047 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-06 07:26:59,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:59,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1720221781, now seen corresponding path program 1 times [2022-12-06 07:26:59,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:59,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820848663] [2022-12-06 07:26:59,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:59,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:59,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:59,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:59,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820848663] [2022-12-06 07:26:59,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820848663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:59,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:59,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:59,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395571157] [2022-12-06 07:26:59,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:59,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:59,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:59,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:59,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:59,107 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:59,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:59,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:59,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:59,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:59,145 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:59,145 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:59,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 372 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:59,146 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:59,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:59,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:59,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:59,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:59,146 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:59,146 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:59,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:59,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:59,147 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:59,147 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:59,147 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:59,147 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:59,148 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:59,148 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:59,148 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:59,148 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:59,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:59,150 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:59,150 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:59,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:59,150 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:59,150 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:59,223 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:59,223 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:59,223 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:59,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:59,223 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:59,223 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:59,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable462 [2022-12-06 07:26:59,224 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-06 07:26:59,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:59,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1750697974, now seen corresponding path program 1 times [2022-12-06 07:26:59,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:59,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989981687] [2022-12-06 07:26:59,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:59,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:59,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-06 07:26:59,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:59,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989981687] [2022-12-06 07:26:59,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989981687] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:59,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:59,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:59,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826691675] [2022-12-06 07:26:59,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:59,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:59,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:59,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:59,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:59,294 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:59,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:59,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:59,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:59,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:59,337 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:59,337 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:26:59,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:59,337 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:59,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:59,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:59,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:59,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:59,338 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:59,338 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:59,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:59,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:59,338 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:59,339 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:59,339 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:59,339 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:59,339 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:59,339 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:59,339 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:59,339 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:59,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:59,341 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:59,341 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:59,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:59,342 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:59,342 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:59,413 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:59,414 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:26:59,414 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:59,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:59,414 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:59,414 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:59,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable463 [2022-12-06 07:26:59,414 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-06 07:26:59,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:59,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1777480083, now seen corresponding path program 1 times [2022-12-06 07:26:59,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:59,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792373572] [2022-12-06 07:26:59,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:59,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:59,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:59,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:59,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792373572] [2022-12-06 07:26:59,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792373572] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:59,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:59,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:59,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758157121] [2022-12-06 07:26:59,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:59,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:59,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:59,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:59,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:59,478 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:59,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:59,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:59,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:59,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:59,514 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:59,514 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:59,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:59,514 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:59,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:59,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:59,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:59,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:59,515 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:59,515 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:59,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:59,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:59,516 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:59,516 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:59,516 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:59,516 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:59,516 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:59,516 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:59,516 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:59,516 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:59,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:59,518 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:59,518 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:59,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:59,519 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:59,519 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:59,589 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:59,590 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:26:59,590 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:59,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:59,590 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:59,590 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:59,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable464 [2022-12-06 07:26:59,590 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-06 07:26:59,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:59,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1807956276, now seen corresponding path program 1 times [2022-12-06 07:26:59,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:59,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870234541] [2022-12-06 07:26:59,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:59,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:59,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-06 07:26:59,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:59,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870234541] [2022-12-06 07:26:59,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870234541] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:59,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:59,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:59,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280634757] [2022-12-06 07:26:59,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:59,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:59,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:59,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:59,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:59,650 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:59,650 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:59,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:59,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:59,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:59,693 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:26:59,693 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:26:59,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:26:59,694 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:26:59,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:59,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:59,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:59,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:59,694 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:59,694 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:59,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:59,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:59,695 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:59,695 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:59,695 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:59,695 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:59,695 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:59,696 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:59,696 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:59,696 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:59,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:59,698 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:26:59,698 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:26:59,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:26:59,698 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:59,698 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:26:59,769 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:59,770 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:26:59,770 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:26:59,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:59,770 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:59,770 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:59,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable465 [2022-12-06 07:26:59,770 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-06 07:26:59,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:59,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1834738385, now seen corresponding path program 1 times [2022-12-06 07:26:59,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:59,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855712005] [2022-12-06 07:26:59,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:59,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:59,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-06 07:26:59,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:59,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855712005] [2022-12-06 07:26:59,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855712005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:59,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:59,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:59,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902584312] [2022-12-06 07:26:59,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:59,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:59,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:59,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:59,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:59,829 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:59,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:59,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:59,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:59,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:59,864 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:26:59,864 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:26:59,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:26:59,865 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:26:59,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:59,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:59,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:59,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:26:59,865 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:26:59,865 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:26:59,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:26:59,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:59,866 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:59,866 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:26:59,866 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:26:59,866 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:59,866 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:59,866 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:59,867 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:59,867 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:59,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:59,869 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:26:59,869 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:26:59,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:26:59,869 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:26:59,869 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:26:59,941 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:59,942 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:26:59,942 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:26:59,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:59,942 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:59,942 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:59,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable466 [2022-12-06 07:26:59,942 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-06 07:26:59,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:59,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1865214578, now seen corresponding path program 1 times [2022-12-06 07:26:59,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:59,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858965279] [2022-12-06 07:26:59,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:59,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:59,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-06 07:26:59,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:59,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858965279] [2022-12-06 07:26:59,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858965279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:59,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:59,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:26:59,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376432155] [2022-12-06 07:26:59,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:59,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:59,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:59,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:59,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:59,997 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:26:59,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:59,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:59,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:26:59,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:00,039 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:00,039 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:00,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:00,039 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:00,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:00,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:00,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:00,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:00,040 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:00,040 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:00,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:00,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:00,041 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:00,041 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:00,041 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:00,041 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:00,041 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:00,042 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:00,042 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:00,042 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:00,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:00,045 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:00,045 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:00,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:00,046 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:00,046 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:00,138 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:00,138 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 07:27:00,138 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:00,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:00,139 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:00,139 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:00,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable467 [2022-12-06 07:27:00,139 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-06 07:27:00,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:00,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1891996687, now seen corresponding path program 1 times [2022-12-06 07:27:00,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:00,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139182412] [2022-12-06 07:27:00,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:00,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:00,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-06 07:27:00,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:00,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139182412] [2022-12-06 07:27:00,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139182412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:00,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:00,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:00,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518122525] [2022-12-06 07:27:00,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:00,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:00,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:00,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:00,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:00,229 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:00,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:00,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:00,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:00,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:00,270 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:00,270 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:00,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:00,271 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:00,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:00,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:00,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:00,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:00,271 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:00,272 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:00,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:00,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:00,273 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:00,273 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:00,273 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:00,273 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:00,273 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:00,273 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:00,273 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:00,273 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:00,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:00,276 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:00,276 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:00,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:00,277 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:00,277 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:00,367 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:00,367 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 07:27:00,368 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:00,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:00,368 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:00,368 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:00,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable468 [2022-12-06 07:27:00,368 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-06 07:27:00,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:00,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1922472880, now seen corresponding path program 1 times [2022-12-06 07:27:00,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:00,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62099854] [2022-12-06 07:27:00,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:00,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:00,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-06 07:27:00,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:00,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62099854] [2022-12-06 07:27:00,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62099854] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:00,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:00,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:00,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425242004] [2022-12-06 07:27:00,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:00,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:00,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:00,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:00,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:00,438 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:00,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:00,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:00,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:00,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:00,473 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:00,473 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:00,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:00,474 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:00,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:00,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:00,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:00,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:00,474 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:00,474 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:00,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:00,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:00,476 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:00,476 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:00,476 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:00,476 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:00,476 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:00,476 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:00,476 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:00,477 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:00,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:00,479 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:00,480 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:00,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:00,480 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:00,480 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:00,551 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:00,552 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:00,552 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:00,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:00,552 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:00,552 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:00,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable469 [2022-12-06 07:27:00,552 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-06 07:27:00,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:00,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1949254989, now seen corresponding path program 1 times [2022-12-06 07:27:00,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:00,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052673182] [2022-12-06 07:27:00,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:00,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:00,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-06 07:27:00,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:00,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052673182] [2022-12-06 07:27:00,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052673182] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:00,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:00,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:00,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264235896] [2022-12-06 07:27:00,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:00,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:00,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:00,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:00,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:00,611 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:00,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:00,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:00,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:00,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:00,646 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:00,647 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:00,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:00,647 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:00,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:00,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:00,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:00,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:00,648 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:00,648 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:00,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:00,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:00,648 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:00,649 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:00,649 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:00,649 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:00,649 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:00,649 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:00,649 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:00,649 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:00,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:00,651 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:00,652 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:00,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:00,652 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:00,652 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:00,723 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:00,723 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:27:00,723 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:00,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:00,724 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:00,724 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:00,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable470 [2022-12-06 07:27:00,724 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-06 07:27:00,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:00,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1979731182, now seen corresponding path program 1 times [2022-12-06 07:27:00,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:00,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360807296] [2022-12-06 07:27:00,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:00,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:00,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-06 07:27:00,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:00,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360807296] [2022-12-06 07:27:00,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360807296] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:00,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:00,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:00,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499740125] [2022-12-06 07:27:00,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:00,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:00,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:00,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:00,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:00,780 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:00,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:00,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:00,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:00,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:00,823 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:00,823 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:00,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:00,823 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:00,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:00,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:00,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:00,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:00,824 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:00,824 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:00,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:00,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:00,825 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:00,825 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:00,825 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:00,825 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:00,825 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:00,825 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:00,825 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:00,825 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:00,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:00,828 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:00,828 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:00,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:00,828 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:00,828 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:00,901 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:00,901 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:00,901 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:00,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:00,901 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:00,901 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:00,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable471 [2022-12-06 07:27:00,901 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-06 07:27:00,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:00,902 INFO L85 PathProgramCache]: Analyzing trace with hash 2006513291, now seen corresponding path program 1 times [2022-12-06 07:27:00,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:00,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807948578] [2022-12-06 07:27:00,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:00,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:00,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-06 07:27:00,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:00,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807948578] [2022-12-06 07:27:00,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807948578] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:00,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:00,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:00,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133961877] [2022-12-06 07:27:00,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:00,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:00,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:00,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:00,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:00,966 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:00,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:00,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:00,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:00,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:01,007 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:01,008 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:01,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:01,008 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:01,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:01,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:01,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:01,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:01,009 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:01,009 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:01,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:01,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:01,010 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:01,010 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:01,010 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:01,010 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:01,010 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:01,010 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:01,010 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:01,010 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:01,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:01,013 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:01,013 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:01,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:01,013 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:01,013 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:01,086 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:01,087 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:01,087 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:01,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:01,087 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:01,087 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:01,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable472 [2022-12-06 07:27:01,087 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-06 07:27:01,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:01,088 INFO L85 PathProgramCache]: Analyzing trace with hash 2036989484, now seen corresponding path program 1 times [2022-12-06 07:27:01,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:01,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260878664] [2022-12-06 07:27:01,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:01,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:01,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-06 07:27:01,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:01,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260878664] [2022-12-06 07:27:01,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260878664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:01,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:01,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:01,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607842005] [2022-12-06 07:27:01,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:01,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:01,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:01,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:01,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:01,149 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:01,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:01,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:01,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:01,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:01,206 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:01,206 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:01,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:01,206 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:01,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:01,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:01,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:01,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:01,207 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:01,207 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:01,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:01,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:01,208 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:01,208 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:01,208 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:01,209 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:01,209 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:01,209 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:01,209 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:01,209 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:01,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:01,212 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:01,212 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:01,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:01,212 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:01,212 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:01,303 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:01,304 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 07:27:01,304 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:01,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:01,304 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:01,304 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:01,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable473 [2022-12-06 07:27:01,304 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-06 07:27:01,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:01,304 INFO L85 PathProgramCache]: Analyzing trace with hash 2063771593, now seen corresponding path program 1 times [2022-12-06 07:27:01,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:01,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389897224] [2022-12-06 07:27:01,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:01,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:01,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-06 07:27:01,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:01,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389897224] [2022-12-06 07:27:01,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389897224] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:01,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:01,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:01,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066471678] [2022-12-06 07:27:01,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:01,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:01,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:01,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:01,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:01,383 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:01,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:01,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:01,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:01,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:01,428 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:01,429 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:01,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 376 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:01,429 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:01,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:01,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:01,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:01,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:01,430 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:01,430 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:01,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:01,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:01,431 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:01,431 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:01,432 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:01,432 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:01,432 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:01,432 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:01,432 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:01,432 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:01,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:01,435 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:01,435 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:01,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:01,436 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:01,436 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:01,526 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:01,527 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 07:27:01,527 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:01,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:01,527 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:01,527 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:01,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable474 [2022-12-06 07:27:01,527 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-06 07:27:01,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:01,527 INFO L85 PathProgramCache]: Analyzing trace with hash 2094247786, now seen corresponding path program 1 times [2022-12-06 07:27:01,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:01,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254972545] [2022-12-06 07:27:01,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:01,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:01,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-06 07:27:01,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:01,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254972545] [2022-12-06 07:27:01,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254972545] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:01,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:01,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:01,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210470363] [2022-12-06 07:27:01,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:01,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:01,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:01,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:01,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:01,588 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:01,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:01,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:01,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:01,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:01,629 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:01,629 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:01,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:01,629 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:01,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:01,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:01,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:01,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:01,630 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:01,630 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:01,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:01,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:01,630 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:01,630 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:01,631 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:01,631 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:01,631 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:01,631 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:01,631 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:01,631 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:01,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:01,633 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:01,633 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:01,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:01,634 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:01,634 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:01,706 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:01,707 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:01,707 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:01,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:01,707 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:01,707 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:01,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable475 [2022-12-06 07:27:01,707 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-06 07:27:01,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:01,708 INFO L85 PathProgramCache]: Analyzing trace with hash 2121029895, now seen corresponding path program 1 times [2022-12-06 07:27:01,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:01,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799976760] [2022-12-06 07:27:01,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:01,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:01,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-06 07:27:01,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:01,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799976760] [2022-12-06 07:27:01,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799976760] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:01,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:01,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:01,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772708219] [2022-12-06 07:27:01,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:01,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:01,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:01,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:01,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:01,775 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:01,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:01,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:01,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:01,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:01,810 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:01,810 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:01,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:01,810 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:01,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:01,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:01,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:01,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:01,811 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:01,811 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:01,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:01,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:01,812 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:01,812 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:01,812 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:01,812 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:01,812 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:01,812 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:01,812 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:01,812 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:01,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:01,814 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:01,814 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:01,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:01,815 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:01,815 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:01,888 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:01,888 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:01,888 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:01,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:01,888 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:01,888 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:01,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable476 [2022-12-06 07:27:01,889 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-06 07:27:01,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:01,889 INFO L85 PathProgramCache]: Analyzing trace with hash -2143461208, now seen corresponding path program 1 times [2022-12-06 07:27:01,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:01,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166778375] [2022-12-06 07:27:01,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:01,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:01,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-06 07:27:01,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:01,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166778375] [2022-12-06 07:27:01,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166778375] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:01,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:01,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:01,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867821427] [2022-12-06 07:27:01,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:01,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:01,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:01,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:01,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:01,948 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:01,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:01,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:01,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:01,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:01,985 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:01,985 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:01,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:01,985 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:01,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:01,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:01,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:01,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:01,986 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:01,986 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:01,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:01,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:01,987 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:01,987 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:01,987 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:01,987 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:01,987 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:01,987 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:01,987 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:01,987 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:01,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:01,990 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:01,990 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:01,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:01,990 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:01,990 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:02,062 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:02,062 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:02,062 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:02,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:02,062 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:02,062 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:02,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable477 [2022-12-06 07:27:02,063 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-06 07:27:02,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:02,063 INFO L85 PathProgramCache]: Analyzing trace with hash -2116679099, now seen corresponding path program 1 times [2022-12-06 07:27:02,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:02,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826423791] [2022-12-06 07:27:02,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:02,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:02,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-06 07:27:02,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:02,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826423791] [2022-12-06 07:27:02,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826423791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:02,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:02,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:02,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813329581] [2022-12-06 07:27:02,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:02,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:02,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:02,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:02,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:02,123 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:02,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:02,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:02,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:02,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:02,163 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:02,163 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:02,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:02,164 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:02,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:02,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:02,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:02,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:02,164 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:02,164 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:02,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:02,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:02,165 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:02,165 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:02,165 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:02,165 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:02,166 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:02,166 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:02,166 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:02,166 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:02,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:02,168 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:02,168 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:02,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:02,168 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:02,168 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:02,240 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:02,240 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:02,240 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:02,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:02,241 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:02,241 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:02,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable478 [2022-12-06 07:27:02,241 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-06 07:27:02,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:02,241 INFO L85 PathProgramCache]: Analyzing trace with hash -2086202906, now seen corresponding path program 1 times [2022-12-06 07:27:02,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:02,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535801180] [2022-12-06 07:27:02,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:02,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:02,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-06 07:27:02,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:02,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535801180] [2022-12-06 07:27:02,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535801180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:02,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:02,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:02,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157276701] [2022-12-06 07:27:02,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:02,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:02,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:02,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:02,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:02,297 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:02,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:02,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:02,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:02,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:02,333 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:02,333 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:02,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:02,334 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:02,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:02,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:02,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:02,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:02,334 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:02,334 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:02,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:02,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:02,335 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:02,335 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:02,335 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:02,335 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:02,335 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:02,336 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:02,336 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:02,336 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:02,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:02,338 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:02,338 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:02,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:02,338 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:02,338 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:02,411 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:02,412 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:02,412 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:02,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:02,412 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:02,412 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:02,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable479 [2022-12-06 07:27:02,412 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-06 07:27:02,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:02,413 INFO L85 PathProgramCache]: Analyzing trace with hash -2059420797, now seen corresponding path program 1 times [2022-12-06 07:27:02,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:02,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074712560] [2022-12-06 07:27:02,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:02,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:02,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-06 07:27:02,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:02,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074712560] [2022-12-06 07:27:02,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074712560] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:02,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:02,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:02,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904279738] [2022-12-06 07:27:02,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:02,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:02,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:02,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:02,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:02,480 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:02,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:02,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:02,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:02,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:02,516 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:02,516 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:02,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:02,516 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:02,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:02,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:02,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:02,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:02,517 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:02,517 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:02,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:02,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:02,518 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:02,518 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:02,518 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:02,518 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:02,518 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:02,518 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:02,518 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:02,518 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:02,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:02,521 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:02,521 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:02,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:02,521 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:02,521 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:02,592 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:02,593 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:02,593 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:02,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:02,593 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:02,593 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:02,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable480 [2022-12-06 07:27:02,593 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-06 07:27:02,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:02,594 INFO L85 PathProgramCache]: Analyzing trace with hash -2028944604, now seen corresponding path program 1 times [2022-12-06 07:27:02,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:02,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058463111] [2022-12-06 07:27:02,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:02,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:02,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-06 07:27:02,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:02,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058463111] [2022-12-06 07:27:02,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058463111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:02,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:02,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:02,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774389558] [2022-12-06 07:27:02,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:02,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:02,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:02,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:02,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:02,654 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:02,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:02,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:02,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:02,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:02,696 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:02,696 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:02,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:02,697 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:02,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:02,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:02,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:02,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:02,697 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:02,697 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:02,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:02,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:02,698 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:02,698 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:02,698 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:02,698 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:02,698 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:02,699 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:02,699 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:02,699 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:02,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:02,701 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:02,701 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:02,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:02,701 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:02,701 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:02,774 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:02,774 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:02,774 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:02,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:02,774 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:02,775 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:02,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable481 [2022-12-06 07:27:02,775 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-06 07:27:02,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:02,775 INFO L85 PathProgramCache]: Analyzing trace with hash -2002162495, now seen corresponding path program 1 times [2022-12-06 07:27:02,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:02,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595697856] [2022-12-06 07:27:02,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:02,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:02,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-06 07:27:02,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:02,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595697856] [2022-12-06 07:27:02,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595697856] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:02,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:02,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:02,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901714425] [2022-12-06 07:27:02,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:02,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:02,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:02,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:02,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:02,834 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:02,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:02,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:02,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:02,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:02,872 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:02,872 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:02,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:02,873 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:02,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:02,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:02,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:02,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:02,873 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:02,873 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:02,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:02,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:02,874 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:02,874 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:02,874 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:02,874 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:02,874 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:02,875 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:02,875 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:02,875 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:02,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:02,877 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:02,877 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:02,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:02,877 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:02,877 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:02,947 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:02,948 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:27:02,948 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:02,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:02,948 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:02,948 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:02,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable482 [2022-12-06 07:27:02,948 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-06 07:27:02,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:02,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1971686302, now seen corresponding path program 1 times [2022-12-06 07:27:02,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:02,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370622011] [2022-12-06 07:27:02,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:02,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:03,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-06 07:27:03,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:03,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370622011] [2022-12-06 07:27:03,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370622011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:03,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:03,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:03,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003892442] [2022-12-06 07:27:03,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:03,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:03,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:03,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:03,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:03,004 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:03,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:03,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:03,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:03,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:03,039 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:03,039 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:03,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:03,040 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:03,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:03,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:03,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:03,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:03,040 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:03,040 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:03,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:03,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:03,041 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:03,041 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:03,041 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:03,041 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:03,042 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:03,042 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:03,042 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:03,042 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:03,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:03,044 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:03,044 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:03,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:03,044 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:03,044 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:03,117 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:03,118 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:03,118 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:03,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:03,118 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:03,118 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:03,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable483 [2022-12-06 07:27:03,118 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-06 07:27:03,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:03,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1944904193, now seen corresponding path program 1 times [2022-12-06 07:27:03,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:03,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520777415] [2022-12-06 07:27:03,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:03,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:03,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-06 07:27:03,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:03,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520777415] [2022-12-06 07:27:03,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520777415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:03,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:03,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:03,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042098547] [2022-12-06 07:27:03,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:03,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:03,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:03,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:03,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:03,179 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:03,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:03,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:03,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:03,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:03,239 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:03,239 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:03,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:03,240 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:03,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:03,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:03,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:03,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:03,240 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:03,240 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:03,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:03,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:03,241 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:03,241 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:03,241 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:03,241 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:03,241 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:03,242 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:03,242 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:03,242 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:03,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:03,244 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:03,244 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:03,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:03,244 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:03,244 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:03,316 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:03,317 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:03,317 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:03,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:03,317 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:03,317 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:03,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable484 [2022-12-06 07:27:03,317 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-06 07:27:03,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:03,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1914428000, now seen corresponding path program 1 times [2022-12-06 07:27:03,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:03,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624834345] [2022-12-06 07:27:03,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:03,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:03,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-06 07:27:03,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:03,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624834345] [2022-12-06 07:27:03,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624834345] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:03,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:03,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:03,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14339554] [2022-12-06 07:27:03,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:03,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:03,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:03,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:03,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:03,374 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:03,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:03,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:03,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:03,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:03,412 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:03,412 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:03,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:03,413 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:03,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:03,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:03,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:03,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:03,413 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:03,413 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:03,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:03,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:03,414 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:03,414 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:03,414 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:03,414 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:03,414 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:03,415 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:03,415 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:03,415 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:03,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:03,418 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:03,418 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:03,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:03,419 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:03,419 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:03,492 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:03,493 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:27:03,493 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:03,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:03,493 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:03,493 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:03,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable485 [2022-12-06 07:27:03,493 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-06 07:27:03,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:03,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1887645891, now seen corresponding path program 1 times [2022-12-06 07:27:03,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:03,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592837260] [2022-12-06 07:27:03,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:03,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:03,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:03,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:03,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592837260] [2022-12-06 07:27:03,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592837260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:03,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:03,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:03,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394103145] [2022-12-06 07:27:03,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:03,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:03,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:03,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:03,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:03,552 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:03,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:03,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:03,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:03,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:03,586 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:03,586 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:03,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:03,587 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:03,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:03,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:03,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:03,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:03,588 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:03,588 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:03,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:03,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:03,588 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:03,589 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:03,589 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:03,589 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:03,589 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:03,589 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:03,589 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:03,589 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:03,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:03,591 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:03,592 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:03,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:03,592 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:03,592 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:03,665 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:03,666 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:03,666 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:03,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:03,666 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:03,666 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:03,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable486 [2022-12-06 07:27:03,666 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-06 07:27:03,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:03,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1857169698, now seen corresponding path program 1 times [2022-12-06 07:27:03,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:03,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441180670] [2022-12-06 07:27:03,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:03,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:03,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-06 07:27:03,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:03,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441180670] [2022-12-06 07:27:03,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441180670] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:03,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:03,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:03,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146346197] [2022-12-06 07:27:03,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:03,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:03,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:03,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:03,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:03,723 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:03,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:03,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:03,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:03,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:03,764 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:03,765 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:03,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:03,765 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:03,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:03,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:03,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:03,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:03,766 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:03,766 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:03,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:03,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:03,766 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:03,766 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:03,767 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:03,767 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:03,767 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:03,767 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:03,767 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:03,767 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:03,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:03,769 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:03,769 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:03,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:03,770 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:03,770 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:03,842 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:03,842 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:03,842 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:03,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:03,843 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:03,843 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:03,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable487 [2022-12-06 07:27:03,843 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-06 07:27:03,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:03,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1830387589, now seen corresponding path program 1 times [2022-12-06 07:27:03,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:03,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134989849] [2022-12-06 07:27:03,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:03,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:03,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-06 07:27:03,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:03,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134989849] [2022-12-06 07:27:03,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134989849] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:03,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:03,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:03,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228361024] [2022-12-06 07:27:03,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:03,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:03,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:03,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:03,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:03,908 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:03,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:03,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:03,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:03,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:03,946 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:03,947 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:03,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:03,947 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:03,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:03,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:03,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:03,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:03,948 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:03,948 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:03,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:03,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:03,948 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:03,948 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:03,949 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:03,949 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:03,949 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:03,949 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:03,949 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:03,949 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:03,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:03,951 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:03,951 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:03,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:03,952 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:03,952 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:04,023 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:04,024 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:04,024 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:04,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:04,024 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:04,024 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:04,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable488 [2022-12-06 07:27:04,024 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-06 07:27:04,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:04,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1799911396, now seen corresponding path program 1 times [2022-12-06 07:27:04,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:04,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967609090] [2022-12-06 07:27:04,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:04,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:04,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-06 07:27:04,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:04,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967609090] [2022-12-06 07:27:04,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967609090] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:04,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:04,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:04,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026478867] [2022-12-06 07:27:04,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:04,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:04,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:04,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:04,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:04,081 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:04,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:04,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:04,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:04,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:04,121 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:04,122 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:04,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:04,122 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:04,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:04,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:04,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:04,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:04,123 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:04,123 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:04,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:04,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:04,123 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:04,123 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:04,124 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:04,124 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:04,124 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:04,124 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:04,124 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:04,124 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:04,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:04,126 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:04,126 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:04,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:04,127 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:04,127 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:04,199 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:04,200 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:04,200 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:04,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:04,200 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:04,200 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:04,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable489 [2022-12-06 07:27:04,200 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-06 07:27:04,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:04,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1773129287, now seen corresponding path program 1 times [2022-12-06 07:27:04,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:04,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341195589] [2022-12-06 07:27:04,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:04,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:04,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-06 07:27:04,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:04,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341195589] [2022-12-06 07:27:04,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341195589] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:04,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:04,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:04,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29422979] [2022-12-06 07:27:04,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:04,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:04,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:04,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:04,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:04,259 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:04,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:04,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:04,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:04,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:04,295 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:04,295 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:04,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:04,296 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:04,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:04,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:04,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:04,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:04,296 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:04,296 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:04,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:04,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:04,297 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:04,297 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:04,297 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:04,298 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:04,298 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:04,298 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:04,298 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:04,298 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:04,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:04,300 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:04,300 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:04,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:04,300 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:04,300 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:04,372 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:04,373 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:04,373 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:04,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:04,373 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:04,373 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:04,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable490 [2022-12-06 07:27:04,373 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-06 07:27:04,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:04,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1742653094, now seen corresponding path program 1 times [2022-12-06 07:27:04,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:04,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416271019] [2022-12-06 07:27:04,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:04,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:04,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-06 07:27:04,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:04,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416271019] [2022-12-06 07:27:04,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416271019] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:04,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:04,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:04,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75012918] [2022-12-06 07:27:04,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:04,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:04,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:04,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:04,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:04,430 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:04,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:04,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:04,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:04,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:04,471 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:04,471 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:04,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:04,471 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:04,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:04,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:04,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:04,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:04,472 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:04,472 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:04,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:04,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:04,473 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:04,473 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:04,473 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:04,473 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:04,473 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:04,473 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:04,473 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:04,473 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:04,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:04,476 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:04,476 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:04,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:04,476 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:04,476 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:04,547 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:04,548 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:04,548 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:04,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:04,548 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:04,548 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:04,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable491 [2022-12-06 07:27:04,548 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-06 07:27:04,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:04,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1715870985, now seen corresponding path program 1 times [2022-12-06 07:27:04,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:04,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7305277] [2022-12-06 07:27:04,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:04,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:04,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:04,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:04,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7305277] [2022-12-06 07:27:04,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7305277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:04,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:04,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:04,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711164083] [2022-12-06 07:27:04,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:04,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:04,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:04,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:04,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:04,617 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:04,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:04,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:04,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:04,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:04,653 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:04,653 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:04,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:04,653 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:04,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:04,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:04,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:04,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:04,654 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:04,654 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:04,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:04,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:04,655 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:04,655 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:04,655 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:04,655 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:04,655 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:04,655 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:04,656 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:04,656 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:04,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:04,658 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:04,658 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:04,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:04,658 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:04,658 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:04,730 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:04,731 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:04,731 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:04,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:04,731 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:04,731 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:04,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable492 [2022-12-06 07:27:04,731 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-06 07:27:04,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:04,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1685394792, now seen corresponding path program 1 times [2022-12-06 07:27:04,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:04,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668011747] [2022-12-06 07:27:04,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:04,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:04,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-06 07:27:04,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:04,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668011747] [2022-12-06 07:27:04,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668011747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:04,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:04,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:04,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597143838] [2022-12-06 07:27:04,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:04,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:04,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:04,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:04,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:04,790 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:04,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:04,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:04,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:04,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:04,832 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:04,832 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:04,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:04,833 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:04,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:04,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:04,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:04,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:04,834 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:04,834 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:04,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:04,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:04,834 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:04,834 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:04,835 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:04,835 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:04,835 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:04,835 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:04,835 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:04,835 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:04,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:04,837 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:04,838 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:04,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:04,838 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:04,838 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:04,912 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:04,912 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:04,912 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:04,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:04,913 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:04,913 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:04,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable493 [2022-12-06 07:27:04,913 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-06 07:27:04,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:04,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1658612683, now seen corresponding path program 1 times [2022-12-06 07:27:04,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:04,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555594458] [2022-12-06 07:27:04,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:04,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:04,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-06 07:27:04,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:04,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555594458] [2022-12-06 07:27:04,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555594458] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:04,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:04,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:04,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418584754] [2022-12-06 07:27:04,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:04,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:04,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:04,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:04,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:04,975 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:04,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:04,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:04,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:04,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:05,017 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:05,017 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:05,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:05,017 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:05,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:05,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:05,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:05,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:05,018 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:05,018 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:05,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:05,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:05,019 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:05,019 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:05,019 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:05,019 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:05,019 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:05,019 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:05,019 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:05,020 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:05,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:05,022 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:05,022 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:05,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:05,022 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:05,022 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:05,093 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:05,094 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:05,094 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:05,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:05,094 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:05,094 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:05,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable494 [2022-12-06 07:27:05,094 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-06 07:27:05,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:05,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1628136490, now seen corresponding path program 1 times [2022-12-06 07:27:05,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:05,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165427384] [2022-12-06 07:27:05,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:05,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:05,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-06 07:27:05,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:05,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165427384] [2022-12-06 07:27:05,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165427384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:05,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:05,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:05,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710530638] [2022-12-06 07:27:05,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:05,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:05,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:05,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:05,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:05,151 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:05,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:05,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:05,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:05,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:05,192 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:05,192 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:05,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:05,193 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:05,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:05,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:05,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:05,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:05,193 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:05,193 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:05,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:05,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:05,194 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:05,194 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:05,194 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:05,194 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:05,194 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:05,194 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:05,195 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:05,195 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:05,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:05,197 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:05,197 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:05,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:05,197 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:05,197 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:05,268 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:05,268 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:27:05,268 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:05,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:05,269 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:05,269 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:05,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable495 [2022-12-06 07:27:05,269 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-06 07:27:05,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:05,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1601354381, now seen corresponding path program 1 times [2022-12-06 07:27:05,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:05,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712830432] [2022-12-06 07:27:05,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:05,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:05,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:05,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:05,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712830432] [2022-12-06 07:27:05,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712830432] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:05,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:05,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:05,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421089243] [2022-12-06 07:27:05,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:05,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:05,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:05,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:05,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:05,335 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:05,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:05,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:05,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:05,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:05,377 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:05,377 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:05,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:05,378 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:05,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:05,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:05,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:05,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:05,378 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:05,378 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:05,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:05,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:05,379 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:05,379 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:05,379 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:05,379 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:05,379 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:05,379 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:05,380 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:05,380 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:05,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:05,382 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:05,382 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:05,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:05,382 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:05,382 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:05,456 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:05,456 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:05,456 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:05,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:05,456 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:05,456 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:05,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable496 [2022-12-06 07:27:05,456 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-06 07:27:05,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:05,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1570878188, now seen corresponding path program 1 times [2022-12-06 07:27:05,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:05,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3225759] [2022-12-06 07:27:05,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:05,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:05,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:05,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-06 07:27:05,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:05,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3225759] [2022-12-06 07:27:05,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3225759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:05,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:05,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:05,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062244184] [2022-12-06 07:27:05,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:05,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:05,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:05,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:05,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:05,513 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:05,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:05,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:05,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:05,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:05,549 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:05,549 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:05,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:05,550 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:05,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:05,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:05,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:05,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:05,550 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:05,550 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:05,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:05,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:05,551 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:05,551 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:05,551 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:05,551 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:05,551 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:05,552 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:05,552 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:05,552 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:05,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:05,554 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:05,554 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:05,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:05,554 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:05,554 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:05,627 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:05,628 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:05,628 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:05,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:05,628 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:05,628 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:05,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable497 [2022-12-06 07:27:05,628 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-06 07:27:05,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:05,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1544096079, now seen corresponding path program 1 times [2022-12-06 07:27:05,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:05,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511968806] [2022-12-06 07:27:05,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:05,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:05,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-06 07:27:05,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:05,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511968806] [2022-12-06 07:27:05,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511968806] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:05,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:05,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:05,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53086313] [2022-12-06 07:27:05,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:05,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:05,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:05,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:05,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:05,690 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:05,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:05,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:05,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:05,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:05,730 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:05,730 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:05,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:05,731 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:05,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:05,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:05,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:05,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:05,731 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:05,731 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:05,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:05,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:05,732 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:05,732 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:05,732 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:05,732 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:05,732 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:05,732 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:05,733 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:05,733 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:05,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:05,735 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:05,735 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:05,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:05,735 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:05,735 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:05,809 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:05,810 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:27:05,810 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:05,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:05,810 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:05,810 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:05,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable498 [2022-12-06 07:27:05,810 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-06 07:27:05,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:05,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1513619886, now seen corresponding path program 1 times [2022-12-06 07:27:05,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:05,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846547120] [2022-12-06 07:27:05,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:05,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:05,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-06 07:27:05,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:05,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846547120] [2022-12-06 07:27:05,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846547120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:05,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:05,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:05,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742293866] [2022-12-06 07:27:05,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:05,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:05,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:05,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:05,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:05,870 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:05,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:05,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:05,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:05,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:05,911 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:05,911 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:05,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:05,911 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:05,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:05,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:05,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:05,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:05,912 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:05,912 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:05,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:05,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:05,913 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:05,913 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:05,913 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:05,913 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:05,913 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:05,913 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:05,913 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:05,913 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:05,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:05,916 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:05,916 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:05,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:05,916 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:05,916 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:05,990 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:05,991 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:27:05,991 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:05,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:05,991 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:05,991 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:05,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable499 [2022-12-06 07:27:05,991 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-06 07:27:05,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:05,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1486837777, now seen corresponding path program 1 times [2022-12-06 07:27:05,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:05,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243028886] [2022-12-06 07:27:05,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:05,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:06,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:06,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-06 07:27:06,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:06,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243028886] [2022-12-06 07:27:06,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243028886] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:06,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:06,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:06,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958700875] [2022-12-06 07:27:06,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:06,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:06,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:06,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:06,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:06,061 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:06,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:06,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:06,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:06,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:06,102 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:06,102 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:06,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:06,102 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:06,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:06,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:06,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:06,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:06,103 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:06,103 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:06,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:06,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:06,104 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:06,104 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:06,104 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:06,104 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:06,104 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:06,104 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:06,104 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:06,104 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:06,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:06,107 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:06,107 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:06,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:06,107 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:06,107 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:06,180 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:06,181 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:06,181 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:06,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:06,181 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:06,181 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:06,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable500 [2022-12-06 07:27:06,181 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-06 07:27:06,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:06,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1456361584, now seen corresponding path program 1 times [2022-12-06 07:27:06,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:06,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308062806] [2022-12-06 07:27:06,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:06,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:06,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-06 07:27:06,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:06,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308062806] [2022-12-06 07:27:06,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308062806] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:06,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:06,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:06,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360933161] [2022-12-06 07:27:06,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:06,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:06,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:06,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:06,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:06,239 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:06,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:06,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:06,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:06,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:06,275 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:06,276 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:06,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:06,276 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:06,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:06,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:06,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:06,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:06,277 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:06,277 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:06,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:06,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:06,277 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:06,278 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:06,278 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:06,278 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:06,278 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:06,278 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:06,278 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:06,278 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:06,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:06,281 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:06,281 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:06,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:06,281 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:06,281 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:06,354 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:06,354 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:06,354 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:06,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:06,355 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:06,355 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:06,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable501 [2022-12-06 07:27:06,355 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-06 07:27:06,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:06,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1429579475, now seen corresponding path program 1 times [2022-12-06 07:27:06,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:06,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778329806] [2022-12-06 07:27:06,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:06,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:06,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-06 07:27:06,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:06,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778329806] [2022-12-06 07:27:06,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778329806] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:06,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:06,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:06,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269673730] [2022-12-06 07:27:06,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:06,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:06,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:06,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:06,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:06,424 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:06,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:06,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:06,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:06,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:06,460 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:06,460 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:06,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:06,460 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:06,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:06,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:06,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:06,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:06,461 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:06,461 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:06,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:06,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:06,462 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:06,462 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:06,462 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:06,462 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:06,462 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:06,462 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:06,462 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:06,462 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:06,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:06,465 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:06,465 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:06,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:06,465 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:06,465 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:06,537 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:06,537 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:06,537 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:06,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:06,537 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:06,537 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:06,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable502 [2022-12-06 07:27:06,538 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-06 07:27:06,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:06,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1399103282, now seen corresponding path program 1 times [2022-12-06 07:27:06,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:06,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675417489] [2022-12-06 07:27:06,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:06,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:06,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-06 07:27:06,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:06,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675417489] [2022-12-06 07:27:06,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675417489] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:06,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:06,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:06,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157767484] [2022-12-06 07:27:06,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:06,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:06,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:06,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:06,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:06,596 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:06,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:06,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:06,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:06,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:06,637 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:06,637 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:06,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:06,637 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:06,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:06,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:06,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:06,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:06,638 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:06,638 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:06,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:06,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:06,639 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:06,639 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:06,639 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:06,639 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:06,639 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:06,639 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:06,639 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:06,639 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:06,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:06,642 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:06,642 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:06,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:06,642 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:06,642 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:06,714 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:06,714 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:06,714 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:06,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:06,715 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:06,715 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:06,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable503 [2022-12-06 07:27:06,715 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-06 07:27:06,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:06,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1372321173, now seen corresponding path program 1 times [2022-12-06 07:27:06,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:06,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177861536] [2022-12-06 07:27:06,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:06,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:06,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:06,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-06 07:27:06,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:06,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177861536] [2022-12-06 07:27:06,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177861536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:06,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:06,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:06,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370583536] [2022-12-06 07:27:06,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:06,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:06,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:06,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:06,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:06,781 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:06,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:06,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:06,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:06,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:06,816 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:06,816 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:06,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:06,816 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:06,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:06,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:06,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:06,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:06,817 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:06,817 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:06,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:06,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:06,817 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:06,818 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:06,818 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:06,818 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:06,818 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:06,818 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:06,818 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:06,818 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:06,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:06,820 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:06,821 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:06,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:06,821 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:06,821 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:06,891 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:06,892 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:27:06,892 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:06,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:06,892 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:06,892 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:06,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable504 [2022-12-06 07:27:06,892 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-06 07:27:06,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:06,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1341844980, now seen corresponding path program 1 times [2022-12-06 07:27:06,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:06,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640772895] [2022-12-06 07:27:06,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:06,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:06,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-06 07:27:06,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:06,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640772895] [2022-12-06 07:27:06,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640772895] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:06,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:06,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:06,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247754060] [2022-12-06 07:27:06,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:06,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:06,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:06,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:06,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:06,951 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:06,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:06,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:06,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:06,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:06,993 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:06,993 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:06,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:06,994 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:06,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:06,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:06,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:06,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:06,994 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:06,994 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:06,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:06,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:06,995 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:06,995 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:06,995 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:06,996 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:06,996 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:06,996 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:06,996 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:06,996 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:06,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:06,998 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:06,998 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:06,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:06,998 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:06,998 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:07,075 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:07,075 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:27:07,076 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:07,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:07,076 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:07,076 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:07,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable505 [2022-12-06 07:27:07,076 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-06 07:27:07,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:07,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1315062871, now seen corresponding path program 1 times [2022-12-06 07:27:07,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:07,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645806196] [2022-12-06 07:27:07,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:07,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:07,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-06 07:27:07,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:07,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645806196] [2022-12-06 07:27:07,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645806196] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:07,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:07,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:07,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360551545] [2022-12-06 07:27:07,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:07,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:07,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:07,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:07,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:07,135 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:07,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:07,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:07,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:07,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:07,176 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:07,176 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:07,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:07,177 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:07,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:07,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:07,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:07,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:07,178 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:07,178 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:07,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:07,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:07,178 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:07,178 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:07,179 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:07,179 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:07,179 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:07,179 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:07,179 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:07,179 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:07,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:07,181 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:07,181 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:07,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:07,182 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:07,182 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:07,255 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:07,256 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:07,256 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:07,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:07,256 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:07,256 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:07,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable506 [2022-12-06 07:27:07,256 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-06 07:27:07,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:07,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1284586678, now seen corresponding path program 1 times [2022-12-06 07:27:07,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:07,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921047409] [2022-12-06 07:27:07,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:07,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:07,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-06 07:27:07,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:07,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921047409] [2022-12-06 07:27:07,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921047409] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:07,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:07,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:07,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422983259] [2022-12-06 07:27:07,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:07,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:07,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:07,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:07,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:07,320 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:07,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:07,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:07,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:07,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:07,356 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:07,357 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:07,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:07,357 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:07,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:07,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:07,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:07,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:07,358 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:07,358 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:07,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:07,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:07,358 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:07,359 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:07,359 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:07,359 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:07,359 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:07,359 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:07,359 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:07,359 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:07,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:07,363 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:07,363 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:07,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:07,363 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:07,363 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:07,454 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:07,455 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:27:07,455 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:07,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:07,455 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:07,455 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:07,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable507 [2022-12-06 07:27:07,456 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-06 07:27:07,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:07,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1257804569, now seen corresponding path program 1 times [2022-12-06 07:27:07,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:07,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994680755] [2022-12-06 07:27:07,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:07,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:07,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:07,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-06 07:27:07,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:07,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994680755] [2022-12-06 07:27:07,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994680755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:07,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:07,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:07,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341943611] [2022-12-06 07:27:07,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:07,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:07,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:07,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:07,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:07,535 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:07,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:07,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:07,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:07,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:07,571 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:07,571 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:07,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:07,571 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:07,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:07,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:07,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:07,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:07,572 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:07,572 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:07,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:07,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:07,573 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:07,573 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:07,573 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:07,573 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:07,573 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:07,573 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:07,574 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:07,574 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:07,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:07,576 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:07,576 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:07,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:07,576 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:07,576 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:07,650 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:07,650 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:07,650 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:07,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:07,650 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:07,650 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:07,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable508 [2022-12-06 07:27:07,651 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-06 07:27:07,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:07,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1227328376, now seen corresponding path program 1 times [2022-12-06 07:27:07,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:07,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705404997] [2022-12-06 07:27:07,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:07,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:07,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-06 07:27:07,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:07,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705404997] [2022-12-06 07:27:07,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705404997] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:07,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:07,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:07,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840310480] [2022-12-06 07:27:07,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:07,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:07,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:07,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:07,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:07,710 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:07,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:07,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:07,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:07,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:07,753 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:07,753 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:07,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:07,753 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:07,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:07,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:07,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:07,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:07,754 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:07,754 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:07,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:07,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:07,755 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:07,755 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:07,755 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:07,755 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:07,755 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:07,755 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:07,755 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:07,755 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:07,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:07,757 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:07,758 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:07,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 118 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:07,758 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:07,758 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:07,830 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:07,831 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:07,831 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:07,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:07,831 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:07,831 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:07,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable509 [2022-12-06 07:27:07,831 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-06 07:27:07,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:07,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1200546267, now seen corresponding path program 1 times [2022-12-06 07:27:07,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:07,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233445602] [2022-12-06 07:27:07,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:07,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:07,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:07,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-06 07:27:07,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:07,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233445602] [2022-12-06 07:27:07,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233445602] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:07,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:07,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:07,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692814083] [2022-12-06 07:27:07,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:07,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:07,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:07,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:07,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:07,895 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:07,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:07,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:07,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:07,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:07,936 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:07,936 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:07,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:07,936 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:07,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:07,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:07,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:07,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:07,937 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:07,937 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:07,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:07,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:07,938 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:07,938 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:07,938 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:07,938 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:07,939 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:07,939 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:07,939 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:07,939 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:07,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:07,942 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:07,942 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:07,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:07,943 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:07,943 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:08,021 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:08,022 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:27:08,022 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:08,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:08,022 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:08,022 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:08,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable510 [2022-12-06 07:27:08,022 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-06 07:27:08,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:08,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1170070074, now seen corresponding path program 1 times [2022-12-06 07:27:08,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:08,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263331430] [2022-12-06 07:27:08,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:08,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:08,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-06 07:27:08,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:08,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263331430] [2022-12-06 07:27:08,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263331430] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:08,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:08,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:08,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590881193] [2022-12-06 07:27:08,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:08,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:08,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:08,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:08,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:08,086 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:08,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:08,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:08,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:08,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:08,133 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:08,133 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:08,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:08,134 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:08,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:08,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:08,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:08,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:08,134 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:08,134 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:08,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:08,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:08,136 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:08,136 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:08,136 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:08,136 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:08,136 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:08,137 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:08,137 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:08,137 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:08,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:08,140 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:08,140 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:08,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:08,140 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:08,140 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:08,213 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:08,214 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:27:08,214 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:08,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:08,214 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:08,214 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:08,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable511 [2022-12-06 07:27:08,214 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-06 07:27:08,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:08,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1143287965, now seen corresponding path program 1 times [2022-12-06 07:27:08,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:08,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381745762] [2022-12-06 07:27:08,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:08,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:08,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-06 07:27:08,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:08,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381745762] [2022-12-06 07:27:08,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381745762] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:08,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:08,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:08,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948047302] [2022-12-06 07:27:08,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:08,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:08,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:08,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:08,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:08,283 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:08,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:08,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:08,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:08,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:08,323 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:08,324 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:08,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:08,324 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:08,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:08,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:08,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:08,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:08,325 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:08,325 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:08,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:08,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:08,326 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:08,326 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:08,326 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:08,327 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:08,327 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:08,327 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:08,327 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:08,327 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:08,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:08,330 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:08,330 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:08,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:08,331 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:08,331 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:08,412 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:08,413 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-06 07:27:08,413 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:08,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:08,413 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:08,413 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:08,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable512 [2022-12-06 07:27:08,413 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-06 07:27:08,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:08,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1112811772, now seen corresponding path program 1 times [2022-12-06 07:27:08,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:08,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975018794] [2022-12-06 07:27:08,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:08,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:08,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-06 07:27:08,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:08,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975018794] [2022-12-06 07:27:08,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975018794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:08,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:08,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:08,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007699631] [2022-12-06 07:27:08,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:08,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:08,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:08,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:08,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:08,470 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:08,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:08,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:08,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:08,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:08,507 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:08,507 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:08,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:08,508 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:08,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:08,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:08,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:08,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:08,508 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:08,508 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:08,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:08,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:08,509 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:08,509 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:08,510 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:08,510 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:08,510 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:08,510 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:08,510 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:08,510 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:08,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:08,512 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:08,512 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:08,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:08,513 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:08,513 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:08,587 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:08,588 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:27:08,588 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:08,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:08,588 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:08,588 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:08,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable513 [2022-12-06 07:27:08,588 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-06 07:27:08,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:08,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1086029663, now seen corresponding path program 1 times [2022-12-06 07:27:08,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:08,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277505637] [2022-12-06 07:27:08,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:08,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:08,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:08,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-06 07:27:08,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:08,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277505637] [2022-12-06 07:27:08,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277505637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:08,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:08,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:08,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123815525] [2022-12-06 07:27:08,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:08,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:08,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:08,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:08,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:08,648 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:08,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:08,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:08,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:08,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:08,681 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:08,682 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:08,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:08,682 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:08,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:08,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:08,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:08,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:08,683 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:08,683 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:08,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:08,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:08,683 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:08,683 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:08,684 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:08,684 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:08,684 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:08,684 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:08,684 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:08,684 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:08,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:08,686 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:08,686 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:08,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:08,687 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:08,687 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:08,758 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:08,759 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:08,759 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:08,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:08,759 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:08,759 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:08,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable514 [2022-12-06 07:27:08,759 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-06 07:27:08,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:08,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1055553470, now seen corresponding path program 1 times [2022-12-06 07:27:08,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:08,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801518887] [2022-12-06 07:27:08,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:08,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:08,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-06 07:27:08,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:08,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801518887] [2022-12-06 07:27:08,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801518887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:08,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:08,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:08,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441822124] [2022-12-06 07:27:08,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:08,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:08,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:08,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:08,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:08,816 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:08,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:08,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:08,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:08,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:08,857 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:08,857 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:08,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:08,858 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:08,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:08,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:08,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:08,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:08,858 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:08,858 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:08,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:08,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:08,859 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:08,859 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:08,859 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:08,859 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:08,859 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:08,860 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:08,860 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:08,860 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:08,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:08,862 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:08,862 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:08,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:08,862 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:08,862 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:08,934 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:08,934 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:08,935 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:08,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:08,935 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:08,935 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:08,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable515 [2022-12-06 07:27:08,935 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-06 07:27:08,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:08,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1028771361, now seen corresponding path program 1 times [2022-12-06 07:27:08,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:08,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44281847] [2022-12-06 07:27:08,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:08,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:09,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-06 07:27:09,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:09,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44281847] [2022-12-06 07:27:09,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44281847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:09,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:09,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:09,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297996937] [2022-12-06 07:27:09,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:09,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:09,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:09,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:09,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:09,002 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:09,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:09,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:09,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:09,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:09,038 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:09,038 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:09,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:09,039 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:09,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:09,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:09,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:09,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:09,039 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:09,039 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:09,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:09,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:09,040 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:09,040 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:09,040 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:09,041 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:09,041 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:09,041 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:09,041 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:09,041 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:09,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:09,043 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:09,043 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:09,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:09,043 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:09,044 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:09,116 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:09,117 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:09,117 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:09,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:09,117 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:09,117 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:09,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable516 [2022-12-06 07:27:09,117 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-06 07:27:09,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:09,118 INFO L85 PathProgramCache]: Analyzing trace with hash -998295168, now seen corresponding path program 1 times [2022-12-06 07:27:09,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:09,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599288050] [2022-12-06 07:27:09,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:09,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:09,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-06 07:27:09,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:09,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599288050] [2022-12-06 07:27:09,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599288050] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:09,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:09,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:09,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465277935] [2022-12-06 07:27:09,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:09,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:09,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:09,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:09,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:09,175 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:09,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:09,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:09,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:09,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:09,217 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:09,217 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:09,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:09,218 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:09,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:09,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:09,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:09,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:09,218 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:09,218 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:09,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:09,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:09,219 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:09,219 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:09,219 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:09,219 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:09,219 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:09,219 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:09,219 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:09,220 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:09,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:09,222 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:09,222 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:09,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:09,222 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:09,222 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:09,294 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:09,294 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:09,294 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:09,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:09,294 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:09,294 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:09,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable517 [2022-12-06 07:27:09,295 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-06 07:27:09,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:09,295 INFO L85 PathProgramCache]: Analyzing trace with hash -971513059, now seen corresponding path program 1 times [2022-12-06 07:27:09,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:09,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366772445] [2022-12-06 07:27:09,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:09,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:09,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:09,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:09,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366772445] [2022-12-06 07:27:09,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366772445] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:09,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:09,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:09,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478742701] [2022-12-06 07:27:09,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:09,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:09,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:09,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:09,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:09,354 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:09,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:09,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:09,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:09,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:09,388 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:09,389 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:09,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:09,389 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:09,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:09,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:09,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:09,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:09,390 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:09,390 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:09,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:09,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:09,390 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:09,390 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:09,391 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:09,391 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:09,391 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:09,391 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:09,391 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:09,391 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:09,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:09,393 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:09,393 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:09,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:09,394 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:09,394 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:09,466 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:09,467 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:09,467 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:09,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:09,467 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:09,467 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:09,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable518 [2022-12-06 07:27:09,467 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-06 07:27:09,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:09,467 INFO L85 PathProgramCache]: Analyzing trace with hash -941036866, now seen corresponding path program 1 times [2022-12-06 07:27:09,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:09,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756904324] [2022-12-06 07:27:09,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:09,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:09,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-06 07:27:09,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:09,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756904324] [2022-12-06 07:27:09,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756904324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:09,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:09,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:09,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779299888] [2022-12-06 07:27:09,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:09,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:09,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:09,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:09,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:09,524 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:09,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:09,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:09,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:09,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:09,559 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:09,559 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:09,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:09,560 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:09,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:09,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:09,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:09,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:09,560 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:09,561 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:09,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:09,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:09,561 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:09,561 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:09,561 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:09,562 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:09,562 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:09,562 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:09,562 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:09,562 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:09,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:09,564 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:09,564 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:09,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:09,564 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:09,565 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:09,636 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:09,637 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:09,637 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:09,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:09,637 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:09,637 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:09,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable519 [2022-12-06 07:27:09,637 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-06 07:27:09,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:09,637 INFO L85 PathProgramCache]: Analyzing trace with hash -914254757, now seen corresponding path program 1 times [2022-12-06 07:27:09,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:09,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290419659] [2022-12-06 07:27:09,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:09,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:09,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-06 07:27:09,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:09,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290419659] [2022-12-06 07:27:09,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290419659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:09,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:09,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:09,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605232038] [2022-12-06 07:27:09,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:09,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:09,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:09,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:09,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:09,708 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:09,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:09,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:09,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:09,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:09,748 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:09,748 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:09,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:09,749 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:09,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:09,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:09,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:09,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:09,749 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:09,749 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:09,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:09,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:09,750 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:09,750 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:09,750 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:09,750 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:09,750 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:09,751 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:09,751 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:09,751 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:09,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:09,753 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:09,753 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:09,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:09,753 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:09,753 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:09,826 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:09,827 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:09,827 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:09,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:09,827 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:09,827 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:09,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable520 [2022-12-06 07:27:09,827 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-06 07:27:09,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:09,827 INFO L85 PathProgramCache]: Analyzing trace with hash -883778564, now seen corresponding path program 1 times [2022-12-06 07:27:09,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:09,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846380291] [2022-12-06 07:27:09,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:09,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:09,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:09,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:09,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846380291] [2022-12-06 07:27:09,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846380291] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:09,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:09,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:09,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986521437] [2022-12-06 07:27:09,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:09,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:09,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:09,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:09,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:09,886 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:09,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:09,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:09,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:09,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:09,923 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:09,923 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:09,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:09,924 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:09,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:09,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:09,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:09,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:09,924 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:09,924 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:09,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:09,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:09,925 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:09,925 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:09,925 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:09,925 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:09,926 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:09,926 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:09,926 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:09,926 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:09,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:09,929 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:09,929 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:09,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:09,929 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:09,929 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:10,004 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:10,004 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:27:10,004 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:10,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:10,005 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:10,005 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:10,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable521 [2022-12-06 07:27:10,005 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-06 07:27:10,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:10,005 INFO L85 PathProgramCache]: Analyzing trace with hash -856996455, now seen corresponding path program 1 times [2022-12-06 07:27:10,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:10,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141661660] [2022-12-06 07:27:10,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:10,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:10,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-06 07:27:10,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:10,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141661660] [2022-12-06 07:27:10,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141661660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:10,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:10,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:10,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345974659] [2022-12-06 07:27:10,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:10,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:10,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:10,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:10,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:10,064 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:10,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:10,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:10,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:10,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:10,100 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:10,100 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:10,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:10,100 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:10,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:10,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:10,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:10,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:10,101 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:10,101 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:10,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:10,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:10,102 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:10,102 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:10,102 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:10,102 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:10,102 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:10,102 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:10,102 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:10,102 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:10,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:10,105 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:10,105 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:10,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:10,105 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:10,105 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:10,178 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:10,179 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:10,179 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:10,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:10,179 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:10,179 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:10,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable522 [2022-12-06 07:27:10,179 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-06 07:27:10,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:10,179 INFO L85 PathProgramCache]: Analyzing trace with hash -826520262, now seen corresponding path program 1 times [2022-12-06 07:27:10,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:10,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995204824] [2022-12-06 07:27:10,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:10,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:10,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-06 07:27:10,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:10,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995204824] [2022-12-06 07:27:10,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995204824] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:10,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:10,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:10,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69919184] [2022-12-06 07:27:10,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:10,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:10,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:10,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:10,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:10,239 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:10,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:10,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:10,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:10,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:10,276 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:10,276 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:10,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:10,277 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:10,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:10,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:10,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:10,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:10,277 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:10,277 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:10,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:10,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:10,278 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:10,278 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:10,278 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:10,278 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:10,279 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:10,279 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:10,279 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:10,279 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:10,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:10,281 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:10,281 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:10,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:10,281 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:10,281 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:10,354 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:10,355 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:10,355 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:10,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:10,355 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:10,355 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:10,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable523 [2022-12-06 07:27:10,355 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-06 07:27:10,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:10,355 INFO L85 PathProgramCache]: Analyzing trace with hash -799738153, now seen corresponding path program 1 times [2022-12-06 07:27:10,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:10,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147738713] [2022-12-06 07:27:10,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:10,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:10,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:10,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:10,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147738713] [2022-12-06 07:27:10,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147738713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:10,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:10,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:10,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832020371] [2022-12-06 07:27:10,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:10,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:10,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:10,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:10,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:10,426 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:10,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:10,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:10,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:10,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:10,465 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:10,465 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:10,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 380 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:10,465 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:10,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:10,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:10,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:10,466 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:10,466 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:10,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:10,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:10,467 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:10,467 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:10,467 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:10,467 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:10,467 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:10,467 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:10,467 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:10,468 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:10,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:10,470 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:10,470 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:10,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:10,470 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:10,470 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:10,542 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:10,543 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:10,543 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:10,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:10,543 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:10,543 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:10,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable524 [2022-12-06 07:27:10,543 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-06 07:27:10,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:10,543 INFO L85 PathProgramCache]: Analyzing trace with hash -769261960, now seen corresponding path program 1 times [2022-12-06 07:27:10,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:10,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570248242] [2022-12-06 07:27:10,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:10,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:10,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27: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-06 07:27:10,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:10,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570248242] [2022-12-06 07:27:10,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570248242] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:10,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:10,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:10,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381552782] [2022-12-06 07:27:10,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:10,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:10,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:10,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:10,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:10,603 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:10,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:10,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:10,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:10,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:10,639 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:10,640 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:10,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:10,640 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:10,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:10,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:10,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:10,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:10,641 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:10,641 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:10,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:10,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:10,641 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:10,641 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:10,642 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:10,642 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:10,642 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:10,642 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:10,642 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:10,642 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:10,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:10,644 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:10,644 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:10,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:10,645 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:10,645 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:10,718 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:10,719 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:10,719 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:10,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:10,719 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:10,719 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:10,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable525 [2022-12-06 07:27:10,719 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-06 07:27:10,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:10,720 INFO L85 PathProgramCache]: Analyzing trace with hash -742479851, now seen corresponding path program 1 times [2022-12-06 07:27:10,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:10,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388610360] [2022-12-06 07:27:10,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:10,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:10,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-06 07:27:10,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:10,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388610360] [2022-12-06 07:27:10,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388610360] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:10,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:10,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:10,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884397882] [2022-12-06 07:27:10,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:10,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:10,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:10,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:10,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:10,792 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:10,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:10,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:10,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:10,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:10,828 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:10,829 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:10,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:10,829 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:10,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:10,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:10,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:10,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:10,830 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:10,830 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:10,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:10,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:10,830 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:10,831 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:10,831 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:10,831 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:10,831 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:10,831 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:10,831 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:10,831 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:10,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:10,833 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:10,834 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:10,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:10,834 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:10,834 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:10,906 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:10,907 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:10,907 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:10,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:10,907 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:10,907 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:10,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable526 [2022-12-06 07:27:10,907 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-06 07:27:10,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:10,908 INFO L85 PathProgramCache]: Analyzing trace with hash -712003658, now seen corresponding path program 1 times [2022-12-06 07:27:10,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:10,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955539075] [2022-12-06 07:27:10,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:10,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:10,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-06 07:27:10,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:10,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955539075] [2022-12-06 07:27:10,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955539075] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:10,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:10,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:10,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87214047] [2022-12-06 07:27:10,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:10,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:10,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:10,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:10,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:10,965 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:10,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:10,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:10,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:10,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:11,002 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:11,002 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:11,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:11,003 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:11,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:11,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:11,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:11,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:11,003 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:11,003 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:11,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:11,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:11,004 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:11,004 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:11,004 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:11,004 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:11,005 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:11,005 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:11,005 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:11,005 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:11,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:11,007 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:11,007 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:11,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:11,007 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:11,007 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:11,081 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:11,082 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:27:11,082 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:11,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:11,082 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:11,082 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:11,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable527 [2022-12-06 07:27:11,082 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-06 07:27:11,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:11,082 INFO L85 PathProgramCache]: Analyzing trace with hash -685221549, now seen corresponding path program 1 times [2022-12-06 07:27:11,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:11,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268213502] [2022-12-06 07:27:11,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:11,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:11,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-06 07:27:11,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:11,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268213502] [2022-12-06 07:27:11,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268213502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:11,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:11,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:11,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281032006] [2022-12-06 07:27:11,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:11,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:11,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:11,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:11,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:11,153 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:11,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:11,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:11,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:11,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:11,193 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:11,193 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:11,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:11,194 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:11,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:11,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:11,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:11,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:11,194 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:11,194 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:11,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:11,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:11,195 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:11,195 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:11,195 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:11,195 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:11,195 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:11,196 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:11,196 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:11,196 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:11,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:11,198 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:11,198 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:11,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:11,198 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:11,198 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:11,287 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:11,288 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-06 07:27:11,288 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:11,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:11,288 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:11,288 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:11,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable528 [2022-12-06 07:27:11,288 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-06 07:27:11,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:11,288 INFO L85 PathProgramCache]: Analyzing trace with hash -654745356, now seen corresponding path program 1 times [2022-12-06 07:27:11,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:11,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452863331] [2022-12-06 07:27:11,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:11,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:11,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-06 07:27:11,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:11,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452863331] [2022-12-06 07:27:11,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452863331] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:11,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:11,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:11,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001573868] [2022-12-06 07:27:11,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:11,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:11,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:11,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:11,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:11,346 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:11,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:11,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:11,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:11,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:11,381 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:11,381 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:11,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 352 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:11,382 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:11,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:11,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:11,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:11,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:11,382 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:11,382 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:11,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:11,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:11,383 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:11,383 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:11,383 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:11,383 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:11,383 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:11,384 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:11,384 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:11,384 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:11,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:11,386 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:11,386 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:11,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:11,386 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:11,386 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:11,458 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:11,458 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:11,458 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:11,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:11,458 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:11,458 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:11,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable529 [2022-12-06 07:27:11,459 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-06 07:27:11,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:11,459 INFO L85 PathProgramCache]: Analyzing trace with hash -627963247, now seen corresponding path program 1 times [2022-12-06 07:27:11,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:11,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367264528] [2022-12-06 07:27:11,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:11,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:11,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-06 07:27:11,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:11,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367264528] [2022-12-06 07:27:11,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367264528] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:11,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:11,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:11,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973887236] [2022-12-06 07:27:11,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:11,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:11,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:11,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:11,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:11,519 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:11,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:11,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:11,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:11,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:11,555 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:11,556 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:11,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:11,556 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:11,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:11,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:11,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:11,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:11,557 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:11,557 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:11,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:11,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:11,557 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:11,557 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:11,558 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:11,558 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:11,558 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:11,558 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:11,558 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:11,558 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:11,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:11,560 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:11,560 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:11,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:11,561 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:11,561 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:11,634 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:11,634 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:11,634 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:11,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:11,634 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:11,634 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:11,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable530 [2022-12-06 07:27:11,635 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-06 07:27:11,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:11,635 INFO L85 PathProgramCache]: Analyzing trace with hash -597487054, now seen corresponding path program 1 times [2022-12-06 07:27:11,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:11,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653953688] [2022-12-06 07:27:11,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:11,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:11,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-06 07:27:11,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:11,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653953688] [2022-12-06 07:27:11,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653953688] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:11,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:11,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:11,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060600448] [2022-12-06 07:27:11,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:11,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:11,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:11,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:11,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:11,690 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:11,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:11,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:11,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:11,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:11,731 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:11,731 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:11,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:11,732 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:11,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:11,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:11,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:11,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:11,732 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:11,732 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:11,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:11,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:11,733 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:11,733 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:11,733 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:11,733 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:11,733 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:11,733 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:11,734 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:11,734 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:11,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:11,737 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:11,737 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:11,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:11,737 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:11,737 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:11,810 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:11,810 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:11,810 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:11,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:11,810 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:11,810 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:11,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable531 [2022-12-06 07:27:11,811 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-06 07:27:11,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:11,811 INFO L85 PathProgramCache]: Analyzing trace with hash -570704945, now seen corresponding path program 1 times [2022-12-06 07:27:11,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:11,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336029362] [2022-12-06 07:27:11,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:11,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:11,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-06 07:27:11,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:11,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336029362] [2022-12-06 07:27:11,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336029362] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:11,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:11,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:11,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377873000] [2022-12-06 07:27:11,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:11,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:11,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:11,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:11,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:11,881 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:11,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:11,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:11,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:11,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:11,917 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:11,918 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:11,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:11,918 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:11,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:11,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:11,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:11,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:11,919 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:11,919 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:11,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:11,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:11,920 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:11,920 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:11,920 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:11,920 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:11,920 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:11,920 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:11,920 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:11,920 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:11,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:11,923 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:11,923 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:11,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:11,923 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:11,923 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:11,995 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:11,995 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:11,996 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:11,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:11,996 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:11,996 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:11,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable532 [2022-12-06 07:27:11,996 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-06 07:27:11,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:11,996 INFO L85 PathProgramCache]: Analyzing trace with hash -540228752, now seen corresponding path program 1 times [2022-12-06 07:27:11,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:11,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542859981] [2022-12-06 07:27:11,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:11,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:12,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-06 07:27:12,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:12,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542859981] [2022-12-06 07:27:12,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542859981] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:12,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:12,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:12,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708246004] [2022-12-06 07:27:12,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:12,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:12,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:12,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:12,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:12,052 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:12,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:12,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:12,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:12,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:12,088 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:12,088 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:12,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:12,088 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:12,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:12,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:12,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:12,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:12,089 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:12,089 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:12,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:12,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:12,090 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:12,090 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:12,090 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:12,090 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:12,090 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:12,090 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:12,090 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:12,090 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:12,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:12,093 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:12,093 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:12,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:12,093 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:12,093 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:12,167 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:12,168 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:27:12,168 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:12,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:12,168 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:12,168 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:12,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable533 [2022-12-06 07:27:12,168 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-06 07:27:12,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:12,168 INFO L85 PathProgramCache]: Analyzing trace with hash -513446643, now seen corresponding path program 1 times [2022-12-06 07:27:12,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:12,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929447491] [2022-12-06 07:27:12,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:12,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:12,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-06 07:27:12,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:12,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929447491] [2022-12-06 07:27:12,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929447491] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:12,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:12,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:12,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857917785] [2022-12-06 07:27:12,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:12,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:12,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:12,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:12,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:12,232 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:12,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:12,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:12,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:12,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:12,273 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:12,273 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:12,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:12,273 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:12,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:12,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:12,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:12,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:12,274 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:12,274 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:12,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:12,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:12,275 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:12,275 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:12,275 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:12,275 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:12,275 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:12,275 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:12,275 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:12,275 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:12,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:12,278 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:12,278 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:12,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:12,278 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:12,278 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:12,351 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:12,352 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:12,352 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:12,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:12,352 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:12,352 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:12,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable534 [2022-12-06 07:27:12,352 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-06 07:27:12,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:12,352 INFO L85 PathProgramCache]: Analyzing trace with hash -482970450, now seen corresponding path program 1 times [2022-12-06 07:27:12,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:12,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528139179] [2022-12-06 07:27:12,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:12,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:12,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-06 07:27:12,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:12,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528139179] [2022-12-06 07:27:12,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528139179] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:12,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:12,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:12,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956761055] [2022-12-06 07:27:12,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:12,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:12,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:12,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:12,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:12,409 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:12,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:12,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:12,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:12,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:12,451 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:12,452 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:12,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:12,452 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:12,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:12,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:12,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:12,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:12,453 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:12,453 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:12,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:12,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:12,453 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:12,453 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:12,454 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:12,454 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:12,454 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:12,454 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:12,454 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:12,454 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:12,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:12,456 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:12,456 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:12,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:12,457 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:12,457 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:12,530 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:12,531 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:12,531 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:12,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:12,531 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:12,531 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:12,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable535 [2022-12-06 07:27:12,531 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-06 07:27:12,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:12,531 INFO L85 PathProgramCache]: Analyzing trace with hash -456188341, now seen corresponding path program 1 times [2022-12-06 07:27:12,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:12,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035975659] [2022-12-06 07:27:12,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:12,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:12,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-06 07:27:12,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:12,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035975659] [2022-12-06 07:27:12,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035975659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:12,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:12,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:12,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10973284] [2022-12-06 07:27:12,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:12,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:12,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:12,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:12,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:12,599 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:12,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:12,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:12,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:12,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:12,637 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:12,637 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:12,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:12,638 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:12,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:12,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:12,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:12,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:12,638 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:12,638 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:12,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:12,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:12,639 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:12,639 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:12,639 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:12,639 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:12,639 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:12,640 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:12,640 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:12,640 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:12,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:12,642 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:12,642 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:12,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:12,642 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:12,642 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:12,714 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:12,715 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:12,715 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:12,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:12,715 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:12,715 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:12,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable536 [2022-12-06 07:27:12,715 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-06 07:27:12,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:12,716 INFO L85 PathProgramCache]: Analyzing trace with hash -425712148, now seen corresponding path program 1 times [2022-12-06 07:27:12,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:12,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500907368] [2022-12-06 07:27:12,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:12,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:12,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-06 07:27:12,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:12,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500907368] [2022-12-06 07:27:12,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500907368] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:12,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:12,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:12,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078828113] [2022-12-06 07:27:12,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:12,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:12,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:12,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:12,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:12,772 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:12,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:12,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:12,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:12,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:12,807 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:12,807 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:12,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:12,808 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:12,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:12,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:12,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:12,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:12,808 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:12,808 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:12,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:12,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:12,809 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:12,809 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:12,809 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:12,809 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:12,809 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:12,809 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:12,810 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:12,810 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:12,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:12,812 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:12,812 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:12,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:12,812 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:12,812 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:12,884 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:12,885 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:12,885 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:12,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:12,885 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:12,885 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:12,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable537 [2022-12-06 07:27:12,885 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-06 07:27:12,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:12,886 INFO L85 PathProgramCache]: Analyzing trace with hash -398930039, now seen corresponding path program 1 times [2022-12-06 07:27:12,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:12,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028332872] [2022-12-06 07:27:12,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:12,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:12,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-06 07:27:12,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:12,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028332872] [2022-12-06 07:27:12,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028332872] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:12,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:12,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:12,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488555170] [2022-12-06 07:27:12,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:12,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:12,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:12,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:12,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:12,967 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:12,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:12,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:12,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:12,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:13,009 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:13,009 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:13,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:13,010 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:13,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:13,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:13,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:13,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:13,010 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:13,010 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:13,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:13,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:13,011 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:13,011 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:13,011 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:13,012 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:13,012 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:13,012 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:13,012 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:13,012 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:13,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:13,014 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:13,014 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:13,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:13,014 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:13,015 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:13,094 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:13,094 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:27:13,094 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:13,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:13,095 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:13,095 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:13,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable538 [2022-12-06 07:27:13,095 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-06 07:27:13,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:13,095 INFO L85 PathProgramCache]: Analyzing trace with hash -368453846, now seen corresponding path program 1 times [2022-12-06 07:27:13,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:13,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187767302] [2022-12-06 07:27:13,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:13,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:13,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-06 07:27:13,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:13,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187767302] [2022-12-06 07:27:13,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187767302] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:13,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:13,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:13,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926516997] [2022-12-06 07:27:13,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:13,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:13,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:13,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:13,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:13,155 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:13,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:13,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:13,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:13,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:13,192 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:13,192 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:13,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:13,193 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:13,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:13,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:13,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:13,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:13,193 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:13,193 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:13,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:13,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:13,194 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:13,194 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:13,194 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:13,194 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:13,194 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:13,194 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:13,194 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:13,195 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:13,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:13,197 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:13,197 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:13,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:13,197 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:13,197 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:13,273 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:13,273 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:27:13,273 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:13,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:13,273 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:13,273 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:13,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable539 [2022-12-06 07:27:13,274 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-06 07:27:13,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:13,274 INFO L85 PathProgramCache]: Analyzing trace with hash -341671737, now seen corresponding path program 1 times [2022-12-06 07:27:13,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:13,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772293512] [2022-12-06 07:27:13,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:13,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:13,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:13,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-06 07:27:13,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:13,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772293512] [2022-12-06 07:27:13,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772293512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:13,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:13,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:13,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115941685] [2022-12-06 07:27:13,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:13,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:13,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:13,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:13,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:13,340 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:13,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:13,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:13,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:13,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:13,375 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:13,376 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:13,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:13,376 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:13,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:13,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:13,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:13,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:13,377 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:13,377 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:13,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:13,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:13,377 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:13,378 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:13,378 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:13,378 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:13,378 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:13,378 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:13,378 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:13,378 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:13,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:13,380 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:13,380 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:13,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:13,381 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:13,381 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:13,453 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:13,454 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:13,454 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:13,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:13,454 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:13,454 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:13,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable540 [2022-12-06 07:27:13,454 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-06 07:27:13,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:13,455 INFO L85 PathProgramCache]: Analyzing trace with hash -311195544, now seen corresponding path program 1 times [2022-12-06 07:27:13,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:13,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251620970] [2022-12-06 07:27:13,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:13,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:13,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-06 07:27:13,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:13,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251620970] [2022-12-06 07:27:13,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251620970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:13,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:13,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:13,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468188456] [2022-12-06 07:27:13,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:13,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:13,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:13,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:13,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:13,514 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:13,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:13,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:13,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:13,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:13,558 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:13,558 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:13,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:13,558 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:13,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:13,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:13,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:13,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:13,559 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:13,559 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:13,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:13,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:13,560 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:13,560 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:13,560 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:13,560 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:13,560 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:13,560 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:13,560 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:13,560 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:13,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:13,563 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:13,563 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:13,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:13,563 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:13,563 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:13,636 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:13,636 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:13,636 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:13,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:13,636 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:13,637 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:13,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable541 [2022-12-06 07:27:13,637 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-06 07:27:13,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:13,637 INFO L85 PathProgramCache]: Analyzing trace with hash -284413435, now seen corresponding path program 1 times [2022-12-06 07:27:13,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:13,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534172294] [2022-12-06 07:27:13,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:13,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:13,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-06 07:27:13,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:13,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534172294] [2022-12-06 07:27:13,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534172294] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:13,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:13,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:13,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576154824] [2022-12-06 07:27:13,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:13,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:13,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:13,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:13,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:13,700 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:13,700 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:13,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:13,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:13,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:13,750 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:13,750 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:13,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:13,750 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:13,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:13,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:13,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:13,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:13,751 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:13,751 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:13,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:13,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:13,752 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:13,752 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:13,752 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:13,752 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:13,752 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:13,752 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:13,753 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:13,753 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:13,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:13,755 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:13,755 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:13,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:13,755 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:13,755 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:13,826 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:13,827 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:13,827 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:13,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:13,827 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:13,827 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:13,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable542 [2022-12-06 07:27:13,827 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-06 07:27:13,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:13,827 INFO L85 PathProgramCache]: Analyzing trace with hash -253937242, now seen corresponding path program 1 times [2022-12-06 07:27:13,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:13,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187008089] [2022-12-06 07:27:13,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:13,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:13,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:13,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:13,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187008089] [2022-12-06 07:27:13,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187008089] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:13,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:13,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:13,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306372957] [2022-12-06 07:27:13,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:13,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:13,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:13,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:13,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:13,886 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:13,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:13,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:13,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:13,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:13,922 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:13,922 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:13,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:13,922 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:13,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:13,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:13,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:13,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:13,923 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:13,923 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:13,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:13,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:13,924 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:13,924 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:13,924 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:13,924 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:13,924 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:13,924 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:13,924 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:13,924 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:13,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:13,927 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:13,927 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:13,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:13,927 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:13,927 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:14,001 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:14,002 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:27:14,002 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:14,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:14,002 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:14,002 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:14,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable543 [2022-12-06 07:27:14,002 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-06 07:27:14,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:14,002 INFO L85 PathProgramCache]: Analyzing trace with hash -227155133, now seen corresponding path program 1 times [2022-12-06 07:27:14,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:14,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539184082] [2022-12-06 07:27:14,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:14,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:14,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:14,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-06 07:27:14,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:14,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539184082] [2022-12-06 07:27:14,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539184082] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:14,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:14,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:14,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425319722] [2022-12-06 07:27:14,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:14,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:14,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:14,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:14,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:14,070 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:14,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:14,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:14,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:14,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:14,111 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:14,111 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:14,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:14,112 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:14,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:14,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:14,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:14,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:14,112 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:14,112 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:14,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:14,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:14,113 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:14,113 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:14,113 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:14,114 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:14,114 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:14,114 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:14,114 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:14,114 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:14,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:14,116 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:14,116 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:14,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:14,117 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:14,117 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:14,190 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:14,190 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:14,190 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:14,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:14,191 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:14,191 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:14,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable544 [2022-12-06 07:27:14,191 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-06 07:27:14,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:14,191 INFO L85 PathProgramCache]: Analyzing trace with hash -196678940, now seen corresponding path program 1 times [2022-12-06 07:27:14,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:14,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419080990] [2022-12-06 07:27:14,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:14,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:14,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:14,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-06 07:27:14,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:14,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419080990] [2022-12-06 07:27:14,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419080990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:14,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:14,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:14,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601123902] [2022-12-06 07:27:14,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:14,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:14,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:14,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:14,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:14,255 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:14,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:14,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:14,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:14,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:14,292 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:14,292 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:14,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:14,293 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:14,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:14,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:14,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:14,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:14,293 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:14,294 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:14,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:14,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:14,294 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:14,294 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:14,295 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:14,295 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:14,295 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:14,295 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:14,295 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:14,295 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:14,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:14,297 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:14,297 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:14,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:14,297 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:14,297 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:14,368 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:14,369 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:27:14,369 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:14,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:14,369 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:14,369 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:14,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable545 [2022-12-06 07:27:14,369 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-06 07:27:14,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:14,369 INFO L85 PathProgramCache]: Analyzing trace with hash -169896831, now seen corresponding path program 1 times [2022-12-06 07:27:14,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:14,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047413321] [2022-12-06 07:27:14,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:14,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:14,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-06 07:27:14,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:14,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047413321] [2022-12-06 07:27:14,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047413321] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:14,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:14,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:14,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440552955] [2022-12-06 07:27:14,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:14,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:14,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:14,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:14,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:14,429 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:14,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:14,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:14,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:14,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:14,462 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:14,462 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:14,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:14,463 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:14,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:14,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:14,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:14,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:14,463 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:14,463 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:14,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:14,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:14,464 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:14,464 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:14,464 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:14,464 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:14,465 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:14,465 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:14,465 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:14,465 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:14,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:14,467 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:14,467 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:14,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:14,467 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:14,467 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:14,539 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:14,539 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:14,539 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:14,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:14,539 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:14,539 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:14,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable546 [2022-12-06 07:27:14,540 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-06 07:27:14,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:14,540 INFO L85 PathProgramCache]: Analyzing trace with hash -139420638, now seen corresponding path program 1 times [2022-12-06 07:27:14,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:14,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352881796] [2022-12-06 07:27:14,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:14,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:14,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-06 07:27:14,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:14,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352881796] [2022-12-06 07:27:14,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352881796] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:14,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:14,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:14,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111533082] [2022-12-06 07:27:14,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:14,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:14,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:14,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:14,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:14,614 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:14,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:14,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:14,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:14,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:14,655 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:14,655 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:14,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:14,655 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:14,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:14,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:14,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:14,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:14,656 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:14,656 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:14,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:14,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:14,657 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:14,657 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:14,657 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:14,657 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:14,657 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:14,657 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:14,657 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:14,657 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:14,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:14,660 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:14,660 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:14,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:14,660 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:14,660 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:14,732 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:14,733 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:14,733 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:14,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:14,733 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:14,733 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:14,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable547 [2022-12-06 07:27:14,733 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-06 07:27:14,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:14,733 INFO L85 PathProgramCache]: Analyzing trace with hash -112638529, now seen corresponding path program 1 times [2022-12-06 07:27:14,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:14,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338629080] [2022-12-06 07:27:14,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:14,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27: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-06 07:27:14,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:14,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338629080] [2022-12-06 07:27:14,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338629080] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:14,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:14,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:14,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788455329] [2022-12-06 07:27:14,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:14,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:14,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:14,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:14,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:14,797 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:14,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:14,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:14,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:14,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:14,839 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:14,839 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:14,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:14,840 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:14,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:14,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:14,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:14,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:14,840 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:14,840 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:14,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:14,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:14,841 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:14,841 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:14,841 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:14,841 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:14,841 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:14,841 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:14,841 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:14,842 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:14,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:14,844 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:14,844 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:14,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:14,844 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:14,844 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:14,915 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:14,916 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:14,916 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:14,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:14,916 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:14,916 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:14,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable548 [2022-12-06 07:27:14,916 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-06 07:27:14,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:14,917 INFO L85 PathProgramCache]: Analyzing trace with hash -82162336, now seen corresponding path program 1 times [2022-12-06 07:27:14,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:14,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340938996] [2022-12-06 07:27:14,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:14,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:14,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-06 07:27:14,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:14,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340938996] [2022-12-06 07:27:14,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340938996] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:14,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:14,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:14,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537435387] [2022-12-06 07:27:14,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:14,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:14,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:14,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:14,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:14,983 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:14,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:14,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:14,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:14,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:15,031 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:15,031 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:15,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:15,032 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:15,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:15,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:15,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:15,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:15,032 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:15,032 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:15,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:15,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:15,033 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:15,033 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:15,033 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:15,033 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:15,033 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:15,034 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:15,034 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:15,034 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:15,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:15,036 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:15,036 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:15,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:15,036 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:15,036 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:15,109 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:15,109 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:15,109 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:15,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:15,109 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:15,109 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:15,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable549 [2022-12-06 07:27:15,109 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-06 07:27:15,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:15,110 INFO L85 PathProgramCache]: Analyzing trace with hash -55380227, now seen corresponding path program 1 times [2022-12-06 07:27:15,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:15,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955262098] [2022-12-06 07:27:15,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:15,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:15,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-06 07:27:15,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:15,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955262098] [2022-12-06 07:27:15,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955262098] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:15,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:15,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:15,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69213374] [2022-12-06 07:27:15,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:15,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:15,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:15,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:15,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:15,170 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:15,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:15,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:15,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:15,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:15,209 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:15,209 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:15,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:15,209 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:15,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:15,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:15,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:15,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:15,210 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:15,210 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:15,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:15,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:15,211 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:15,211 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:15,211 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:15,211 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:15,211 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:15,211 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:15,211 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:15,211 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:15,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:15,214 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:15,215 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:15,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:15,215 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:15,215 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:15,288 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:15,288 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:15,288 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:15,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:15,289 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:15,289 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:15,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable550 [2022-12-06 07:27:15,289 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-06 07:27:15,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:15,289 INFO L85 PathProgramCache]: Analyzing trace with hash -24904034, now seen corresponding path program 1 times [2022-12-06 07:27:15,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:15,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293845522] [2022-12-06 07:27:15,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:15,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:15,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-06 07:27:15,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:15,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293845522] [2022-12-06 07:27:15,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293845522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:15,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:15,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:15,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177051370] [2022-12-06 07:27:15,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:15,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:15,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:15,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:15,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:15,360 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:15,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:15,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:15,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:15,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:15,396 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:15,397 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:15,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:15,397 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:15,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:15,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:15,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:15,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:15,398 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:15,398 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:15,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:15,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:15,398 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:15,399 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:15,399 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:15,399 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:15,399 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:15,399 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:15,399 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:15,399 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:15,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:15,401 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:15,402 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:15,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:15,402 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:15,402 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:15,475 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:15,476 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:15,476 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:15,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:15,476 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:15,476 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:15,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable551 [2022-12-06 07:27:15,476 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-06 07:27:15,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:15,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1878075, now seen corresponding path program 1 times [2022-12-06 07:27:15,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:15,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944809166] [2022-12-06 07:27:15,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:15,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:15,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-06 07:27:15,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:15,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944809166] [2022-12-06 07:27:15,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944809166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:15,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:15,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:15,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025346861] [2022-12-06 07:27:15,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:15,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:15,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:15,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:15,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:15,544 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:15,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:15,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:15,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:15,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:15,581 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:15,581 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:15,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:15,582 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:15,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:15,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:15,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:15,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:15,582 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:15,582 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:15,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:15,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:15,583 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:15,583 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:15,583 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:15,583 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:15,583 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:15,584 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:15,584 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:15,584 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:15,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:15,586 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:15,586 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:15,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:15,586 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:15,586 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:15,659 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:15,660 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:15,660 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:15,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:15,660 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:15,660 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:15,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable552 [2022-12-06 07:27:15,660 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-06 07:27:15,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:15,660 INFO L85 PathProgramCache]: Analyzing trace with hash 32354268, now seen corresponding path program 1 times [2022-12-06 07:27:15,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:15,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355260662] [2022-12-06 07:27:15,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:15,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:15,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-06 07:27:15,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:15,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355260662] [2022-12-06 07:27:15,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355260662] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:15,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:15,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:15,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531629812] [2022-12-06 07:27:15,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:15,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:15,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:15,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:15,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:15,717 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:15,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:15,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:15,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:15,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:15,754 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:15,754 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:15,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:15,755 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:15,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:15,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:15,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:15,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:15,755 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:15,756 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:15,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:15,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:15,756 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:15,756 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:15,756 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:15,757 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:15,757 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:15,757 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:15,757 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:15,757 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:15,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:15,759 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:15,759 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:15,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:15,759 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:15,760 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:15,832 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:15,832 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:15,832 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:15,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:15,833 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:15,833 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:15,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable553 [2022-12-06 07:27:15,833 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-06 07:27:15,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:15,833 INFO L85 PathProgramCache]: Analyzing trace with hash 59136377, now seen corresponding path program 1 times [2022-12-06 07:27:15,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:15,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022292288] [2022-12-06 07:27:15,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:15,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:15,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-06 07:27:15,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:15,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022292288] [2022-12-06 07:27:15,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022292288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:15,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:15,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:15,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030077973] [2022-12-06 07:27:15,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:15,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:15,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:15,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:15,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:15,893 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:15,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:15,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:15,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:15,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:15,927 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:15,927 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:15,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:15,928 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:15,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:15,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:15,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:15,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:15,928 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:15,928 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:15,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:15,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:15,929 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:15,929 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:15,929 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:15,929 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:15,929 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:15,930 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:15,930 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:15,930 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:15,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:15,932 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:15,932 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:15,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:15,932 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:15,932 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:16,004 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:16,004 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:16,004 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:16,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:16,005 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:16,005 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:16,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable554 [2022-12-06 07:27:16,005 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-06 07:27:16,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:16,005 INFO L85 PathProgramCache]: Analyzing trace with hash 89612570, now seen corresponding path program 1 times [2022-12-06 07:27:16,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:16,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110114174] [2022-12-06 07:27:16,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:16,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:16,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:16,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-06 07:27:16,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:16,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110114174] [2022-12-06 07:27:16,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110114174] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:16,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:16,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:16,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723891739] [2022-12-06 07:27:16,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:16,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:16,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:16,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:16,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:16,061 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:16,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:16,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:16,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:16,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:16,104 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:16,104 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:16,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:16,104 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:16,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:16,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:16,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:16,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:16,105 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:16,105 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:16,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:16,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:16,106 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:16,106 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:16,106 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:16,106 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:16,106 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:16,106 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:16,106 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:16,106 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:16,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:16,108 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:16,109 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:16,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:16,109 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:16,109 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:16,184 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:16,184 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:27:16,184 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:16,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:16,185 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:16,185 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:16,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable555 [2022-12-06 07:27:16,185 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-06 07:27:16,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:16,185 INFO L85 PathProgramCache]: Analyzing trace with hash 116394679, now seen corresponding path program 1 times [2022-12-06 07:27:16,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:16,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444289684] [2022-12-06 07:27:16,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:16,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:16,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-06 07:27:16,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:16,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444289684] [2022-12-06 07:27:16,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444289684] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:16,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:16,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:16,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450407141] [2022-12-06 07:27:16,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:16,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:16,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:16,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:16,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:16,268 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:16,268 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:16,268 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:16,268 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:16,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:16,303 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:16,303 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:16,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 372 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:16,303 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:16,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:16,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:16,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:16,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:16,304 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:16,304 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:16,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:16,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:16,304 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:16,305 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:16,305 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:16,305 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:16,305 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:16,305 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:16,305 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:16,305 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:16,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:16,307 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:16,307 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:16,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:16,308 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:16,308 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:16,380 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:16,381 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:16,381 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:16,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:16,381 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:16,381 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:16,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable556 [2022-12-06 07:27:16,381 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-06 07:27:16,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:16,382 INFO L85 PathProgramCache]: Analyzing trace with hash 146870872, now seen corresponding path program 1 times [2022-12-06 07:27:16,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:16,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003388079] [2022-12-06 07:27:16,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:16,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:16,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:16,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-06 07:27:16,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:16,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003388079] [2022-12-06 07:27:16,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003388079] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:16,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:16,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:16,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359419472] [2022-12-06 07:27:16,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:16,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:16,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:16,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:16,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:16,443 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:16,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:16,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:16,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:16,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:16,480 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:16,480 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:16,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:16,481 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:16,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:16,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:16,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:16,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:16,481 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:16,481 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:16,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:16,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:16,482 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:16,482 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:16,482 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:16,482 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:16,482 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:16,482 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:16,483 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:16,483 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:16,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:16,485 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:16,485 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:16,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:16,485 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:16,485 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:16,560 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:16,560 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:27:16,560 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:16,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:16,560 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:16,560 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:16,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable557 [2022-12-06 07:27:16,561 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-06 07:27:16,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:16,561 INFO L85 PathProgramCache]: Analyzing trace with hash 173652981, now seen corresponding path program 1 times [2022-12-06 07:27:16,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:16,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089488039] [2022-12-06 07:27:16,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:16,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:16,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-06 07:27:16,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:16,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089488039] [2022-12-06 07:27:16,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089488039] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:16,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:16,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:16,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782879822] [2022-12-06 07:27:16,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:16,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:16,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:16,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:16,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:16,622 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:16,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:16,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:16,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:16,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:16,663 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:16,663 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:16,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:16,663 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:16,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:16,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:16,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:16,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:16,664 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:16,664 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:16,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:16,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:16,665 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:16,665 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:16,665 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:16,665 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:16,665 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:16,665 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:16,665 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:16,665 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:16,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:16,668 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:16,668 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:16,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:16,668 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:16,668 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:16,741 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:16,742 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:16,742 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:16,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:16,742 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:16,742 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:16,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable558 [2022-12-06 07:27:16,742 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-06 07:27:16,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:16,743 INFO L85 PathProgramCache]: Analyzing trace with hash 204129174, now seen corresponding path program 1 times [2022-12-06 07:27:16,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:16,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730948277] [2022-12-06 07:27:16,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:16,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:16,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-06 07:27:16,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:16,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730948277] [2022-12-06 07:27:16,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730948277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:16,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:16,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:16,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193438372] [2022-12-06 07:27:16,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:16,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:16,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:16,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:16,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:16,801 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:16,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:16,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:16,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:16,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:16,843 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:16,843 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:16,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:16,844 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:16,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:16,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:16,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:16,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:16,844 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:16,844 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:16,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:16,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:16,845 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:16,845 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:16,845 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:16,845 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:16,845 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:16,845 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:16,845 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:16,846 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:16,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:16,848 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:16,848 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:16,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:16,848 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:16,848 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:16,929 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:16,930 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 07:27:16,930 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:16,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:16,930 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:16,930 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:16,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable559 [2022-12-06 07:27:16,930 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-06 07:27:16,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:16,930 INFO L85 PathProgramCache]: Analyzing trace with hash 230911283, now seen corresponding path program 1 times [2022-12-06 07:27:16,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:16,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426715461] [2022-12-06 07:27:16,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:16,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:16,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:16,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:16,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426715461] [2022-12-06 07:27:16,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426715461] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:16,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:16,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:16,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118993514] [2022-12-06 07:27:16,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:16,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:16,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:16,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:16,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:16,989 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:16,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:16,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:16,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:16,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:17,032 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:17,032 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:17,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:17,033 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:17,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:17,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:17,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:17,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:17,033 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:17,033 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:17,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:17,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:17,034 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:17,034 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:17,034 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:17,035 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:17,035 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:17,035 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:17,035 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:17,035 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:17,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:17,037 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:17,037 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:17,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:17,037 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:17,037 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:17,111 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:17,111 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:17,111 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:17,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:17,111 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:17,111 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:17,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable560 [2022-12-06 07:27:17,112 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-06 07:27:17,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:17,112 INFO L85 PathProgramCache]: Analyzing trace with hash 261387476, now seen corresponding path program 1 times [2022-12-06 07:27:17,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:17,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95427764] [2022-12-06 07:27:17,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:17,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:17,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:17,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-06 07:27:17,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:17,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95427764] [2022-12-06 07:27:17,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95427764] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:17,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:17,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:17,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77376845] [2022-12-06 07:27:17,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:17,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:17,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:17,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:17,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:17,175 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:17,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:17,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:17,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:17,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:17,212 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:17,212 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:17,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:17,212 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:17,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:17,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:17,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:17,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:17,213 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:17,213 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:17,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:17,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:17,214 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:17,214 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:17,214 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:17,214 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:17,214 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:17,214 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:17,214 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:17,214 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:17,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:17,216 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:17,217 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:17,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:17,217 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:17,217 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:17,289 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:17,290 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:17,290 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:17,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:17,290 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:17,290 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:17,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable561 [2022-12-06 07:27:17,290 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-06 07:27:17,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:17,290 INFO L85 PathProgramCache]: Analyzing trace with hash 288169585, now seen corresponding path program 1 times [2022-12-06 07:27:17,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:17,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549668238] [2022-12-06 07:27:17,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:17,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27: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-06 07:27:17,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:17,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549668238] [2022-12-06 07:27:17,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549668238] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:17,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:17,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:17,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313511175] [2022-12-06 07:27:17,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:17,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:17,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:17,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:17,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:17,349 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:17,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:17,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:17,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:17,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:17,385 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:17,385 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:17,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:17,386 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:17,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:17,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:17,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:17,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:17,386 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:17,386 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:17,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:17,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:17,387 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:17,387 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:17,387 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:17,387 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:17,387 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:17,387 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:17,387 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:17,388 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:17,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:17,390 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:17,390 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:17,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:17,390 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:17,390 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:17,462 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:17,462 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:17,462 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:17,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:17,462 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:17,463 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:17,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable562 [2022-12-06 07:27:17,463 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-06 07:27:17,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:17,463 INFO L85 PathProgramCache]: Analyzing trace with hash 318645778, now seen corresponding path program 1 times [2022-12-06 07:27:17,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:17,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722445769] [2022-12-06 07:27:17,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:17,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:17,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-06 07:27:17,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:17,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722445769] [2022-12-06 07:27:17,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722445769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:17,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:17,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:17,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340308403] [2022-12-06 07:27:17,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:17,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:17,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:17,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:17,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:17,540 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:17,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:17,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:17,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:17,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:17,588 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:17,588 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:17,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:17,589 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:17,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:17,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:17,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:17,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:17,589 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:17,589 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:17,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:17,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:17,590 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:17,590 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:17,591 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:17,591 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:17,591 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:17,591 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:17,591 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:17,591 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:17,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:17,594 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:17,594 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:17,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:17,594 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:17,594 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:17,696 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:17,697 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-06 07:27:17,697 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:17,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:17,697 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:17,697 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:17,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable563 [2022-12-06 07:27:17,698 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-06 07:27:17,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:17,698 INFO L85 PathProgramCache]: Analyzing trace with hash 345427887, now seen corresponding path program 1 times [2022-12-06 07:27:17,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:17,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820746128] [2022-12-06 07:27:17,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:17,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:17,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:17,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:17,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820746128] [2022-12-06 07:27:17,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820746128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:17,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:17,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:17,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063272275] [2022-12-06 07:27:17,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:17,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:17,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:17,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:17,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:17,786 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:17,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:17,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:17,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:17,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:17,839 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:17,839 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:17,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:17,840 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:17,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:17,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:17,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:17,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:17,841 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:17,841 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:17,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:17,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:17,842 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:17,842 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:17,842 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:17,842 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:17,842 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:17,843 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:17,843 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:17,843 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:17,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:17,847 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:17,847 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:17,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:17,847 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:17,847 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:17,937 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:17,938 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:27:17,938 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:17,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:17,938 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:17,938 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:17,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable564 [2022-12-06 07:27:17,938 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-06 07:27:17,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:17,939 INFO L85 PathProgramCache]: Analyzing trace with hash 375904080, now seen corresponding path program 1 times [2022-12-06 07:27:17,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:17,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621886218] [2022-12-06 07:27:17,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:17,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:18,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:18,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:18,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621886218] [2022-12-06 07:27:18,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621886218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:18,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:18,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:18,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890848820] [2022-12-06 07:27:18,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:18,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:18,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:18,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:18,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:18,007 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:18,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:18,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:18,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:18,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:18,044 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:18,044 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:18,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:18,044 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:18,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:18,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:18,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:18,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:18,045 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:18,045 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:18,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:18,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:18,046 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:18,046 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:18,046 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:18,046 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:18,046 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:18,046 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:18,046 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:18,046 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:18,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:18,049 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:18,049 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:18,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:18,049 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:18,049 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:18,123 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:18,123 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:18,123 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:18,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:18,123 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:18,123 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:18,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable565 [2022-12-06 07:27:18,124 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-06 07:27:18,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:18,124 INFO L85 PathProgramCache]: Analyzing trace with hash 402686189, now seen corresponding path program 1 times [2022-12-06 07:27:18,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:18,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767261301] [2022-12-06 07:27:18,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:18,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:18,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-06 07:27:18,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:18,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767261301] [2022-12-06 07:27:18,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767261301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:18,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:18,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:18,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743209712] [2022-12-06 07:27:18,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:18,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:18,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:18,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:18,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:18,186 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:18,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:18,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:18,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:18,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:18,228 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:18,228 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:18,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:18,229 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:18,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:18,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:18,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:18,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:18,229 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:18,230 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:18,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:18,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:18,230 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:18,230 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:18,230 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:18,231 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:18,231 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:18,231 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:18,231 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:18,231 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:18,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:18,233 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:18,233 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:18,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:18,233 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:18,233 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:18,306 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:18,307 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:18,307 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:18,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:18,307 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:18,307 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:18,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable566 [2022-12-06 07:27:18,307 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-06 07:27:18,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:18,307 INFO L85 PathProgramCache]: Analyzing trace with hash 433162382, now seen corresponding path program 1 times [2022-12-06 07:27:18,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:18,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331795535] [2022-12-06 07:27:18,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:18,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:18,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-06 07:27:18,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:18,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331795535] [2022-12-06 07:27:18,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331795535] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:18,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:18,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:18,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686965923] [2022-12-06 07:27:18,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:18,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:18,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:18,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:18,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:18,366 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:18,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:18,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:18,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:18,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:18,409 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:18,409 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:18,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:18,409 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:18,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:18,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:18,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:18,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:18,410 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:18,410 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:18,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:18,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:18,411 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:18,411 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:18,411 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:18,411 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:18,411 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:18,411 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:18,411 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:18,411 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:18,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:18,414 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:18,414 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:18,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:18,414 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:18,414 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:18,488 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:18,488 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:18,488 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:18,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:18,489 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:18,489 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:18,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable567 [2022-12-06 07:27:18,489 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-06 07:27:18,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:18,489 INFO L85 PathProgramCache]: Analyzing trace with hash 459944491, now seen corresponding path program 1 times [2022-12-06 07:27:18,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:18,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143378591] [2022-12-06 07:27:18,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:18,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:18,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-06 07:27:18,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:18,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143378591] [2022-12-06 07:27:18,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143378591] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:18,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:18,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:18,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438540504] [2022-12-06 07:27:18,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:18,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:18,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:18,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:18,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:18,549 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:18,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:18,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:18,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:18,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:18,606 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:18,606 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:18,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:18,607 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:18,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:18,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:18,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:18,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:18,607 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:18,607 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:18,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:18,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:18,608 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:18,608 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:18,608 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:18,608 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:18,609 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:18,609 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:18,609 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:18,609 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:18,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:18,611 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:18,611 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:18,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:18,611 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:18,611 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:18,685 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:18,686 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:27:18,686 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:18,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:18,686 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:18,686 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:18,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable568 [2022-12-06 07:27:18,686 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-06 07:27:18,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:18,686 INFO L85 PathProgramCache]: Analyzing trace with hash 490420684, now seen corresponding path program 1 times [2022-12-06 07:27:18,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:18,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896535366] [2022-12-06 07:27:18,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:18,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:18,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27: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-06 07:27:18,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:18,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896535366] [2022-12-06 07:27:18,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896535366] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:18,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:18,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:18,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43750487] [2022-12-06 07:27:18,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:18,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:18,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:18,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:18,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:18,742 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:18,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:18,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:18,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:18,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:18,786 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:18,786 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:18,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:18,787 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:18,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:18,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:18,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:18,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:18,787 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:18,787 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:18,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:18,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:18,788 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:18,788 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:18,788 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:18,788 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:18,789 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:18,789 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:18,789 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:18,789 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:18,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:18,791 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:18,791 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:18,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:18,791 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:18,791 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:18,865 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:18,865 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:18,865 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:18,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:18,865 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:18,865 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:18,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable569 [2022-12-06 07:27:18,865 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-06 07:27:18,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:18,866 INFO L85 PathProgramCache]: Analyzing trace with hash 517202793, now seen corresponding path program 1 times [2022-12-06 07:27:18,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:18,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054583078] [2022-12-06 07:27:18,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:18,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:18,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-06 07:27:18,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:18,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054583078] [2022-12-06 07:27:18,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054583078] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:18,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:18,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:18,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032166260] [2022-12-06 07:27:18,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:18,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:18,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:18,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:18,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:18,924 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:18,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:18,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:18,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:18,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:18,960 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:18,960 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:18,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:18,961 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:18,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:18,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:18,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:18,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:18,961 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:18,961 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:18,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:18,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:18,962 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:18,962 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:18,962 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:18,962 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:18,962 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:18,962 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:18,962 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:18,963 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:18,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:18,965 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:18,965 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:18,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:18,965 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:18,965 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:19,037 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:19,038 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:19,038 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:19,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:19,038 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:19,038 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:19,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable570 [2022-12-06 07:27:19,038 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-06 07:27:19,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:19,038 INFO L85 PathProgramCache]: Analyzing trace with hash 547678986, now seen corresponding path program 1 times [2022-12-06 07:27:19,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:19,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299033808] [2022-12-06 07:27:19,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:19,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:19,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-06 07:27:19,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:19,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299033808] [2022-12-06 07:27:19,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299033808] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:19,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:19,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:19,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972506774] [2022-12-06 07:27:19,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:19,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:19,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:19,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:19,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:19,094 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:19,094 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:19,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:19,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:19,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:19,130 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:19,131 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:19,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:19,131 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:19,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:19,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:19,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:19,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:19,132 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:19,132 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:19,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:19,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:19,132 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:19,132 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:19,132 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:19,133 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:19,133 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:19,133 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:19,133 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:19,133 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:19,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:19,135 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:19,135 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:19,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:19,135 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:19,135 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:19,208 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:19,208 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:19,208 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:19,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:19,208 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:19,208 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:19,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable571 [2022-12-06 07:27:19,209 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-06 07:27:19,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:19,209 INFO L85 PathProgramCache]: Analyzing trace with hash 574461095, now seen corresponding path program 1 times [2022-12-06 07:27:19,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:19,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828168588] [2022-12-06 07:27:19,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:19,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:19,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-06 07:27:19,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:19,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828168588] [2022-12-06 07:27:19,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828168588] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:19,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:19,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:19,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096048489] [2022-12-06 07:27:19,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:19,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:19,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:19,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:19,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:19,268 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:19,268 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:19,268 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:19,268 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:19,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:19,303 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:19,303 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:19,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:19,303 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:19,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:19,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:19,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:19,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:19,304 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:19,304 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:19,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:19,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:19,305 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:19,305 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:19,305 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:19,305 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:19,305 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:19,305 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:19,305 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:19,305 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:19,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:19,308 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:19,308 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:19,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:19,308 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:19,308 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:19,380 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:19,380 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:19,380 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:19,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:19,380 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:19,380 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:19,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable572 [2022-12-06 07:27:19,381 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-06 07:27:19,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:19,381 INFO L85 PathProgramCache]: Analyzing trace with hash 604937288, now seen corresponding path program 1 times [2022-12-06 07:27:19,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:19,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330639535] [2022-12-06 07:27:19,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:19,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:19,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-06 07:27:19,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:19,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330639535] [2022-12-06 07:27:19,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330639535] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:19,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:19,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:19,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042325406] [2022-12-06 07:27:19,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:19,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:19,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:19,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:19,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:19,443 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:19,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:19,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:19,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:19,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:19,479 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:19,479 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:19,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:19,480 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:19,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:19,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:19,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:19,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:19,480 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:19,481 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:19,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:19,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:19,481 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:19,481 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:19,481 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:19,482 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:19,482 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:19,482 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:19,482 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:19,482 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:19,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:19,484 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:19,484 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:19,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:19,484 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:19,484 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:19,557 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:19,558 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:19,558 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:19,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:19,558 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:19,558 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:19,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable573 [2022-12-06 07:27:19,558 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-06 07:27:19,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:19,558 INFO L85 PathProgramCache]: Analyzing trace with hash 631719397, now seen corresponding path program 1 times [2022-12-06 07:27:19,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:19,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354284316] [2022-12-06 07:27:19,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:19,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:19,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:19,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:19,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354284316] [2022-12-06 07:27:19,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354284316] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:19,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:19,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:19,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555999391] [2022-12-06 07:27:19,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:19,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:19,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:19,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:19,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:19,617 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:19,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:19,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:19,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:19,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:19,654 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:19,654 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:19,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:19,655 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:19,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:19,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:19,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:19,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:19,655 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:19,656 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:19,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:19,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:19,656 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:19,656 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:19,657 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:19,657 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:19,657 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:19,657 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:19,657 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:19,657 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:19,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:19,659 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:19,659 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:19,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 145 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:19,660 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:19,660 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:19,732 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:19,732 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:19,732 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:19,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:19,733 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:19,733 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:19,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable574 [2022-12-06 07:27:19,733 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-06 07:27:19,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:19,733 INFO L85 PathProgramCache]: Analyzing trace with hash 662195590, now seen corresponding path program 1 times [2022-12-06 07:27:19,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:19,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773697038] [2022-12-06 07:27:19,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:19,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:19,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-06 07:27:19,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:19,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773697038] [2022-12-06 07:27:19,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773697038] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:19,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:19,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:19,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676201760] [2022-12-06 07:27:19,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:19,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:19,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:19,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:19,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:19,790 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:19,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:19,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:19,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:19,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:19,825 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:19,826 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:19,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:19,826 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:19,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:19,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:19,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:19,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:19,826 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:19,827 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:19,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:19,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:19,827 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:19,827 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:19,828 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:19,828 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:19,828 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:19,828 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:19,828 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:19,828 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:19,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:19,830 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:19,830 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:19,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:19,831 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:19,831 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:19,904 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:19,905 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:19,905 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:19,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:19,905 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:19,905 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:19,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable575 [2022-12-06 07:27:19,905 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-06 07:27:19,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:19,906 INFO L85 PathProgramCache]: Analyzing trace with hash 688977699, now seen corresponding path program 1 times [2022-12-06 07:27:19,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:19,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176042795] [2022-12-06 07:27:19,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:19,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:19,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-06 07:27:19,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:19,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176042795] [2022-12-06 07:27:19,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176042795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:19,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:19,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:19,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452040253] [2022-12-06 07:27:19,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:19,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:19,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:19,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:19,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:19,965 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:19,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:19,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:19,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:19,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:20,006 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:20,006 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:20,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:20,007 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:20,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:20,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:20,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:20,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:20,007 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:20,007 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:20,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:20,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:20,008 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:20,008 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:20,008 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:20,008 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:20,009 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:20,009 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:20,009 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:20,009 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:20,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:20,011 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:20,011 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:20,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:20,011 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:20,011 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:20,084 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:20,085 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:20,085 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:20,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:20,085 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:20,085 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:20,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable576 [2022-12-06 07:27:20,085 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-06 07:27:20,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:20,085 INFO L85 PathProgramCache]: Analyzing trace with hash 719453892, now seen corresponding path program 1 times [2022-12-06 07:27:20,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:20,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070749677] [2022-12-06 07:27:20,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:20,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:20,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-06 07:27:20,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:20,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070749677] [2022-12-06 07:27:20,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070749677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:20,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:20,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:20,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532067685] [2022-12-06 07:27:20,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:20,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:20,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:20,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:20,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:20,145 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:20,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:20,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:20,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:20,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:20,181 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:20,181 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:20,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:20,181 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:20,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:20,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:20,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:20,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:20,182 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:20,182 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:20,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:20,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:20,182 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:20,182 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:20,183 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:20,183 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:20,183 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:20,183 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:20,183 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:20,183 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:20,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:20,185 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:20,185 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:20,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:20,186 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:20,186 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:20,256 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:20,257 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:27:20,257 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:20,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:20,257 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:20,257 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:20,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable577 [2022-12-06 07:27:20,257 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-06 07:27:20,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:20,257 INFO L85 PathProgramCache]: Analyzing trace with hash 746236001, now seen corresponding path program 1 times [2022-12-06 07:27:20,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:20,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626160833] [2022-12-06 07:27:20,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:20,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:20,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-06 07:27:20,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:20,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626160833] [2022-12-06 07:27:20,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626160833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:20,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:20,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:20,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835040248] [2022-12-06 07:27:20,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:20,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:20,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:20,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:20,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:20,341 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:20,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:20,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:20,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:20,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:20,382 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:20,382 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:20,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:20,382 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:20,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:20,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:20,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:20,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:20,383 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:20,383 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:20,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:20,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:20,383 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:20,384 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:20,384 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:20,384 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:20,384 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:20,384 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:20,384 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:20,384 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:20,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:20,386 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:20,386 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:20,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:20,387 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:20,387 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:20,459 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:20,459 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:20,459 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:20,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:20,459 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:20,459 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:20,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable578 [2022-12-06 07:27:20,459 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-06 07:27:20,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:20,460 INFO L85 PathProgramCache]: Analyzing trace with hash 776712194, now seen corresponding path program 1 times [2022-12-06 07:27:20,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:20,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557368822] [2022-12-06 07:27:20,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:20,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:20,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-06 07:27:20,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:20,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557368822] [2022-12-06 07:27:20,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557368822] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:20,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:20,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:20,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398190949] [2022-12-06 07:27:20,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:20,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:20,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:20,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:20,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:20,516 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:20,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:20,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:20,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:20,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:20,558 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:20,558 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:20,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:20,558 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:20,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:20,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:20,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:20,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:20,559 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:20,559 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:20,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:20,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:20,560 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:20,560 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:20,560 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:20,560 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:20,560 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:20,560 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:20,560 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:20,560 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:20,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:20,563 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:20,563 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:20,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:20,563 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:20,563 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:20,634 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:20,634 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:27:20,634 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:20,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:20,635 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:20,635 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:20,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable579 [2022-12-06 07:27:20,635 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-06 07:27:20,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:20,635 INFO L85 PathProgramCache]: Analyzing trace with hash 803494303, now seen corresponding path program 1 times [2022-12-06 07:27:20,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:20,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983466891] [2022-12-06 07:27:20,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:20,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:20,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-06 07:27:20,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:20,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983466891] [2022-12-06 07:27:20,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983466891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:20,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:20,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:20,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369166664] [2022-12-06 07:27:20,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:20,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:20,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:20,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:20,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:20,695 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:20,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:20,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:20,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:20,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:20,736 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:20,736 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:20,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:20,736 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:20,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:20,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:20,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:20,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:20,737 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:20,737 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:20,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:20,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:20,738 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:20,738 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:20,738 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:20,738 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:20,738 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:20,738 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:20,738 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:20,738 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:20,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:20,741 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:20,741 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:20,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:20,741 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:20,741 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:20,812 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:20,813 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:20,813 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:20,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:20,813 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:20,813 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:20,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable580 [2022-12-06 07:27:20,813 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-06 07:27:20,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:20,813 INFO L85 PathProgramCache]: Analyzing trace with hash 833970496, now seen corresponding path program 1 times [2022-12-06 07:27:20,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:20,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65458141] [2022-12-06 07:27:20,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:20,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:20,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-06 07:27:20,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:20,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65458141] [2022-12-06 07:27:20,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65458141] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:20,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:20,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:20,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455751037] [2022-12-06 07:27:20,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:20,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:20,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:20,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:20,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:20,869 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:20,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:20,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:20,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:20,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:20,911 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:20,911 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:20,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:20,912 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:20,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:20,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:20,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:20,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:20,912 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:20,912 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:20,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:20,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:20,913 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:20,913 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:20,913 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:20,913 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:20,913 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:20,914 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:20,914 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:20,914 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:20,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:20,916 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:20,916 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:20,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:20,916 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:20,916 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:20,987 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:20,988 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:20,988 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:20,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:20,988 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:20,988 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:20,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable581 [2022-12-06 07:27:20,988 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-06 07:27:20,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:20,988 INFO L85 PathProgramCache]: Analyzing trace with hash 860752605, now seen corresponding path program 1 times [2022-12-06 07:27:20,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:20,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655470752] [2022-12-06 07:27:20,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:20,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:21,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-06 07:27:21,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:21,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655470752] [2022-12-06 07:27:21,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655470752] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:21,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:21,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:21,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314424060] [2022-12-06 07:27:21,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:21,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:21,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:21,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:21,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:21,047 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:21,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:21,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:21,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:21,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:21,086 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:21,086 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:21,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:21,086 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:21,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:21,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:21,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:21,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:21,087 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:21,087 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:21,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:21,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:21,088 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:21,088 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:21,088 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:21,088 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:21,088 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:21,088 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:21,088 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:21,088 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:21,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:21,090 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:21,090 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:21,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:21,091 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:21,091 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:21,162 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:21,163 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:21,163 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:21,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:21,163 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:21,163 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:21,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable582 [2022-12-06 07:27:21,163 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-06 07:27:21,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:21,163 INFO L85 PathProgramCache]: Analyzing trace with hash 891228798, now seen corresponding path program 1 times [2022-12-06 07:27:21,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:21,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731659984] [2022-12-06 07:27:21,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:21,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:21,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-06 07:27:21,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:21,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731659984] [2022-12-06 07:27:21,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731659984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:21,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:21,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:21,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530531757] [2022-12-06 07:27:21,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:21,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:21,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:21,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:21,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:21,238 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:21,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:21,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:21,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:21,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:21,274 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:21,274 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:21,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:21,275 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:21,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:21,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:21,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:21,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:21,275 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:21,275 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:21,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:21,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:21,276 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:21,276 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:21,276 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:21,276 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:21,276 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:21,277 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:21,277 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:21,277 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:21,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:21,279 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:21,279 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:21,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:21,279 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:21,279 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:21,352 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:21,352 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:21,352 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:21,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:21,352 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:21,352 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:21,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable583 [2022-12-06 07:27:21,352 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-06 07:27:21,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:21,353 INFO L85 PathProgramCache]: Analyzing trace with hash 918010907, now seen corresponding path program 1 times [2022-12-06 07:27:21,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:21,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659003985] [2022-12-06 07:27:21,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:21,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:21,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-06 07:27:21,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:21,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659003985] [2022-12-06 07:27:21,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659003985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:21,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:21,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:21,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144820448] [2022-12-06 07:27:21,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:21,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:21,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:21,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:21,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:21,414 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:21,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:21,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:21,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:21,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:21,450 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:21,450 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:21,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:21,451 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:21,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:21,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:21,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:21,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:21,452 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:21,452 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:21,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:21,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:21,452 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:21,452 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:21,453 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:21,453 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:21,453 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:21,453 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:21,453 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:21,453 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:21,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:21,455 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:21,455 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:21,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:21,456 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:21,456 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:21,528 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:21,528 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:21,528 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:21,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:21,528 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:21,529 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:21,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable584 [2022-12-06 07:27:21,529 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-06 07:27:21,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:21,529 INFO L85 PathProgramCache]: Analyzing trace with hash 948487100, now seen corresponding path program 1 times [2022-12-06 07:27:21,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:21,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231363005] [2022-12-06 07:27:21,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:21,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:21,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-06 07:27:21,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:21,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231363005] [2022-12-06 07:27:21,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231363005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:21,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:21,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:21,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264877643] [2022-12-06 07:27:21,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:21,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:21,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:21,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:21,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:21,586 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:21,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:21,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:21,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:21,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:21,627 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:21,627 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:21,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:21,627 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:21,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:21,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:21,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:21,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:21,628 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:21,628 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:21,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:21,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:21,629 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:21,629 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:21,629 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:21,629 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:21,629 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:21,629 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:21,629 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:21,629 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:21,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:21,632 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:21,632 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:21,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:21,632 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:21,632 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:21,702 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:21,703 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:27:21,703 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:21,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:21,703 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:21,703 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:21,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable585 [2022-12-06 07:27:21,703 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-06 07:27:21,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:21,703 INFO L85 PathProgramCache]: Analyzing trace with hash 975269209, now seen corresponding path program 1 times [2022-12-06 07:27:21,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:21,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876934916] [2022-12-06 07:27:21,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:21,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:21,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-06 07:27:21,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:21,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876934916] [2022-12-06 07:27:21,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876934916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:21,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:21,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:21,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077051726] [2022-12-06 07:27:21,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:21,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:21,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:21,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:21,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:21,763 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:21,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:21,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:21,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:21,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:21,799 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:21,799 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:21,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:21,800 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:21,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:21,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:21,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:21,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:21,800 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:21,800 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:21,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:21,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:21,801 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:21,801 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:21,801 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:21,801 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:21,801 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:21,801 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:21,801 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:21,802 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:21,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:21,804 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:21,804 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:21,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:21,804 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:21,804 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:21,878 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:21,879 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:27:21,879 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:21,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:21,879 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:21,879 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:21,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable586 [2022-12-06 07:27:21,879 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-06 07:27:21,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:21,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1005745402, now seen corresponding path program 1 times [2022-12-06 07:27:21,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:21,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407532064] [2022-12-06 07:27:21,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:21,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:21,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-06 07:27:21,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:21,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407532064] [2022-12-06 07:27:21,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407532064] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:21,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:21,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:21,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112424361] [2022-12-06 07:27:21,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:21,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:21,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:21,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:21,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:21,938 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:21,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:21,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:21,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:21,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:21,974 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:21,974 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:21,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:21,975 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:21,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:21,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:21,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:21,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:21,975 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:21,976 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:21,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:21,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:21,976 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:21,976 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:21,976 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:21,977 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:21,977 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:21,977 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:21,977 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:21,977 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:21,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:21,979 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:21,979 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:21,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:21,979 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:21,979 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:22,058 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:22,058 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:27:22,058 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:22,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:22,059 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:22,059 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:22,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable587 [2022-12-06 07:27:22,059 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-06 07:27:22,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:22,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1032527511, now seen corresponding path program 1 times [2022-12-06 07:27:22,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:22,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11538263] [2022-12-06 07:27:22,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:22,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:22,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-06 07:27:22,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:22,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11538263] [2022-12-06 07:27:22,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11538263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:22,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:22,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:22,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479670531] [2022-12-06 07:27:22,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:22,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:22,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:22,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:22,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:22,119 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:22,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:22,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:22,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:22,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:22,160 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:22,160 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:22,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:22,160 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:22,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:22,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:22,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:22,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:22,161 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:22,161 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:22,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:22,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:22,162 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:22,162 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:22,162 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:22,162 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:22,162 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:22,162 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:22,162 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:22,162 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:22,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:22,164 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:22,165 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:22,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 144 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:22,165 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:22,165 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:22,236 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:22,237 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:22,237 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:22,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:22,237 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:22,237 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:22,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable588 [2022-12-06 07:27:22,237 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-06 07:27:22,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:22,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1063003704, now seen corresponding path program 1 times [2022-12-06 07:27:22,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:22,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665262627] [2022-12-06 07:27:22,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:22,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:22,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-06 07:27:22,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:22,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665262627] [2022-12-06 07:27:22,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665262627] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:22,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:22,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:22,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216028957] [2022-12-06 07:27:22,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:22,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:22,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:22,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:22,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:22,294 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:22,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:22,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:22,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:22,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:22,335 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:22,336 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:22,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:22,336 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:22,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:22,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:22,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:22,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:22,337 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:22,337 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:22,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:22,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:22,337 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:22,337 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:22,338 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:22,338 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:22,338 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:22,338 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:22,338 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:22,338 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:22,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:22,340 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:22,340 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:22,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:22,341 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:22,341 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:22,412 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:22,412 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:27:22,412 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:22,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:22,412 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:22,412 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:22,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable589 [2022-12-06 07:27:22,412 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-06 07:27:22,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:22,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1089785813, now seen corresponding path program 1 times [2022-12-06 07:27:22,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:22,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386702593] [2022-12-06 07:27:22,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:22,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:22,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-06 07:27:22,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:22,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386702593] [2022-12-06 07:27:22,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386702593] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:22,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:22,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:22,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001153170] [2022-12-06 07:27:22,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:22,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:22,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:22,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:22,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:22,472 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:22,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:22,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:22,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:22,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:22,513 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:22,513 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:22,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:22,514 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:22,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:22,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:22,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:22,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:22,515 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:22,515 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:22,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:22,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:22,516 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:22,516 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:22,517 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:22,517 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:22,517 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:22,517 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:22,517 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:22,517 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:22,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:22,519 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:22,519 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:22,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:22,520 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:22,520 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:22,593 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:22,593 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:22,593 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:22,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:22,593 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:22,594 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:22,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable590 [2022-12-06 07:27:22,594 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-06 07:27:22,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:22,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1120262006, now seen corresponding path program 1 times [2022-12-06 07:27:22,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:22,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919211709] [2022-12-06 07:27:22,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:22,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:22,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-06 07:27:22,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:22,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919211709] [2022-12-06 07:27:22,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919211709] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:22,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:22,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:22,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579902497] [2022-12-06 07:27:22,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:22,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:22,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:22,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:22,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:22,652 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:22,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:22,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:22,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:22,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:22,693 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:22,693 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:22,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:22,694 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:22,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:22,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:22,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:22,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:22,694 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:22,695 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:22,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:22,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:22,695 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:22,695 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:22,695 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:22,696 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:22,696 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:22,696 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:22,696 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:22,696 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:22,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:22,698 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:22,698 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:22,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:22,698 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:22,698 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:22,772 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:22,773 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:22,773 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:22,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:22,773 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:22,773 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:22,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable591 [2022-12-06 07:27:22,773 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-06 07:27:22,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:22,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1147044115, now seen corresponding path program 1 times [2022-12-06 07:27:22,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:22,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492595685] [2022-12-06 07:27:22,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:22,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:22,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:22,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:22,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492595685] [2022-12-06 07:27:22,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492595685] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:22,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:22,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:22,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167639568] [2022-12-06 07:27:22,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:22,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:22,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:22,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:22,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:22,835 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:22,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:22,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:22,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:22,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:22,891 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:22,891 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:22,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:22,891 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:22,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:22,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:22,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:22,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:22,892 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:22,892 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:22,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:22,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:22,893 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:22,893 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:22,893 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:22,893 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:22,893 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:22,893 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:22,893 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:22,893 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:22,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:22,896 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:22,896 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:22,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:22,896 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:22,896 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:22,969 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:22,969 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:22,969 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:22,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:22,969 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:22,969 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:22,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable592 [2022-12-06 07:27:22,970 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-06 07:27:22,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:22,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1177520308, now seen corresponding path program 1 times [2022-12-06 07:27:22,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:22,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467788694] [2022-12-06 07:27:22,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:22,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:23,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-06 07:27:23,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:23,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467788694] [2022-12-06 07:27:23,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467788694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:23,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:23,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:23,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369872924] [2022-12-06 07:27:23,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:23,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:23,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:23,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:23,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:23,025 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:23,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:23,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:23,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:23,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:23,060 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:23,060 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:23,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:23,061 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:23,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:23,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:23,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:23,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:23,061 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:23,061 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:23,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:23,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:23,062 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:23,062 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:23,062 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:23,062 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:23,062 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:23,063 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:23,063 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:23,063 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:23,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:23,066 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:23,066 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:23,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:23,066 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:23,066 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:23,138 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:23,138 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:23,138 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:23,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:23,138 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:23,138 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:23,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable593 [2022-12-06 07:27:23,138 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-06 07:27:23,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:23,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1204302417, now seen corresponding path program 1 times [2022-12-06 07:27:23,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:23,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738347502] [2022-12-06 07:27:23,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:23,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27: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-06 07:27:23,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:23,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738347502] [2022-12-06 07:27:23,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738347502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:23,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:23,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:23,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826060140] [2022-12-06 07:27:23,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:23,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:23,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:23,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:23,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:23,198 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:23,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:23,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:23,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:23,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:23,233 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:23,233 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:23,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:23,234 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:23,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:23,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:23,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:23,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:23,234 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:23,235 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:23,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:23,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:23,235 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:23,235 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:23,236 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:23,236 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:23,236 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:23,236 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:23,236 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:23,236 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:23,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:23,238 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:23,238 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:23,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:23,238 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:23,239 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:23,309 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:23,310 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:27:23,310 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:23,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:23,310 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:23,310 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:23,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable594 [2022-12-06 07:27:23,310 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-06 07:27:23,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:23,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1234778610, now seen corresponding path program 1 times [2022-12-06 07:27:23,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:23,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580552234] [2022-12-06 07:27:23,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:23,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:23,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:23,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-06 07:27:23,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:23,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580552234] [2022-12-06 07:27:23,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580552234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:23,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:23,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:23,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717032044] [2022-12-06 07:27:23,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:23,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:23,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:23,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:23,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:23,369 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:23,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:23,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:23,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:23,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:23,410 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:23,410 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:23,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:23,411 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:23,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:23,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:23,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:23,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:23,411 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:23,411 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:23,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:23,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:23,412 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:23,412 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:23,412 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:23,412 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:23,412 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:23,412 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:23,413 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:23,413 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:23,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:23,415 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:23,415 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:23,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:23,415 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:23,415 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:23,491 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:23,491 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:27:23,491 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:23,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:23,491 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:23,491 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:23,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable595 [2022-12-06 07:27:23,491 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-06 07:27:23,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:23,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1261560719, now seen corresponding path program 1 times [2022-12-06 07:27:23,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:23,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297651048] [2022-12-06 07:27:23,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:23,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:23,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-06 07:27:23,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:23,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297651048] [2022-12-06 07:27:23,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297651048] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:23,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:23,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:23,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779820981] [2022-12-06 07:27:23,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:23,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:23,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:23,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:23,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:23,551 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:23,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:23,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:23,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:23,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:23,586 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:23,587 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:23,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:23,587 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:23,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:23,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:23,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:23,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:23,589 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:23,589 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:23,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:23,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:23,589 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:23,589 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:23,590 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:23,590 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:23,590 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:23,590 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:23,590 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:23,590 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:23,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:23,594 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:23,594 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:23,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:23,594 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:23,594 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:23,674 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:23,675 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 07:27:23,675 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:23,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:23,675 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:23,675 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:23,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable596 [2022-12-06 07:27:23,675 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-06 07:27:23,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:23,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1292036912, now seen corresponding path program 1 times [2022-12-06 07:27:23,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:23,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440745259] [2022-12-06 07:27:23,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:23,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:23,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:23,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:23,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440745259] [2022-12-06 07:27:23,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440745259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:23,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:23,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:23,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820273371] [2022-12-06 07:27:23,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:23,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:23,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:23,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:23,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:23,740 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:23,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:23,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:23,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:23,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:23,776 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:23,776 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:23,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:23,777 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:23,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:23,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:23,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:23,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:23,777 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:23,777 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:23,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:23,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:23,778 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:23,778 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:23,778 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:23,778 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:23,778 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:23,778 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:23,778 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:23,778 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:23,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:23,781 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:23,781 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:23,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:23,781 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:23,781 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:23,851 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:23,852 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:27:23,852 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:23,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:23,852 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:23,852 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:23,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable597 [2022-12-06 07:27:23,852 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-06 07:27:23,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:23,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1318819021, now seen corresponding path program 1 times [2022-12-06 07:27:23,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:23,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443064830] [2022-12-06 07:27:23,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:23,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:23,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-06 07:27:23,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:23,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443064830] [2022-12-06 07:27:23,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443064830] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:23,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:23,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:23,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110417413] [2022-12-06 07:27:23,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:23,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:23,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:23,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:23,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:23,911 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:23,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:23,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:23,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:23,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:23,947 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:23,947 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:23,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:23,948 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:23,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:23,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:23,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:23,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:23,948 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:23,948 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:23,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:23,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:23,949 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:23,949 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:23,949 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:23,949 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:23,949 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:23,950 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:23,950 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:23,950 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:23,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:23,952 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:23,952 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:23,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:23,952 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:23,952 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:24,025 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:24,025 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:24,025 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:24,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:24,025 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:24,025 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:24,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable598 [2022-12-06 07:27:24,025 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-06 07:27:24,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:24,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1349295214, now seen corresponding path program 1 times [2022-12-06 07:27:24,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:24,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166014188] [2022-12-06 07:27:24,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:24,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:24,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-06 07:27:24,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:24,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166014188] [2022-12-06 07:27:24,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166014188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:24,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:24,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:24,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642019336] [2022-12-06 07:27:24,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:24,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:24,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:24,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:24,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:24,081 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:24,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:24,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:24,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:24,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:24,123 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:24,123 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:24,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:24,123 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:24,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:24,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:24,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:24,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:24,124 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:24,124 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:24,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:24,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:24,125 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:24,125 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:24,125 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:24,125 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:24,125 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:24,125 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:24,125 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:24,125 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:24,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:24,127 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:24,127 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:24,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:24,128 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:24,128 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:24,201 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:24,201 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:24,201 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:24,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:24,201 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:24,201 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:24,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable599 [2022-12-06 07:27:24,201 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-06 07:27:24,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:24,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1376077323, now seen corresponding path program 1 times [2022-12-06 07:27:24,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:24,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96416920] [2022-12-06 07:27:24,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:24,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27: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-06 07:27:24,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:24,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96416920] [2022-12-06 07:27:24,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96416920] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:24,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:24,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:24,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37584959] [2022-12-06 07:27:24,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:24,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:24,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:24,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:24,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:24,263 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:24,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:24,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:24,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:24,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:24,297 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:24,297 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:24,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:24,298 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:24,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:24,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:24,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:24,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:24,298 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:24,299 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:24,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:24,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:24,299 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:24,299 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:24,299 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:24,300 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:24,300 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:24,300 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:24,300 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:24,300 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:24,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:24,302 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:24,302 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:24,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:24,302 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:24,302 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:24,376 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:24,377 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:24,377 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:24,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:24,377 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:24,377 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:24,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable600 [2022-12-06 07:27:24,377 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-06 07:27:24,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:24,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1406553516, now seen corresponding path program 1 times [2022-12-06 07:27:24,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:24,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148622920] [2022-12-06 07:27:24,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:24,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:24,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-06 07:27:24,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:24,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148622920] [2022-12-06 07:27:24,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148622920] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:24,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:24,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:24,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992834768] [2022-12-06 07:27:24,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:24,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:24,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:24,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:24,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:24,439 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:24,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:24,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:24,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:24,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:24,476 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:24,476 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:24,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:24,476 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:24,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:24,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:24,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:24,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:24,477 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:24,477 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:24,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:24,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:24,477 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:24,478 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:24,478 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:24,478 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:24,478 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:24,478 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:24,478 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:24,478 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:24,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:24,480 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:24,480 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:24,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:24,481 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:24,481 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:24,555 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:24,555 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:24,555 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:24,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:24,556 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:24,556 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:24,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable601 [2022-12-06 07:27:24,556 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-06 07:27:24,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:24,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1433335625, now seen corresponding path program 1 times [2022-12-06 07:27:24,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:24,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087993249] [2022-12-06 07:27:24,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:24,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:24,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-06 07:27:24,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:24,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087993249] [2022-12-06 07:27:24,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087993249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:24,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:24,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:24,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117237004] [2022-12-06 07:27:24,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:24,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:24,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:24,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:24,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:24,625 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:24,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:24,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:24,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:24,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:24,661 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:24,661 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:24,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:24,661 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:24,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:24,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:24,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:24,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:24,662 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:24,662 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:24,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:24,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:24,663 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:24,663 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:24,663 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:24,663 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:24,663 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:24,663 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:24,663 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:24,663 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:24,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:24,665 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:24,666 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:24,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:24,666 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:24,666 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:24,739 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:24,739 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:24,739 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:24,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:24,740 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:24,740 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:24,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable602 [2022-12-06 07:27:24,740 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-06 07:27:24,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:24,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1463811818, now seen corresponding path program 1 times [2022-12-06 07:27:24,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:24,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284971548] [2022-12-06 07:27:24,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:24,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:24,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:24,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-06 07:27:24,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:24,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284971548] [2022-12-06 07:27:24,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284971548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:24,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:24,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:24,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809417070] [2022-12-06 07:27:24,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:24,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:24,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:24,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:24,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:24,797 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:24,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:24,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:24,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:24,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:24,833 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:24,833 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:24,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:24,833 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:24,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:24,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:24,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:24,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:24,834 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:24,834 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:24,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:24,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:24,835 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:24,835 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:24,835 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:24,835 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:24,835 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:24,835 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:24,835 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:24,835 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:24,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:24,837 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:24,838 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:24,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:24,838 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:24,838 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:24,910 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:24,910 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:24,911 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:24,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:24,911 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:24,911 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:24,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable603 [2022-12-06 07:27:24,911 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-06 07:27:24,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:24,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1490593927, now seen corresponding path program 1 times [2022-12-06 07:27:24,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:24,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120928374] [2022-12-06 07:27:24,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:24,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:24,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-06 07:27:24,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:24,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120928374] [2022-12-06 07:27:24,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120928374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:24,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:24,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:24,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335055076] [2022-12-06 07:27:24,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:24,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:24,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:24,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:24,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:24,970 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:24,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:24,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:24,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:24,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:25,006 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:25,006 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:25,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:25,007 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:25,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:25,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:25,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:25,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:25,007 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:25,007 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:25,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:25,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:25,008 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:25,008 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:25,008 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:25,008 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:25,008 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:25,009 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:25,009 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:25,009 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:25,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:25,011 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:25,011 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:25,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:25,011 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:25,011 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:25,085 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:25,085 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:25,085 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:25,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:25,085 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:25,086 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:25,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable604 [2022-12-06 07:27:25,086 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-06 07:27:25,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:25,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1521070120, now seen corresponding path program 1 times [2022-12-06 07:27:25,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:25,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898457532] [2022-12-06 07:27:25,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:25,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:25,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:25,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-06 07:27:25,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:25,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898457532] [2022-12-06 07:27:25,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898457532] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:25,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:25,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:25,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73645459] [2022-12-06 07:27:25,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:25,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:25,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:25,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:25,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:25,143 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:25,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:25,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:25,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:25,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:25,180 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:25,180 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:25,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:25,180 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:25,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:25,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:25,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:25,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:25,181 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:25,181 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:25,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:25,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:25,182 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:25,182 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:25,182 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:25,182 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:25,182 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:25,182 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:25,182 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:25,182 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:25,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:25,184 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:25,185 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:25,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:25,185 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:25,185 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:25,258 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:25,258 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:25,258 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:25,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:25,258 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:25,258 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:25,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable605 [2022-12-06 07:27:25,259 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-06 07:27:25,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:25,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1547852229, now seen corresponding path program 1 times [2022-12-06 07:27:25,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:25,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224348891] [2022-12-06 07:27:25,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:25,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:25,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-06 07:27:25,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:25,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224348891] [2022-12-06 07:27:25,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224348891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:25,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:25,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:25,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905553544] [2022-12-06 07:27:25,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:25,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:25,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:25,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:25,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:25,320 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:25,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:25,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:25,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:25,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:25,360 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:25,360 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:25,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:25,361 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:25,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:25,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:25,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:25,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:25,361 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:25,361 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:25,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:25,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:25,362 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:25,362 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:25,362 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:25,362 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:25,362 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:25,362 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:25,362 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:25,363 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:25,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:25,365 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:25,365 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:25,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:25,365 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:25,365 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:25,439 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:25,440 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:27:25,440 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:25,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:25,440 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:25,440 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:25,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable606 [2022-12-06 07:27:25,440 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-06 07:27:25,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:25,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1578328422, now seen corresponding path program 1 times [2022-12-06 07:27:25,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:25,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391733818] [2022-12-06 07:27:25,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:25,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:25,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-06 07:27:25,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:25,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391733818] [2022-12-06 07:27:25,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391733818] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:25,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:25,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:25,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690765030] [2022-12-06 07:27:25,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:25,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:25,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:25,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:25,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:25,503 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:25,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:25,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:25,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:25,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:25,545 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:25,546 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:25,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:25,546 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:25,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:25,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:25,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:25,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:25,547 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:25,547 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:25,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:25,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:25,547 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:25,547 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:25,548 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:25,548 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:25,548 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:25,548 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:25,548 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:25,548 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:25,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:25,550 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:25,550 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:25,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:25,551 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:25,551 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:25,622 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:25,623 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:25,623 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:25,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:25,623 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:25,623 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:25,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable607 [2022-12-06 07:27:25,623 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-06 07:27:25,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:25,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1605110531, now seen corresponding path program 1 times [2022-12-06 07:27:25,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:25,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786065305] [2022-12-06 07:27:25,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:25,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:25,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-06 07:27:25,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:25,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786065305] [2022-12-06 07:27:25,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786065305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:25,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:25,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:25,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934876643] [2022-12-06 07:27:25,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:25,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:25,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:25,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:25,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:25,685 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:25,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:25,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:25,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:25,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:25,720 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:25,720 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:25,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:25,720 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:25,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:25,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:25,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:25,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:25,721 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:25,721 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:25,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:25,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:25,722 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:25,722 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:25,722 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:25,722 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:25,722 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:25,722 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:25,722 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:25,722 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:25,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:25,724 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:25,725 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:25,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:25,725 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:25,725 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:25,797 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:25,797 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:25,797 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:25,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:25,797 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:25,798 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:25,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable608 [2022-12-06 07:27:25,798 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-06 07:27:25,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:25,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1635586724, now seen corresponding path program 1 times [2022-12-06 07:27:25,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:25,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436757093] [2022-12-06 07:27:25,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:25,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:25,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-06 07:27:25,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:25,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436757093] [2022-12-06 07:27:25,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436757093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:25,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:25,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:25,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922110368] [2022-12-06 07:27:25,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:25,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:25,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:25,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:25,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:25,858 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:25,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:25,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:25,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:25,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:25,895 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:25,895 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:25,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 352 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:25,895 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:25,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:25,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:25,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:25,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:25,896 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:25,896 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:25,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:25,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:25,896 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:25,897 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:25,897 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:25,897 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:25,897 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:25,897 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:25,897 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:25,897 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:25,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:25,899 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:25,899 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:25,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:25,900 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:25,900 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:25,971 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:25,972 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:25,972 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:25,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:25,972 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:25,972 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:25,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable609 [2022-12-06 07:27:25,972 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-06 07:27:25,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:25,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1662368833, now seen corresponding path program 1 times [2022-12-06 07:27:25,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:25,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922518196] [2022-12-06 07:27:25,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:25,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:25,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:26,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:26,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:26,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922518196] [2022-12-06 07:27:26,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922518196] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:26,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:26,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:26,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579062910] [2022-12-06 07:27:26,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:26,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:26,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:26,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:26,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:26,033 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:26,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:26,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:26,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:26,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:26,075 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:26,075 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:26,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:26,076 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:26,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:26,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:26,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:26,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:26,076 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:26,076 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:26,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:26,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:26,077 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:26,077 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:26,077 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:26,077 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:26,077 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:26,078 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:26,078 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:26,078 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:26,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:26,080 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:26,080 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:26,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:26,080 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:26,080 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:26,153 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:26,154 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:26,154 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:26,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:26,154 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:26,154 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:26,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable610 [2022-12-06 07:27:26,154 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-06 07:27:26,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:26,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1692845026, now seen corresponding path program 1 times [2022-12-06 07:27:26,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:26,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886636431] [2022-12-06 07:27:26,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:26,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:26,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-06 07:27:26,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:26,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886636431] [2022-12-06 07:27:26,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886636431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:26,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:26,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:26,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833804696] [2022-12-06 07:27:26,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:26,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:26,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:26,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:26,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:26,212 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:26,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:26,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:26,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:26,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:26,253 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:26,253 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:26,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 349 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:26,253 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:26,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:26,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:26,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:26,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:26,261 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:26,261 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:26,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:26,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:26,261 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:26,261 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:26,262 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:26,262 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:26,262 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:26,262 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:26,262 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:26,262 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:26,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:26,264 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:26,265 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:26,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:26,265 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:26,265 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:26,337 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:26,337 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:26,337 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:26,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:26,337 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:26,337 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:26,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable611 [2022-12-06 07:27:26,337 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-06 07:27:26,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:26,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1719627135, now seen corresponding path program 1 times [2022-12-06 07:27:26,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:26,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844552388] [2022-12-06 07:27:26,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:26,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:26,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-06 07:27:26,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:26,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844552388] [2022-12-06 07:27:26,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844552388] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:26,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:26,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:26,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623524020] [2022-12-06 07:27:26,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:26,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:26,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:26,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:26,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:26,394 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:26,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:26,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:26,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:26,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:26,432 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:26,432 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:26,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:26,432 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:26,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:26,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:26,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:26,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:26,433 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:26,433 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:26,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:26,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:26,434 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:26,434 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:26,434 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:26,434 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:26,434 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:26,434 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:26,434 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:26,435 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:26,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:26,437 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:26,437 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:26,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:26,437 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:26,437 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:26,508 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:26,508 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:27:26,508 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:26,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:26,509 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:26,509 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:26,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable612 [2022-12-06 07:27:26,509 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-06 07:27:26,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:26,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1750103328, now seen corresponding path program 1 times [2022-12-06 07:27:26,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:26,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138288457] [2022-12-06 07:27:26,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:26,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:26,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-06 07:27:26,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:26,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138288457] [2022-12-06 07:27:26,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138288457] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:26,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:26,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:26,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748994471] [2022-12-06 07:27:26,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:26,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:26,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:26,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:26,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:26,564 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:26,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:26,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:26,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:26,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:26,605 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:26,605 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:26,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:26,606 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:26,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:26,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:26,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:26,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:26,606 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:26,606 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:26,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:26,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:26,607 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:26,607 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:26,607 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:26,607 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:26,607 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:26,607 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:26,607 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:26,608 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:26,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:26,610 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:26,610 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:26,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:26,610 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:26,610 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:26,682 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:26,683 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:26,683 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:26,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:26,683 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:26,683 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:26,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable613 [2022-12-06 07:27:26,683 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-06 07:27:26,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:26,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1776885437, now seen corresponding path program 1 times [2022-12-06 07:27:26,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:26,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223553821] [2022-12-06 07:27:26,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:26,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:26,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-06 07:27:26,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:26,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223553821] [2022-12-06 07:27:26,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223553821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:26,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:26,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:26,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364248153] [2022-12-06 07:27:26,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:26,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:26,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:26,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:26,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:26,744 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:26,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:26,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:26,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:26,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:26,779 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:26,779 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:26,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:26,779 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:26,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:26,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:26,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:26,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:26,780 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:26,780 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:26,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:26,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:26,781 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:26,781 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:26,781 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:26,781 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:26,781 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:26,781 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:26,781 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:26,782 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:26,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:26,785 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:26,785 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:26,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:26,785 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:26,785 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:26,876 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:26,877 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:27:26,877 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:26,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:26,877 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:26,877 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:26,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable614 [2022-12-06 07:27:26,877 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-06 07:27:26,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:26,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1807361630, now seen corresponding path program 1 times [2022-12-06 07:27:26,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:26,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059108338] [2022-12-06 07:27:26,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:26,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:26,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:26,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-06 07:27:26,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:26,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059108338] [2022-12-06 07:27:26,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059108338] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:26,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:26,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:26,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312934631] [2022-12-06 07:27:26,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:26,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:26,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:26,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:26,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:26,952 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:26,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:26,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:26,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:26,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:27,009 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:27,009 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:27,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:27,010 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:27,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:27,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:27,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:27,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:27,011 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:27,011 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:27,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:27,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:27,012 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:27,012 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:27,012 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:27,012 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:27,012 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:27,012 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:27,013 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:27,013 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:27,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:27,016 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:27,016 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:27,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:27,016 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:27,016 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:27,101 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:27,101 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 07:27:27,101 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:27,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:27,101 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:27,102 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:27,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable615 [2022-12-06 07:27:27,102 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-06 07:27:27,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:27,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1834143739, now seen corresponding path program 1 times [2022-12-06 07:27:27,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:27,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830384304] [2022-12-06 07:27:27,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:27,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:27,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-06 07:27:27,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:27,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830384304] [2022-12-06 07:27:27,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830384304] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:27,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:27,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:27,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741318215] [2022-12-06 07:27:27,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:27,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:27,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:27,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:27,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:27,171 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:27,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:27,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:27,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:27,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:27,209 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:27,209 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:27,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:27,210 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:27,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:27,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:27,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:27,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:27,210 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:27,210 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:27,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:27,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:27,211 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:27,211 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:27,211 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:27,211 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:27,211 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:27,212 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:27,212 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:27,212 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:27,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:27,214 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:27,214 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:27,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:27,214 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:27,214 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:27,288 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:27,289 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:27:27,289 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:27,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:27,289 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:27,289 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:27,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable616 [2022-12-06 07:27:27,289 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-06 07:27:27,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:27,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1864619932, now seen corresponding path program 1 times [2022-12-06 07:27:27,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:27,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360803660] [2022-12-06 07:27:27,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:27,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:27,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-06 07:27:27,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:27,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360803660] [2022-12-06 07:27:27,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360803660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:27,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:27,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:27,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263249601] [2022-12-06 07:27:27,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:27,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:27,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:27,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:27,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:27,345 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:27,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:27,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:27,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:27,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:27,387 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:27,387 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:27,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:27,387 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:27,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:27,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:27,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:27,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:27,388 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:27,388 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:27,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:27,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:27,389 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:27,389 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:27,389 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:27,389 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:27,389 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:27,389 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:27,389 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:27,389 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:27,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:27,391 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:27,391 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:27,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:27,392 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:27,392 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:27,465 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:27,466 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:27,466 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:27,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:27,466 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:27,466 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:27,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable617 [2022-12-06 07:27:27,466 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-06 07:27:27,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:27,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1891402041, now seen corresponding path program 1 times [2022-12-06 07:27:27,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:27,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919409597] [2022-12-06 07:27:27,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:27,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:27,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:27,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-06 07:27:27,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:27,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919409597] [2022-12-06 07:27:27,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919409597] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:27,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:27,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:27,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719523575] [2022-12-06 07:27:27,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:27,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:27,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:27,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:27,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:27,525 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:27,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:27,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:27,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:27,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:27,560 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:27,560 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:27,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:27,561 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:27,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:27,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:27,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:27,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:27,561 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:27,561 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:27,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:27,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:27,562 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:27,562 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:27,562 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:27,562 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:27,562 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:27,562 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:27,563 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:27,563 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:27,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:27,565 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:27,565 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:27,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:27,565 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:27,565 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:27,637 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:27,637 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:27,637 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:27,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:27,638 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:27,638 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:27,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable618 [2022-12-06 07:27:27,638 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-06 07:27:27,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:27,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1921878234, now seen corresponding path program 1 times [2022-12-06 07:27:27,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:27,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455919569] [2022-12-06 07:27:27,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:27,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:27,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-06 07:27:27,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:27,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455919569] [2022-12-06 07:27:27,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455919569] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:27,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:27,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:27,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125591491] [2022-12-06 07:27:27,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:27,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:27,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:27,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:27,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:27,694 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:27,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:27,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:27,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:27,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:27,736 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:27,736 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:27,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:27,736 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:27,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:27,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:27,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:27,737 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:27,737 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:27,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:27,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:27,737 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:27,738 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:27,738 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:27,738 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:27,738 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:27,738 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:27,738 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:27,738 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:27,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:27,740 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:27,740 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:27,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:27,741 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:27,741 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:27,814 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:27,815 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:27,815 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:27,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:27,815 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:27,815 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:27,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable619 [2022-12-06 07:27:27,815 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-06 07:27:27,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:27,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1948660343, now seen corresponding path program 1 times [2022-12-06 07:27:27,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:27,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378208494] [2022-12-06 07:27:27,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:27,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:27,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-06 07:27:27,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:27,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378208494] [2022-12-06 07:27:27,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378208494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:27,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:27,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:27,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595302084] [2022-12-06 07:27:27,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:27,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:27,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:27,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:27,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:27,895 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:27,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:27,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:27,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:27,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:27,937 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:27,937 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:27,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:27,938 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:27,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:27,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:27,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:27,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:27,938 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:27,938 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:27,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:27,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:27,939 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:27,939 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:27,939 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:27,939 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:27,939 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:27,940 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:27,940 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:27,940 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:27,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:27,942 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:27,942 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:27,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:27,942 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:27,942 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:28,014 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:28,015 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:28,015 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:28,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:28,015 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:28,015 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:28,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable620 [2022-12-06 07:27:28,015 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-06 07:27:28,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:28,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1979136536, now seen corresponding path program 1 times [2022-12-06 07:27:28,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:28,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748460207] [2022-12-06 07:27:28,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:28,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:28,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-06 07:27:28,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:28,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748460207] [2022-12-06 07:27:28,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748460207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:28,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:28,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:28,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250143440] [2022-12-06 07:27:28,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:28,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:28,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:28,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:28,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:28,090 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:28,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:28,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:28,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:28,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:28,130 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:28,131 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:28,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:28,131 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:28,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:28,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:28,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:28,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:28,132 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:28,132 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:28,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:28,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:28,132 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:28,133 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:28,133 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:28,133 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:28,133 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:28,133 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:28,133 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:28,133 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:28,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:28,135 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:28,135 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:28,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:28,136 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:28,136 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:28,208 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:28,209 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:28,209 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:28,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:28,209 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:28,209 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:28,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable621 [2022-12-06 07:27:28,209 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-06 07:27:28,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:28,209 INFO L85 PathProgramCache]: Analyzing trace with hash 2005918645, now seen corresponding path program 1 times [2022-12-06 07:27:28,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:28,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090855613] [2022-12-06 07:27:28,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:28,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:28,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-06 07:27:28,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:28,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090855613] [2022-12-06 07:27:28,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090855613] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:28,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:28,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:28,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295185702] [2022-12-06 07:27:28,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:28,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:28,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:28,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:28,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:28,269 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:28,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:28,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:28,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:28,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:28,310 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:28,310 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:28,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:28,310 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:28,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:28,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:28,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:28,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:28,311 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:28,311 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:28,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:28,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:28,311 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:28,312 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:28,312 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:28,312 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:28,312 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:28,312 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:28,312 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:28,312 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:28,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:28,314 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:28,314 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:28,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:28,315 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:28,315 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:28,385 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:28,385 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 73 [2022-12-06 07:27:28,385 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:28,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:28,386 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:28,386 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:28,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable622 [2022-12-06 07:27:28,386 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-06 07:27:28,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:28,386 INFO L85 PathProgramCache]: Analyzing trace with hash 2036394838, now seen corresponding path program 1 times [2022-12-06 07:27:28,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:28,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952146822] [2022-12-06 07:27:28,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:28,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:28,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-06 07:27:28,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:28,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952146822] [2022-12-06 07:27:28,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952146822] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:28,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:28,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:28,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415939145] [2022-12-06 07:27:28,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:28,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:28,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:28,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:28,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:28,444 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:28,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:28,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:28,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:28,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:28,487 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:28,487 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:28,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:28,488 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:28,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:28,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:28,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:28,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:28,488 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:28,488 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:28,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:28,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:28,489 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:28,489 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:28,489 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:28,489 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:28,490 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:28,490 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:28,490 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:28,490 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:28,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:28,492 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:28,492 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:28,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:28,492 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:28,492 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:28,577 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:28,577 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 07:27:28,577 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:28,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:28,577 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:28,577 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:28,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable623 [2022-12-06 07:27:28,578 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-06 07:27:28,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:28,578 INFO L85 PathProgramCache]: Analyzing trace with hash 2063176947, now seen corresponding path program 1 times [2022-12-06 07:27:28,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:28,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430511417] [2022-12-06 07:27:28,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:28,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:28,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-06 07:27:28,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:28,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430511417] [2022-12-06 07:27:28,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430511417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:28,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:28,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:28,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079441930] [2022-12-06 07:27:28,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:28,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:28,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:28,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:28,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:28,645 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:28,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:28,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:28,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:28,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:28,696 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:28,697 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:28,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:28,697 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:28,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:28,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:28,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:28,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:28,698 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:28,698 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:28,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:28,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:28,698 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:28,698 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:28,699 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:28,699 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:28,699 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:28,699 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:28,699 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:28,699 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:28,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:28,701 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:28,701 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:28,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:28,702 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:28,702 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:28,775 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:28,775 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:28,775 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:28,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:28,775 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:28,775 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:28,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable624 [2022-12-06 07:27:28,775 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-06 07:27:28,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:28,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2093653140, now seen corresponding path program 1 times [2022-12-06 07:27:28,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:28,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340386558] [2022-12-06 07:27:28,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:28,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:28,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:28,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-06 07:27:28,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:28,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340386558] [2022-12-06 07:27:28,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340386558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:28,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:28,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:28,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115913794] [2022-12-06 07:27:28,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:28,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:28,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:28,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:28,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:28,846 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:28,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:28,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:28,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:28,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:28,888 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:28,888 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:28,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:28,888 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:28,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:28,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:28,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:28,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:28,889 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:28,889 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:28,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:28,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:28,890 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:28,890 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:28,890 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:28,890 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:28,890 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:28,890 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:28,890 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:28,890 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:28,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:28,892 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:28,892 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:28,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:28,893 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:28,893 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:28,965 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:28,965 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:28,965 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:28,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:28,965 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:28,965 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:28,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable625 [2022-12-06 07:27:28,965 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-06 07:27:28,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:28,966 INFO L85 PathProgramCache]: Analyzing trace with hash 2120435249, now seen corresponding path program 1 times [2022-12-06 07:27:28,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:28,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904586624] [2022-12-06 07:27:28,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:28,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:29,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:29,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:29,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904586624] [2022-12-06 07:27:29,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904586624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:29,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:29,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:29,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272640813] [2022-12-06 07:27:29,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:29,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:29,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:29,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:29,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:29,033 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:29,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:29,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:29,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:29,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:29,074 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:29,075 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:29,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:29,075 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:29,075 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:29,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:29,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:29,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:29,076 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:29,076 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:29,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:29,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:29,076 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:29,076 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:29,077 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:29,077 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:29,077 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:29,077 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:29,077 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:29,077 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:29,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:29,079 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:29,079 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:29,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:29,080 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:29,080 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:29,152 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:29,152 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:29,152 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:29,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:29,152 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:29,152 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:29,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable626 [2022-12-06 07:27:29,152 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-06 07:27:29,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:29,153 INFO L85 PathProgramCache]: Analyzing trace with hash -2144055854, now seen corresponding path program 1 times [2022-12-06 07:27:29,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:29,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050439495] [2022-12-06 07:27:29,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:29,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:29,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-06 07:27:29,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:29,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050439495] [2022-12-06 07:27:29,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050439495] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:29,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:29,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:29,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601332736] [2022-12-06 07:27:29,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:29,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:29,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:29,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:29,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:29,211 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:29,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:29,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:29,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:29,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:29,247 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:29,247 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:29,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:29,247 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:29,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:29,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:29,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:29,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:29,248 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:29,248 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:29,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:29,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:29,249 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:29,249 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:29,249 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:29,249 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:29,249 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:29,249 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:29,249 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:29,249 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:29,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:29,251 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:29,252 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:29,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:29,252 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:29,252 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:29,322 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:29,323 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:27:29,323 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:29,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:29,323 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:29,323 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:29,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable627 [2022-12-06 07:27:29,323 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-06 07:27:29,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:29,323 INFO L85 PathProgramCache]: Analyzing trace with hash -2117273745, now seen corresponding path program 1 times [2022-12-06 07:27:29,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:29,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613654195] [2022-12-06 07:27:29,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:29,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:29,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-06 07:27:29,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:29,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613654195] [2022-12-06 07:27:29,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613654195] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:29,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:29,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:29,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847722337] [2022-12-06 07:27:29,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:29,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:29,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:29,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:29,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:29,383 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:29,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:29,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:29,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:29,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:29,423 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:29,423 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:29,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:29,424 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:29,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:29,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:29,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:29,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:29,424 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:29,424 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:29,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:29,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:29,425 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:29,425 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:29,425 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:29,425 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:29,425 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:29,425 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:29,425 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:29,425 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:29,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:29,428 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:29,428 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:29,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:29,428 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:29,428 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:29,500 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:29,501 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:29,501 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:29,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:29,501 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:29,501 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:29,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable628 [2022-12-06 07:27:29,501 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-06 07:27:29,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:29,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2086797552, now seen corresponding path program 1 times [2022-12-06 07:27:29,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:29,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819617111] [2022-12-06 07:27:29,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:29,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:29,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:29,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:29,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819617111] [2022-12-06 07:27:29,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819617111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:29,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:29,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:29,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186295433] [2022-12-06 07:27:29,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:29,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:29,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:29,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:29,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:29,557 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:29,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:29,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:29,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:29,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:29,599 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:29,599 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:29,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:29,599 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:29,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:29,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:29,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:29,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:29,600 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:29,600 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:29,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:29,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:29,600 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:29,601 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:29,601 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:29,601 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:29,601 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:29,601 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:29,601 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:29,601 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:29,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:29,603 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:29,603 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:29,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:29,604 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:29,604 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:29,676 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:29,676 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:29,676 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:29,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:29,676 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:29,676 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:29,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable629 [2022-12-06 07:27:29,677 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-06 07:27:29,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:29,677 INFO L85 PathProgramCache]: Analyzing trace with hash -2060015443, now seen corresponding path program 1 times [2022-12-06 07:27:29,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:29,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392392548] [2022-12-06 07:27:29,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:29,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:29,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:29,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-06 07:27:29,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:29,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392392548] [2022-12-06 07:27:29,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392392548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:29,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:29,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:29,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414261079] [2022-12-06 07:27:29,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:29,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:29,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:29,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:29,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:29,739 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:29,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:29,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:29,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:29,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:29,781 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:29,781 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:29,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 378 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:29,781 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:29,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:29,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:29,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:29,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:29,782 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:29,782 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:29,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:29,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:29,783 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:29,783 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:29,783 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:29,783 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:29,783 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:29,783 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:29,783 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:29,783 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:29,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:29,786 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:29,786 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:29,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:29,786 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:29,786 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:29,867 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:29,867 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:27:29,868 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:29,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:29,868 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:29,868 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:29,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable630 [2022-12-06 07:27:29,868 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-06 07:27:29,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:29,868 INFO L85 PathProgramCache]: Analyzing trace with hash -2029539250, now seen corresponding path program 1 times [2022-12-06 07:27:29,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:29,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262684001] [2022-12-06 07:27:29,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:29,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:29,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-06 07:27:29,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:29,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262684001] [2022-12-06 07:27:29,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262684001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:29,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:29,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:29,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034887992] [2022-12-06 07:27:29,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:29,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:29,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:29,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:29,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:29,925 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:29,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:29,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:29,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:29,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:29,961 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:29,961 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:29,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:29,961 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:29,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:29,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:29,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:29,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:29,962 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:29,962 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:29,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:29,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:29,962 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:29,962 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:29,963 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:29,963 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:29,963 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:29,963 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:29,963 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:29,963 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:29,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:29,965 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:29,965 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:29,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:29,965 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:29,966 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:30,039 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:30,040 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:30,040 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:30,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:30,040 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:30,040 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:30,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable631 [2022-12-06 07:27:30,040 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-06 07:27:30,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:30,041 INFO L85 PathProgramCache]: Analyzing trace with hash -2002757141, now seen corresponding path program 1 times [2022-12-06 07:27:30,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:30,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502984506] [2022-12-06 07:27:30,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:30,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:30,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-06 07:27:30,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:30,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502984506] [2022-12-06 07:27:30,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502984506] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:30,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:30,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:30,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544054930] [2022-12-06 07:27:30,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:30,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:30,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:30,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:30,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:30,099 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:30,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:30,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:30,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:30,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:30,140 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:30,140 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:30,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:30,140 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:30,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:30,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:30,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:30,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:30,141 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:30,141 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:30,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:30,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:30,142 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:30,142 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:30,142 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:30,142 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:30,142 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:30,142 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:30,142 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:30,142 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:30,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:30,144 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:30,144 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:30,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:30,145 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:30,145 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:30,221 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:30,222 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:27:30,222 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:30,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:30,222 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:30,222 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:30,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable632 [2022-12-06 07:27:30,222 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-06 07:27:30,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:30,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1972280948, now seen corresponding path program 1 times [2022-12-06 07:27:30,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:30,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800228859] [2022-12-06 07:27:30,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:30,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:30,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-06 07:27:30,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:30,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800228859] [2022-12-06 07:27:30,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800228859] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:30,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:30,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:30,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664174606] [2022-12-06 07:27:30,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:30,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:30,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:30,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:30,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:30,280 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:30,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:30,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:30,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:30,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:30,321 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:30,321 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:30,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:30,322 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:30,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:30,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:30,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:30,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:30,322 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:30,322 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:30,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:30,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:30,323 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:30,323 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:30,323 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:30,323 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:30,323 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:30,323 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:30,324 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:30,324 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:30,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:30,326 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:30,326 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:30,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:30,326 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:30,326 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:30,397 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:30,397 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:27:30,398 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:30,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:30,398 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:30,398 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:30,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable633 [2022-12-06 07:27:30,398 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-06 07:27:30,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:30,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1945498839, now seen corresponding path program 1 times [2022-12-06 07:27:30,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:30,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874267205] [2022-12-06 07:27:30,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:30,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:30,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-06 07:27:30,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:30,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874267205] [2022-12-06 07:27:30,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874267205] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:30,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:30,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:30,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138743943] [2022-12-06 07:27:30,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:30,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:30,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:30,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:30,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:30,457 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:30,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:30,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:30,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:30,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:30,492 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:30,492 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:30,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:30,493 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:30,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:30,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:30,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:30,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:30,493 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:30,493 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:30,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:30,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:30,494 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:30,494 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:30,494 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:30,494 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:30,494 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:30,495 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:30,495 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:30,495 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:30,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:30,498 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:30,498 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:30,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:30,498 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:30,498 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:30,571 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:30,571 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:30,571 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:30,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:30,572 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:30,572 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:30,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable634 [2022-12-06 07:27:30,572 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-06 07:27:30,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:30,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1915022646, now seen corresponding path program 1 times [2022-12-06 07:27:30,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:30,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130175089] [2022-12-06 07:27:30,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:30,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:30,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-06 07:27:30,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:30,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130175089] [2022-12-06 07:27:30,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130175089] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:30,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:30,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:30,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592448836] [2022-12-06 07:27:30,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:30,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:30,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:30,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:30,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:30,629 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:30,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:30,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:30,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:30,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:30,673 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:30,673 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:30,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:30,673 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:30,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:30,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:30,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:30,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:30,674 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:30,674 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:30,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:30,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:30,675 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:30,675 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:30,675 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:30,675 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:30,675 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:30,675 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:30,675 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:30,675 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:30,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:30,677 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:30,677 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:30,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:30,678 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:30,678 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:30,750 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:30,751 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:30,751 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:30,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:30,751 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:30,751 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:30,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable635 [2022-12-06 07:27:30,751 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-06 07:27:30,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:30,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1888240537, now seen corresponding path program 1 times [2022-12-06 07:27:30,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:30,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285596073] [2022-12-06 07:27:30,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:30,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:30,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-06 07:27:30,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:30,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285596073] [2022-12-06 07:27:30,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285596073] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:30,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:30,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:30,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529718733] [2022-12-06 07:27:30,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:30,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:30,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:30,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:30,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:30,811 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:30,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:30,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:30,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:30,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:30,850 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:30,850 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:30,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:30,850 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:30,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:30,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:30,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:30,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:30,851 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:30,851 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:30,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:30,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:30,851 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:30,852 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:30,852 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:30,852 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:30,852 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:30,852 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:30,852 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:30,852 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:30,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:30,854 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:30,854 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:30,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:30,855 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:30,855 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:30,926 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:30,927 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:30,927 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:30,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:30,927 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:30,927 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:30,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable636 [2022-12-06 07:27:30,927 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-06 07:27:30,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:30,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1857764344, now seen corresponding path program 1 times [2022-12-06 07:27:30,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:30,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724437841] [2022-12-06 07:27:30,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:30,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:30,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-06 07:27:30,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:30,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724437841] [2022-12-06 07:27:30,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724437841] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:30,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:30,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:30,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410769204] [2022-12-06 07:27:30,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:30,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:30,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:30,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:30,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:30,993 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:30,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:30,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:30,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:30,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:31,030 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:31,030 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:31,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:31,030 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:31,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:31,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:31,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:31,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:31,031 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:31,031 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:31,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:31,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:31,032 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:31,032 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:31,032 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:31,032 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:31,032 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:31,032 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:31,032 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:31,033 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:31,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:31,035 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:31,035 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:31,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:31,035 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:31,035 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:31,108 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:31,109 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:31,109 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:31,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:31,109 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:31,109 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:31,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable637 [2022-12-06 07:27:31,109 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-06 07:27:31,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:31,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1830982235, now seen corresponding path program 1 times [2022-12-06 07:27:31,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:31,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450018891] [2022-12-06 07:27:31,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:31,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:31,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-06 07:27:31,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:31,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450018891] [2022-12-06 07:27:31,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450018891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:31,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:31,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:31,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800733596] [2022-12-06 07:27:31,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:31,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:31,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:31,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:31,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:31,184 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:31,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:31,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:31,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:31,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:31,218 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:31,218 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:31,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:31,218 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:31,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:31,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:31,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:31,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:31,219 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:31,219 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:31,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:31,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:31,220 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:31,220 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:31,220 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:31,220 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:31,220 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:31,220 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:31,220 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:31,222 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:31,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:31,225 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:31,225 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:31,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:31,225 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:31,226 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:31,298 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:31,299 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:27:31,299 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:31,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:31,299 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:31,299 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:31,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable638 [2022-12-06 07:27:31,299 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-06 07:27:31,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:31,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1800506042, now seen corresponding path program 1 times [2022-12-06 07:27:31,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:31,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331711973] [2022-12-06 07:27:31,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:31,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:31,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-06 07:27:31,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:31,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331711973] [2022-12-06 07:27:31,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331711973] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:31,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:31,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:31,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115947717] [2022-12-06 07:27:31,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:31,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:31,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:31,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:31,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:31,363 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:31,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:31,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:31,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:31,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:31,400 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:31,401 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:31,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:31,401 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:31,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:31,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:31,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:31,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:31,402 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:31,402 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:31,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:31,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:31,402 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:31,402 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:31,403 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:31,403 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:31,403 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:31,403 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:31,403 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:31,403 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:31,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:31,406 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:31,406 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:31,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:31,407 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:31,407 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:31,490 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:31,490 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 07:27:31,490 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:31,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:31,490 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:31,491 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:31,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable639 [2022-12-06 07:27:31,491 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-06 07:27:31,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:31,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1773723933, now seen corresponding path program 1 times [2022-12-06 07:27:31,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:31,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878033699] [2022-12-06 07:27:31,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:31,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:31,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-06 07:27:31,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:31,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878033699] [2022-12-06 07:27:31,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878033699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:31,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:31,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:31,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460071950] [2022-12-06 07:27:31,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:31,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:31,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:31,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:31,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:31,558 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:31,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:31,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:31,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:31,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:31,600 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:31,600 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:31,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:31,600 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:31,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:31,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:31,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:31,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:31,601 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:31,601 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:31,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:31,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:31,601 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:31,602 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:31,602 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:31,602 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:31,602 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:31,602 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:31,602 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:31,602 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:31,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:31,604 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:31,604 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:31,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:31,605 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:31,605 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:31,679 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:31,679 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:31,679 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:31,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:31,680 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:31,680 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:31,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable640 [2022-12-06 07:27:31,680 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-06 07:27:31,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:31,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1743247740, now seen corresponding path program 1 times [2022-12-06 07:27:31,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:31,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622423978] [2022-12-06 07:27:31,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:31,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:31,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:31,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-06 07:27:31,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:31,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622423978] [2022-12-06 07:27:31,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622423978] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:31,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:31,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:31,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524876681] [2022-12-06 07:27:31,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:31,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:31,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:31,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:31,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:31,741 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:31,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:31,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:31,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:31,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:31,777 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:31,778 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:31,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:31,778 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:31,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:31,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:31,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:31,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:31,779 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:31,779 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:31,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:31,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:31,779 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:31,780 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:31,780 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:31,780 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:31,780 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:31,780 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:31,780 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:31,780 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:31,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:31,782 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:31,782 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:31,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:31,783 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:31,783 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:31,855 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:31,856 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:31,856 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:31,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:31,856 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:31,856 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:31,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable641 [2022-12-06 07:27:31,856 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-06 07:27:31,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:31,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1716465631, now seen corresponding path program 1 times [2022-12-06 07:27:31,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:31,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293608989] [2022-12-06 07:27:31,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:31,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:31,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-06 07:27:31,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:31,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293608989] [2022-12-06 07:27:31,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293608989] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:31,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:31,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:31,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645082828] [2022-12-06 07:27:31,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:31,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:31,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:31,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:31,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:31,916 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:31,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:31,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:31,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:31,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:31,957 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:31,957 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:31,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:31,957 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:31,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:31,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:31,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:31,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:31,958 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:31,958 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:31,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:31,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:31,958 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:31,958 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:31,959 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:31,959 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:31,959 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:31,959 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:31,959 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:31,959 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:31,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:31,961 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:31,961 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:31,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:31,962 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:31,962 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:32,034 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:32,035 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:32,035 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:32,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:32,035 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:32,035 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:32,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable642 [2022-12-06 07:27:32,035 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-06 07:27:32,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:32,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1685989438, now seen corresponding path program 1 times [2022-12-06 07:27:32,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:32,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375454979] [2022-12-06 07:27:32,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:32,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27: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-06 07:27:32,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:32,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375454979] [2022-12-06 07:27:32,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375454979] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:32,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:32,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:32,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244724530] [2022-12-06 07:27:32,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:32,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:32,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:32,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:32,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:32,092 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:32,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:32,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:32,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:32,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:32,128 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:32,129 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:32,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:32,129 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:32,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:32,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:32,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:32,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:32,130 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:32,130 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:32,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:32,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:32,130 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:32,130 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:32,130 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:32,131 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:32,131 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:32,131 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:32,131 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:32,131 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:32,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:32,133 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:32,133 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:32,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:32,133 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:32,133 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:32,218 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:32,219 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 07:27:32,219 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:32,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:32,219 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:32,219 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:32,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable643 [2022-12-06 07:27:32,219 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-06 07:27:32,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:32,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1659207329, now seen corresponding path program 1 times [2022-12-06 07:27:32,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:32,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707952110] [2022-12-06 07:27:32,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:32,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:32,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-06 07:27:32,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:32,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707952110] [2022-12-06 07:27:32,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707952110] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:32,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:32,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:32,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758785062] [2022-12-06 07:27:32,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:32,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:32,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:32,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:32,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:32,281 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:32,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:32,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:32,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:32,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:32,321 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:32,321 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:32,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:32,321 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:32,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:32,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:32,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:32,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:32,322 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:32,322 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:32,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:32,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:32,323 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:32,323 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:32,323 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:32,323 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:32,323 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:32,323 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:32,323 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:32,323 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:32,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:32,326 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:32,326 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:32,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:32,326 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:32,327 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:32,400 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:32,400 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:32,400 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:32,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:32,400 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:32,400 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:32,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable644 [2022-12-06 07:27:32,400 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-06 07:27:32,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:32,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1628731136, now seen corresponding path program 1 times [2022-12-06 07:27:32,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:32,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38700442] [2022-12-06 07:27:32,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:32,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:32,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-06 07:27:32,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:32,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38700442] [2022-12-06 07:27:32,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38700442] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:32,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:32,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:32,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387212222] [2022-12-06 07:27:32,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:32,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:32,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:32,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:32,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:32,466 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:32,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:32,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:32,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:32,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:32,508 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:32,508 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:32,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:32,508 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:32,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:32,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:32,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:32,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:32,509 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:32,509 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:32,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:32,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:32,509 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:32,509 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:32,510 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:32,510 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:32,510 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:32,510 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:32,510 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:32,510 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:32,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:32,512 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:32,512 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:32,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:32,512 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:32,513 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:32,585 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:32,586 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:32,586 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:32,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:32,586 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:32,586 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:32,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable645 [2022-12-06 07:27:32,586 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-06 07:27:32,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:32,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1601949027, now seen corresponding path program 1 times [2022-12-06 07:27:32,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:32,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638293446] [2022-12-06 07:27:32,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:32,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:32,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-06 07:27:32,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:32,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638293446] [2022-12-06 07:27:32,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638293446] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:32,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:32,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:32,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746652106] [2022-12-06 07:27:32,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:32,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:32,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:32,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:32,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:32,647 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:32,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:32,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:32,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:32,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:32,683 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:32,683 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:32,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:32,683 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:32,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:32,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:32,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:32,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:32,684 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:32,684 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:32,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:32,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:32,685 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:32,685 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:32,685 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:32,685 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:32,685 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:32,685 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:32,685 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:32,685 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:32,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:32,688 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:32,688 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:32,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:32,688 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:32,688 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:32,761 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:32,762 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:32,762 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:32,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:32,762 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:32,762 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:32,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable646 [2022-12-06 07:27:32,762 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-06 07:27:32,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:32,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1571472834, now seen corresponding path program 1 times [2022-12-06 07:27:32,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:32,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291247905] [2022-12-06 07:27:32,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:32,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:32,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-06 07:27:32,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:32,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291247905] [2022-12-06 07:27:32,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291247905] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:32,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:32,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:32,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506544808] [2022-12-06 07:27:32,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:32,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:32,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:32,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:32,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:32,823 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:32,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:32,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:32,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:32,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:32,866 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:32,866 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:32,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:32,866 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:32,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:32,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:32,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:32,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:32,867 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:32,867 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:32,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:32,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:32,868 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:32,868 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:32,868 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:32,868 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:32,868 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:32,868 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:32,868 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:32,868 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:32,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:32,870 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:32,870 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:32,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:32,871 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:32,871 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:32,945 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:32,946 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:27:32,946 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:32,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:32,946 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:32,946 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:32,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable647 [2022-12-06 07:27:32,946 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-06 07:27:32,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:32,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1544690725, now seen corresponding path program 1 times [2022-12-06 07:27:32,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:32,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683588011] [2022-12-06 07:27:32,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:32,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:33,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-06 07:27:33,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:33,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683588011] [2022-12-06 07:27:33,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683588011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:33,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:33,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:33,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36822765] [2022-12-06 07:27:33,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:33,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:33,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:33,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:33,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:33,007 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:33,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:33,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:33,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:33,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:33,054 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:33,054 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:33,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 376 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:33,055 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:33,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:33,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:33,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:33,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:33,055 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:33,055 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:33,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:33,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:33,056 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:33,056 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:33,056 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:33,056 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:33,057 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:33,057 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:33,057 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:33,057 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:33,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:33,059 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:33,059 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:33,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:33,059 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:33,059 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:33,131 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:33,132 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:33,132 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:33,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:33,132 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:33,132 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:33,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable648 [2022-12-06 07:27:33,132 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-06 07:27:33,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:33,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1514214532, now seen corresponding path program 1 times [2022-12-06 07:27:33,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:33,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253259780] [2022-12-06 07:27:33,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:33,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:33,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-06 07:27:33,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:33,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253259780] [2022-12-06 07:27:33,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253259780] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:33,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:33,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:33,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728399122] [2022-12-06 07:27:33,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:33,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:33,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:33,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:33,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:33,198 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:33,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:33,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:33,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:33,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:33,241 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:33,241 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:33,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:33,242 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:33,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:33,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:33,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:33,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:33,242 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:33,242 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:33,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:33,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:33,243 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:33,243 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:33,243 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:33,243 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:33,243 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:33,243 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:33,243 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:33,244 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:33,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:33,246 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:33,246 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:33,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:33,246 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:33,246 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:33,327 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:33,328 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 07:27:33,328 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:33,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:33,328 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:33,328 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:33,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable649 [2022-12-06 07:27:33,328 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-06 07:27:33,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:33,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1487432423, now seen corresponding path program 1 times [2022-12-06 07:27:33,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:33,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164156768] [2022-12-06 07:27:33,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:33,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:33,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:33,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-06 07:27:33,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:33,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164156768] [2022-12-06 07:27:33,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164156768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:33,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:33,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:33,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766492766] [2022-12-06 07:27:33,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:33,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:33,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:33,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:33,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:33,393 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:33,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:33,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:33,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:33,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:33,432 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:33,432 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:33,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:33,433 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:33,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:33,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:33,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:33,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:33,433 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:33,433 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:33,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:33,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:33,434 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:33,434 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:33,434 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:33,434 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:33,434 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:33,434 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:33,434 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:33,434 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:33,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:33,437 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:33,437 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:33,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:33,437 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:33,437 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:33,510 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:33,510 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:33,511 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:33,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:33,511 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:33,511 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:33,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable650 [2022-12-06 07:27:33,511 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-06 07:27:33,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:33,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1456956230, now seen corresponding path program 1 times [2022-12-06 07:27:33,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:33,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557463507] [2022-12-06 07:27:33,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:33,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:33,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-06 07:27:33,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:33,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557463507] [2022-12-06 07:27:33,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557463507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:33,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:33,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:33,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896503122] [2022-12-06 07:27:33,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:33,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:33,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:33,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:33,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:33,581 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:33,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:33,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:33,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:33,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:33,617 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:33,617 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:33,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:33,617 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:33,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:33,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:33,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:33,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:33,618 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:33,618 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:33,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:33,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:33,619 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:33,619 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:33,619 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:33,619 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:33,619 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:33,619 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:33,619 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:33,619 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:33,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:33,622 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:33,623 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:33,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:33,623 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:33,623 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:33,696 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:33,697 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:27:33,697 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:33,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:33,697 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:33,697 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:33,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable651 [2022-12-06 07:27:33,697 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-06 07:27:33,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:33,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1430174121, now seen corresponding path program 1 times [2022-12-06 07:27:33,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:33,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712355982] [2022-12-06 07:27:33,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:33,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:33,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-06 07:27:33,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:33,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712355982] [2022-12-06 07:27:33,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712355982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:33,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:33,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:33,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095769908] [2022-12-06 07:27:33,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:33,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:33,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:33,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:33,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:33,758 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:33,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:33,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:33,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:33,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:33,795 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:33,795 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:33,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:33,796 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:33,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:33,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:33,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:33,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:33,796 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:33,796 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:33,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:33,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:33,797 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:33,797 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:33,797 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:33,798 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:33,798 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:33,798 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:33,798 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:33,798 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:33,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:33,801 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:33,801 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:33,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:33,801 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:33,802 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:33,876 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:33,876 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:27:33,877 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:33,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:33,877 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:33,877 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:33,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable652 [2022-12-06 07:27:33,877 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-06 07:27:33,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:33,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1399697928, now seen corresponding path program 1 times [2022-12-06 07:27:33,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:33,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987210166] [2022-12-06 07:27:33,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:33,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:33,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-06 07:27:33,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:33,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987210166] [2022-12-06 07:27:33,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987210166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:33,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:33,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:33,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519864926] [2022-12-06 07:27:33,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:33,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:33,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:33,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:33,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:33,935 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:33,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:33,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:33,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:33,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:33,977 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:33,977 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:33,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:33,978 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:33,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:33,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:33,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:33,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:33,978 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:33,978 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:33,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:33,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:33,979 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:33,979 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:33,979 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:33,979 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:33,980 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:33,980 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:33,980 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:33,980 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:33,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:33,982 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:33,982 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:33,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:33,982 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:33,982 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:34,057 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:34,057 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:27:34,057 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:34,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:34,058 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:34,058 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:34,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable653 [2022-12-06 07:27:34,058 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-06 07:27:34,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:34,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1372915819, now seen corresponding path program 1 times [2022-12-06 07:27:34,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:34,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737102800] [2022-12-06 07:27:34,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:34,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:34,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-06 07:27:34,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:34,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737102800] [2022-12-06 07:27:34,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737102800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:34,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:34,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:34,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855028406] [2022-12-06 07:27:34,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:34,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:34,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:34,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:34,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:34,125 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:34,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:34,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:34,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:34,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:34,160 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:34,160 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:34,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 372 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:34,160 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:34,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:34,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:34,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:34,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:34,161 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:34,161 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:34,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:34,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:34,161 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:34,161 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:34,162 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:34,162 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:34,162 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:34,162 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:34,162 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:34,162 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:34,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:34,164 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:34,164 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:34,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:34,165 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:34,165 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:34,237 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:34,238 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:34,238 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:34,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:34,238 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:34,238 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:34,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable654 [2022-12-06 07:27:34,238 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-06 07:27:34,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:34,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1342439626, now seen corresponding path program 1 times [2022-12-06 07:27:34,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:34,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686360062] [2022-12-06 07:27:34,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:34,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:34,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:34,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-06 07:27:34,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:34,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686360062] [2022-12-06 07:27:34,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686360062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:34,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:34,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:34,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549638416] [2022-12-06 07:27:34,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:34,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:34,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:34,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:34,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:34,295 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:34,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:34,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:34,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:34,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:34,331 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:34,332 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:34,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:34,332 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:34,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:34,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:34,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:34,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:34,333 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:34,333 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:34,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:34,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:34,333 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:34,333 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:34,333 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:34,334 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:34,334 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:34,334 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:34,334 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:34,334 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:34,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:34,336 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:34,336 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:34,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:34,336 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:34,336 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:34,408 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:34,409 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:34,409 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:34,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:34,409 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:34,409 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:34,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable655 [2022-12-06 07:27:34,409 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-06 07:27:34,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:34,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1315657517, now seen corresponding path program 1 times [2022-12-06 07:27:34,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:34,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612757983] [2022-12-06 07:27:34,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:34,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:34,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-06 07:27:34,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:34,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612757983] [2022-12-06 07:27:34,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612757983] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:34,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:34,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:34,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830187280] [2022-12-06 07:27:34,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:34,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:34,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:34,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:34,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:34,472 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:34,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:34,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:34,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:34,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:34,508 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:34,508 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:34,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:34,508 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:34,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:34,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:34,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:34,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:34,509 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:34,509 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:34,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:34,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:34,510 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:34,510 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:34,510 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:34,510 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:34,510 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:34,510 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:34,510 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:34,510 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:34,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:34,513 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:34,513 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:34,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:34,513 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:34,513 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:34,585 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:34,586 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:34,586 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:34,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:34,586 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:34,586 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:34,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable656 [2022-12-06 07:27:34,586 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-06 07:27:34,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:34,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1285181324, now seen corresponding path program 1 times [2022-12-06 07:27:34,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:34,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27171648] [2022-12-06 07:27:34,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:34,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:34,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:34,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-06 07:27:34,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:34,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27171648] [2022-12-06 07:27:34,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27171648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:34,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:34,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:34,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731971378] [2022-12-06 07:27:34,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:34,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:34,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:34,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:34,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:34,645 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:34,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:34,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:34,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:34,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:34,680 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:34,681 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:34,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:34,681 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:34,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:34,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:34,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:34,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:34,682 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:34,682 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:34,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:34,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:34,682 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:34,682 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:34,683 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:34,683 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:34,683 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:34,683 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:34,683 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:34,683 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:34,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:34,685 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:34,685 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:34,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:34,685 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:34,685 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:34,759 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:34,759 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:34,759 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:34,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:34,759 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:34,759 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:34,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable657 [2022-12-06 07:27:34,759 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-06 07:27:34,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:34,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1258399215, now seen corresponding path program 1 times [2022-12-06 07:27:34,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:34,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243748067] [2022-12-06 07:27:34,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:34,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:34,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:34,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-06 07:27:34,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:34,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243748067] [2022-12-06 07:27:34,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243748067] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:34,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:34,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:34,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523999960] [2022-12-06 07:27:34,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:34,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:34,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:34,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:34,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:34,826 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:34,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:34,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:34,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:34,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:34,867 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:34,867 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:34,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:34,867 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:34,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:34,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:34,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:34,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:34,868 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:34,868 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:34,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:34,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:34,869 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:34,869 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:34,869 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:34,869 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:34,869 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:34,869 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:34,869 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:34,869 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:34,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:34,871 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:34,871 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:34,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:34,872 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:34,872 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:34,944 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:34,945 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:34,945 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:34,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:34,945 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:34,945 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:34,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable658 [2022-12-06 07:27:34,945 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-06 07:27:34,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:34,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1227923022, now seen corresponding path program 1 times [2022-12-06 07:27:34,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:34,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708081109] [2022-12-06 07:27:34,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:34,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:34,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:35,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-06 07:27:35,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:35,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708081109] [2022-12-06 07:27:35,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708081109] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:35,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:35,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:35,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883479204] [2022-12-06 07:27:35,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:35,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:35,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:35,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:35,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:35,012 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:35,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:35,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:35,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:35,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:35,047 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:35,047 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:35,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:35,048 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:35,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:35,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:35,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:35,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:35,048 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:35,048 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:35,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:35,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:35,049 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:35,049 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:35,049 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:35,049 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:35,049 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:35,050 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:35,050 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:35,050 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:35,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:35,052 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:35,052 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:35,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 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 116. Up to 16 conditions per place. [2022-12-06 07:27:35,052 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:35,052 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:35,125 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:35,126 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:35,126 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:35,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:35,126 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:35,126 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:35,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable659 [2022-12-06 07:27:35,126 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-06 07:27:35,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:35,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1201140913, now seen corresponding path program 1 times [2022-12-06 07:27:35,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:35,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873936529] [2022-12-06 07:27:35,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:35,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:35,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-06 07:27:35,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:35,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873936529] [2022-12-06 07:27:35,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873936529] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:35,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:35,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:35,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878266723] [2022-12-06 07:27:35,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:35,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:35,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:35,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:35,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:35,187 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:35,187 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:35,187 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:35,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:35,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:35,228 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:35,228 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:35,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:35,229 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:35,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:35,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:35,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:35,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:35,229 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:35,229 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:35,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:35,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:35,230 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:35,230 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:35,230 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:35,230 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:35,230 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:35,231 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:35,231 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:35,231 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:35,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:35,233 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:35,233 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:35,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:35,233 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:35,233 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:35,324 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:35,325 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 07:27:35,325 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:35,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:35,325 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:35,325 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:35,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable660 [2022-12-06 07:27:35,325 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-06 07:27:35,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:35,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1170664720, now seen corresponding path program 1 times [2022-12-06 07:27:35,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:35,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694193648] [2022-12-06 07:27:35,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:35,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:35,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-06 07:27:35,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:35,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694193648] [2022-12-06 07:27:35,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694193648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:35,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:35,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:35,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968487952] [2022-12-06 07:27:35,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:35,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:35,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:35,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:35,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:35,404 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:35,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:35,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:35,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:35,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:35,448 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:35,448 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:35,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:35,448 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:35,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:35,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:35,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:35,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:35,449 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:35,449 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:35,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:35,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:35,449 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:35,450 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:35,450 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:35,450 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:35,450 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:35,450 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:35,450 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:35,450 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:35,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:35,452 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:35,452 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:35,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:35,453 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:35,453 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:35,526 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:35,527 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:35,527 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:35,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:35,527 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:35,527 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:35,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable661 [2022-12-06 07:27:35,527 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-06 07:27:35,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:35,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1143882611, now seen corresponding path program 1 times [2022-12-06 07:27:35,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:35,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446068658] [2022-12-06 07:27:35,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:35,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:35,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-06 07:27:35,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:35,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446068658] [2022-12-06 07:27:35,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446068658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:35,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:35,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:35,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731803863] [2022-12-06 07:27:35,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:35,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:35,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:35,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:35,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:35,588 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:35,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:35,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:35,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:35,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:35,629 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:35,629 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:35,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:35,629 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:35,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:35,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:35,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:35,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:35,630 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:35,630 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:35,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:35,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:35,631 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:35,631 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:35,632 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:35,632 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:35,632 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:35,632 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:35,632 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:35,632 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:35,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:35,635 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:35,636 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:35,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:35,636 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:35,636 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:35,729 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:35,729 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 07:27:35,729 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:35,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:35,730 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:35,730 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:35,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable662 [2022-12-06 07:27:35,730 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-06 07:27:35,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:35,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1113406418, now seen corresponding path program 1 times [2022-12-06 07:27:35,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:35,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981901412] [2022-12-06 07:27:35,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:35,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:35,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:35,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-06 07:27:35,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:35,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981901412] [2022-12-06 07:27:35,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981901412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:35,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:35,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:35,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256064088] [2022-12-06 07:27:35,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:35,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:35,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:35,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:35,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:35,804 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:35,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:35,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:35,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:35,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:35,839 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:35,840 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:35,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:35,840 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:35,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:35,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:35,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:35,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:35,840 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:35,841 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:35,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:35,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:35,841 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:35,841 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:35,841 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:35,842 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:35,842 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:35,842 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:35,842 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:35,842 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:35,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:35,845 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:35,845 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:35,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:35,845 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:35,845 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:35,927 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:35,928 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-06 07:27:35,928 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:35,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:35,928 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:35,928 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:35,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable663 [2022-12-06 07:27:35,929 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-06 07:27:35,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:35,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1086624309, now seen corresponding path program 1 times [2022-12-06 07:27:35,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:35,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466748590] [2022-12-06 07:27:35,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:35,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:35,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:36,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-06 07:27:36,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:36,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466748590] [2022-12-06 07:27:36,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466748590] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:36,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:36,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:36,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485798282] [2022-12-06 07:27:36,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:36,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:36,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:36,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:36,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:36,008 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:36,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:36,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:36,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:36,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:36,045 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:36,045 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:36,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:36,045 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:36,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:36,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:36,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:36,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:36,046 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:36,046 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:36,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:36,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:36,046 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:36,047 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:36,047 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:36,047 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:36,047 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:36,047 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:36,047 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:36,047 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:36,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:36,049 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:36,049 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:36,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:36,050 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:36,050 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:36,131 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:36,132 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 07:27:36,132 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:36,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:36,132 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:36,132 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:36,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable664 [2022-12-06 07:27:36,132 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-06 07:27:36,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:36,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1056148116, now seen corresponding path program 1 times [2022-12-06 07:27:36,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:36,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216168589] [2022-12-06 07:27:36,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:36,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:36,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-06 07:27:36,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:36,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216168589] [2022-12-06 07:27:36,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216168589] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:36,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:36,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:36,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695268512] [2022-12-06 07:27:36,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:36,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:36,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:36,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:36,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:36,190 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:36,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:36,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:36,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:36,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:36,231 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:36,231 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:36,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:36,231 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:36,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:36,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:36,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:36,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:36,232 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:36,232 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:36,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:36,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:36,233 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:36,233 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:36,233 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:36,233 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:36,233 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:36,233 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:36,233 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:36,233 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:36,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:36,236 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:36,236 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:36,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:36,236 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:36,236 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:36,318 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:36,318 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 07:27:36,318 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:36,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:36,318 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:36,318 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:36,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable665 [2022-12-06 07:27:36,319 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-06 07:27:36,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:36,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1029366007, now seen corresponding path program 1 times [2022-12-06 07:27:36,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:36,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575838695] [2022-12-06 07:27:36,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:36,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:36,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:36,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-06 07:27:36,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:36,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575838695] [2022-12-06 07:27:36,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575838695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:36,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:36,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:36,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401966128] [2022-12-06 07:27:36,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:36,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:36,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:36,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:36,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:36,381 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:36,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:36,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:36,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:36,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:36,422 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:36,422 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:36,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:36,422 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:36,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:36,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:36,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:36,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:36,423 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:36,423 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:36,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:36,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:36,424 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:36,424 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:36,424 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:36,424 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:36,424 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:36,424 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:36,424 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:36,424 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:36,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:36,426 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:36,426 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:36,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:36,427 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:36,427 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:36,500 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:36,500 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:36,500 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:36,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:36,500 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:36,501 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:36,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable666 [2022-12-06 07:27:36,501 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-06 07:27:36,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:36,501 INFO L85 PathProgramCache]: Analyzing trace with hash -998889814, now seen corresponding path program 1 times [2022-12-06 07:27:36,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:36,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614026825] [2022-12-06 07:27:36,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:36,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:36,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-06 07:27:36,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:36,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614026825] [2022-12-06 07:27:36,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614026825] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:36,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:36,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:36,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513219083] [2022-12-06 07:27:36,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:36,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:36,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:36,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:36,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:36,560 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:36,560 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:36,560 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:36,560 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:36,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:36,601 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:36,601 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:36,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:36,601 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:36,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:36,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:36,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:36,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:36,602 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:36,602 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:36,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:36,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:36,603 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:36,603 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:36,603 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:36,603 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:36,603 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:36,603 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:36,603 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:36,603 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:36,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:36,605 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:36,606 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:36,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:36,606 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:36,606 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:36,678 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:36,679 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:36,679 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:36,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:36,679 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:36,679 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:36,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable667 [2022-12-06 07:27:36,679 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-06 07:27:36,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:36,679 INFO L85 PathProgramCache]: Analyzing trace with hash -972107705, now seen corresponding path program 1 times [2022-12-06 07:27:36,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:36,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881291418] [2022-12-06 07:27:36,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:36,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:36,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-06 07:27:36,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:36,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881291418] [2022-12-06 07:27:36,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881291418] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:36,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:36,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:36,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171644623] [2022-12-06 07:27:36,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:36,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:36,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:36,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:36,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:36,761 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:36,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:36,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:36,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:36,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:36,802 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:36,802 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:36,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:36,803 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:36,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:36,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:36,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:36,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:36,803 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:36,803 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:36,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:36,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:36,804 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:36,804 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:36,805 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:36,805 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:36,805 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:36,805 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:36,805 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:36,805 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:36,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:36,808 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:36,808 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:36,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:36,809 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:36,809 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:36,902 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:36,903 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 07:27:36,903 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:36,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:36,903 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:36,903 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:36,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable668 [2022-12-06 07:27:36,903 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-06 07:27:36,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:36,904 INFO L85 PathProgramCache]: Analyzing trace with hash -941631512, now seen corresponding path program 1 times [2022-12-06 07:27:36,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:36,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776109057] [2022-12-06 07:27:36,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:36,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:36,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-06 07:27:36,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:36,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776109057] [2022-12-06 07:27:36,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776109057] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:36,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:36,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:36,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418826807] [2022-12-06 07:27:36,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:36,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:36,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:36,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:36,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:36,977 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:36,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:36,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:36,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:36,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:37,026 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:37,026 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:37,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:37,026 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:37,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:37,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:37,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:37,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:37,027 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:37,027 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:37,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:37,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:37,028 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:37,028 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:37,028 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:37,028 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:37,028 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:37,029 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:37,029 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:37,029 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:37,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:37,032 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:37,032 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:37,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:37,032 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:37,032 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:37,119 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:37,120 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-06 07:27:37,120 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:37,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:37,120 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:37,120 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:37,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable669 [2022-12-06 07:27:37,120 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-06 07:27:37,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:37,121 INFO L85 PathProgramCache]: Analyzing trace with hash -914849403, now seen corresponding path program 1 times [2022-12-06 07:27:37,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:37,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51437212] [2022-12-06 07:27:37,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:37,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:37,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:37,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-06 07:27:37,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:37,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51437212] [2022-12-06 07:27:37,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51437212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:37,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:37,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:37,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083864599] [2022-12-06 07:27:37,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:37,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:37,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:37,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:37,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:37,196 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:37,196 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:37,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:37,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:37,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:37,236 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:37,237 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:37,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:37,237 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:37,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:37,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:37,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:37,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:37,238 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:37,238 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:37,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:37,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:37,239 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:37,239 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:37,240 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:37,240 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:37,240 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:37,240 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:37,240 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:37,240 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:37,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:37,243 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:37,243 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:37,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:37,244 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:37,244 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:37,331 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:37,332 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-06 07:27:37,332 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:37,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:37,332 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:37,332 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:37,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable670 [2022-12-06 07:27:37,332 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-06 07:27:37,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:37,332 INFO L85 PathProgramCache]: Analyzing trace with hash -884373210, now seen corresponding path program 1 times [2022-12-06 07:27:37,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:37,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796920683] [2022-12-06 07:27:37,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:37,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:37,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-06 07:27:37,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:37,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796920683] [2022-12-06 07:27:37,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796920683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:37,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:37,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:37,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34760948] [2022-12-06 07:27:37,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:37,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:37,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:37,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:37,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:37,405 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:37,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:37,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:37,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:37,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:37,452 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:37,452 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:37,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:37,453 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:37,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:37,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:37,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:37,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:37,453 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:37,453 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:37,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:37,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:37,454 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:37,454 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:37,454 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:37,454 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:37,454 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:37,454 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:37,454 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:37,455 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:37,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:37,457 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:37,457 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:37,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:37,457 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:37,457 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:37,530 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:37,531 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:37,531 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:37,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:37,531 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:37,531 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:37,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable671 [2022-12-06 07:27:37,531 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-06 07:27:37,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:37,532 INFO L85 PathProgramCache]: Analyzing trace with hash -857591101, now seen corresponding path program 1 times [2022-12-06 07:27:37,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:37,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71218164] [2022-12-06 07:27:37,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:37,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:37,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-06 07:27:37,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:37,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71218164] [2022-12-06 07:27:37,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71218164] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:37,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:37,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:37,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135787548] [2022-12-06 07:27:37,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:37,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:37,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:37,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:37,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:37,591 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:37,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:37,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:37,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:37,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:37,632 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:37,632 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:37,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:37,632 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:37,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:37,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:37,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:37,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:37,633 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:37,633 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:37,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:37,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:37,634 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:37,634 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:37,634 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:37,634 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:37,634 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:37,634 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:37,634 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:37,634 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:37,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:37,636 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:37,636 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:37,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:37,637 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:37,637 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:37,708 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:37,709 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:37,709 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:37,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:37,709 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:37,709 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:37,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable672 [2022-12-06 07:27:37,709 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-06 07:27:37,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:37,709 INFO L85 PathProgramCache]: Analyzing trace with hash -827114908, now seen corresponding path program 1 times [2022-12-06 07:27:37,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:37,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050594438] [2022-12-06 07:27:37,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:37,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:37,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-06 07:27:37,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:37,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050594438] [2022-12-06 07:27:37,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050594438] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:37,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:37,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:37,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521204228] [2022-12-06 07:27:37,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:37,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:37,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:37,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:37,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:37,776 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:37,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:37,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:37,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:37,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:37,811 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:37,811 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:37,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:37,812 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:37,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:37,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:37,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:37,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:37,812 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:37,812 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:37,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:37,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:37,813 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:37,813 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:37,813 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:37,813 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:37,813 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:37,813 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:37,813 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:37,813 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:37,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:37,816 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:37,816 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:37,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:37,816 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:37,816 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:37,888 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:37,889 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:37,889 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:37,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:37,889 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:37,889 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:37,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable673 [2022-12-06 07:27:37,889 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-06 07:27:37,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:37,890 INFO L85 PathProgramCache]: Analyzing trace with hash -800332799, now seen corresponding path program 1 times [2022-12-06 07:27:37,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:37,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883518816] [2022-12-06 07:27:37,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:37,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:37,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-06 07:27:37,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:37,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883518816] [2022-12-06 07:27:37,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883518816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:37,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:37,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:37,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800286101] [2022-12-06 07:27:37,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:37,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:37,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:37,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:37,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:37,949 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:37,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:37,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:37,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:37,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:37,990 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:37,990 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:37,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:37,990 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:37,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:37,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:37,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:37,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:37,991 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:37,991 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:37,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:37,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:37,992 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:37,992 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:37,992 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:37,992 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:37,992 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:37,992 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:37,992 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:37,992 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:37,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:37,994 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:37,994 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:37,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:37,995 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:37,995 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:38,068 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:38,068 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:38,068 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:38,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:38,068 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:38,068 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:38,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable674 [2022-12-06 07:27:38,068 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-06 07:27:38,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:38,069 INFO L85 PathProgramCache]: Analyzing trace with hash -769856606, now seen corresponding path program 1 times [2022-12-06 07:27:38,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:38,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280219830] [2022-12-06 07:27:38,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:38,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:38,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-06 07:27:38,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:38,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280219830] [2022-12-06 07:27:38,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280219830] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:38,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:38,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:38,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123034744] [2022-12-06 07:27:38,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:38,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:38,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:38,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:38,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:38,127 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:38,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:38,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:38,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:38,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:38,185 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:38,185 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:38,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:38,186 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:38,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:38,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:38,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:38,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:38,186 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:38,186 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:38,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:38,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:38,187 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:38,187 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:38,187 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:38,187 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:38,187 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:38,187 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:38,187 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:38,188 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:38,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:38,190 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:38,190 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:38,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:38,190 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:38,190 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:38,269 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:38,270 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 07:27:38,270 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:38,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:38,270 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:38,270 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:38,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable675 [2022-12-06 07:27:38,270 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-06 07:27:38,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:38,270 INFO L85 PathProgramCache]: Analyzing trace with hash -743074497, now seen corresponding path program 1 times [2022-12-06 07:27:38,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:38,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777689579] [2022-12-06 07:27:38,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:38,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:38,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-06 07:27:38,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:38,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777689579] [2022-12-06 07:27:38,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777689579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:38,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:38,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:38,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175404892] [2022-12-06 07:27:38,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:38,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:38,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:38,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:38,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:38,331 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:38,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:38,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:38,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:38,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:38,364 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:38,364 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:38,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:38,365 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:38,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:38,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:38,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:38,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:38,365 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:38,365 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:38,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:38,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:38,366 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:38,366 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:38,366 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:38,366 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:38,366 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:38,367 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:38,367 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:38,367 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:38,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:38,369 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:38,369 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:38,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:38,369 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:38,369 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:38,444 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:38,445 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:27:38,445 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:38,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:38,445 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:38,445 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:38,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable676 [2022-12-06 07:27:38,445 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-06 07:27:38,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:38,445 INFO L85 PathProgramCache]: Analyzing trace with hash -712598304, now seen corresponding path program 1 times [2022-12-06 07:27:38,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:38,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957825654] [2022-12-06 07:27:38,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:38,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:38,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-06 07:27:38,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:38,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957825654] [2022-12-06 07:27:38,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957825654] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:38,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:38,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:38,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776099249] [2022-12-06 07:27:38,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:38,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:38,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:38,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:38,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:38,502 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:38,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:38,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:38,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:38,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:38,544 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:38,544 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:38,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:38,544 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:38,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:38,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:38,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:38,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:38,545 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:38,545 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:38,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:38,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:38,546 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:38,546 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:38,546 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:38,546 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:38,546 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:38,546 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:38,546 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:38,546 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:38,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:38,548 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:38,548 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:38,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:38,549 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:38,549 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:38,634 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:38,634 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 07:27:38,634 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:38,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:38,635 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:38,635 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:38,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable677 [2022-12-06 07:27:38,635 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-06 07:27:38,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:38,635 INFO L85 PathProgramCache]: Analyzing trace with hash -685816195, now seen corresponding path program 1 times [2022-12-06 07:27:38,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:38,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982283635] [2022-12-06 07:27:38,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:38,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:38,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:38,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-06 07:27:38,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:38,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982283635] [2022-12-06 07:27:38,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982283635] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:38,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:38,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:38,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625989185] [2022-12-06 07:27:38,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:38,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:38,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:38,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:38,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:38,706 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:38,706 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:38,706 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:38,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:38,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:38,747 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:38,747 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:38,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 372 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:38,747 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:38,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:38,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:38,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:38,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:38,748 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:38,748 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:38,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:38,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:38,749 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:38,749 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:38,749 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:38,749 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:38,749 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:38,749 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:38,749 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:38,749 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:38,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:38,751 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:38,752 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:38,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:38,752 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:38,752 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:38,824 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:38,824 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:38,825 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:38,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:38,825 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:38,825 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:38,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable678 [2022-12-06 07:27:38,825 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-06 07:27:38,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:38,825 INFO L85 PathProgramCache]: Analyzing trace with hash -655340002, now seen corresponding path program 1 times [2022-12-06 07:27:38,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:38,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338818316] [2022-12-06 07:27:38,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:38,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:38,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:38,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:38,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338818316] [2022-12-06 07:27:38,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338818316] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:38,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:38,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:38,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086074121] [2022-12-06 07:27:38,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:38,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:38,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:38,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:38,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:38,886 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:38,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:38,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:38,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:38,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:38,922 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:38,922 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:38,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:38,923 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:38,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:38,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:38,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:38,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:38,923 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:38,923 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:38,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:38,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:38,924 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:38,924 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:38,924 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:38,924 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:38,924 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:38,924 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:38,924 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:38,924 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:38,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:38,927 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:38,927 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:38,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:38,927 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:38,927 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:39,001 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:39,001 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:39,001 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:39,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:39,001 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:39,002 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:39,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable679 [2022-12-06 07:27:39,002 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-06 07:27:39,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:39,002 INFO L85 PathProgramCache]: Analyzing trace with hash -628557893, now seen corresponding path program 1 times [2022-12-06 07:27:39,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:39,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698578229] [2022-12-06 07:27:39,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:39,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:39,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:39,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-06 07:27:39,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:39,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698578229] [2022-12-06 07:27:39,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698578229] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:39,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:39,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:39,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141599824] [2022-12-06 07:27:39,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:39,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:39,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:39,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:39,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:39,062 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:39,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:39,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:39,062 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:39,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:39,098 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:39,099 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:39,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:39,099 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:39,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:39,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:39,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:39,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:39,100 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:39,100 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:39,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:39,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:39,100 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:39,100 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:39,101 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:39,101 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:39,101 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:39,101 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:39,101 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:39,101 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:39,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:39,103 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:39,103 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:39,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:39,104 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:39,104 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:39,176 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:39,176 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:39,176 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:39,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:39,176 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:39,176 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:39,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable680 [2022-12-06 07:27:39,177 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-06 07:27:39,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:39,177 INFO L85 PathProgramCache]: Analyzing trace with hash -598081700, now seen corresponding path program 1 times [2022-12-06 07:27:39,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:39,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447127155] [2022-12-06 07:27:39,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:39,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:39,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-06 07:27:39,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:39,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447127155] [2022-12-06 07:27:39,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447127155] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:39,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:39,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:39,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056222195] [2022-12-06 07:27:39,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:39,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:39,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:39,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:39,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:39,242 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:39,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:39,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:39,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:39,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:39,285 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:39,286 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:39,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:39,286 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:39,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:39,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:39,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:39,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:39,287 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:39,287 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:39,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:39,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:39,288 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:39,288 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:39,288 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:39,288 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:39,288 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:39,288 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:39,289 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:39,289 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:39,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:39,292 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:39,292 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:39,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:39,292 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:39,292 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:39,364 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:39,364 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:39,364 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:39,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:39,364 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:39,365 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:39,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable681 [2022-12-06 07:27:39,365 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-06 07:27:39,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:39,365 INFO L85 PathProgramCache]: Analyzing trace with hash -571299591, now seen corresponding path program 1 times [2022-12-06 07:27:39,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:39,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330335143] [2022-12-06 07:27:39,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:39,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:39,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-06 07:27:39,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:39,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330335143] [2022-12-06 07:27:39,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330335143] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:39,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:39,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:39,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626349700] [2022-12-06 07:27:39,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:39,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:39,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:39,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:39,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:39,425 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:39,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:39,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:39,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:39,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:39,466 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:39,466 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:39,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:39,467 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:39,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:39,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:39,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:39,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:39,468 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:39,468 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:39,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:39,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:39,468 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:39,468 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:39,469 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:39,469 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:39,469 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:39,469 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:39,469 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:39,469 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:39,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:39,471 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:39,471 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:39,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:39,472 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:39,472 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:39,544 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:39,545 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:39,545 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:39,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:39,545 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:39,545 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:39,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable682 [2022-12-06 07:27:39,545 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-06 07:27:39,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:39,545 INFO L85 PathProgramCache]: Analyzing trace with hash -540823398, now seen corresponding path program 1 times [2022-12-06 07:27:39,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:39,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202958400] [2022-12-06 07:27:39,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:39,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:39,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-06 07:27:39,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:39,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202958400] [2022-12-06 07:27:39,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202958400] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:39,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:39,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:39,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91437838] [2022-12-06 07:27:39,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:39,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:39,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:39,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:39,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:39,621 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:39,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:39,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:39,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:39,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:39,662 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:39,663 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:39,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 351 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:39,663 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:39,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:39,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:39,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:39,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:39,664 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:39,664 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:39,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:39,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:39,664 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:39,664 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:39,665 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:39,665 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:39,665 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:39,665 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:39,665 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:39,665 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:39,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:39,667 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:39,667 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:39,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:39,668 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:39,668 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:39,739 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:39,740 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:39,740 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:39,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:39,740 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:39,740 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:39,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable683 [2022-12-06 07:27:39,740 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-06 07:27:39,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:39,740 INFO L85 PathProgramCache]: Analyzing trace with hash -514041289, now seen corresponding path program 1 times [2022-12-06 07:27:39,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:39,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568310732] [2022-12-06 07:27:39,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:39,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:39,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-06 07:27:39,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:39,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568310732] [2022-12-06 07:27:39,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568310732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:39,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:39,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:39,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022722288] [2022-12-06 07:27:39,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:39,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:39,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:39,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:39,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:39,797 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:39,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:39,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:39,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:39,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:39,835 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:39,835 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:39,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:39,835 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:39,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:39,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:39,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:39,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:39,836 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:39,836 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:39,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:39,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:39,837 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:39,837 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:39,837 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:39,837 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:39,837 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:39,837 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:39,837 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:39,837 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:39,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:39,840 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:39,840 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:39,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:39,840 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:39,840 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:39,913 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:39,914 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:39,914 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:39,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:39,914 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:39,914 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:39,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable684 [2022-12-06 07:27:39,914 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-06 07:27:39,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:39,914 INFO L85 PathProgramCache]: Analyzing trace with hash -483565096, now seen corresponding path program 1 times [2022-12-06 07:27:39,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:39,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116690961] [2022-12-06 07:27:39,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:39,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:39,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-06 07:27:39,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:39,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116690961] [2022-12-06 07:27:39,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116690961] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:39,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:39,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:39,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724636608] [2022-12-06 07:27:39,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:39,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:39,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:39,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:39,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:39,971 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:39,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:39,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:39,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:39,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:40,023 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:40,023 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:40,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:40,023 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:40,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:40,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:40,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:40,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:40,024 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:40,024 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:40,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:40,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:40,025 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:40,025 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:40,025 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:40,025 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:40,025 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:40,025 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:40,025 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:40,025 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:40,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:40,027 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:40,027 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:40,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:40,028 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:40,028 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:40,100 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:40,101 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:40,101 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:40,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:40,101 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:40,101 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:40,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable685 [2022-12-06 07:27:40,101 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-06 07:27:40,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:40,101 INFO L85 PathProgramCache]: Analyzing trace with hash -456782987, now seen corresponding path program 1 times [2022-12-06 07:27:40,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:40,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893971919] [2022-12-06 07:27:40,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:40,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:40,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-06 07:27:40,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:40,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893971919] [2022-12-06 07:27:40,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893971919] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:40,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:40,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:40,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448926337] [2022-12-06 07:27:40,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:40,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:40,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:40,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:40,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:40,161 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:40,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:40,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:40,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:40,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:40,202 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:40,202 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:40,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:40,203 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:40,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:40,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:40,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:40,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:40,203 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:40,204 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:40,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:40,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:40,204 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:40,204 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:40,204 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:40,204 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:40,205 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:40,205 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:40,205 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:40,205 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:40,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:40,207 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:40,207 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:40,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:40,207 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:40,207 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:40,281 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:40,281 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:40,281 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:40,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:40,281 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:40,282 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:40,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable686 [2022-12-06 07:27:40,282 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-06 07:27:40,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:40,282 INFO L85 PathProgramCache]: Analyzing trace with hash -426306794, now seen corresponding path program 1 times [2022-12-06 07:27:40,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:40,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463883635] [2022-12-06 07:27:40,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:40,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:40,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-06 07:27:40,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:40,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463883635] [2022-12-06 07:27:40,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463883635] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:40,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:40,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:40,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298944947] [2022-12-06 07:27:40,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:40,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:40,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:40,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:40,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:40,348 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:40,348 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:40,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:40,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:40,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:40,390 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:40,391 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:40,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:40,391 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:40,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:40,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:40,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:40,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:40,392 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:40,392 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:40,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:40,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:40,392 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:40,392 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:40,393 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:40,393 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:40,393 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:40,393 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:40,393 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:40,393 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:40,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:40,395 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:40,395 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:40,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:40,395 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:40,395 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:40,468 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:40,469 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:40,469 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:40,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:40,469 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:40,469 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:40,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable687 [2022-12-06 07:27:40,469 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-06 07:27:40,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:40,470 INFO L85 PathProgramCache]: Analyzing trace with hash -399524685, now seen corresponding path program 1 times [2022-12-06 07:27:40,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:40,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696134660] [2022-12-06 07:27:40,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:40,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:40,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-06 07:27:40,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:40,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696134660] [2022-12-06 07:27:40,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696134660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:40,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:40,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:40,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847131713] [2022-12-06 07:27:40,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:40,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:40,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:40,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:40,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:40,531 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:40,531 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:40,531 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:40,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:40,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:40,565 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:40,565 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:40,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:40,566 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:40,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:40,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:40,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:40,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:40,566 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:40,566 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:40,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:40,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:40,567 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:40,567 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:40,567 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:40,567 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:40,567 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:40,568 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:40,568 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:40,568 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:40,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:40,570 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:40,570 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:40,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:40,570 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:40,570 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:40,642 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:40,643 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:40,643 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:40,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:40,643 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:40,643 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:40,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable688 [2022-12-06 07:27:40,643 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-06 07:27:40,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:40,643 INFO L85 PathProgramCache]: Analyzing trace with hash -369048492, now seen corresponding path program 1 times [2022-12-06 07:27:40,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:40,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792859834] [2022-12-06 07:27:40,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:40,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:40,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-06 07:27:40,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:40,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792859834] [2022-12-06 07:27:40,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792859834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:40,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:40,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:40,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630170138] [2022-12-06 07:27:40,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:40,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:40,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:40,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:40,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:40,703 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:40,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:40,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:40,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:40,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:40,744 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:40,745 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:40,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:40,745 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:40,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:40,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:40,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:40,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:40,746 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:40,746 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:40,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:40,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:40,746 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:40,746 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:40,747 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:40,747 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:40,747 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:40,747 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:40,747 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:40,747 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:40,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:40,749 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:40,749 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:40,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:40,750 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:40,750 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:40,822 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:40,822 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:40,822 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:40,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:40,822 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:40,822 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:40,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable689 [2022-12-06 07:27:40,822 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-06 07:27:40,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:40,823 INFO L85 PathProgramCache]: Analyzing trace with hash -342266383, now seen corresponding path program 1 times [2022-12-06 07:27:40,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:40,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768036715] [2022-12-06 07:27:40,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:40,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:40,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-06 07:27:40,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:40,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768036715] [2022-12-06 07:27:40,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768036715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:40,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:40,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:40,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258552340] [2022-12-06 07:27:40,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:40,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:40,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:40,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:40,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:40,882 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:40,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:40,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:40,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:40,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:40,923 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:40,923 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:40,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:40,923 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:40,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:40,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:40,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:40,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:40,924 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:40,924 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:40,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:40,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:40,925 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:40,925 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:40,925 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:40,925 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:40,925 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:40,925 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:40,925 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:40,925 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:40,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:40,928 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:40,928 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:40,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:40,928 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:40,928 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:41,001 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:41,002 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:41,002 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:41,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:41,002 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:41,002 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:41,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable690 [2022-12-06 07:27:41,002 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-06 07:27:41,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:41,002 INFO L85 PathProgramCache]: Analyzing trace with hash -311790190, now seen corresponding path program 1 times [2022-12-06 07:27:41,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:41,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136448840] [2022-12-06 07:27:41,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:41,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27: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-06 07:27:41,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:41,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136448840] [2022-12-06 07:27:41,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136448840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:41,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:41,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:41,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914151642] [2022-12-06 07:27:41,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:41,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:41,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:41,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:41,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:41,060 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:41,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:41,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:41,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:41,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:41,097 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:41,097 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:41,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:41,097 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:41,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:41,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:41,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:41,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:41,098 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:41,098 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:41,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:41,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:41,099 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:41,099 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:41,099 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:41,099 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:41,099 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:41,099 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:41,099 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:41,099 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:41,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:41,101 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:41,101 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:41,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:41,102 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:41,102 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:41,177 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:41,177 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:27:41,177 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:41,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:41,177 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:41,177 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:41,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable691 [2022-12-06 07:27:41,178 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-06 07:27:41,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:41,178 INFO L85 PathProgramCache]: Analyzing trace with hash -285008081, now seen corresponding path program 1 times [2022-12-06 07:27:41,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:41,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829081898] [2022-12-06 07:27:41,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:41,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:41,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-06 07:27:41,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:41,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829081898] [2022-12-06 07:27:41,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829081898] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:41,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:41,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:41,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151478270] [2022-12-06 07:27:41,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:41,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:41,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:41,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:41,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:41,247 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:41,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:41,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:41,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:41,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:41,289 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:41,290 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:41,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:41,290 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:41,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:41,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:41,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:41,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:41,291 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:41,291 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:41,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:41,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:41,291 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:41,292 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:41,292 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:41,292 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:41,292 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:41,292 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:41,292 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:41,292 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:41,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:41,294 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:41,294 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:41,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:41,295 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:41,295 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:41,371 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:41,371 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:27:41,371 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:41,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:41,371 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:41,372 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:41,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable692 [2022-12-06 07:27:41,372 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-06 07:27:41,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:41,372 INFO L85 PathProgramCache]: Analyzing trace with hash -254531888, now seen corresponding path program 1 times [2022-12-06 07:27:41,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:41,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165688978] [2022-12-06 07:27:41,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:41,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:41,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-06 07:27:41,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:41,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165688978] [2022-12-06 07:27:41,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165688978] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:41,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:41,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:41,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992738833] [2022-12-06 07:27:41,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:41,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:41,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:41,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:41,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:41,430 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:41,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:41,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:41,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:41,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:41,465 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:41,465 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:41,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:41,466 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:41,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:41,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:41,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:41,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:41,466 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:41,466 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:41,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:41,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:41,467 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:41,467 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:41,467 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:41,467 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:41,467 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:41,468 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:41,468 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:41,468 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:41,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:41,470 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:41,470 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:41,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:41,470 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:41,470 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:41,544 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:41,544 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:41,544 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:41,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:41,544 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:41,545 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:41,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable693 [2022-12-06 07:27:41,545 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-06 07:27:41,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:41,545 INFO L85 PathProgramCache]: Analyzing trace with hash -227749779, now seen corresponding path program 1 times [2022-12-06 07:27:41,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:41,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339292644] [2022-12-06 07:27:41,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:41,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:41,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-06 07:27:41,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:41,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339292644] [2022-12-06 07:27:41,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339292644] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:41,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:41,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:41,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971350351] [2022-12-06 07:27:41,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:41,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:41,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:41,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:41,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:41,604 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:41,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:41,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:41,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:41,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:41,640 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:41,640 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:41,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:41,640 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:41,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:41,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:41,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:41,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:41,641 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:41,641 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:41,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:41,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:41,641 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:41,642 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:41,642 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:41,642 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:41,642 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:41,642 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:41,642 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:41,642 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:41,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:41,644 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:41,644 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:41,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:41,645 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:41,645 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:41,717 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:41,718 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:41,718 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:41,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:41,718 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:41,718 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:41,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable694 [2022-12-06 07:27:41,718 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-06 07:27:41,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:41,719 INFO L85 PathProgramCache]: Analyzing trace with hash -197273586, now seen corresponding path program 1 times [2022-12-06 07:27:41,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:41,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125491675] [2022-12-06 07:27:41,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:41,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:41,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-06 07:27:41,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:41,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125491675] [2022-12-06 07:27:41,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125491675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:41,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:41,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:41,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608229852] [2022-12-06 07:27:41,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:41,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:41,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:41,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:41,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:41,776 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:41,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:41,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:41,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:41,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:41,819 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:41,819 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:41,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:41,819 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:41,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:41,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:41,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:41,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:41,820 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:41,820 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:41,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:41,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:41,821 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:41,821 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:41,821 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:41,821 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:41,821 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:41,821 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:41,821 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:41,821 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:41,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:41,823 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:41,823 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:41,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:41,824 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:41,824 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:41,896 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:41,897 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:41,897 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:41,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:41,897 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:41,897 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:41,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable695 [2022-12-06 07:27:41,897 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-06 07:27:41,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:41,898 INFO L85 PathProgramCache]: Analyzing trace with hash -170491477, now seen corresponding path program 1 times [2022-12-06 07:27:41,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:41,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34745302] [2022-12-06 07:27:41,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:41,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:41,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-06 07:27:41,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:41,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34745302] [2022-12-06 07:27:41,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34745302] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:41,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:41,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:41,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758631892] [2022-12-06 07:27:41,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:41,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:41,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:41,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:41,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:41,960 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:41,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:41,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:41,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:41,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:41,996 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:41,996 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:41,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:41,997 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:41,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:41,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:41,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:41,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:41,997 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:41,997 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:41,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:41,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:41,998 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:41,998 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:41,998 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:41,998 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:41,998 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:41,998 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:41,998 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:41,998 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:41,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:42,007 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:42,008 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:42,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:42,008 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:42,008 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:42,081 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:42,082 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:27:42,082 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:42,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:42,082 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:42,082 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:42,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable696 [2022-12-06 07:27:42,082 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-06 07:27:42,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:42,082 INFO L85 PathProgramCache]: Analyzing trace with hash -140015284, now seen corresponding path program 1 times [2022-12-06 07:27:42,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:42,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679265830] [2022-12-06 07:27:42,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:42,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:42,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-06 07:27:42,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:42,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679265830] [2022-12-06 07:27:42,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679265830] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:42,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:42,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:42,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292535594] [2022-12-06 07:27:42,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:42,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:42,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:42,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:42,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:42,138 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:42,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:42,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:42,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:42,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:42,180 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:42,180 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:42,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:42,181 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:42,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:42,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:42,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:42,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:42,181 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:42,181 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:42,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:42,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:42,182 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:42,182 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:42,182 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:42,182 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:42,182 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:42,182 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:42,183 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:42,183 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:42,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:42,185 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:42,185 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:42,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:42,185 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:42,185 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:42,257 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:42,258 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:42,258 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:42,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:42,258 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:42,258 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:42,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable697 [2022-12-06 07:27:42,258 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-06 07:27:42,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:42,258 INFO L85 PathProgramCache]: Analyzing trace with hash -113233175, now seen corresponding path program 1 times [2022-12-06 07:27:42,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:42,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993922647] [2022-12-06 07:27:42,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:42,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:42,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:42,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-06 07:27:42,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:42,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993922647] [2022-12-06 07:27:42,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993922647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:42,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:42,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:42,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14534344] [2022-12-06 07:27:42,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:42,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:42,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:42,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:42,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:42,321 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:42,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:42,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:42,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:42,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:42,354 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:42,355 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:42,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:42,355 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:42,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:42,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:42,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:42,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:42,356 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:42,356 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:42,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:42,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:42,356 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:42,356 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:42,357 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:42,357 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:42,357 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:42,357 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:42,357 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:42,357 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:42,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:42,359 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:42,359 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:42,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:42,359 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:42,360 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:42,433 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:42,433 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:42,433 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:42,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:42,433 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:42,433 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:42,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable698 [2022-12-06 07:27:42,433 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-06 07:27:42,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:42,434 INFO L85 PathProgramCache]: Analyzing trace with hash -82756982, now seen corresponding path program 1 times [2022-12-06 07:27:42,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:42,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867089164] [2022-12-06 07:27:42,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:42,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:42,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:42,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:42,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867089164] [2022-12-06 07:27:42,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867089164] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:42,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:42,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:42,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860852080] [2022-12-06 07:27:42,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:42,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:42,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:42,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:42,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:42,491 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:42,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:42,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:42,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:42,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:42,532 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:42,533 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:42,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:42,533 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:42,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:42,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:42,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:42,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:42,534 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:42,534 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:42,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:42,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:42,534 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:42,534 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:42,535 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:42,535 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:42,535 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:42,535 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:42,535 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:42,535 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:42,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:42,537 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:42,537 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:42,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:42,537 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:42,538 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:42,610 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:42,610 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:42,610 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:42,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:42,610 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:42,610 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:42,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable699 [2022-12-06 07:27:42,610 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-06 07:27:42,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:42,611 INFO L85 PathProgramCache]: Analyzing trace with hash -55974873, now seen corresponding path program 1 times [2022-12-06 07:27:42,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:42,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948179838] [2022-12-06 07:27:42,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:42,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:42,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-06 07:27:42,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:42,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948179838] [2022-12-06 07:27:42,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948179838] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:42,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:42,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:42,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636715095] [2022-12-06 07:27:42,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:42,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:42,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:42,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:42,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:42,673 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:42,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:42,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:42,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:42,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:42,713 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:42,714 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:42,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:42,714 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:42,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:42,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:42,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:42,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:42,715 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:42,715 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:42,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:42,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:42,715 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:42,715 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:42,716 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:42,716 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:42,716 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:42,716 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:42,716 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:42,716 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:42,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:42,718 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:42,718 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:42,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:42,719 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:42,719 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:42,791 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:42,792 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:42,792 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:42,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:42,792 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:42,792 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:42,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable700 [2022-12-06 07:27:42,792 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-06 07:27:42,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:42,792 INFO L85 PathProgramCache]: Analyzing trace with hash -25498680, now seen corresponding path program 1 times [2022-12-06 07:27:42,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:42,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928613701] [2022-12-06 07:27:42,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:42,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:42,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-06 07:27:42,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:42,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928613701] [2022-12-06 07:27:42,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928613701] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:42,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:42,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:42,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060488427] [2022-12-06 07:27:42,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:42,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:42,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:42,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:42,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:42,865 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:42,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:42,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:42,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:42,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:42,907 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:42,907 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:42,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:42,908 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:42,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:42,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:42,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:42,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:42,909 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:42,909 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:42,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:42,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:42,909 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:42,909 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:42,909 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:42,910 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:42,910 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:42,910 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:42,910 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:42,910 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:42,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:42,912 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:42,912 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:42,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:42,912 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:42,912 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:42,988 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:42,989 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:27:42,989 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:42,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:42,989 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:42,989 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:42,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable701 [2022-12-06 07:27:42,989 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-06 07:27:42,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:42,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1283429, now seen corresponding path program 1 times [2022-12-06 07:27:42,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:42,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157332879] [2022-12-06 07:27:42,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:42,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:43,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-06 07:27:43,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:43,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157332879] [2022-12-06 07:27:43,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157332879] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:43,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:43,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:43,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918243016] [2022-12-06 07:27:43,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:43,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:43,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:43,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:43,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:43,053 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:43,053 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:43,053 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:43,053 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:43,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:43,092 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:43,092 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:43,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:43,093 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:43,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:43,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:43,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:43,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:43,093 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:43,093 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:43,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:43,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:43,094 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:43,094 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:43,094 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:43,094 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:43,094 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:43,095 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:43,095 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:43,095 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:43,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:43,097 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:43,097 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:43,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:43,097 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:43,097 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:43,170 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:43,171 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:43,171 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:43,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:43,171 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:43,171 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:43,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable702 [2022-12-06 07:27:43,171 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-06 07:27:43,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:43,171 INFO L85 PathProgramCache]: Analyzing trace with hash 31759622, now seen corresponding path program 1 times [2022-12-06 07:27:43,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:43,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892181922] [2022-12-06 07:27:43,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:43,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:43,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-06 07:27:43,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:43,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892181922] [2022-12-06 07:27:43,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892181922] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:43,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:43,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:43,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342186587] [2022-12-06 07:27:43,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:43,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:43,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:43,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:43,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:43,229 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:43,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:43,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:43,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:43,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:43,271 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:43,271 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:43,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:43,271 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:43,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:43,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:43,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:43,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:43,272 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:43,272 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:43,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:43,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:43,273 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:43,273 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:43,273 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:43,273 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:43,273 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:43,273 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:43,273 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:43,273 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:43,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:43,276 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:43,276 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:43,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:43,276 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:43,276 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:43,348 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:43,348 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:43,348 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:43,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:43,348 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:43,348 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:43,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable703 [2022-12-06 07:27:43,349 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-06 07:27:43,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:43,349 INFO L85 PathProgramCache]: Analyzing trace with hash 58541731, now seen corresponding path program 1 times [2022-12-06 07:27:43,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:43,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786718059] [2022-12-06 07:27:43,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:43,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:43,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-06 07:27:43,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:43,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786718059] [2022-12-06 07:27:43,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786718059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:43,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:43,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:43,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987743591] [2022-12-06 07:27:43,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:43,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:43,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:43,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:43,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:43,409 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:43,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:43,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:43,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:43,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:43,444 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:43,445 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:43,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:43,445 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:43,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:43,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:43,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:43,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:43,446 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:43,446 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:43,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:43,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:43,446 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:43,446 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:43,447 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:43,447 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:43,447 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:43,447 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:43,447 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:43,447 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:43,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:43,449 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:43,449 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:43,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:43,449 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:43,449 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:43,522 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:43,523 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:43,523 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:43,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:43,523 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:43,523 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:43,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable704 [2022-12-06 07:27:43,523 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-06 07:27:43,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:43,523 INFO L85 PathProgramCache]: Analyzing trace with hash 89017924, now seen corresponding path program 1 times [2022-12-06 07:27:43,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:43,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305166891] [2022-12-06 07:27:43,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:43,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:43,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-06 07:27:43,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:43,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305166891] [2022-12-06 07:27:43,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305166891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:43,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:43,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:43,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271610454] [2022-12-06 07:27:43,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:43,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:43,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:43,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:43,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:43,584 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:43,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:43,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:43,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:43,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:43,626 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:43,626 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:43,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:43,626 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:43,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:43,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:43,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:43,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:43,627 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:43,627 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:43,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:43,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:43,627 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:43,628 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:43,628 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:43,628 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:43,628 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:43,628 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:43,628 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:43,628 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:43,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:43,630 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:43,630 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:43,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:43,631 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:43,631 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:43,703 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:43,704 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:43,704 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:43,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:43,704 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:43,704 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:43,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable705 [2022-12-06 07:27:43,704 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-06 07:27:43,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:43,705 INFO L85 PathProgramCache]: Analyzing trace with hash 115800033, now seen corresponding path program 1 times [2022-12-06 07:27:43,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:43,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620467284] [2022-12-06 07:27:43,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:43,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:43,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-06 07:27:43,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:43,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620467284] [2022-12-06 07:27:43,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620467284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:43,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:43,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:43,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713767759] [2022-12-06 07:27:43,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:43,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:43,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:43,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:43,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:43,774 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:43,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:43,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:43,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:43,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:43,813 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:43,814 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:43,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:43,814 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:43,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:43,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:43,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:43,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:43,815 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:43,815 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:43,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:43,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:43,815 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:43,815 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:43,816 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:43,816 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:43,816 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:43,816 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:43,816 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:43,816 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:43,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:43,818 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:43,818 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:43,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:43,818 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:43,818 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:43,922 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:43,922 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-06 07:27:43,922 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:43,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:43,922 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:43,922 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:43,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable706 [2022-12-06 07:27:43,923 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-06 07:27:43,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:43,923 INFO L85 PathProgramCache]: Analyzing trace with hash 146276226, now seen corresponding path program 1 times [2022-12-06 07:27:43,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:43,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752214670] [2022-12-06 07:27:43,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:43,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:43,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-06 07:27:43,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:43,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752214670] [2022-12-06 07:27:43,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752214670] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:43,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:43,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:43,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522366093] [2022-12-06 07:27:43,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:43,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:43,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:43,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:43,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:43,990 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:43,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:43,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:43,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:43,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:44,026 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:44,026 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:44,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:44,027 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:44,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:44,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:44,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:44,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:44,027 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:44,027 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:44,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:44,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:44,028 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:44,028 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:44,028 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:44,028 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:44,028 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:44,029 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:44,029 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:44,029 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:44,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:44,031 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:44,031 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:44,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:44,031 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:44,031 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:44,102 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:44,103 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:44,103 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:44,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:44,103 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:44,103 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:44,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable707 [2022-12-06 07:27:44,103 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-06 07:27:44,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:44,103 INFO L85 PathProgramCache]: Analyzing trace with hash 173058335, now seen corresponding path program 1 times [2022-12-06 07:27:44,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:44,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156243437] [2022-12-06 07:27:44,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:44,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:44,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:44,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-06 07:27:44,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:44,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156243437] [2022-12-06 07:27:44,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156243437] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:44,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:44,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:44,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095932774] [2022-12-06 07:27:44,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:44,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:44,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:44,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:44,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:44,166 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:44,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:44,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:44,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:44,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:44,200 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:44,201 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:44,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:44,201 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:44,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:44,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:44,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:44,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:44,202 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:44,202 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:44,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:44,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:44,202 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:44,202 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:44,203 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:44,203 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:44,203 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:44,203 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:44,203 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:44,203 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:44,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:44,205 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:44,205 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:44,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:44,205 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:44,206 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:44,277 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:44,278 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:44,278 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:44,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:44,278 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:44,278 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:44,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable708 [2022-12-06 07:27:44,278 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-06 07:27:44,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:44,278 INFO L85 PathProgramCache]: Analyzing trace with hash 203534528, now seen corresponding path program 1 times [2022-12-06 07:27:44,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:44,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056505707] [2022-12-06 07:27:44,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:44,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:44,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-06 07:27:44,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:44,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056505707] [2022-12-06 07:27:44,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056505707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:44,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:44,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:44,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032864995] [2022-12-06 07:27:44,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:44,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:44,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:44,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:44,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:44,339 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:44,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:44,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:44,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:44,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:44,374 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:44,374 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:44,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:44,375 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:44,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:44,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:44,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:44,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:44,375 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:44,375 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:44,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:44,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:44,376 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:44,376 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:44,376 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:44,376 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:44,376 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:44,376 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:44,377 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:44,377 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:44,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:44,379 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:44,379 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:44,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:44,379 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:44,379 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:44,452 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:44,453 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:44,453 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:44,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:44,453 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:44,453 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:44,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable709 [2022-12-06 07:27:44,453 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-06 07:27:44,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:44,453 INFO L85 PathProgramCache]: Analyzing trace with hash 230316637, now seen corresponding path program 1 times [2022-12-06 07:27:44,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:44,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233283202] [2022-12-06 07:27:44,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:44,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:44,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-06 07:27:44,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:44,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233283202] [2022-12-06 07:27:44,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233283202] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:44,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:44,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:44,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563259377] [2022-12-06 07:27:44,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:44,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:44,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:44,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:44,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:44,514 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:44,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:44,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:44,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:44,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:44,556 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:44,556 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:44,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:44,556 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:44,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:44,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:44,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:44,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:44,557 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:44,557 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:44,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:44,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:44,558 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:44,558 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:44,558 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:44,558 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:44,558 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:44,558 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:44,558 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:44,558 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:44,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:44,562 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:44,562 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:44,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:44,562 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:44,562 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:44,672 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:44,673 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-06 07:27:44,673 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:44,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:44,673 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:44,673 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:44,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable710 [2022-12-06 07:27:44,673 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-06 07:27:44,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:44,674 INFO L85 PathProgramCache]: Analyzing trace with hash 260792830, now seen corresponding path program 1 times [2022-12-06 07:27:44,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:44,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280311802] [2022-12-06 07:27:44,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:44,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:44,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-06 07:27:44,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:44,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280311802] [2022-12-06 07:27:44,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280311802] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:44,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:44,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:44,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824576810] [2022-12-06 07:27:44,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:44,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:44,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:44,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:44,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:44,730 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:44,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:44,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:44,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:44,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:44,773 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:44,773 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:44,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:44,773 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:44,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:44,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:44,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:44,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:44,774 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:44,774 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:44,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:44,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:44,775 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:44,775 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:44,775 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:44,775 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:44,775 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:44,775 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:44,775 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:44,775 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:44,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:44,777 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:44,777 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:44,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:44,778 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:44,778 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:44,860 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:44,860 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 07:27:44,860 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:44,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:44,860 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:44,861 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:44,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable711 [2022-12-06 07:27:44,861 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-06 07:27:44,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:44,861 INFO L85 PathProgramCache]: Analyzing trace with hash 287574939, now seen corresponding path program 1 times [2022-12-06 07:27:44,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:44,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108822494] [2022-12-06 07:27:44,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:44,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:44,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:44,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-06 07:27:44,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:44,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108822494] [2022-12-06 07:27:44,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108822494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:44,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:44,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:44,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922183660] [2022-12-06 07:27:44,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:44,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:44,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:44,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:44,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:44,936 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:44,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:44,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:44,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:44,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:44,984 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:44,985 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:44,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:44,985 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:44,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:44,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:44,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:44,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:44,986 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:44,986 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:44,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:44,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:44,987 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:44,987 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:44,987 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:44,987 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:44,987 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:44,988 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:44,988 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:44,988 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:44,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:44,991 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:44,991 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:44,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:44,991 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:44,991 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:45,067 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:45,067 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:27:45,067 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:45,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:45,068 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:45,068 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:45,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable712 [2022-12-06 07:27:45,068 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-06 07:27:45,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:45,068 INFO L85 PathProgramCache]: Analyzing trace with hash 318051132, now seen corresponding path program 1 times [2022-12-06 07:27:45,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:45,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235788455] [2022-12-06 07:27:45,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:45,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:45,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:45,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-06 07:27:45,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:45,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235788455] [2022-12-06 07:27:45,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235788455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:45,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:45,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:45,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93181099] [2022-12-06 07:27:45,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:45,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:45,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:45,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:45,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:45,129 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:45,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:45,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:45,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:45,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:45,183 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:45,183 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:45,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:45,184 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:45,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:45,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:45,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:45,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:45,184 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:45,185 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:45,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:45,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:45,185 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:45,186 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:45,186 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:45,186 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:45,186 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:45,186 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:45,186 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:45,186 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:45,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:45,189 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:45,189 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:45,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:45,189 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:45,189 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:45,262 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:45,262 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:45,262 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:45,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:45,262 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:45,262 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:45,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable713 [2022-12-06 07:27:45,262 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-06 07:27:45,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:45,263 INFO L85 PathProgramCache]: Analyzing trace with hash 344833241, now seen corresponding path program 1 times [2022-12-06 07:27:45,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:45,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726578911] [2022-12-06 07:27:45,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:45,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:45,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-06 07:27:45,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:45,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726578911] [2022-12-06 07:27:45,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726578911] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:45,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:45,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:45,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075185854] [2022-12-06 07:27:45,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:45,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:45,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:45,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:45,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:45,326 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:45,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:45,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:45,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:45,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:45,362 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:45,362 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:45,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:45,363 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:45,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:45,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:45,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:45,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:45,363 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:45,364 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:45,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:45,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:45,364 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:45,364 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:45,364 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:45,365 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:45,365 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:45,365 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:45,365 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:45,365 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:45,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:45,367 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:45,367 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:45,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:45,368 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:45,368 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:45,441 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:45,442 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:45,442 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:45,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:45,442 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:45,442 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:45,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable714 [2022-12-06 07:27:45,442 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-06 07:27:45,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:45,443 INFO L85 PathProgramCache]: Analyzing trace with hash 375309434, now seen corresponding path program 1 times [2022-12-06 07:27:45,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:45,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57231914] [2022-12-06 07:27:45,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:45,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:45,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-06 07:27:45,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:45,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57231914] [2022-12-06 07:27:45,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57231914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:45,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:45,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:45,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466419222] [2022-12-06 07:27:45,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:45,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:45,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:45,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:45,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:45,516 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:45,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:45,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:45,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:45,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:45,561 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:45,561 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:45,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:45,562 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:45,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:45,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:45,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:45,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:45,563 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:45,563 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:45,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:45,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:45,564 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:45,564 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:45,564 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:45,564 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:45,564 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:45,564 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:45,564 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:45,565 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:45,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:45,568 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:45,568 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:45,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:45,568 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:45,568 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:45,641 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:45,641 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:45,641 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:45,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:45,641 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:45,641 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:45,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable715 [2022-12-06 07:27:45,642 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-06 07:27:45,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:45,642 INFO L85 PathProgramCache]: Analyzing trace with hash 402091543, now seen corresponding path program 1 times [2022-12-06 07:27:45,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:45,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7874072] [2022-12-06 07:27:45,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:45,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:45,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-06 07:27:45,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:45,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7874072] [2022-12-06 07:27:45,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7874072] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:45,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:45,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:45,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346266352] [2022-12-06 07:27:45,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:45,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:45,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:45,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:45,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:45,702 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:45,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:45,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:45,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:45,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:45,737 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:45,738 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:45,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:45,738 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:45,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:45,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:45,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:45,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:45,739 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:45,739 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:45,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:45,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:45,739 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:45,740 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:45,740 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:45,740 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:45,740 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:45,740 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:45,740 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:45,740 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:45,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:45,742 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:45,743 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:45,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:45,743 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:45,743 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:45,817 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:45,817 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:45,817 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:45,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:45,817 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:45,818 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:45,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable716 [2022-12-06 07:27:45,818 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-06 07:27:45,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:45,818 INFO L85 PathProgramCache]: Analyzing trace with hash 432567736, now seen corresponding path program 1 times [2022-12-06 07:27:45,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:45,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908151456] [2022-12-06 07:27:45,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:45,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:45,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:45,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:45,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908151456] [2022-12-06 07:27:45,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908151456] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:45,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:45,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:45,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129286620] [2022-12-06 07:27:45,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:45,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:45,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:45,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:45,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:45,876 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:45,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:45,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:45,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:45,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:45,913 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:45,914 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:45,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:45,914 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:45,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:45,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:45,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:45,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:45,915 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:45,915 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:45,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:45,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:45,915 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:45,916 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:45,916 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:45,916 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:45,916 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:45,916 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:45,916 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:45,916 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:45,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:45,920 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:45,920 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:45,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:45,920 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:45,920 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:46,012 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:46,012 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:27:46,012 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:46,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:46,012 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:46,012 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:46,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable717 [2022-12-06 07:27:46,013 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-06 07:27:46,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:46,013 INFO L85 PathProgramCache]: Analyzing trace with hash 459349845, now seen corresponding path program 1 times [2022-12-06 07:27:46,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:46,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150243473] [2022-12-06 07:27:46,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:46,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:46,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-06 07:27:46,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:46,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150243473] [2022-12-06 07:27:46,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150243473] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:46,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:46,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:46,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584302020] [2022-12-06 07:27:46,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:46,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:46,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:46,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:46,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:46,090 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:46,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:46,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:46,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:46,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:46,131 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:46,132 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:46,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:46,132 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:46,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:46,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:46,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:46,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:46,133 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:46,133 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:46,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:46,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:46,133 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:46,133 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:46,134 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:46,134 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:46,134 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:46,134 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:46,134 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:46,134 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:46,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:46,136 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:46,136 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:46,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:46,136 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:46,137 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:46,210 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:46,210 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:46,210 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:46,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:46,210 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:46,210 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:46,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable718 [2022-12-06 07:27:46,211 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-06 07:27:46,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:46,211 INFO L85 PathProgramCache]: Analyzing trace with hash 489826038, now seen corresponding path program 1 times [2022-12-06 07:27:46,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:46,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367942892] [2022-12-06 07:27:46,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:46,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:46,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-06 07:27:46,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:46,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367942892] [2022-12-06 07:27:46,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367942892] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:46,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:46,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:46,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828069568] [2022-12-06 07:27:46,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:46,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:46,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:46,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:46,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:46,273 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:46,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:46,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:46,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:46,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:46,308 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:46,308 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:46,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:46,309 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:46,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:46,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:46,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:46,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:46,309 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:46,310 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:46,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:46,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:46,310 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:46,310 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:46,310 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:46,311 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:46,311 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:46,311 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:46,311 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:46,311 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:46,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:46,313 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:46,313 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:46,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:46,313 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:46,313 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:46,387 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:46,388 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:46,388 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:46,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:46,388 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:46,388 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:46,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable719 [2022-12-06 07:27:46,388 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-06 07:27:46,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:46,388 INFO L85 PathProgramCache]: Analyzing trace with hash 516608147, now seen corresponding path program 1 times [2022-12-06 07:27:46,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:46,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714224597] [2022-12-06 07:27:46,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:46,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:46,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:46,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:46,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714224597] [2022-12-06 07:27:46,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714224597] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:46,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:46,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:46,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064587368] [2022-12-06 07:27:46,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:46,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:46,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:46,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:46,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:46,458 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:46,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:46,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:46,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:46,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:46,499 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:46,499 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:46,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:46,499 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:46,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:46,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:46,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:46,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:46,500 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:46,500 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:46,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:46,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:46,501 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:46,501 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:46,501 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:46,501 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:46,501 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:46,501 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:46,501 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:46,501 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:46,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:46,503 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:46,503 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:46,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:46,504 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:46,504 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:46,577 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:46,578 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:46,578 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:46,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:46,578 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:46,578 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:46,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable720 [2022-12-06 07:27:46,578 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-06 07:27:46,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:46,578 INFO L85 PathProgramCache]: Analyzing trace with hash 547084340, now seen corresponding path program 1 times [2022-12-06 07:27:46,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:46,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204669663] [2022-12-06 07:27:46,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:46,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:46,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-06 07:27:46,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:46,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204669663] [2022-12-06 07:27:46,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204669663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:46,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:46,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:46,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342427285] [2022-12-06 07:27:46,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:46,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:46,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:46,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:46,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:46,641 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:46,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:46,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:46,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:46,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:46,678 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:46,678 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:46,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:46,678 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:46,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:46,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:46,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:46,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:46,679 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:46,679 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:46,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:46,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:46,680 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:46,680 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:46,680 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:46,680 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:46,680 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:46,680 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:46,680 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:46,680 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:46,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:46,683 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:46,683 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:46,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:46,683 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:46,683 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:46,756 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:46,756 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:46,756 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:46,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:46,757 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:46,757 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:46,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable721 [2022-12-06 07:27:46,757 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-06 07:27:46,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:46,757 INFO L85 PathProgramCache]: Analyzing trace with hash 573866449, now seen corresponding path program 1 times [2022-12-06 07:27:46,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:46,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340841551] [2022-12-06 07:27:46,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:46,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:46,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:46,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-06 07:27:46,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:46,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340841551] [2022-12-06 07:27:46,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340841551] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:46,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:46,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:46,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374612802] [2022-12-06 07:27:46,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:46,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:46,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:46,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:46,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:46,819 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:46,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:46,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:46,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:46,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:46,855 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:46,855 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:46,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:46,855 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:46,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:46,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:46,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:46,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:46,856 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:46,856 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:46,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:46,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:46,857 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:46,857 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:46,857 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:46,857 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:46,857 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:46,857 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:46,858 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:46,858 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:46,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:46,861 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:46,861 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:46,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:46,861 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:46,862 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:46,956 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:46,957 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 07:27:46,957 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:46,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:46,957 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:46,957 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:46,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable722 [2022-12-06 07:27:46,957 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-06 07:27:46,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:46,957 INFO L85 PathProgramCache]: Analyzing trace with hash 604342642, now seen corresponding path program 1 times [2022-12-06 07:27:46,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:46,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068761369] [2022-12-06 07:27:46,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:46,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27: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-06 07:27:47,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:47,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068761369] [2022-12-06 07:27:47,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068761369] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:47,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:47,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:47,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856570035] [2022-12-06 07:27:47,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:47,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:47,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:47,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:47,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:47,037 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:47,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:47,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:47,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:47,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:47,085 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:47,085 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:47,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:47,086 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:47,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:47,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:47,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:47,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:47,087 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:47,087 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:47,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:47,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:47,088 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:47,088 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:47,088 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:47,088 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:47,088 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:47,088 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:47,088 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:47,089 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:47,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:47,092 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:47,092 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:47,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:47,092 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:47,092 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:47,170 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:47,171 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 07:27:47,171 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:47,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:47,171 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:47,171 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:47,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable723 [2022-12-06 07:27:47,171 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-06 07:27:47,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:47,171 INFO L85 PathProgramCache]: Analyzing trace with hash 631124751, now seen corresponding path program 1 times [2022-12-06 07:27:47,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:47,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054969966] [2022-12-06 07:27:47,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:47,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:47,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-06 07:27:47,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:47,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054969966] [2022-12-06 07:27:47,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054969966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:47,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:47,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:47,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72153781] [2022-12-06 07:27:47,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:47,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:47,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:47,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:47,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:47,228 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:47,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:47,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:47,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:47,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:47,270 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:47,270 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:47,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:47,271 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:47,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:47,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:47,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:47,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:47,272 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:47,272 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:47,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:47,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:47,272 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:47,272 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:47,273 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:47,273 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:47,273 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:47,273 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:47,273 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:47,273 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:47,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:47,275 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:47,275 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:47,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:47,275 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:47,276 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:47,355 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:47,355 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:27:47,355 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:47,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:47,355 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:47,355 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:47,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable724 [2022-12-06 07:27:47,355 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-06 07:27:47,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:47,356 INFO L85 PathProgramCache]: Analyzing trace with hash 661600944, now seen corresponding path program 1 times [2022-12-06 07:27:47,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:47,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571527031] [2022-12-06 07:27:47,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:47,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:47,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-06 07:27:47,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:47,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571527031] [2022-12-06 07:27:47,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571527031] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:47,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:47,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:47,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344126989] [2022-12-06 07:27:47,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:47,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:47,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:47,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:47,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:47,415 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:47,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:47,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:47,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:47,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:47,458 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:47,458 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:47,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:47,458 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:47,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:47,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:47,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:47,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:47,459 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:47,459 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:47,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:47,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:47,460 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:47,460 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:47,460 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:47,460 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:47,460 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:47,460 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:47,460 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:47,460 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:47,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:47,462 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:47,462 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:47,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:47,463 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:47,463 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:47,537 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:47,537 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:47,537 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:47,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:47,537 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:47,537 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:47,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable725 [2022-12-06 07:27:47,537 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-06 07:27:47,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:47,538 INFO L85 PathProgramCache]: Analyzing trace with hash 688383053, now seen corresponding path program 1 times [2022-12-06 07:27:47,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:47,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353821293] [2022-12-06 07:27:47,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:47,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:47,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-06 07:27:47,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:47,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353821293] [2022-12-06 07:27:47,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353821293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:47,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:47,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:47,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319793564] [2022-12-06 07:27:47,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:47,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:47,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:47,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:47,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:47,597 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:47,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:47,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:47,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:47,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:47,636 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:47,636 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:47,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 371 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:47,636 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:47,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:47,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:47,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:47,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:47,637 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:47,637 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:47,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:47,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:47,638 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:47,638 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:47,638 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:47,638 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:47,638 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:47,638 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:47,638 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:47,638 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:47,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:47,640 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:47,640 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:47,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:47,641 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:47,641 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:47,714 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:47,715 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:47,715 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:47,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:47,715 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:47,715 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:47,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable726 [2022-12-06 07:27:47,715 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-06 07:27:47,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:47,715 INFO L85 PathProgramCache]: Analyzing trace with hash 718859246, now seen corresponding path program 1 times [2022-12-06 07:27:47,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:47,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364976675] [2022-12-06 07:27:47,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:47,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:47,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-06 07:27:47,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:47,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364976675] [2022-12-06 07:27:47,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364976675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:47,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:47,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:47,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873043685] [2022-12-06 07:27:47,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:47,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:47,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:47,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:47,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:47,773 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:47,773 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:47,773 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:47,773 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:47,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:47,814 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:47,814 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:47,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:47,815 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:47,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:47,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:47,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:47,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:47,815 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:47,816 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:47,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:47,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:47,816 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:47,816 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:47,816 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:47,816 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:47,816 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:47,817 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:47,817 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:47,817 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:47,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:47,819 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:47,819 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:47,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:47,819 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:47,819 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:47,892 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:47,892 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:47,892 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:47,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:47,892 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:47,892 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:47,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable727 [2022-12-06 07:27:47,893 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-06 07:27:47,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:47,893 INFO L85 PathProgramCache]: Analyzing trace with hash 745641355, now seen corresponding path program 1 times [2022-12-06 07:27:47,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:47,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669876741] [2022-12-06 07:27:47,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:47,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:47,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:47,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-06 07:27:47,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:47,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669876741] [2022-12-06 07:27:47,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669876741] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:47,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:47,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:47,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623172196] [2022-12-06 07:27:47,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:47,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:47,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:47,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:47,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:47,954 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:47,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:47,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:47,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:47,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:47,990 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:47,990 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:47,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 356 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:47,990 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:47,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:47,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:47,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:47,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:47,991 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:47,991 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:47,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:47,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:47,991 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:47,991 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:47,992 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:47,992 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:47,992 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:47,992 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:47,992 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:47,992 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:47,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:47,994 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:47,994 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:47,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:47,994 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:47,994 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:48,068 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:48,069 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:48,069 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:48,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:48,069 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:48,069 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:48,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable728 [2022-12-06 07:27:48,069 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-06 07:27:48,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:48,070 INFO L85 PathProgramCache]: Analyzing trace with hash 776117548, now seen corresponding path program 1 times [2022-12-06 07:27:48,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:48,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103100602] [2022-12-06 07:27:48,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:48,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:48,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-06 07:27:48,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:48,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103100602] [2022-12-06 07:27:48,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103100602] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:48,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:48,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:48,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702816211] [2022-12-06 07:27:48,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:48,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:48,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:48,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:48,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:48,135 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:48,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:48,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:48,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:48,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:48,178 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:48,178 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:48,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:48,178 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:48,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:48,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:48,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:48,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:48,179 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:48,179 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:48,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:48,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:48,180 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:48,180 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:48,180 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:48,180 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:48,180 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:48,180 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:48,180 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:48,180 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:48,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:48,182 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:48,182 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:48,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:48,183 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:48,183 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:48,255 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:48,256 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:48,256 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:48,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:48,256 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:48,256 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:48,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable729 [2022-12-06 07:27:48,256 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-06 07:27:48,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:48,257 INFO L85 PathProgramCache]: Analyzing trace with hash 802899657, now seen corresponding path program 1 times [2022-12-06 07:27:48,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:48,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56237746] [2022-12-06 07:27:48,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:48,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:48,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-06 07:27:48,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:48,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56237746] [2022-12-06 07:27:48,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56237746] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:48,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:48,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:48,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942723083] [2022-12-06 07:27:48,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:48,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:48,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:48,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:48,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:48,317 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:48,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:48,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:48,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:48,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:48,352 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:48,352 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:48,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:48,353 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:48,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:48,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:48,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:48,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:48,353 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:48,353 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:48,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:48,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:48,354 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:48,354 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:48,354 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:48,354 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:48,354 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:48,355 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:48,355 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:48,355 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:48,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:48,357 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:48,357 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:48,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:48,357 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:48,357 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:48,430 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:48,430 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:48,430 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:48,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:48,431 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:48,431 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:48,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable730 [2022-12-06 07:27:48,431 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-06 07:27:48,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:48,431 INFO L85 PathProgramCache]: Analyzing trace with hash 833375850, now seen corresponding path program 1 times [2022-12-06 07:27:48,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:48,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207847152] [2022-12-06 07:27:48,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:48,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:48,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-06 07:27:48,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:48,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207847152] [2022-12-06 07:27:48,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207847152] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:48,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:48,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:48,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230164417] [2022-12-06 07:27:48,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:48,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:48,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:48,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:48,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:48,489 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:48,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:48,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:48,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:48,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:48,531 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:48,531 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:48,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:48,532 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:48,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:48,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:48,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:48,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:48,532 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:48,532 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:48,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:48,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:48,533 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:48,533 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:48,533 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:48,533 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:48,533 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:48,533 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:48,533 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:48,534 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:48,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:48,536 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:48,536 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:48,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:48,536 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:48,536 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:48,608 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:48,609 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:48,609 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:48,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:48,609 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:48,609 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:48,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable731 [2022-12-06 07:27:48,609 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-06 07:27:48,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:48,609 INFO L85 PathProgramCache]: Analyzing trace with hash 860157959, now seen corresponding path program 1 times [2022-12-06 07:27:48,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:48,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21735193] [2022-12-06 07:27:48,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:48,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:48,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-06 07:27:48,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:48,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21735193] [2022-12-06 07:27:48,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21735193] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:48,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:48,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:48,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782492386] [2022-12-06 07:27:48,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:48,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:48,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:48,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:48,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:48,669 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:48,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:48,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:48,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:48,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:48,705 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:48,705 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:48,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:48,706 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:48,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:48,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:48,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:48,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:48,706 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:48,706 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:48,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:48,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:48,707 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:48,707 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:48,707 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:48,707 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:48,707 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:48,708 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:48,708 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:48,708 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:48,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:48,710 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:48,710 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:48,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:48,710 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:48,710 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:48,782 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:48,783 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:48,783 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:48,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:48,783 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:48,783 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:48,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable732 [2022-12-06 07:27:48,783 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-06 07:27:48,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:48,784 INFO L85 PathProgramCache]: Analyzing trace with hash 890634152, now seen corresponding path program 1 times [2022-12-06 07:27:48,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:48,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614327096] [2022-12-06 07:27:48,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:48,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:48,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-06 07:27:48,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:48,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614327096] [2022-12-06 07:27:48,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614327096] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:48,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:48,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:48,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836251255] [2022-12-06 07:27:48,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:48,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:48,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:48,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:48,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:48,840 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:48,840 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:48,840 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:48,840 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:48,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:48,876 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:48,876 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:48,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:48,876 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:48,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:48,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:48,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:48,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:48,877 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:48,877 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:48,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:48,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:48,878 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:48,878 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:48,878 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:48,878 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:48,878 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:48,878 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:48,878 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:48,878 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:48,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:48,880 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:48,880 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:48,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:48,881 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:48,881 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:48,958 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:48,958 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:27:48,958 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:48,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:48,959 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:48,959 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:48,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable733 [2022-12-06 07:27:48,959 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-06 07:27:48,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:48,959 INFO L85 PathProgramCache]: Analyzing trace with hash 917416261, now seen corresponding path program 1 times [2022-12-06 07:27:48,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:48,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56346518] [2022-12-06 07:27:48,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:48,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:49,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:49,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:49,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56346518] [2022-12-06 07:27:49,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56346518] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:49,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:49,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:49,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891529526] [2022-12-06 07:27:49,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:49,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:49,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:49,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:49,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:49,026 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:49,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:49,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:49,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:49,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:49,062 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:49,062 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:49,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:49,063 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:49,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:49,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:49,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:49,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:49,063 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:49,063 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:49,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:49,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:49,064 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:49,064 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:49,064 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:49,064 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:49,064 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:49,064 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:49,064 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:49,064 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:49,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:49,067 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:49,067 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:49,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:49,067 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:49,067 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:49,138 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:49,138 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:27:49,139 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:49,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:49,139 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:49,139 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:49,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable734 [2022-12-06 07:27:49,139 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-06 07:27:49,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:49,139 INFO L85 PathProgramCache]: Analyzing trace with hash 947892454, now seen corresponding path program 1 times [2022-12-06 07:27:49,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:49,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72805913] [2022-12-06 07:27:49,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:49,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:49,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-06 07:27:49,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:49,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72805913] [2022-12-06 07:27:49,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72805913] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:49,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:49,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:49,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411405911] [2022-12-06 07:27:49,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:49,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:49,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:49,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:49,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:49,200 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:49,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:49,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:49,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:49,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:49,242 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:49,243 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:49,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:49,243 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:49,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:49,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:49,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:49,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:49,244 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:49,244 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:49,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:49,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:49,244 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:49,244 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:49,244 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:49,245 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:49,245 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:49,245 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:49,245 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:49,245 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:49,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:49,247 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:49,247 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:49,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:49,247 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:49,247 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:49,320 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:49,320 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:49,320 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:49,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:49,321 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:49,321 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:49,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable735 [2022-12-06 07:27:49,321 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-06 07:27:49,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:49,321 INFO L85 PathProgramCache]: Analyzing trace with hash 974674563, now seen corresponding path program 1 times [2022-12-06 07:27:49,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:49,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698338413] [2022-12-06 07:27:49,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:49,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:49,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-06 07:27:49,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:49,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698338413] [2022-12-06 07:27:49,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698338413] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:49,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:49,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:49,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711384568] [2022-12-06 07:27:49,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:49,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:49,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:49,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:49,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:49,381 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:49,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:49,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:49,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:49,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:49,422 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:49,422 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:49,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 372 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:49,423 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:49,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:49,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:49,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:49,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:49,423 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:49,423 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:49,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:49,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:49,424 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:49,424 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:49,424 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:49,424 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:49,424 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:49,424 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:49,424 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:49,424 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:49,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:49,427 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:49,427 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:49,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:49,427 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:49,427 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:49,499 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:49,500 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:49,500 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:49,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:49,500 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:49,500 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:49,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable736 [2022-12-06 07:27:49,500 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-06 07:27:49,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:49,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1005150756, now seen corresponding path program 1 times [2022-12-06 07:27:49,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:49,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942513563] [2022-12-06 07:27:49,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:49,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:49,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-06 07:27:49,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:49,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942513563] [2022-12-06 07:27:49,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942513563] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:49,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:49,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:49,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177464282] [2022-12-06 07:27:49,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:49,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:49,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:49,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:49,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:49,556 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:49,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:49,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:49,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:49,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:49,592 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:49,592 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:49,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:49,592 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:49,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:49,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:49,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:49,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:49,593 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:49,593 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:49,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:49,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:49,594 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:49,594 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:49,594 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:49,594 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:49,594 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:49,594 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:49,594 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:49,594 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:49,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:49,596 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:49,597 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:49,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:49,597 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:49,597 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:49,669 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:49,669 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:49,669 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:49,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:49,669 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:49,669 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:49,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable737 [2022-12-06 07:27:49,669 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-06 07:27:49,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:49,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1031932865, now seen corresponding path program 1 times [2022-12-06 07:27:49,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:49,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467812536] [2022-12-06 07:27:49,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:49,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:49,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-06 07:27:49,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:49,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467812536] [2022-12-06 07:27:49,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467812536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:49,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:49,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:49,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341468192] [2022-12-06 07:27:49,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:49,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:49,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:49,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:49,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:49,729 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:49,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:49,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:49,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:49,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:49,771 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:49,771 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:49,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:49,771 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:49,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:49,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:49,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:49,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:49,772 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:49,772 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:49,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:49,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:49,773 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:49,773 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:49,773 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:49,773 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:49,773 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:49,773 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:49,773 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:49,773 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:49,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:49,776 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:49,776 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:49,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:49,776 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:49,776 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:49,849 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:49,850 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:49,850 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:49,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:49,850 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:49,850 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:49,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable738 [2022-12-06 07:27:49,850 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-06 07:27:49,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:49,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1062409058, now seen corresponding path program 1 times [2022-12-06 07:27:49,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:49,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444432749] [2022-12-06 07:27:49,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:49,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:49,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-06 07:27:49,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:49,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444432749] [2022-12-06 07:27:49,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444432749] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:49,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:49,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:49,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848683382] [2022-12-06 07:27:49,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:49,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:49,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:49,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:49,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:49,913 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:49,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:49,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:49,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:49,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:49,954 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:49,954 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:49,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:49,955 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:49,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:49,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:49,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:49,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:49,955 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:49,955 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:49,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:49,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:49,956 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:49,956 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:49,956 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:49,956 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:49,956 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:49,956 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:49,957 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:49,957 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:49,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:49,959 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:49,959 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:49,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:49,959 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:49,959 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:50,033 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:50,033 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:50,033 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:50,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:50,033 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:50,033 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:50,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable739 [2022-12-06 07:27:50,034 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-06 07:27:50,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:50,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1089191167, now seen corresponding path program 1 times [2022-12-06 07:27:50,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:50,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976837197] [2022-12-06 07:27:50,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:50,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:50,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-06 07:27:50,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:50,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976837197] [2022-12-06 07:27:50,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976837197] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:50,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:50,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:50,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528088942] [2022-12-06 07:27:50,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:50,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:50,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:50,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:50,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:50,092 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:50,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:50,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:50,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:50,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:50,133 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:50,133 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:50,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:50,133 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:50,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:50,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:50,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:50,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:50,134 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:50,134 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:50,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:50,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:50,135 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:50,135 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:50,135 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:50,135 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:50,135 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:50,135 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:50,135 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:50,135 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:50,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:50,138 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:50,138 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:50,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:50,138 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:50,138 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:50,210 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:50,210 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:50,210 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:50,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:50,210 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:50,211 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:50,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable740 [2022-12-06 07:27:50,211 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-06 07:27:50,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:50,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1119667360, now seen corresponding path program 1 times [2022-12-06 07:27:50,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:50,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290942303] [2022-12-06 07:27:50,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:50,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:50,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:50,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-06 07:27:50,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:50,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290942303] [2022-12-06 07:27:50,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290942303] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:50,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:50,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:50,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141297304] [2022-12-06 07:27:50,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:50,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:50,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:50,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:50,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:50,269 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:50,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:50,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:50,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:50,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:50,312 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:50,312 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:50,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 356 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:50,313 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:50,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:50,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:50,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:50,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:50,313 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:50,313 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:50,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:50,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:50,314 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:50,314 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:50,314 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:50,314 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:50,314 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:50,314 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:50,314 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:50,314 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:50,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:50,317 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:50,317 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:50,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 118 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:50,317 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:50,317 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:50,392 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:50,392 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:27:50,392 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:50,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:50,393 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:50,393 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:50,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable741 [2022-12-06 07:27:50,393 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-06 07:27:50,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:50,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1146449469, now seen corresponding path program 1 times [2022-12-06 07:27:50,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:50,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219671932] [2022-12-06 07:27:50,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:50,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:50,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-06 07:27:50,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:50,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219671932] [2022-12-06 07:27:50,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219671932] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:50,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:50,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:50,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107667652] [2022-12-06 07:27:50,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:50,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:50,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:50,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:50,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:50,474 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:50,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:50,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:50,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:50,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:50,516 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:50,517 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:50,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 373 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:50,517 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:50,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:50,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:50,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:50,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:50,518 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:50,518 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:50,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:50,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:50,519 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:50,519 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:50,519 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:50,519 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:50,519 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:50,520 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:50,520 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:50,520 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:50,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:50,523 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:50,523 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:50,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:50,523 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:50,523 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:50,613 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:50,614 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 07:27:50,614 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:50,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:50,614 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:50,614 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:50,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable742 [2022-12-06 07:27:50,614 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-06 07:27:50,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:50,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1176925662, now seen corresponding path program 1 times [2022-12-06 07:27:50,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:50,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082488117] [2022-12-06 07:27:50,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:50,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:50,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-06 07:27:50,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:50,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082488117] [2022-12-06 07:27:50,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082488117] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:50,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:50,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:50,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096118784] [2022-12-06 07:27:50,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:50,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:50,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:50,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:50,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:50,678 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:50,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:50,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:50,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:50,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:50,722 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:50,722 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:50,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:50,723 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:50,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:50,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:50,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:50,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:50,723 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:50,723 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:50,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:50,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:50,724 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:50,724 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:50,724 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:50,724 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:50,724 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:50,724 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:50,724 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:50,725 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:50,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:50,727 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:50,727 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:50,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:50,727 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:50,727 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:50,801 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:50,802 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:27:50,802 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:50,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:50,802 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:50,802 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:50,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable743 [2022-12-06 07:27:50,802 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-06 07:27:50,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:50,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1203707771, now seen corresponding path program 1 times [2022-12-06 07:27:50,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:50,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409082466] [2022-12-06 07:27:50,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:50,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27: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-06 07:27:50,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:50,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409082466] [2022-12-06 07:27:50,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409082466] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:50,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:50,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:50,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314526454] [2022-12-06 07:27:50,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:50,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:50,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:50,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:50,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:50,867 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:50,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:50,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:50,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:50,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:50,903 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:50,903 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:50,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:50,904 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:50,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:50,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:50,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:50,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:50,904 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:50,904 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:50,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:50,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:50,905 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:50,905 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:50,905 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:50,905 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:50,905 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:50,905 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:50,905 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:50,906 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:50,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:50,909 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:50,909 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:50,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:50,909 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:50,909 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:50,995 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:50,996 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-06 07:27:50,996 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:50,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:50,996 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:50,996 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:50,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable744 [2022-12-06 07:27:50,996 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-06 07:27:50,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:50,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1234183964, now seen corresponding path program 1 times [2022-12-06 07:27:50,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:50,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366592101] [2022-12-06 07:27:50,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:50,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:51,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:51,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-06 07:27:51,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:51,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366592101] [2022-12-06 07:27:51,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366592101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:51,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:51,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:51,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745779867] [2022-12-06 07:27:51,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:51,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:51,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:51,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:51,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:51,072 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:51,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:51,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:51,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:51,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:51,114 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:51,114 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:51,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:51,115 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:51,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:51,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:51,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:51,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:51,115 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:51,115 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:51,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:51,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:51,116 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:51,116 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:51,116 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:51,117 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:51,117 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:51,117 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:51,117 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:51,117 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:51,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:51,120 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:51,120 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:51,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:51,120 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:51,121 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:51,209 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:51,210 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-06 07:27:51,210 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:51,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:51,210 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:51,210 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:51,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable745 [2022-12-06 07:27:51,210 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-06 07:27:51,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:51,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1260966073, now seen corresponding path program 1 times [2022-12-06 07:27:51,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:51,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841786606] [2022-12-06 07:27:51,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:51,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:51,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-06 07:27:51,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:51,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841786606] [2022-12-06 07:27:51,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841786606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:51,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:51,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:51,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829491223] [2022-12-06 07:27:51,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:51,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:51,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:51,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:51,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:51,288 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:51,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:51,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:51,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:51,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:51,337 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:51,338 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:51,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:51,338 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:51,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:51,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:51,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:51,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:51,339 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:51,339 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:51,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:51,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:51,340 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:51,340 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:51,340 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:51,340 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:51,341 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:51,341 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:51,341 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:51,341 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:51,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:51,344 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:51,344 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:51,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:51,344 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:51,344 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:51,435 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:51,435 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 07:27:51,436 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:51,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:51,436 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:51,436 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:51,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable746 [2022-12-06 07:27:51,436 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-06 07:27:51,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:51,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1291442266, now seen corresponding path program 1 times [2022-12-06 07:27:51,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:51,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171034612] [2022-12-06 07:27:51,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:51,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:51,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-06 07:27:51,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:51,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171034612] [2022-12-06 07:27:51,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171034612] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:51,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:51,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:51,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081774149] [2022-12-06 07:27:51,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:51,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:51,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:51,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:51,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:51,500 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:51,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:51,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:51,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:51,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:51,535 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:51,535 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:51,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:51,536 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:51,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:51,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:51,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:51,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:51,536 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:51,536 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:51,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:51,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:51,537 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:51,537 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:51,537 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:51,537 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:51,537 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:51,538 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:51,538 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:51,538 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:51,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:51,540 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:51,540 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:51,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:51,540 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:51,540 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:51,614 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:51,614 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:51,614 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:51,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:51,615 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:51,615 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:51,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable747 [2022-12-06 07:27:51,615 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-06 07:27:51,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:51,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1318224375, now seen corresponding path program 1 times [2022-12-06 07:27:51,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:51,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484080767] [2022-12-06 07:27:51,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:51,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:51,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:51,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-06 07:27:51,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:51,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484080767] [2022-12-06 07:27:51,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484080767] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:51,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:51,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:51,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111474139] [2022-12-06 07:27:51,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:51,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:51,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:51,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:51,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:51,685 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:51,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:51,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:51,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:51,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:51,720 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:51,720 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:51,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 373 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:51,720 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:51,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:51,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:51,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:51,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:51,721 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:51,721 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:51,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:51,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:51,722 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:51,722 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:51,722 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:51,722 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:51,722 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:51,722 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:51,722 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:51,722 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:51,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:51,724 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:51,725 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:51,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:51,725 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:51,725 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:51,799 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:51,800 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:27:51,800 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:51,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:51,800 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:51,800 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:51,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable748 [2022-12-06 07:27:51,800 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-06 07:27:51,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:51,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1348700568, now seen corresponding path program 1 times [2022-12-06 07:27:51,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:51,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228745520] [2022-12-06 07:27:51,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:51,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:51,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-06 07:27:51,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:51,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228745520] [2022-12-06 07:27:51,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228745520] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:51,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:51,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:51,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535052752] [2022-12-06 07:27:51,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:51,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:51,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:51,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:51,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:51,856 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:51,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:51,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:51,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:51,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:51,892 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:51,892 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:51,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:51,893 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:51,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:51,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:51,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:51,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:51,893 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:51,893 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:51,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:51,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:51,894 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:51,894 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:51,894 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:51,894 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:51,894 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:51,894 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:51,895 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:51,895 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:51,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:51,897 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:51,897 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:51,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:51,897 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:51,897 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:51,968 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:51,968 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:27:51,969 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:51,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:51,969 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:51,969 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:51,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable749 [2022-12-06 07:27:51,969 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-06 07:27:51,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:51,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1375482677, now seen corresponding path program 1 times [2022-12-06 07:27:51,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:51,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362805466] [2022-12-06 07:27:51,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:51,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:52,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-06 07:27:52,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:52,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362805466] [2022-12-06 07:27:52,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362805466] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:52,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:52,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:52,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058301366] [2022-12-06 07:27:52,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:52,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:52,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:52,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:52,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:52,030 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:52,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:52,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:52,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:52,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:52,066 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:52,066 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:52,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:52,066 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:52,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:52,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:52,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:52,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:52,067 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:52,067 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:52,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:52,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:52,068 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:52,068 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:52,068 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:52,068 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:52,068 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:52,068 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:52,068 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:52,068 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:52,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:52,070 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:52,070 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:52,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:52,071 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:52,071 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:52,144 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:52,145 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:52,145 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:52,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:52,145 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:52,145 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:52,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable750 [2022-12-06 07:27:52,145 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-06 07:27:52,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:52,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1405958870, now seen corresponding path program 1 times [2022-12-06 07:27:52,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:52,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716317440] [2022-12-06 07:27:52,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:52,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:52,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-06 07:27:52,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:52,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716317440] [2022-12-06 07:27:52,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716317440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:52,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:52,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:52,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662558204] [2022-12-06 07:27:52,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:52,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:52,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:52,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:52,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:52,202 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:52,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:52,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:52,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:52,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:52,239 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:52,239 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:52,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:52,239 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:52,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:52,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:52,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:52,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:52,240 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:52,240 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:52,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:52,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:52,241 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:52,241 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:52,241 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:52,241 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:52,241 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:52,241 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:52,241 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:52,241 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:52,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:52,243 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:52,243 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:52,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:52,244 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:52,244 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:52,317 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:52,317 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:52,317 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:52,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:52,318 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:52,318 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:52,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable751 [2022-12-06 07:27:52,318 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-06 07:27:52,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:52,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1432740979, now seen corresponding path program 1 times [2022-12-06 07:27:52,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:52,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952875001] [2022-12-06 07:27:52,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:52,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:52,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-06 07:27:52,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:52,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952875001] [2022-12-06 07:27:52,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952875001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:52,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:52,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:52,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188987802] [2022-12-06 07:27:52,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:52,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:52,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:52,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:52,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:52,378 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:52,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:52,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:52,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:52,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:52,412 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:52,412 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:52,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 373 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:52,413 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:52,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:52,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:52,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:52,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:52,413 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:52,413 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:52,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:52,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:52,414 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:52,414 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:52,414 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:52,414 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:52,414 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:52,415 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:52,415 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:52,415 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:52,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:52,417 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:52,417 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:52,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:52,417 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:52,417 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:52,490 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:52,491 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:52,491 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:52,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:52,491 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:52,491 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:52,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable752 [2022-12-06 07:27:52,491 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-06 07:27:52,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:52,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1463217172, now seen corresponding path program 1 times [2022-12-06 07:27:52,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:52,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441974521] [2022-12-06 07:27:52,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:52,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:52,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-06 07:27:52,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:52,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441974521] [2022-12-06 07:27:52,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441974521] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:52,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:52,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:52,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773746635] [2022-12-06 07:27:52,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:52,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:52,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:52,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:52,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:52,556 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:52,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:52,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:52,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:52,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:52,598 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:52,598 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:52,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:52,599 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:52,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:52,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:52,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:52,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:52,599 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:52,599 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:52,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:52,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:52,600 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:52,600 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:52,600 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:52,600 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:52,600 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:52,600 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:52,600 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:52,601 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:52,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:52,603 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:52,603 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:52,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:52,603 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:52,603 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:52,676 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:52,677 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:52,677 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:52,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:52,677 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:52,677 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:52,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable753 [2022-12-06 07:27:52,677 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-06 07:27:52,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:52,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1489999281, now seen corresponding path program 1 times [2022-12-06 07:27:52,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:52,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883996209] [2022-12-06 07:27:52,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:52,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:52,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-06 07:27:52,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:52,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883996209] [2022-12-06 07:27:52,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883996209] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:52,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:52,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:52,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325120353] [2022-12-06 07:27:52,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:52,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:52,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:52,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:52,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:52,737 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:52,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:52,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:52,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:52,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:52,778 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:52,778 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:52,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:52,779 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:52,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:52,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:52,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:52,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:52,779 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:52,779 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:52,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:52,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:52,780 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:52,780 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:52,780 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:52,781 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:52,781 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:52,781 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:52,781 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:52,781 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:52,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:52,784 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:52,784 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:52,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:52,785 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:52,785 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:52,880 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:52,881 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 07:27:52,881 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:52,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:52,881 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:52,881 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:52,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable754 [2022-12-06 07:27:52,881 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-06 07:27:52,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:52,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1520475474, now seen corresponding path program 1 times [2022-12-06 07:27:52,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:52,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936322605] [2022-12-06 07:27:52,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:52,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:52,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:52,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-06 07:27:52,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:52,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936322605] [2022-12-06 07:27:52,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936322605] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:52,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:52,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:52,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365451953] [2022-12-06 07:27:52,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:52,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:52,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:52,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:52,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:52,939 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:52,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:52,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:52,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:52,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:52,976 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:52,976 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:52,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:52,977 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:52,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:52,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:52,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:52,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:52,977 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:52,978 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:52,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:52,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:52,978 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:52,978 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:52,978 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:52,978 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:52,979 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:52,979 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:52,979 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:52,979 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:52,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:52,981 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:52,981 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:52,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:52,981 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:52,981 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:53,053 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:53,054 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:53,054 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:53,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:53,054 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:53,054 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:53,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable755 [2022-12-06 07:27:53,054 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-06 07:27:53,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:53,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1547257583, now seen corresponding path program 1 times [2022-12-06 07:27:53,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:53,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563890018] [2022-12-06 07:27:53,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:53,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:53,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-06 07:27:53,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:53,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563890018] [2022-12-06 07:27:53,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563890018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:53,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:53,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:53,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825433556] [2022-12-06 07:27:53,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:53,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:53,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:53,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:53,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:53,114 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:53,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:53,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:53,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:53,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:53,150 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:53,150 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:53,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:53,151 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:53,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:53,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:53,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:53,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:53,151 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:53,151 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:53,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:53,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:53,152 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:53,152 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:53,152 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:53,152 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:53,152 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:53,153 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:53,153 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:53,153 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:53,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:53,155 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:53,155 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:53,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:53,155 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:53,155 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:53,227 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:53,227 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:53,227 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:53,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:53,228 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:53,228 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:53,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable756 [2022-12-06 07:27:53,228 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-06 07:27:53,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:53,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1577733776, now seen corresponding path program 1 times [2022-12-06 07:27:53,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:53,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081331040] [2022-12-06 07:27:53,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:53,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:53,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-06 07:27:53,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:53,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081331040] [2022-12-06 07:27:53,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081331040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:53,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:53,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:53,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117432470] [2022-12-06 07:27:53,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:53,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:53,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:53,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:53,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:53,304 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:53,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:53,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:53,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:53,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:53,358 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:53,358 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:53,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:53,359 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:53,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:53,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:53,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:53,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:53,359 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:53,359 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:53,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:53,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:53,360 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:53,361 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:53,361 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:53,361 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:53,361 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:53,361 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:53,361 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:53,361 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:53,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:53,370 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:53,371 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:53,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:53,371 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:53,371 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:53,447 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:53,448 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 07:27:53,448 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:53,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:53,448 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:53,448 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:53,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable757 [2022-12-06 07:27:53,448 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-06 07:27:53,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:53,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1604515885, now seen corresponding path program 1 times [2022-12-06 07:27:53,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:53,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865333304] [2022-12-06 07:27:53,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:53,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:53,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-06 07:27:53,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:53,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865333304] [2022-12-06 07:27:53,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865333304] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:53,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:53,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:53,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986879114] [2022-12-06 07:27:53,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:53,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:53,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:53,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:53,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:53,510 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:53,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:53,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:53,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:53,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:53,548 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:53,548 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:53,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:53,549 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:53,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:53,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:53,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:53,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:53,549 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:53,549 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:53,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:53,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:53,550 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:53,550 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:53,550 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:53,550 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:53,550 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:53,550 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:53,550 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:53,550 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:53,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:53,553 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:53,553 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:53,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:53,553 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:53,553 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:53,625 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:53,626 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:53,626 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:53,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:53,626 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:53,626 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:53,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable758 [2022-12-06 07:27:53,626 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-06 07:27:53,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:53,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1634992078, now seen corresponding path program 1 times [2022-12-06 07:27:53,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:53,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995344995] [2022-12-06 07:27:53,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:53,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:53,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-06 07:27:53,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:53,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995344995] [2022-12-06 07:27:53,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995344995] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:53,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:53,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:53,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936734054] [2022-12-06 07:27:53,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:53,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:53,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:53,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:53,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:53,683 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:53,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:53,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:53,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:53,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:53,720 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:53,720 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:53,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:53,720 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:53,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:53,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:53,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:53,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:53,721 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:53,721 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:53,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:53,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:53,722 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:53,722 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:53,722 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:53,722 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:53,722 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:53,722 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:53,722 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:53,722 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:53,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:53,724 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:53,724 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:53,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:53,725 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:53,725 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:53,797 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:53,798 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:53,798 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:53,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:53,798 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:53,798 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:53,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable759 [2022-12-06 07:27:53,798 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-06 07:27:53,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:53,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1661774187, now seen corresponding path program 1 times [2022-12-06 07:27:53,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:53,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64045436] [2022-12-06 07:27:53,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:53,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:53,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:53,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:53,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:53,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64045436] [2022-12-06 07:27:53,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64045436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:53,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:53,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:53,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584338995] [2022-12-06 07:27:53,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:53,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:53,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:53,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:53,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:53,859 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:53,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:53,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:53,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:53,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:53,900 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:53,900 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:53,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:53,900 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:53,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:53,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:53,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:53,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:53,901 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:53,901 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:53,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:53,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:53,901 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:53,901 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:53,902 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:53,902 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:53,902 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:53,902 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:53,902 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:53,902 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:53,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:53,905 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:53,905 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:53,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:53,906 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:53,906 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:53,988 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:53,989 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 07:27:53,989 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:53,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:53,989 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:53,989 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:53,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable760 [2022-12-06 07:27:53,989 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-06 07:27:53,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:53,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1692250380, now seen corresponding path program 1 times [2022-12-06 07:27:53,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:53,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811204016] [2022-12-06 07:27:53,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:53,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:53,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:54,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-06 07:27:54,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:54,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811204016] [2022-12-06 07:27:54,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811204016] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:54,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:54,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:54,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838881271] [2022-12-06 07:27:54,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:54,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:54,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:54,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:54,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:54,048 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:54,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:54,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:54,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:54,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:54,090 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:54,090 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:54,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:54,090 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:54,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:54,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:54,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:54,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:54,091 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:54,091 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:54,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:54,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:54,092 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:54,092 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:54,092 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:54,092 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:54,092 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:54,092 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:54,092 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:54,092 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:54,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:54,095 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:54,095 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:54,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:54,095 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:54,095 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:54,165 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:54,166 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:27:54,166 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:54,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:54,166 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:54,166 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:54,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable761 [2022-12-06 07:27:54,166 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-06 07:27:54,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:54,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1719032489, now seen corresponding path program 1 times [2022-12-06 07:27:54,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:54,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908195772] [2022-12-06 07:27:54,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:54,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:54,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-06 07:27:54,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:54,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908195772] [2022-12-06 07:27:54,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908195772] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:54,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:54,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:54,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284135717] [2022-12-06 07:27:54,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:54,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:54,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:54,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:54,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:54,234 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:54,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:54,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:54,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:54,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:54,272 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:54,272 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:54,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 371 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:54,273 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:54,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:54,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:54,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:54,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:54,273 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:54,273 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:54,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:54,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:54,274 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:54,274 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:54,274 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:54,274 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:54,274 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:54,275 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:54,275 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:54,275 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:54,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:54,277 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:54,277 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:54,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:54,277 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:54,277 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:54,350 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:54,351 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:54,351 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:54,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:54,351 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:54,351 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:54,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable762 [2022-12-06 07:27:54,351 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-06 07:27:54,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:54,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1749508682, now seen corresponding path program 1 times [2022-12-06 07:27:54,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:54,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213597871] [2022-12-06 07:27:54,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:54,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:54,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-06 07:27:54,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:54,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213597871] [2022-12-06 07:27:54,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213597871] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:54,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:54,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:54,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723647009] [2022-12-06 07:27:54,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:54,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:54,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:54,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:54,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:54,411 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:54,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:54,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:54,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:54,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:54,453 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:54,453 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:54,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:54,454 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:54,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:54,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:54,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:54,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:54,454 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:54,454 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:54,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:54,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:54,455 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:54,455 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:54,455 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:54,455 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:54,455 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:54,456 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:54,456 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:54,456 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:54,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:54,459 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:54,459 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:54,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:54,459 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:54,460 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:54,539 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:54,540 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 07:27:54,540 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:54,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:54,540 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:54,540 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:54,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable763 [2022-12-06 07:27:54,540 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-06 07:27:54,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:54,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1776290791, now seen corresponding path program 1 times [2022-12-06 07:27:54,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:54,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116776255] [2022-12-06 07:27:54,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:54,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:54,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-06 07:27:54,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:54,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116776255] [2022-12-06 07:27:54,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116776255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:54,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:54,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:54,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314288007] [2022-12-06 07:27:54,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:54,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:54,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:54,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:54,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:54,599 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:54,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:54,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:54,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:54,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:54,633 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:54,633 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:54,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 373 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:54,634 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:54,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:54,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:54,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:54,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:54,634 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:54,634 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:54,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:54,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:54,635 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:54,635 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:54,635 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:54,636 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:54,636 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:54,636 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:54,636 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:54,636 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:54,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:54,638 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:54,638 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:54,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:54,638 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:54,638 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:54,712 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:54,712 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:54,712 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:54,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:54,713 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:54,713 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:54,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable764 [2022-12-06 07:27:54,713 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-06 07:27:54,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:54,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1806766984, now seen corresponding path program 1 times [2022-12-06 07:27:54,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:54,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356064363] [2022-12-06 07:27:54,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:54,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:54,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-06 07:27:54,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:54,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356064363] [2022-12-06 07:27:54,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356064363] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:54,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:54,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:54,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409815510] [2022-12-06 07:27:54,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:54,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:54,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:54,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:54,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:54,781 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:54,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:54,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:54,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:54,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:54,823 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:54,823 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:54,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:54,824 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:54,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:54,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:54,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:54,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:54,824 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:54,824 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:54,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:54,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:54,825 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:54,825 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:54,825 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:54,825 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:54,825 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:54,825 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:54,825 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:54,826 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:54,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:54,828 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:54,828 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:54,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:54,828 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:54,828 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:54,901 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:54,902 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:54,902 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:54,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:54,902 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:54,902 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:54,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable765 [2022-12-06 07:27:54,902 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-06 07:27:54,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:54,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1833549093, now seen corresponding path program 1 times [2022-12-06 07:27:54,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:54,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821577005] [2022-12-06 07:27:54,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:54,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:54,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-06 07:27:54,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:54,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821577005] [2022-12-06 07:27:54,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821577005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:54,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:54,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:54,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979647216] [2022-12-06 07:27:54,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:54,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:54,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:54,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:54,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:54,964 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:54,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:54,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:54,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:54,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:55,004 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:55,005 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:55,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:55,005 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:55,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:55,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:55,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:55,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:55,006 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:55,006 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:55,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:55,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:55,006 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:55,006 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:55,007 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:55,007 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:55,007 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:55,007 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:55,007 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:55,007 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:55,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:55,010 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:55,010 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:55,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:55,011 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:55,011 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:55,084 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:55,085 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:27:55,085 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:55,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:55,085 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:55,086 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:55,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable766 [2022-12-06 07:27:55,086 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-06 07:27:55,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:55,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1864025286, now seen corresponding path program 1 times [2022-12-06 07:27:55,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:55,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426761277] [2022-12-06 07:27:55,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:55,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:55,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-06 07:27:55,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:55,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426761277] [2022-12-06 07:27:55,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426761277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:55,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:55,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:55,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712445378] [2022-12-06 07:27:55,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:55,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:55,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:55,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:55,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:55,162 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:55,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:55,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:55,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:55,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:55,215 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:55,215 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:55,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:55,215 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:55,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:55,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:55,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:55,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:55,216 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:55,216 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:55,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:55,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:55,217 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:55,217 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:55,217 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:55,217 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:55,217 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:55,217 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:55,217 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:55,217 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:55,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:55,219 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:55,220 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:55,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:55,220 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:55,220 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:55,293 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:55,294 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:55,294 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:55,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:55,294 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:55,294 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:55,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable767 [2022-12-06 07:27:55,294 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-06 07:27:55,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:55,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1890807395, now seen corresponding path program 1 times [2022-12-06 07:27:55,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:55,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602330002] [2022-12-06 07:27:55,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:55,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:55,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:55,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:55,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602330002] [2022-12-06 07:27:55,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602330002] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:55,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:55,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:55,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638898041] [2022-12-06 07:27:55,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:55,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:55,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:55,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:55,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:55,354 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:55,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:55,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:55,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:55,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:55,388 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:55,388 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:55,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:55,389 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:55,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:55,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:55,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:55,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:55,389 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:55,389 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:55,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:55,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:55,390 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:55,390 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:55,390 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:55,390 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:55,390 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:55,391 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:55,391 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:55,391 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:55,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:55,393 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:55,393 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:55,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:55,393 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:55,393 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:55,466 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:55,466 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:55,466 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:55,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:55,466 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:55,466 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:55,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable768 [2022-12-06 07:27:55,467 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-06 07:27:55,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:55,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1921283588, now seen corresponding path program 1 times [2022-12-06 07:27:55,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:55,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170209321] [2022-12-06 07:27:55,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:55,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:55,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-06 07:27:55,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:55,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170209321] [2022-12-06 07:27:55,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170209321] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:55,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:55,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:55,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870978257] [2022-12-06 07:27:55,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:55,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:55,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:55,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:55,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:55,524 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:55,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:55,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:55,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:55,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:55,560 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:55,560 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:55,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:55,561 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:55,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:55,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:55,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:55,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:55,561 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:55,561 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:55,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:55,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:55,562 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:55,562 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:55,562 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:55,562 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:55,562 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:55,562 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:55,562 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:55,563 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:55,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:55,565 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:55,565 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:55,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:55,565 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:55,565 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:55,636 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:55,636 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:27:55,636 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:55,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:55,637 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:55,637 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:55,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable769 [2022-12-06 07:27:55,637 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-06 07:27:55,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:55,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1948065697, now seen corresponding path program 1 times [2022-12-06 07:27:55,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:55,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949882355] [2022-12-06 07:27:55,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:55,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:55,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-06 07:27:55,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:55,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949882355] [2022-12-06 07:27:55,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949882355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:55,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:55,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:55,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911691047] [2022-12-06 07:27:55,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:55,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:55,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:55,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:55,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:55,698 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:55,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:55,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:55,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:55,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:55,739 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:55,739 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:55,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:55,739 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:55,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:55,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:55,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:55,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:55,740 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:55,740 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:55,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:55,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:55,741 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:55,741 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:55,741 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:55,741 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:55,741 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:55,741 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:55,741 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:55,741 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:55,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:55,743 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:55,744 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:55,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:55,744 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:55,744 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:55,816 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:55,817 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:55,817 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:55,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:55,817 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:55,817 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:55,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable770 [2022-12-06 07:27:55,817 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-06 07:27:55,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:55,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1978541890, now seen corresponding path program 1 times [2022-12-06 07:27:55,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:55,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137824086] [2022-12-06 07:27:55,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:55,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:55,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-06 07:27:55,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:55,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137824086] [2022-12-06 07:27:55,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137824086] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:55,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:55,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:55,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807136013] [2022-12-06 07:27:55,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:55,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:55,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:55,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:55,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:55,874 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:55,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:55,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:55,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:55,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:55,909 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:55,910 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:55,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:55,910 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:55,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:55,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:55,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:55,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:55,911 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:55,911 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:55,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:55,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:55,911 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:55,911 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:55,912 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:55,912 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:55,912 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:55,912 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:55,912 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:55,912 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:55,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:55,921 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:55,921 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:55,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:55,921 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:55,921 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:55,993 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:55,993 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:27:55,993 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:55,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:55,993 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:55,993 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:55,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable771 [2022-12-06 07:27:55,993 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-06 07:27:55,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:55,994 INFO L85 PathProgramCache]: Analyzing trace with hash 2005323999, now seen corresponding path program 1 times [2022-12-06 07:27:55,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:55,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611952843] [2022-12-06 07:27:55,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:55,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:56,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-06 07:27:56,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:56,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611952843] [2022-12-06 07:27:56,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611952843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:56,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:56,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:56,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355676708] [2022-12-06 07:27:56,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:56,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:56,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:56,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:56,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:56,053 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:56,053 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:56,053 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:56,053 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:56,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:56,089 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:56,089 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:56,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:56,089 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:56,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:56,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:56,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:56,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:56,090 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:56,090 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:56,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:56,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:56,091 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:56,091 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:56,091 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:56,091 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:56,091 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:56,091 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:56,091 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:56,091 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:56,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:56,093 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:56,093 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:56,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:56,094 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:56,094 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:56,167 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:56,168 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:56,168 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:56,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:56,168 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:56,168 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:56,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable772 [2022-12-06 07:27:56,168 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-06 07:27:56,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:56,168 INFO L85 PathProgramCache]: Analyzing trace with hash 2035800192, now seen corresponding path program 1 times [2022-12-06 07:27:56,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:56,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116426607] [2022-12-06 07:27:56,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:56,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:56,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-06 07:27:56,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:56,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116426607] [2022-12-06 07:27:56,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116426607] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:56,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:56,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:56,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477417666] [2022-12-06 07:27:56,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:56,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:56,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:56,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:56,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:56,227 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:56,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:56,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:56,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:56,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:56,263 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:56,263 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:56,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 349 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:56,264 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:56,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:56,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:56,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:56,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:56,264 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:56,264 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:56,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:56,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:56,265 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:56,265 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:56,265 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:56,265 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:56,265 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:56,266 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:56,266 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:56,266 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:56,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:56,268 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:56,268 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:56,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 118 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:56,268 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:56,268 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:56,341 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:56,342 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:56,342 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:56,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:56,342 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:56,342 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:56,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable773 [2022-12-06 07:27:56,343 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-06 07:27:56,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:56,343 INFO L85 PathProgramCache]: Analyzing trace with hash 2062582301, now seen corresponding path program 1 times [2022-12-06 07:27:56,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:56,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828691617] [2022-12-06 07:27:56,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:56,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:56,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-06 07:27:56,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:56,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828691617] [2022-12-06 07:27:56,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828691617] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:56,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:56,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:56,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116906396] [2022-12-06 07:27:56,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:56,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:56,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:56,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:56,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:56,421 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:56,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:56,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:56,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:56,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:56,472 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:56,472 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:56,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:56,473 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:56,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:56,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:56,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:56,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:56,473 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:56,473 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:56,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:56,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:56,474 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:56,474 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:56,475 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:56,475 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:56,475 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:56,475 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:56,475 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:56,475 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:56,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:56,478 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:56,478 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:56,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:56,478 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:56,478 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:56,565 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:56,565 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-06 07:27:56,566 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:56,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:56,566 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:56,566 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:56,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable774 [2022-12-06 07:27:56,566 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-06 07:27:56,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:56,566 INFO L85 PathProgramCache]: Analyzing trace with hash 2093058494, now seen corresponding path program 1 times [2022-12-06 07:27:56,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:56,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790108757] [2022-12-06 07:27:56,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:56,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:56,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-06 07:27:56,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:56,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790108757] [2022-12-06 07:27:56,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790108757] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:56,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:56,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:56,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585002374] [2022-12-06 07:27:56,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:56,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:56,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:56,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:56,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:56,627 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:56,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:56,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:56,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:56,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:56,663 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:56,664 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:56,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:56,664 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:56,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:56,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:56,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:56,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:56,665 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:56,665 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:56,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:56,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:56,665 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:56,665 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:56,666 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:56,666 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:56,666 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:56,666 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:56,666 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:56,666 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:56,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:56,670 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:56,670 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:56,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:56,670 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:56,670 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:56,754 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:56,755 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 07:27:56,755 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:56,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:56,755 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:56,755 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:56,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable775 [2022-12-06 07:27:56,755 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-06 07:27:56,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:56,755 INFO L85 PathProgramCache]: Analyzing trace with hash 2119840603, now seen corresponding path program 1 times [2022-12-06 07:27:56,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:56,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306009798] [2022-12-06 07:27:56,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:56,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:56,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-06 07:27:56,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:56,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306009798] [2022-12-06 07:27:56,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306009798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:56,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:56,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:56,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445347989] [2022-12-06 07:27:56,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:56,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:56,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:56,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:56,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:56,828 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:56,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:56,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:56,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:56,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:56,869 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:56,870 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:56,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:56,870 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:56,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:56,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:56,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:56,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:56,871 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:56,871 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:56,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:56,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:56,871 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:56,871 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:56,872 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:56,872 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:56,872 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:56,872 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:56,872 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:56,872 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:56,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:56,874 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:56,874 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:56,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:56,875 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:56,875 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:56,947 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:56,948 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:56,948 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:56,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:56,948 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:56,948 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:56,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable776 [2022-12-06 07:27:56,948 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-06 07:27:56,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:56,949 INFO L85 PathProgramCache]: Analyzing trace with hash -2144650500, now seen corresponding path program 1 times [2022-12-06 07:27:56,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:56,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011679285] [2022-12-06 07:27:56,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:56,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:57,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-06 07:27:57,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:57,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011679285] [2022-12-06 07:27:57,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011679285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:57,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:57,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:57,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736073271] [2022-12-06 07:27:57,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:57,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:57,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:57,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:57,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:57,006 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:57,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:57,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:57,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:57,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:57,048 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:57,048 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:57,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 336 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:57,048 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:57,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:57,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:57,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:57,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:57,049 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:57,049 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:57,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:57,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:57,050 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:57,050 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:57,050 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:57,050 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:57,050 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:57,050 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:57,050 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:57,050 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:57,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:57,052 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:57,053 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:57,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:57,053 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:57,053 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:57,129 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:57,129 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:27:57,129 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:57,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:57,129 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:57,129 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:57,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable777 [2022-12-06 07:27:57,129 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-06 07:27:57,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:57,130 INFO L85 PathProgramCache]: Analyzing trace with hash -2117868391, now seen corresponding path program 1 times [2022-12-06 07:27:57,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:57,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035051103] [2022-12-06 07:27:57,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:57,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:57,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-06 07:27:57,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:57,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035051103] [2022-12-06 07:27:57,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035051103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:57,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:57,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:57,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644459002] [2022-12-06 07:27:57,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:57,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:57,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:57,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:57,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:57,207 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:57,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:57,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:57,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:57,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:57,244 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:57,244 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:57,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:57,244 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:57,244 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:57,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:57,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:57,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:57,245 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:57,245 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:57,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:57,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:57,246 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:57,246 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:57,246 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:57,246 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:57,246 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:57,246 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:57,246 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:57,246 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:57,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:57,249 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:57,249 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:57,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:57,249 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:57,249 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:57,323 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:57,323 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:57,323 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:57,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:57,323 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:57,323 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:57,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable778 [2022-12-06 07:27:57,324 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-06 07:27:57,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:57,324 INFO L85 PathProgramCache]: Analyzing trace with hash -2087392198, now seen corresponding path program 1 times [2022-12-06 07:27:57,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:57,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462266963] [2022-12-06 07:27:57,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:57,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:57,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-06 07:27:57,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:57,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462266963] [2022-12-06 07:27:57,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462266963] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:57,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:57,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:57,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150044026] [2022-12-06 07:27:57,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:57,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:57,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:57,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:57,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:57,382 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:57,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:57,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:57,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:57,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:57,423 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:57,423 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:57,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:57,423 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:57,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:57,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:57,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:57,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:57,424 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:57,424 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:57,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:57,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:57,425 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:57,425 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:57,425 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:57,425 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:57,425 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:57,425 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:57,425 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:57,425 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:57,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:57,427 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:57,427 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:57,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:57,428 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:57,428 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:57,501 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:57,502 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:57,502 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:57,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:57,502 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:57,502 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:57,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable779 [2022-12-06 07:27:57,502 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-06 07:27:57,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:57,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2060610089, now seen corresponding path program 1 times [2022-12-06 07:27:57,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:57,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37696707] [2022-12-06 07:27:57,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:57,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:57,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-06 07:27:57,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:57,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37696707] [2022-12-06 07:27:57,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37696707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:57,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:57,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:57,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732917848] [2022-12-06 07:27:57,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:57,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:57,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:57,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:57,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:57,562 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:57,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:57,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:57,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:57,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:57,603 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:57,603 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:57,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:57,604 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:57,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:57,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:57,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:57,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:57,604 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:57,604 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:57,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:57,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:57,605 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:57,605 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:57,605 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:57,605 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:57,605 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:57,605 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:57,605 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:57,605 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:57,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:57,608 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:57,608 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:57,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:57,608 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:57,608 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:57,680 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:57,680 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:27:57,680 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:57,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:57,680 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:57,680 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:57,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable780 [2022-12-06 07:27:57,680 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-06 07:27:57,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:57,681 INFO L85 PathProgramCache]: Analyzing trace with hash -2030133896, now seen corresponding path program 1 times [2022-12-06 07:27:57,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:57,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115137976] [2022-12-06 07:27:57,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:57,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:57,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-06 07:27:57,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:57,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115137976] [2022-12-06 07:27:57,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115137976] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:57,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:57,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:57,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689561685] [2022-12-06 07:27:57,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:57,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:57,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:57,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:57,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:57,749 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:57,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:57,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:57,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:57,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:57,786 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:57,786 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:57,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:57,787 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:57,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:57,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:57,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:57,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:57,787 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:57,787 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:57,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:57,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:57,788 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:57,788 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:57,788 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:57,788 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:57,788 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:57,788 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:57,789 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:57,789 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:57,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:57,791 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:57,791 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:57,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:57,791 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:57,791 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:57,864 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:57,865 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:57,865 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:57,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:57,865 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:57,865 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:57,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable781 [2022-12-06 07:27:57,865 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-06 07:27:57,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:57,866 INFO L85 PathProgramCache]: Analyzing trace with hash -2003351787, now seen corresponding path program 1 times [2022-12-06 07:27:57,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:57,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089603039] [2022-12-06 07:27:57,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:57,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:57,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:57,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:57,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089603039] [2022-12-06 07:27:57,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089603039] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:57,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:57,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:57,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997383110] [2022-12-06 07:27:57,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:57,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:57,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:57,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:57,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:57,943 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:57,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:57,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:57,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:57,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:57,986 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:57,986 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:57,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:57,987 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:57,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:57,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:57,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:57,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:57,987 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:57,987 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:57,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:57,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:57,988 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:57,989 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:57,989 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:57,989 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:57,989 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:57,989 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:57,989 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:57,989 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:57,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:57,992 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:57,993 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:57,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:57,993 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:57,993 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:58,082 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:58,083 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 07:27:58,083 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:58,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:58,083 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:58,083 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:58,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable782 [2022-12-06 07:27:58,084 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-06 07:27:58,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:58,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1972875594, now seen corresponding path program 1 times [2022-12-06 07:27:58,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:58,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438590527] [2022-12-06 07:27:58,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:58,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:58,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-06 07:27:58,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:58,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438590527] [2022-12-06 07:27:58,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438590527] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:58,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:58,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:58,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378523894] [2022-12-06 07:27:58,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:58,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:58,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:58,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:58,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:58,155 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:58,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:58,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:58,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:58,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:58,204 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:58,204 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:58,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:58,205 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:58,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:58,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:58,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:58,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:58,205 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:58,206 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:58,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:58,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:58,206 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:58,207 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:58,207 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:58,207 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:58,207 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:58,207 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:58,207 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:58,207 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:58,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:58,210 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:58,210 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:58,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:58,211 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:58,211 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:58,300 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:58,300 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-06 07:27:58,300 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:58,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:58,301 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:58,301 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:58,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable783 [2022-12-06 07:27:58,301 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-06 07:27:58,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:58,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1946093485, now seen corresponding path program 1 times [2022-12-06 07:27:58,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:58,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116294658] [2022-12-06 07:27:58,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:58,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:58,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-06 07:27:58,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:58,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116294658] [2022-12-06 07:27:58,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116294658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:58,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:58,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:58,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737372779] [2022-12-06 07:27:58,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:58,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:58,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:58,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:58,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:58,380 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:58,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:58,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:58,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:58,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:58,435 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:58,435 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:58,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:58,436 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:58,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:58,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:58,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:58,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:58,437 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:58,437 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:58,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:58,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:58,438 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:58,438 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:58,438 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:58,438 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:58,438 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:58,438 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:58,439 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:58,439 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:58,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:58,441 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:58,442 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:58,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:58,442 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:58,442 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:58,525 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:58,526 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 07:27:58,526 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:58,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:58,526 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:58,526 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:58,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable784 [2022-12-06 07:27:58,526 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-06 07:27:58,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:58,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1915617292, now seen corresponding path program 1 times [2022-12-06 07:27:58,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:58,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432677528] [2022-12-06 07:27:58,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:58,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:58,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-06 07:27:58,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:58,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432677528] [2022-12-06 07:27:58,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432677528] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:58,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:58,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:58,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782236446] [2022-12-06 07:27:58,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:58,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:58,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:58,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:58,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:58,608 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:58,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:58,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:58,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:58,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:58,661 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:58,661 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:58,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:58,661 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:58,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:58,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:58,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:58,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:58,662 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:58,662 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:58,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:58,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:58,663 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:58,664 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:58,664 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:58,664 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:58,664 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:58,664 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:58,664 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:58,664 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:58,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:58,674 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:58,674 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:58,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:58,674 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:58,675 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:58,764 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:58,765 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-06 07:27:58,765 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:58,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:58,765 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:58,765 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:58,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable785 [2022-12-06 07:27:58,765 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-06 07:27:58,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:58,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1888835183, now seen corresponding path program 1 times [2022-12-06 07:27:58,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:58,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475542061] [2022-12-06 07:27:58,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:58,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:58,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-06 07:27:58,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:58,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475542061] [2022-12-06 07:27:58,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475542061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:58,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:58,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:58,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324346420] [2022-12-06 07:27:58,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:58,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:58,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:58,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:58,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:58,843 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:58,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:58,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:58,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:58,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:58,885 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:58,885 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:58,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:58,886 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:58,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:58,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:58,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:58,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:58,887 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:58,887 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:58,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:58,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:58,888 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:58,888 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:58,888 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:58,888 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:58,888 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:58,888 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:58,888 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:58,888 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:58,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:58,891 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:58,891 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:58,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:58,892 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:58,892 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:58,979 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:58,980 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-06 07:27:58,980 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:58,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:58,980 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:58,980 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:58,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable786 [2022-12-06 07:27:58,980 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-06 07:27:58,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:58,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1858358990, now seen corresponding path program 1 times [2022-12-06 07:27:58,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:58,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733225217] [2022-12-06 07:27:58,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:58,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:58,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:59,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-06 07:27:59,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:59,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733225217] [2022-12-06 07:27:59,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733225217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:59,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:59,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:59,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991004848] [2022-12-06 07:27:59,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:59,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:59,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:59,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:59,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:59,050 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:59,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:59,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:59,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:59,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:59,086 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:59,086 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:59,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:59,087 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:59,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:59,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:59,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:59,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:59,087 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:59,087 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:59,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:59,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:59,088 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:59,088 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:59,088 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:59,088 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:59,088 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:59,089 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:59,089 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:59,089 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:59,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:59,091 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:59,091 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:59,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:59,091 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:59,091 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:59,167 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:59,167 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:27:59,167 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:59,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:59,167 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:59,168 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:59,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable787 [2022-12-06 07:27:59,168 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-06 07:27:59,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:59,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1831576881, now seen corresponding path program 1 times [2022-12-06 07:27:59,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:59,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689598448] [2022-12-06 07:27:59,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:59,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:59,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-06 07:27:59,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:59,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689598448] [2022-12-06 07:27:59,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689598448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:59,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:59,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:59,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072896326] [2022-12-06 07:27:59,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:59,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:59,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:59,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:59,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:59,230 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:59,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:59,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:59,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:59,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:59,268 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:59,268 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:59,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:59,268 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:59,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:59,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:59,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:59,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:59,269 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:59,269 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:59,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:59,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:59,270 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:59,270 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:59,270 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:59,270 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:59,270 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:59,270 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:59,270 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:59,270 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:59,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:59,273 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:59,273 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:59,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:59,273 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:59,273 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:59,347 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:59,348 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:27:59,348 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:59,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:59,348 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:59,348 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:59,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable788 [2022-12-06 07:27:59,348 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-06 07:27:59,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:59,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1801100688, now seen corresponding path program 1 times [2022-12-06 07:27:59,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:59,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891450307] [2022-12-06 07:27:59,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:59,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:59,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-06 07:27:59,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:59,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891450307] [2022-12-06 07:27:59,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891450307] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:59,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:59,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:59,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413270518] [2022-12-06 07:27:59,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:59,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:59,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:59,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:59,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:59,408 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:59,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:59,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:59,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:59,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:59,445 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:59,445 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:27:59,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:59,446 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:59,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:59,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:59,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:59,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:59,447 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:59,447 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:59,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:59,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:59,447 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:59,447 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:59,448 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:59,448 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:59,448 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:59,448 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:59,448 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:59,448 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:59,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:59,450 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:59,450 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:59,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:59,450 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:59,450 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:59,524 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:59,525 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:27:59,525 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:59,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:59,525 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:59,525 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:59,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable789 [2022-12-06 07:27:59,525 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-06 07:27:59,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:59,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1774318579, now seen corresponding path program 1 times [2022-12-06 07:27:59,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:59,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076765479] [2022-12-06 07:27:59,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:59,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:59,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-06 07:27:59,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:59,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076765479] [2022-12-06 07:27:59,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076765479] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:59,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:59,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:59,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310309649] [2022-12-06 07:27:59,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:59,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:59,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:59,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:59,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:59,613 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:59,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:59,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:59,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:59,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:59,649 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:59,650 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:59,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 370 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:27:59,650 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:27:59,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:59,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:59,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:59,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:59,651 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:59,651 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:59,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:59,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:59,651 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:59,651 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:59,651 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:59,652 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:59,652 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:59,652 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:59,652 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:59,652 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:59,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:59,654 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:27:59,654 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:27:59,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:27:59,654 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:59,654 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:27:59,727 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:59,728 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:27:59,728 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:27:59,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:59,728 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:59,728 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:59,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable790 [2022-12-06 07:27:59,728 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-06 07:27:59,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:59,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1743842386, now seen corresponding path program 1 times [2022-12-06 07:27:59,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:59,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991064923] [2022-12-06 07:27:59,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:59,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:59,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:59,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:59,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991064923] [2022-12-06 07:27:59,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991064923] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:59,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:59,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:59,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389506002] [2022-12-06 07:27:59,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:59,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:59,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:59,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:59,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:59,786 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:59,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:59,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:59,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:59,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:59,822 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:27:59,822 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:27:59,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:27:59,823 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:27:59,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:59,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:59,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:59,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:27:59,823 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:27:59,823 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:27:59,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:27:59,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:59,824 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:59,824 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:27:59,824 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:27:59,824 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:59,824 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:59,825 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:59,825 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:59,825 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:59,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:59,828 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:27:59,828 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:27:59,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:27:59,828 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:27:59,829 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:27:59,905 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:59,905 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:27:59,905 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:27:59,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:59,906 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:59,906 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:59,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable791 [2022-12-06 07:27:59,906 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-06 07:27:59,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:59,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1717060277, now seen corresponding path program 1 times [2022-12-06 07:27:59,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:59,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435264699] [2022-12-06 07:27:59,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:59,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:59,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-06 07:27:59,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:59,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435264699] [2022-12-06 07:27:59,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435264699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:59,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:59,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:59,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318158764] [2022-12-06 07:27:59,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:59,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:59,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:59,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:59,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:59,965 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:27:59,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:59,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:59,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:27:59,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:59,999 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:27:59,999 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:27:59,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:00,000 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:00,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:00,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:00,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:00,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:00,000 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:00,000 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:00,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:00,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:00,001 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:00,001 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:00,001 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:00,001 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:00,001 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:00,001 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:00,001 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:00,002 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:00,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:00,004 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:00,004 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:00,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:00,004 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:00,004 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:00,077 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:00,077 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:00,078 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:00,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:00,078 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:00,078 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:00,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable792 [2022-12-06 07:28:00,078 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-06 07:28:00,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:00,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1686584084, now seen corresponding path program 1 times [2022-12-06 07:28:00,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:00,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19863731] [2022-12-06 07:28:00,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:00,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:00,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-06 07:28:00,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:00,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19863731] [2022-12-06 07:28:00,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19863731] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:00,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:00,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:00,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804434409] [2022-12-06 07:28:00,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:00,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:00,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:00,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:00,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:00,137 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:00,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:00,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:00,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:00,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:00,173 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:00,173 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:00,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:00,174 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:00,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:00,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:00,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:00,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:00,174 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:00,174 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:00,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:00,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:00,175 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:00,175 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:00,175 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:00,175 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:00,175 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:00,175 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:00,175 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:00,175 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:00,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:00,178 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:00,178 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:00,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:00,178 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:00,178 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:00,251 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:00,251 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:00,251 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:00,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:00,251 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:00,251 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:00,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable793 [2022-12-06 07:28:00,252 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-06 07:28:00,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:00,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1659801975, now seen corresponding path program 1 times [2022-12-06 07:28:00,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:00,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572808889] [2022-12-06 07:28:00,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:00,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:00,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-06 07:28:00,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:00,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572808889] [2022-12-06 07:28:00,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572808889] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:00,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:00,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:00,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786138001] [2022-12-06 07:28:00,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:00,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:00,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:00,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:00,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:00,313 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:00,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:00,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:00,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:00,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:00,349 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:00,349 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:00,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:00,350 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:00,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:00,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:00,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:00,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:00,350 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:00,350 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:00,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:00,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:00,351 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:00,351 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:00,351 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:00,351 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:00,351 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:00,351 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:00,351 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:00,351 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:00,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:00,354 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:00,354 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:00,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:00,354 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:00,354 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:00,426 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:00,426 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:00,426 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:00,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:00,427 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:00,427 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:00,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable794 [2022-12-06 07:28:00,427 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-06 07:28:00,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:00,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1629325782, now seen corresponding path program 1 times [2022-12-06 07:28:00,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:00,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166515840] [2022-12-06 07:28:00,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:00,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:00,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-06 07:28:00,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:00,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166515840] [2022-12-06 07:28:00,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166515840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:00,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:00,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:00,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928256900] [2022-12-06 07:28:00,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:00,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:00,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:00,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:00,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:00,516 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:00,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:00,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:00,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:00,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:00,571 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:00,572 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:00,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:00,572 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:00,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:00,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:00,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:00,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:00,573 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:00,573 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:00,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:00,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:00,573 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:00,574 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:00,574 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:00,574 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:00,574 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:00,574 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:00,574 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:00,574 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:00,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:00,577 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:00,577 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:00,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:00,578 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:00,578 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:00,651 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:00,655 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:28:00,655 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:00,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:00,655 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:00,655 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:00,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable795 [2022-12-06 07:28:00,655 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-06 07:28:00,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:00,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1602543673, now seen corresponding path program 1 times [2022-12-06 07:28:00,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:00,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446653331] [2022-12-06 07:28:00,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:00,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:00,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-06 07:28:00,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:00,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446653331] [2022-12-06 07:28:00,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446653331] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:00,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:00,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:00,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371816855] [2022-12-06 07:28:00,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:00,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:00,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:00,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:00,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:00,739 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:00,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:00,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:00,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:00,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:00,791 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:00,791 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:00,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 380 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:00,792 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:00,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:00,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:00,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:00,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:00,793 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:00,793 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:00,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:00,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:00,794 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:00,794 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:00,794 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:00,794 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:00,794 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:00,794 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:00,794 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:00,795 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:00,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:00,797 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:00,798 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:00,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:00,798 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:00,798 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:00,889 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:00,890 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:28:00,890 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:00,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:00,890 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:00,890 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:00,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable796 [2022-12-06 07:28:00,890 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-06 07:28:00,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:00,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1572067480, now seen corresponding path program 1 times [2022-12-06 07:28:00,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:00,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573066574] [2022-12-06 07:28:00,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:00,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:00,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-06 07:28:00,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:00,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573066574] [2022-12-06 07:28:00,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573066574] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:00,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:00,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:00,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186565786] [2022-12-06 07:28:00,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:00,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:00,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:00,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:00,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:00,964 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:00,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:00,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:00,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:00,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:01,012 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:01,012 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:01,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:01,013 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:01,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:01,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:01,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:01,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:01,013 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:01,014 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:01,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:01,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:01,015 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:01,015 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:01,015 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:01,015 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:01,015 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:01,015 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:01,015 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:01,015 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:01,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:01,018 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:01,019 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:01,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:01,019 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:01,019 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:01,094 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:01,095 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:28:01,095 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:01,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:01,095 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:01,095 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:01,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable797 [2022-12-06 07:28:01,095 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-06 07:28:01,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:01,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1545285371, now seen corresponding path program 1 times [2022-12-06 07:28:01,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:01,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713840080] [2022-12-06 07:28:01,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:01,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:01,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-06 07:28:01,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:01,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713840080] [2022-12-06 07:28:01,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713840080] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:01,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:01,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:01,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619360636] [2022-12-06 07:28:01,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:01,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:01,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:01,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:01,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:01,159 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:01,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:01,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:01,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:01,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:01,197 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:01,198 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:01,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:01,198 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:01,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:01,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:01,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:01,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:01,199 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:01,199 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:01,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:01,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:01,199 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:01,199 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:01,200 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:01,200 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:01,200 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:01,200 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:01,200 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:01,200 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:01,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:01,202 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:01,202 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:01,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:01,202 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:01,202 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:01,276 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:01,277 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:01,277 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:01,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:01,277 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:01,277 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:01,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable798 [2022-12-06 07:28:01,277 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-06 07:28:01,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:01,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1514809178, now seen corresponding path program 1 times [2022-12-06 07:28:01,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:01,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492680420] [2022-12-06 07:28:01,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:01,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:01,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:01,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-06 07:28:01,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:01,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492680420] [2022-12-06 07:28:01,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492680420] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:01,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:01,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:01,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065986576] [2022-12-06 07:28:01,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:01,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:01,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:01,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:01,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:01,334 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:01,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:01,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:01,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:01,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:01,377 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:01,377 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:01,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:01,377 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:01,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:01,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:01,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:01,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:01,378 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:01,378 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:01,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:01,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:01,379 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:01,379 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:01,379 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:01,379 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:01,379 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:01,379 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:01,379 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:01,379 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:01,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:01,388 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:01,388 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:01,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:01,388 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:01,388 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:01,462 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:01,463 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:28:01,463 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:01,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:01,463 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:01,463 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:01,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable799 [2022-12-06 07:28:01,463 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-06 07:28:01,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:01,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1488027069, now seen corresponding path program 1 times [2022-12-06 07:28:01,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:01,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161238474] [2022-12-06 07:28:01,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:01,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:01,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-06 07:28:01,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:01,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161238474] [2022-12-06 07:28:01,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161238474] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:01,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:01,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:01,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764508502] [2022-12-06 07:28:01,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:01,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:01,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:01,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:01,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:01,542 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:01,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:01,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:01,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:01,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:01,578 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:01,578 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:01,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:01,578 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:01,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:01,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:01,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:01,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:01,579 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:01,579 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:01,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:01,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:01,580 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:01,580 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:01,580 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:01,580 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:01,580 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:01,580 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:01,580 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:01,580 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:01,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:01,582 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:01,582 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:01,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:01,583 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:01,583 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:01,657 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:01,657 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:01,657 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:01,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:01,657 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:01,657 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:01,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable800 [2022-12-06 07:28:01,657 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-06 07:28:01,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:01,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1457550876, now seen corresponding path program 1 times [2022-12-06 07:28:01,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:01,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125947539] [2022-12-06 07:28:01,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:01,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:01,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-06 07:28:01,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:01,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125947539] [2022-12-06 07:28:01,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125947539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:01,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:01,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:01,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227336735] [2022-12-06 07:28:01,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:01,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:01,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:01,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:01,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:01,716 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:01,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:01,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:01,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:01,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:01,761 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:01,761 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:01,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:01,761 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:01,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:01,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:01,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:01,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:01,762 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:01,762 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:01,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:01,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:01,763 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:01,763 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:01,763 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:01,763 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:01,763 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:01,763 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:01,763 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:01,763 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:01,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:01,765 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:01,766 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:01,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:01,766 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:01,766 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:01,841 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:01,841 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:01,841 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:01,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:01,841 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:01,842 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:01,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable801 [2022-12-06 07:28:01,842 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-06 07:28:01,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:01,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1430768767, now seen corresponding path program 1 times [2022-12-06 07:28:01,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:01,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664090783] [2022-12-06 07:28:01,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:01,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:01,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:01,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-06 07:28:01,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:01,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664090783] [2022-12-06 07:28:01,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664090783] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:01,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:01,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:01,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075223446] [2022-12-06 07:28:01,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:01,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:01,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:01,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:01,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:01,903 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:01,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:01,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:01,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:01,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:01,939 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:01,939 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:01,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:01,940 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:01,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:01,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:01,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:01,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:01,941 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:01,941 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:01,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:01,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:01,941 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:01,941 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:01,942 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:01,942 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:01,942 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:01,942 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:01,942 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:01,942 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:01,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:01,944 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:01,944 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:01,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:01,945 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:01,945 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:02,019 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:02,019 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:02,019 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:02,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:02,020 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:02,020 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:02,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable802 [2022-12-06 07:28:02,020 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-06 07:28:02,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:02,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1400292574, now seen corresponding path program 1 times [2022-12-06 07:28:02,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:02,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617753699] [2022-12-06 07:28:02,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:02,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:02,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:02,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-06 07:28:02,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:02,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617753699] [2022-12-06 07:28:02,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617753699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:02,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:02,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:02,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916109943] [2022-12-06 07:28:02,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:02,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:02,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:02,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:02,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:02,078 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:02,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:02,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:02,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:02,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:02,120 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:02,120 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:02,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:02,121 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:02,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:02,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:02,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:02,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:02,121 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:02,121 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:02,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:02,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:02,122 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:02,122 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:02,122 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:02,122 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:02,122 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:02,122 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:02,123 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:02,123 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:02,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:02,125 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:02,125 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:02,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:02,125 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:02,125 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:02,199 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:02,200 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:02,200 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:02,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:02,200 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:02,200 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:02,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable803 [2022-12-06 07:28:02,200 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-06 07:28:02,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:02,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1373510465, now seen corresponding path program 1 times [2022-12-06 07:28:02,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:02,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730155514] [2022-12-06 07:28:02,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:02,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:02,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:02,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-06 07:28:02,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:02,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730155514] [2022-12-06 07:28:02,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730155514] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:02,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:02,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:02,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754750623] [2022-12-06 07:28:02,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:02,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:02,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:02,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:02,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:02,288 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:02,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:02,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:02,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:02,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:02,324 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:02,324 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:02,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:02,325 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:02,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:02,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:02,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:02,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:02,325 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:02,325 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:02,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:02,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:02,326 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:02,326 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:02,326 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:02,326 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:02,326 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:02,326 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:02,327 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:02,327 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:02,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:02,329 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:02,329 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:02,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:02,329 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:02,329 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:02,403 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:02,404 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:02,404 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:02,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:02,404 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:02,404 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:02,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable804 [2022-12-06 07:28:02,404 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-06 07:28:02,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:02,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1343034272, now seen corresponding path program 1 times [2022-12-06 07:28:02,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:02,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598317277] [2022-12-06 07:28:02,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:02,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:02,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-06 07:28:02,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:02,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598317277] [2022-12-06 07:28:02,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598317277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:02,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:02,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:02,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729655199] [2022-12-06 07:28:02,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:02,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:02,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:02,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:02,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:02,463 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:02,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:02,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:02,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:02,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:02,501 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:02,501 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:02,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:02,501 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:02,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:02,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:02,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:02,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:02,502 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:02,502 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:02,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:02,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:02,503 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:02,503 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:02,503 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:02,503 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:02,503 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:02,503 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:02,503 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:02,503 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:02,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:02,505 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:02,505 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:02,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:02,506 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:02,506 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:02,579 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:02,579 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:02,580 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:02,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:02,580 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:02,580 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:02,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable805 [2022-12-06 07:28:02,580 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-06 07:28:02,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:02,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1316252163, now seen corresponding path program 1 times [2022-12-06 07:28:02,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:02,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887861898] [2022-12-06 07:28:02,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:02,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:02,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-06 07:28:02,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:02,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887861898] [2022-12-06 07:28:02,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887861898] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:02,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:02,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:02,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056555338] [2022-12-06 07:28:02,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:02,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:02,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:02,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:02,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:02,640 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:02,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:02,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:02,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:02,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:02,680 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:02,680 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:02,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:02,680 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:02,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:02,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:02,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:02,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:02,681 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:02,681 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:02,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:02,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:02,682 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:02,682 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:02,682 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:02,682 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:02,682 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:02,682 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:02,682 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:02,682 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:02,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:02,685 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:02,685 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:02,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:02,685 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:02,685 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:02,759 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:02,760 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:02,760 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:02,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:02,760 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:02,760 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:02,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable806 [2022-12-06 07:28:02,760 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-06 07:28:02,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:02,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1285775970, now seen corresponding path program 1 times [2022-12-06 07:28:02,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:02,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841282650] [2022-12-06 07:28:02,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:02,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:02,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-06 07:28:02,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:02,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841282650] [2022-12-06 07:28:02,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841282650] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:02,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:02,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:02,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892979951] [2022-12-06 07:28:02,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:02,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:02,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:02,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:02,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:02,819 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:02,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:02,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:02,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:02,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:02,861 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:02,861 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:02,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:02,861 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:02,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:02,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:02,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:02,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:02,862 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:02,862 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:02,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:02,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:02,862 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:02,863 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:02,863 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:02,863 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:02,863 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:02,863 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:02,863 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:02,863 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:02,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:02,865 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:02,865 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:02,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:02,866 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:02,866 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:02,941 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:02,941 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:02,941 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:02,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:02,941 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:02,942 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:02,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable807 [2022-12-06 07:28:02,942 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-06 07:28:02,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:02,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1258993861, now seen corresponding path program 1 times [2022-12-06 07:28:02,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:02,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271603290] [2022-12-06 07:28:02,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:02,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:02,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:03,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-06 07:28:03,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:03,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271603290] [2022-12-06 07:28:03,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271603290] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:03,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:03,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:03,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030327295] [2022-12-06 07:28:03,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:03,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:03,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:03,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:03,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:03,004 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:03,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:03,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:03,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:03,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:03,046 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:03,046 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:03,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:03,047 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:03,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:03,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:03,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:03,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:03,047 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:03,047 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:03,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:03,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:03,048 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:03,048 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:03,048 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:03,048 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:03,048 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:03,048 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:03,049 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:03,049 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:03,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:03,051 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:03,051 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:03,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:03,051 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:03,051 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:03,127 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:03,127 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:28:03,127 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:03,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:03,127 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:03,127 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:03,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable808 [2022-12-06 07:28:03,128 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-06 07:28:03,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:03,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1228517668, now seen corresponding path program 1 times [2022-12-06 07:28:03,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:03,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559547313] [2022-12-06 07:28:03,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:03,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:03,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-06 07:28:03,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:03,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559547313] [2022-12-06 07:28:03,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559547313] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:03,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:03,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:03,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844933970] [2022-12-06 07:28:03,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:03,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:03,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:03,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:03,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:03,195 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:03,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:03,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:03,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:03,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:03,238 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:03,238 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:03,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:03,239 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:03,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:03,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:03,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:03,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:03,240 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:03,240 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:03,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:03,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:03,241 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:03,241 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:03,241 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:03,241 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:03,241 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:03,241 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:03,241 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:03,242 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:03,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:03,244 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:03,244 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:03,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:03,244 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:03,245 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:03,319 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:03,319 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:03,319 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:03,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:03,320 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:03,320 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:03,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable809 [2022-12-06 07:28:03,320 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-06 07:28:03,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:03,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1201735559, now seen corresponding path program 1 times [2022-12-06 07:28:03,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:03,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008622301] [2022-12-06 07:28:03,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:03,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:03,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-06 07:28:03,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:03,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008622301] [2022-12-06 07:28:03,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008622301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:03,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:03,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:03,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240225524] [2022-12-06 07:28:03,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:03,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:03,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:03,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:03,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:03,382 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:03,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:03,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:03,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:03,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:03,423 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:03,423 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:03,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:03,424 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:03,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:03,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:03,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:03,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:03,424 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:03,424 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:03,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:03,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:03,425 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:03,425 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:03,425 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:03,425 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:03,425 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:03,425 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:03,425 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:03,425 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:03,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:03,428 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:03,428 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:03,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:03,428 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:03,428 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:03,502 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:03,503 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:03,503 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:03,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:03,503 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:03,503 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:03,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable810 [2022-12-06 07:28:03,503 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-06 07:28:03,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:03,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1171259366, now seen corresponding path program 1 times [2022-12-06 07:28:03,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:03,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696070472] [2022-12-06 07:28:03,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:03,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:03,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-06 07:28:03,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:03,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696070472] [2022-12-06 07:28:03,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696070472] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:03,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:03,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:03,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511404202] [2022-12-06 07:28:03,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:03,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:03,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:03,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:03,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:03,561 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:03,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:03,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:03,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:03,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:03,602 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:03,602 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:03,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:03,602 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:03,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:03,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:03,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:03,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:03,603 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:03,603 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:03,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:03,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:03,604 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:03,604 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:03,604 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:03,604 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:03,604 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:03,604 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:03,604 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:03,604 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:03,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:03,606 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:03,607 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:03,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:03,607 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:03,607 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:03,680 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:03,681 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:03,681 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:03,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:03,681 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:03,681 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:03,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable811 [2022-12-06 07:28:03,681 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-06 07:28:03,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:03,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1144477257, now seen corresponding path program 1 times [2022-12-06 07:28:03,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:03,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182255443] [2022-12-06 07:28:03,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:03,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28: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-06 07:28:03,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:03,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182255443] [2022-12-06 07:28:03,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182255443] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:03,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:03,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:03,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819547907] [2022-12-06 07:28:03,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:03,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:03,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:03,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:03,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:03,750 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:03,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:03,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:03,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:03,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:03,792 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:03,792 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:03,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:03,793 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:03,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:03,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:03,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:03,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:03,794 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:03,794 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:03,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:03,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:03,794 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:03,794 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:03,794 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:03,794 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:03,795 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:03,795 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:03,795 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:03,795 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:03,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:03,797 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:03,797 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:03,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:03,797 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:03,797 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:03,872 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:03,872 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:03,872 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:03,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:03,872 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:03,872 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:03,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable812 [2022-12-06 07:28:03,873 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-06 07:28:03,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:03,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1114001064, now seen corresponding path program 1 times [2022-12-06 07:28:03,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:03,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682557975] [2022-12-06 07:28:03,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:03,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:03,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-06 07:28:03,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:03,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682557975] [2022-12-06 07:28:03,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682557975] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:03,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:03,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:03,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397981193] [2022-12-06 07:28:03,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:03,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:03,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:03,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:03,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:03,933 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:03,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:03,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:03,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:03,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:03,983 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:03,983 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:03,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:03,983 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:03,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:03,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:03,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:03,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:03,984 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:03,984 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:03,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:03,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:03,985 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:03,985 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:03,985 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:03,985 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:03,985 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:03,985 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:03,985 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:03,985 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:03,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:03,987 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:03,988 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:03,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:03,988 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:03,988 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:04,061 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:04,061 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:04,061 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:04,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:04,061 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:04,061 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:04,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable813 [2022-12-06 07:28:04,062 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-06 07:28:04,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:04,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1087218955, now seen corresponding path program 1 times [2022-12-06 07:28:04,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:04,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138619262] [2022-12-06 07:28:04,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:04,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:04,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-06 07:28:04,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:04,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138619262] [2022-12-06 07:28:04,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138619262] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:04,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:04,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:04,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412812564] [2022-12-06 07:28:04,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:04,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:04,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:04,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:04,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:04,122 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:04,122 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:04,122 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:04,122 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:04,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:04,163 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:04,163 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:04,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:04,164 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:04,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:04,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:04,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:04,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:04,164 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:04,164 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:04,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:04,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:04,165 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:04,165 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:04,165 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:04,165 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:04,165 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:04,165 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:04,166 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:04,166 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:04,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:04,168 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:04,168 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:04,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:04,168 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:04,168 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:04,243 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:04,244 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:28:04,244 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:04,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:04,244 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:04,244 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:04,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable814 [2022-12-06 07:28:04,244 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-06 07:28:04,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:04,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1056742762, now seen corresponding path program 1 times [2022-12-06 07:28:04,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:04,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971842667] [2022-12-06 07:28:04,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:04,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:04,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-06 07:28:04,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:04,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971842667] [2022-12-06 07:28:04,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971842667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:04,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:04,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:04,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889991733] [2022-12-06 07:28:04,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:04,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:04,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:04,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:04,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:04,304 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:04,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:04,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:04,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:04,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:04,340 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:04,340 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:04,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:04,341 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:04,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:04,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:04,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:04,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:04,341 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:04,341 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:04,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:04,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:04,342 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:04,342 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:04,342 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:04,342 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:04,342 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:04,342 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:04,342 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:04,343 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:04,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:04,345 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:04,346 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:04,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:04,346 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:04,346 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:04,424 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:04,424 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:28:04,424 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:04,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:04,424 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:04,425 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:04,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable815 [2022-12-06 07:28:04,425 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-06 07:28:04,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:04,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1029960653, now seen corresponding path program 1 times [2022-12-06 07:28:04,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:04,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643368779] [2022-12-06 07:28:04,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:04,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:04,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:04,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-06 07:28:04,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:04,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643368779] [2022-12-06 07:28:04,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643368779] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:04,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:04,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:04,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706145466] [2022-12-06 07:28:04,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:04,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:04,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:04,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:04,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:04,487 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:04,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:04,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:04,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:04,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:04,529 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:04,529 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:04,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:04,529 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:04,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:04,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:04,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:04,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:04,530 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:04,530 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:04,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:04,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:04,531 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:04,531 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:04,531 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:04,531 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:04,531 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:04,531 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:04,531 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:04,531 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:04,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:04,533 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:04,534 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:04,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:04,534 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:04,534 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:04,608 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:04,608 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:04,608 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:04,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:04,608 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:04,608 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:04,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable816 [2022-12-06 07:28:04,608 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-06 07:28:04,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:04,609 INFO L85 PathProgramCache]: Analyzing trace with hash -999484460, now seen corresponding path program 1 times [2022-12-06 07:28:04,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:04,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630689321] [2022-12-06 07:28:04,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:04,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:04,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:04,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-06 07:28:04,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:04,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630689321] [2022-12-06 07:28:04,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630689321] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:04,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:04,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:04,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879184589] [2022-12-06 07:28:04,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:04,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:04,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:04,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:04,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:04,669 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:04,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:04,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:04,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:04,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:04,712 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:04,712 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:04,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:04,713 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:04,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:04,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:04,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:04,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:04,713 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:04,713 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:04,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:04,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:04,715 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:04,715 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:04,715 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:04,715 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:04,716 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:04,716 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:04,716 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:04,716 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:04,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:04,719 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:04,719 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:04,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:04,720 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:04,720 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:04,816 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:04,816 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-06 07:28:04,816 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:04,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:04,817 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:04,817 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:04,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable817 [2022-12-06 07:28:04,817 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-06 07:28:04,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:04,817 INFO L85 PathProgramCache]: Analyzing trace with hash -972702351, now seen corresponding path program 1 times [2022-12-06 07:28:04,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:04,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435143013] [2022-12-06 07:28:04,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:04,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:04,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-06 07:28:04,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:04,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435143013] [2022-12-06 07:28:04,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435143013] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:04,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:04,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:04,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242677354] [2022-12-06 07:28:04,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:04,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:04,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:04,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:04,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:04,912 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:04,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:04,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:04,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:04,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:04,955 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:04,955 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:04,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:04,955 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:04,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:04,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:04,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:04,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:04,956 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:04,956 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:04,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:04,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:04,957 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:04,957 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:04,957 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:04,957 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:04,957 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:04,958 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:04,958 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:04,958 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:04,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:04,960 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:04,961 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:04,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:04,961 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:04,961 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:05,050 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:05,051 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 07:28:05,051 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:05,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:05,051 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:05,051 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:05,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable818 [2022-12-06 07:28:05,052 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-06 07:28:05,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:05,052 INFO L85 PathProgramCache]: Analyzing trace with hash -942226158, now seen corresponding path program 1 times [2022-12-06 07:28:05,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:05,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492761731] [2022-12-06 07:28:05,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:05,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:05,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-06 07:28:05,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:05,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492761731] [2022-12-06 07:28:05,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492761731] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:05,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:05,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:05,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825505557] [2022-12-06 07:28:05,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:05,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:05,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:05,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:05,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:05,128 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:05,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:05,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:05,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:05,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:05,187 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:05,187 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:05,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:05,188 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:05,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:05,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:05,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:05,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:05,189 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:05,189 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:05,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:05,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:05,190 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:05,190 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:05,190 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:05,190 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:05,190 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:05,190 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:05,190 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:05,190 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:05,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:05,193 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:05,194 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:05,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:05,194 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:05,194 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:05,289 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:05,289 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 07:28:05,290 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:05,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:05,290 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:05,290 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:05,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable819 [2022-12-06 07:28:05,290 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-06 07:28:05,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:05,290 INFO L85 PathProgramCache]: Analyzing trace with hash -915444049, now seen corresponding path program 1 times [2022-12-06 07:28:05,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:05,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565042746] [2022-12-06 07:28:05,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:05,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:05,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-06 07:28:05,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:05,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565042746] [2022-12-06 07:28:05,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565042746] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:05,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:05,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:05,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182385649] [2022-12-06 07:28:05,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:05,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:05,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:05,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:05,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:05,369 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:05,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:05,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:05,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:05,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:05,406 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:05,406 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:05,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:05,406 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:05,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:05,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:05,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:05,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:05,407 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:05,407 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:05,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:05,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:05,408 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:05,408 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:05,408 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:05,408 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:05,408 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:05,408 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:05,408 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:05,409 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:05,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:05,411 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:05,411 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:05,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:05,412 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:05,412 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:05,485 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:05,486 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:05,486 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:05,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:05,486 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:05,486 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:05,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable820 [2022-12-06 07:28:05,486 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-06 07:28:05,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:05,486 INFO L85 PathProgramCache]: Analyzing trace with hash -884967856, now seen corresponding path program 1 times [2022-12-06 07:28:05,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:05,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795929114] [2022-12-06 07:28:05,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:05,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:05,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-06 07:28:05,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:05,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795929114] [2022-12-06 07:28:05,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795929114] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:05,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:05,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:05,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637018330] [2022-12-06 07:28:05,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:05,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:05,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:05,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:05,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:05,545 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:05,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:05,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:05,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:05,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:05,586 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:05,587 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:05,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:05,587 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:05,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:05,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:05,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:05,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:05,588 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:05,588 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:05,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:05,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:05,588 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:05,588 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:05,589 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:05,589 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:05,589 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:05,589 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:05,589 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:05,589 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:05,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:05,591 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:05,591 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:05,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:05,592 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:05,592 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:05,664 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:05,665 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:05,665 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:05,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:05,665 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:05,665 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:05,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable821 [2022-12-06 07:28:05,665 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-06 07:28:05,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:05,665 INFO L85 PathProgramCache]: Analyzing trace with hash -858185747, now seen corresponding path program 1 times [2022-12-06 07:28:05,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:05,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148113195] [2022-12-06 07:28:05,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:05,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:05,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:05,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-06 07:28:05,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:05,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148113195] [2022-12-06 07:28:05,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148113195] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:05,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:05,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:05,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731141353] [2022-12-06 07:28:05,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:05,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:05,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:05,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:05,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:05,725 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:05,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:05,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:05,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:05,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:05,761 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:05,761 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:05,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:05,761 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:05,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:05,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:05,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:05,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:05,762 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:05,762 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:05,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:05,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:05,763 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:05,763 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:05,763 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:05,763 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:05,763 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:05,763 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:05,763 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:05,763 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:05,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:05,765 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:05,765 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:05,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:05,766 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:05,766 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:05,839 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:05,840 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:05,840 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:05,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:05,840 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:05,840 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:05,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable822 [2022-12-06 07:28:05,840 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-06 07:28:05,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:05,840 INFO L85 PathProgramCache]: Analyzing trace with hash -827709554, now seen corresponding path program 1 times [2022-12-06 07:28:05,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:05,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126122380] [2022-12-06 07:28:05,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:05,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:05,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-06 07:28:05,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:05,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126122380] [2022-12-06 07:28:05,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126122380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:05,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:05,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:05,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278351849] [2022-12-06 07:28:05,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:05,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:05,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:05,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:05,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:05,911 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:05,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:05,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:05,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:05,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:05,953 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:05,954 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:05,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:05,954 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:05,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:05,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:05,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:05,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:05,955 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:05,955 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:05,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:05,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:05,955 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:05,955 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:05,956 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:05,956 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:05,956 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:05,956 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:05,956 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:05,956 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:05,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:05,958 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:05,958 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:05,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:05,958 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:05,959 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:06,036 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:06,036 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:28:06,036 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:06,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:06,036 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:06,036 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:06,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable823 [2022-12-06 07:28:06,037 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-06 07:28:06,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:06,037 INFO L85 PathProgramCache]: Analyzing trace with hash -800927445, now seen corresponding path program 1 times [2022-12-06 07:28:06,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:06,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235597696] [2022-12-06 07:28:06,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:06,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:06,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-06 07:28:06,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:06,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235597696] [2022-12-06 07:28:06,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235597696] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:06,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:06,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:06,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685152880] [2022-12-06 07:28:06,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:06,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:06,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:06,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:06,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:06,107 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:06,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:06,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:06,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:06,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:06,156 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:06,156 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:06,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 370 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:06,157 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:06,157 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:06,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:06,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:06,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:06,157 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:06,157 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:06,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:06,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:06,158 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:06,158 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:06,158 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:06,158 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:06,158 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:06,159 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:06,159 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:06,159 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:06,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:06,161 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:06,161 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:06,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:06,161 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:06,161 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:06,235 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:06,236 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:06,236 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:06,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:06,236 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:06,236 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:06,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable824 [2022-12-06 07:28:06,236 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-06 07:28:06,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:06,236 INFO L85 PathProgramCache]: Analyzing trace with hash -770451252, now seen corresponding path program 1 times [2022-12-06 07:28:06,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:06,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055635098] [2022-12-06 07:28:06,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:06,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28: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-06 07:28:06,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:06,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055635098] [2022-12-06 07:28:06,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055635098] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:06,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:06,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:06,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711212006] [2022-12-06 07:28:06,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:06,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:06,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:06,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:06,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:06,295 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:06,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:06,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:06,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:06,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:06,338 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:06,338 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:06,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:06,338 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:06,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:06,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:06,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:06,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:06,339 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:06,339 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:06,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:06,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:06,340 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:06,340 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:06,340 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:06,340 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:06,340 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:06,340 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:06,340 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:06,340 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:06,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:06,342 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:06,342 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:06,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:06,343 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:06,343 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:06,416 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:06,417 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:06,417 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:06,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:06,417 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:06,417 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:06,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable825 [2022-12-06 07:28:06,417 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-06 07:28:06,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:06,417 INFO L85 PathProgramCache]: Analyzing trace with hash -743669143, now seen corresponding path program 1 times [2022-12-06 07:28:06,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:06,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600466351] [2022-12-06 07:28:06,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:06,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28: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-06 07:28:06,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:06,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600466351] [2022-12-06 07:28:06,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600466351] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:06,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:06,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:06,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310242114] [2022-12-06 07:28:06,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:06,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:06,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:06,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:06,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:06,479 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:06,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:06,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:06,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:06,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:06,515 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:06,515 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:06,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:06,515 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:06,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:06,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:06,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:06,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:06,516 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:06,516 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:06,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:06,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:06,517 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:06,517 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:06,517 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:06,517 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:06,517 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:06,517 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:06,517 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:06,517 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:06,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:06,519 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:06,520 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:06,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:06,520 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:06,520 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:06,593 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:06,594 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:06,594 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:06,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:06,594 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:06,594 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:06,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable826 [2022-12-06 07:28:06,594 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-06 07:28:06,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:06,595 INFO L85 PathProgramCache]: Analyzing trace with hash -713192950, now seen corresponding path program 1 times [2022-12-06 07:28:06,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:06,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929654949] [2022-12-06 07:28:06,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:06,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:06,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-06 07:28:06,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:06,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929654949] [2022-12-06 07:28:06,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929654949] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:06,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:06,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:06,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573268301] [2022-12-06 07:28:06,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:06,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:06,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:06,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:06,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:06,656 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:06,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:06,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:06,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:06,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:06,701 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:06,702 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:06,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:06,702 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:06,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:06,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:06,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:06,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:06,703 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:06,703 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:06,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:06,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:06,703 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:06,704 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:06,704 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:06,704 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:06,704 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:06,704 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:06,704 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:06,704 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:06,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:06,707 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:06,707 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:06,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:06,707 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:06,707 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:06,783 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:06,784 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:28:06,784 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:06,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:06,784 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:06,784 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:06,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable827 [2022-12-06 07:28:06,784 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-06 07:28:06,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:06,784 INFO L85 PathProgramCache]: Analyzing trace with hash -686410841, now seen corresponding path program 1 times [2022-12-06 07:28:06,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:06,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970526982] [2022-12-06 07:28:06,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:06,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:06,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-06 07:28:06,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:06,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970526982] [2022-12-06 07:28:06,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970526982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:06,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:06,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:06,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972876876] [2022-12-06 07:28:06,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:06,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:06,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:06,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:06,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:06,853 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:06,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:06,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:06,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:06,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:06,891 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:06,891 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:06,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:06,892 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:06,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:06,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:06,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:06,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:06,892 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:06,893 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:06,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:06,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:06,893 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:06,893 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:06,894 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:06,894 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:06,894 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:06,894 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:06,894 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:06,894 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:06,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:06,897 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:06,897 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:06,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:06,897 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:06,897 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:06,981 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:06,982 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 07:28:06,982 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:06,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:06,982 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:06,982 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:06,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable828 [2022-12-06 07:28:06,982 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-06 07:28:06,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:06,982 INFO L85 PathProgramCache]: Analyzing trace with hash -655934648, now seen corresponding path program 1 times [2022-12-06 07:28:06,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:06,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007622568] [2022-12-06 07:28:06,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:06,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:07,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-06 07:28:07,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:07,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007622568] [2022-12-06 07:28:07,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007622568] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:07,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:07,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:07,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238103455] [2022-12-06 07:28:07,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:07,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:07,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:07,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:07,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:07,044 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:07,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:07,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:07,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:07,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:07,087 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:07,087 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:07,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:07,088 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:07,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:07,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:07,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:07,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:07,088 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:07,088 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:07,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:07,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:07,089 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:07,089 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:07,089 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:07,089 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:07,089 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:07,089 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:07,089 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:07,089 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:07,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:07,092 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:07,092 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:07,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:07,092 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:07,092 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:07,166 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:07,167 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:07,167 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:07,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:07,167 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:07,167 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:07,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable829 [2022-12-06 07:28:07,167 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-06 07:28:07,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:07,167 INFO L85 PathProgramCache]: Analyzing trace with hash -629152539, now seen corresponding path program 1 times [2022-12-06 07:28:07,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:07,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643574405] [2022-12-06 07:28:07,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:07,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:07,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-06 07:28:07,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:07,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643574405] [2022-12-06 07:28:07,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643574405] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:07,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:07,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:07,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999607773] [2022-12-06 07:28:07,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:07,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:07,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:07,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:07,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:07,228 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:07,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:07,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:07,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:07,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:07,264 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:07,264 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:07,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:07,264 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:07,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:07,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:07,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:07,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:07,265 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:07,265 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:07,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:07,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:07,266 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:07,266 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:07,266 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:07,266 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:07,266 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:07,266 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:07,266 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:07,266 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:07,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:07,268 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:07,268 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:07,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:07,269 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:07,269 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:07,343 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:07,344 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:07,344 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:07,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:07,344 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:07,344 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:07,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable830 [2022-12-06 07:28:07,344 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-06 07:28:07,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:07,345 INFO L85 PathProgramCache]: Analyzing trace with hash -598676346, now seen corresponding path program 1 times [2022-12-06 07:28:07,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:07,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367331548] [2022-12-06 07:28:07,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:07,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:07,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-06 07:28:07,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:07,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367331548] [2022-12-06 07:28:07,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367331548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:07,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:07,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:07,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112892807] [2022-12-06 07:28:07,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:07,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:07,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:07,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:07,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:07,406 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:07,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:07,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:07,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:07,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:07,449 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:07,449 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:07,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:07,450 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:07,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:07,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:07,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:07,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:07,450 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:07,450 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:07,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:07,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:07,451 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:07,451 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:07,451 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:07,451 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:07,451 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:07,451 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:07,451 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:07,451 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:07,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:07,454 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:07,454 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:07,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:07,454 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:07,454 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:07,528 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:07,528 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:07,528 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:07,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:07,528 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:07,528 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:07,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable831 [2022-12-06 07:28:07,528 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-06 07:28:07,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:07,529 INFO L85 PathProgramCache]: Analyzing trace with hash -571894237, now seen corresponding path program 1 times [2022-12-06 07:28:07,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:07,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207769341] [2022-12-06 07:28:07,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:07,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:07,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-06 07:28:07,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:07,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207769341] [2022-12-06 07:28:07,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207769341] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:07,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:07,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:07,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349445040] [2022-12-06 07:28:07,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:07,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:07,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:07,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:07,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:07,591 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:07,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:07,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:07,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:07,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:07,633 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:07,633 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:07,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:07,633 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:07,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:07,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:07,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:07,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:07,634 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:07,634 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:07,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:07,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:07,635 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:07,635 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:07,635 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:07,635 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:07,635 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:07,635 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:07,635 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:07,635 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:07,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:07,637 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:07,637 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:07,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:07,638 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:07,638 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:07,712 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:07,712 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:07,712 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:07,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:07,713 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:07,713 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:07,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable832 [2022-12-06 07:28:07,713 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-06 07:28:07,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:07,713 INFO L85 PathProgramCache]: Analyzing trace with hash -541418044, now seen corresponding path program 1 times [2022-12-06 07:28:07,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:07,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073767312] [2022-12-06 07:28:07,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:07,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:07,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28: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-06 07:28:07,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:07,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073767312] [2022-12-06 07:28:07,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073767312] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:07,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:07,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:07,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096243437] [2022-12-06 07:28:07,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:07,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:07,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:07,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:07,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:07,781 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:07,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:07,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:07,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:07,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:07,821 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:07,822 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:07,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:07,822 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:07,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:07,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:07,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:07,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:07,822 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:07,823 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:07,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:07,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:07,823 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:07,823 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:07,823 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:07,823 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:07,823 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:07,824 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:07,824 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:07,824 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:07,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:07,826 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:07,826 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:07,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:07,826 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:07,826 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:07,900 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:07,900 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:07,900 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:07,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:07,900 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:07,900 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:07,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable833 [2022-12-06 07:28:07,900 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-06 07:28:07,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:07,901 INFO L85 PathProgramCache]: Analyzing trace with hash -514635935, now seen corresponding path program 1 times [2022-12-06 07:28:07,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:07,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553785353] [2022-12-06 07:28:07,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:07,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28: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-06 07:28:07,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:07,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553785353] [2022-12-06 07:28:07,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553785353] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:07,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:07,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:07,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880365960] [2022-12-06 07:28:07,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:07,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:07,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:07,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:07,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:07,962 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:07,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:07,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:07,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:07,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:07,997 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:07,998 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:07,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:07,998 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:07,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:07,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:07,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:07,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:07,999 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:07,999 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:07,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:07,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:08,000 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:08,000 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:08,000 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:08,000 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:08,000 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:08,000 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:08,000 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:08,000 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:08,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:08,002 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:08,002 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:08,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:08,003 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:08,003 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:08,076 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:08,077 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:08,077 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:08,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:08,077 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:08,077 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:08,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable834 [2022-12-06 07:28:08,077 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-06 07:28:08,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:08,077 INFO L85 PathProgramCache]: Analyzing trace with hash -484159742, now seen corresponding path program 1 times [2022-12-06 07:28:08,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:08,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62070144] [2022-12-06 07:28:08,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:08,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:08,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-06 07:28:08,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:08,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62070144] [2022-12-06 07:28:08,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62070144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:08,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:08,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:08,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812776036] [2022-12-06 07:28:08,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:08,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:08,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:08,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:08,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:08,135 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:08,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:08,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:08,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:08,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:08,171 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:08,171 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:08,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:08,172 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:08,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:08,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:08,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:08,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:08,173 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:08,173 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:08,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:08,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:08,173 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:08,173 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:08,173 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:08,174 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:08,174 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:08,174 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:08,174 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:08,174 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:08,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:08,176 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:08,176 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:08,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:08,176 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:08,176 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:08,250 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:08,250 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:08,250 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:08,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:08,251 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:08,251 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:08,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable835 [2022-12-06 07:28:08,251 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-06 07:28:08,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:08,251 INFO L85 PathProgramCache]: Analyzing trace with hash -457377633, now seen corresponding path program 1 times [2022-12-06 07:28:08,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:08,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315293694] [2022-12-06 07:28:08,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:08,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:08,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-06 07:28:08,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:08,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315293694] [2022-12-06 07:28:08,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315293694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:08,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:08,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:08,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884257345] [2022-12-06 07:28:08,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:08,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:08,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:08,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:08,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:08,331 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:08,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:08,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:08,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:08,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:08,381 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:08,381 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:08,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:08,381 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:08,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:08,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:08,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:08,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:08,382 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:08,382 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:08,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:08,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:08,383 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:08,383 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:08,384 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:08,384 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:08,384 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:08,384 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:08,384 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:08,384 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:08,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:08,387 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:08,387 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:08,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:08,388 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:08,388 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:08,464 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:08,464 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:28:08,464 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:08,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:08,465 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:08,465 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:08,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable836 [2022-12-06 07:28:08,465 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-06 07:28:08,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:08,465 INFO L85 PathProgramCache]: Analyzing trace with hash -426901440, now seen corresponding path program 1 times [2022-12-06 07:28:08,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:08,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51779089] [2022-12-06 07:28:08,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:08,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:08,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-06 07:28:08,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:08,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51779089] [2022-12-06 07:28:08,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51779089] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:08,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:08,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:08,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588229625] [2022-12-06 07:28:08,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:08,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:08,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:08,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:08,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:08,526 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:08,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:08,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:08,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:08,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:08,569 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:08,570 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:08,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:08,570 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:08,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:08,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:08,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:08,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:08,571 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:08,571 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:08,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:08,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:08,571 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:08,571 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:08,572 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:08,572 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:08,572 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:08,572 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:08,572 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:08,572 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:08,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:08,575 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:08,575 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:08,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:08,575 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:08,575 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:08,649 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:08,650 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:08,650 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:08,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:08,650 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:08,650 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:08,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable837 [2022-12-06 07:28:08,650 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-06 07:28:08,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:08,650 INFO L85 PathProgramCache]: Analyzing trace with hash -400119331, now seen corresponding path program 1 times [2022-12-06 07:28:08,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:08,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890691510] [2022-12-06 07:28:08,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:08,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:08,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:08,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:08,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:08,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890691510] [2022-12-06 07:28:08,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890691510] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:08,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:08,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:08,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218289891] [2022-12-06 07:28:08,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:08,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:08,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:08,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:08,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:08,712 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:08,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:08,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:08,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:08,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:08,747 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:08,747 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:08,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 371 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:08,747 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:08,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:08,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:08,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:08,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:08,748 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:08,748 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:08,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:08,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:08,749 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:08,749 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:08,749 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:08,749 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:08,749 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:08,749 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:08,749 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:08,749 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:08,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:08,759 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:08,759 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:08,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:08,759 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:08,759 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:08,847 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:08,847 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 07:28:08,847 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:08,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:08,847 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:08,847 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:08,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable838 [2022-12-06 07:28:08,848 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-06 07:28:08,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:08,848 INFO L85 PathProgramCache]: Analyzing trace with hash -369643138, now seen corresponding path program 1 times [2022-12-06 07:28:08,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:08,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175496015] [2022-12-06 07:28:08,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:08,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:08,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-06 07:28:08,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:08,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175496015] [2022-12-06 07:28:08,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175496015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:08,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:08,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:08,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975734486] [2022-12-06 07:28:08,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:08,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:08,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:08,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:08,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:08,906 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:08,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:08,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:08,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:08,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:08,949 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:08,949 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:08,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:08,949 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:08,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:08,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:08,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:08,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:08,950 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:08,950 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:08,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:08,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:08,951 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:08,951 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:08,951 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:08,951 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:08,951 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:08,951 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:08,951 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:08,951 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:08,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:08,953 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:08,953 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:08,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:08,954 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:08,954 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:09,028 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:09,028 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:09,028 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:09,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:09,029 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:09,029 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:09,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable839 [2022-12-06 07:28:09,029 INFO L420 AbstractCegarLoop]: === Iteration 841 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:28:09,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:09,029 INFO L85 PathProgramCache]: Analyzing trace with hash -342861029, now seen corresponding path program 1 times [2022-12-06 07:28:09,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:09,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213309937] [2022-12-06 07:28:09,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:09,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:09,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:09,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-06 07:28:09,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:09,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213309937] [2022-12-06 07:28:09,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213309937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:09,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:09,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:09,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431682981] [2022-12-06 07:28:09,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:09,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:09,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:09,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:09,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:09,098 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:09,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:09,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:09,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:09,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:09,139 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:09,139 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:09,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:09,140 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:09,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:09,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:09,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:09,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:09,141 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:09,141 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:09,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:09,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:09,142 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:09,142 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:09,142 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:09,142 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:09,142 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:09,143 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:09,143 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:09,143 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:09,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:09,146 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:09,146 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:09,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:09,146 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:09,146 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:09,236 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:09,236 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 07:28:09,237 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:09,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:09,237 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:09,237 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:09,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable840 [2022-12-06 07:28:09,237 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-06 07:28:09,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:09,237 INFO L85 PathProgramCache]: Analyzing trace with hash -312384836, now seen corresponding path program 1 times [2022-12-06 07:28:09,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:09,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756180674] [2022-12-06 07:28:09,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:09,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:09,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-06 07:28:09,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:09,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756180674] [2022-12-06 07:28:09,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756180674] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:09,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:09,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:09,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535729884] [2022-12-06 07:28:09,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:09,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:09,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:09,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:09,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:09,301 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:09,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:09,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:09,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:09,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:09,343 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:09,343 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:09,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 350 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:09,344 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:09,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:09,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:09,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:09,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:09,344 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:09,344 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:09,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:09,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:09,345 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:09,345 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:09,345 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:09,345 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:09,345 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:09,346 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:09,346 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:09,346 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:09,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:09,348 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:09,348 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:09,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 118 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:09,348 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:09,349 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:09,427 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:09,428 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 07:28:09,428 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:09,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:09,428 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:09,428 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:09,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable841 [2022-12-06 07:28:09,428 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-06 07:28:09,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:09,429 INFO L85 PathProgramCache]: Analyzing trace with hash -285602727, now seen corresponding path program 1 times [2022-12-06 07:28:09,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:09,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983994965] [2022-12-06 07:28:09,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:09,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:09,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-06 07:28:09,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:09,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983994965] [2022-12-06 07:28:09,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983994965] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:09,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:09,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:09,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973094829] [2022-12-06 07:28:09,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:09,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:09,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:09,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:09,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:09,490 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:09,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:09,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:09,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:09,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:09,527 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:09,527 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:09,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:09,527 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:09,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:09,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:09,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:09,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:09,528 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:09,528 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:09,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:09,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:09,529 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:09,529 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:09,529 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:09,529 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:09,529 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:09,529 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:09,529 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:09,529 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:09,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:09,532 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:09,532 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:09,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:09,532 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:09,532 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:09,605 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:09,605 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:09,605 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:09,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:09,605 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:09,605 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:09,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable842 [2022-12-06 07:28:09,605 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-06 07:28:09,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:09,606 INFO L85 PathProgramCache]: Analyzing trace with hash -255126534, now seen corresponding path program 1 times [2022-12-06 07:28:09,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:09,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843344060] [2022-12-06 07:28:09,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:09,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:09,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-06 07:28:09,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:09,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843344060] [2022-12-06 07:28:09,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843344060] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:09,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:09,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:09,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272248806] [2022-12-06 07:28:09,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:09,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:09,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:09,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:09,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:09,664 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:09,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:09,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:09,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:09,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:09,707 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:09,707 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:09,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:09,708 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:09,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:09,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:09,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:09,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:09,708 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:09,708 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:09,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:09,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:09,709 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:09,709 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:09,709 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:09,709 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:09,709 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:09,709 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:09,710 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:09,710 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:09,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:09,712 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:09,712 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:09,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:09,712 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:09,712 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:09,787 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:09,788 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:28:09,788 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:09,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:09,788 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:09,788 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:09,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable843 [2022-12-06 07:28:09,788 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-06 07:28:09,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:09,788 INFO L85 PathProgramCache]: Analyzing trace with hash -228344425, now seen corresponding path program 1 times [2022-12-06 07:28:09,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:09,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705248282] [2022-12-06 07:28:09,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:09,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:09,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-06 07:28:09,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:09,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705248282] [2022-12-06 07:28:09,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705248282] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:09,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:09,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:09,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216798816] [2022-12-06 07:28:09,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:09,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:09,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:09,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:09,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:09,857 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:09,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:09,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:09,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:09,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:09,892 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:09,892 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:09,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:09,893 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:09,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:09,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:09,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:09,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:09,893 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:09,893 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:09,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:09,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:09,894 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:09,894 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:09,894 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:09,894 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:09,894 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:09,895 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:09,895 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:09,895 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:09,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:09,897 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:09,897 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:09,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:09,897 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:09,897 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:09,970 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:09,970 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:09,970 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:09,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:09,971 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:09,971 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:09,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable844 [2022-12-06 07:28:09,971 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-06 07:28:09,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:09,971 INFO L85 PathProgramCache]: Analyzing trace with hash -197868232, now seen corresponding path program 1 times [2022-12-06 07:28:09,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:09,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91018118] [2022-12-06 07:28:09,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:09,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:10,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-06 07:28:10,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:10,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91018118] [2022-12-06 07:28:10,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91018118] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:10,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:10,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:10,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371688279] [2022-12-06 07:28:10,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:10,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:10,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:10,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:10,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:10,031 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:10,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:10,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:10,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:10,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:10,073 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:10,073 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:10,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:10,074 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:10,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:10,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:10,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:10,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:10,074 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:10,074 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:10,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:10,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:10,075 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:10,075 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:10,075 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:10,075 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:10,075 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:10,075 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:10,076 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:10,076 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:10,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:10,078 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:10,078 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:10,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:10,078 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:10,078 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:10,152 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:10,152 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:10,152 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:10,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:10,152 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:10,152 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:10,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable845 [2022-12-06 07:28:10,153 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-06 07:28:10,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:10,153 INFO L85 PathProgramCache]: Analyzing trace with hash -171086123, now seen corresponding path program 1 times [2022-12-06 07:28:10,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:10,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922016205] [2022-12-06 07:28:10,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:10,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:10,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:10,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-06 07:28:10,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:10,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922016205] [2022-12-06 07:28:10,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922016205] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:10,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:10,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:10,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110750644] [2022-12-06 07:28:10,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:10,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:10,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:10,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:10,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:10,214 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:10,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:10,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:10,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:10,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:10,249 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:10,249 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:10,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:10,250 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:10,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:10,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:10,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:10,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:10,250 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:10,250 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:10,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:10,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:10,251 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:10,251 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:10,251 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:10,251 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:10,251 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:10,252 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:10,252 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:10,252 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:10,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:10,254 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:10,254 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:10,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:10,254 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:10,254 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:10,327 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:10,328 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:10,328 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:10,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:10,328 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:10,328 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:10,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable846 [2022-12-06 07:28:10,328 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-06 07:28:10,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:10,328 INFO L85 PathProgramCache]: Analyzing trace with hash -140609930, now seen corresponding path program 1 times [2022-12-06 07:28:10,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:10,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477162490] [2022-12-06 07:28:10,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:10,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:10,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-06 07:28:10,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:10,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477162490] [2022-12-06 07:28:10,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477162490] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:10,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:10,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:10,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008338851] [2022-12-06 07:28:10,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:10,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:10,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:10,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:10,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:10,388 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:10,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:10,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:10,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:10,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:10,425 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:10,425 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:10,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:10,426 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:10,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:10,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:10,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:10,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:10,426 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:10,426 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:10,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:10,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:10,427 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:10,427 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:10,427 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:10,427 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:10,427 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:10,428 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:10,428 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:10,428 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:10,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:10,430 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:10,430 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:10,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:10,430 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:10,430 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:10,516 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:10,516 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 07:28:10,516 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:10,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:10,516 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:10,516 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:10,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable847 [2022-12-06 07:28:10,517 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-06 07:28:10,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:10,517 INFO L85 PathProgramCache]: Analyzing trace with hash -113827821, now seen corresponding path program 1 times [2022-12-06 07:28:10,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:10,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269277543] [2022-12-06 07:28:10,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:10,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:10,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-06 07:28:10,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:10,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269277543] [2022-12-06 07:28:10,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269277543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:10,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:10,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:10,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428343184] [2022-12-06 07:28:10,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:10,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:10,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:10,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:10,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:10,579 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:10,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:10,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:10,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:10,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:10,616 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:10,616 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:10,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:10,617 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:10,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:10,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:10,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:10,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:10,617 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:10,617 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:10,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:10,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:10,618 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:10,618 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:10,618 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:10,618 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:10,618 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:10,619 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:10,619 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:10,619 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:10,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:10,621 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:10,621 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:10,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:10,621 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:10,621 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:10,694 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:10,695 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:10,695 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:10,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:10,695 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:10,695 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:10,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable848 [2022-12-06 07:28:10,695 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-06 07:28:10,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:10,695 INFO L85 PathProgramCache]: Analyzing trace with hash -83351628, now seen corresponding path program 1 times [2022-12-06 07:28:10,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:10,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76553170] [2022-12-06 07:28:10,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:10,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:10,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-06 07:28:10,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:10,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76553170] [2022-12-06 07:28:10,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76553170] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:10,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:10,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:10,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826406709] [2022-12-06 07:28:10,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:10,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:10,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:10,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:10,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:10,755 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:10,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:10,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:10,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:10,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:10,792 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:10,793 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:10,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:10,793 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:10,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:10,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:10,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:10,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:10,794 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:10,794 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:10,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:10,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:10,794 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:10,794 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:10,794 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:10,795 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:10,795 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:10,795 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:10,795 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:10,795 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:10,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:10,797 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:10,797 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:10,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:10,797 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:10,797 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:10,872 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:10,872 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:10,872 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:10,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:10,872 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:10,872 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:10,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable849 [2022-12-06 07:28:10,872 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-06 07:28:10,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:10,873 INFO L85 PathProgramCache]: Analyzing trace with hash -56569519, now seen corresponding path program 1 times [2022-12-06 07:28:10,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:10,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638084965] [2022-12-06 07:28:10,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:10,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:10,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-06 07:28:10,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:10,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638084965] [2022-12-06 07:28:10,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638084965] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:10,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:10,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:10,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236097557] [2022-12-06 07:28:10,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:10,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:10,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:10,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:10,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:10,942 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:10,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:10,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:10,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:10,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:10,978 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:10,979 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:10,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:10,979 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:10,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:10,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:10,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:10,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:10,980 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:10,980 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:10,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:10,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:10,981 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:10,981 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:10,981 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:10,981 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:10,981 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:10,981 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:10,981 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:10,981 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:10,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:10,983 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:10,984 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:10,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:10,984 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:10,984 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:11,059 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:11,059 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:11,059 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:11,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:11,060 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:11,060 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:11,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable850 [2022-12-06 07:28:11,060 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-06 07:28:11,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:11,060 INFO L85 PathProgramCache]: Analyzing trace with hash -26093326, now seen corresponding path program 1 times [2022-12-06 07:28:11,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:11,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419621190] [2022-12-06 07:28:11,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:11,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:11,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-06 07:28:11,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:11,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419621190] [2022-12-06 07:28:11,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419621190] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:11,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:11,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:11,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979314961] [2022-12-06 07:28:11,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:11,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:11,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:11,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:11,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:11,122 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:11,122 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:11,122 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:11,122 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:11,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:11,163 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:11,163 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:11,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:11,164 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:11,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:11,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:11,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:11,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:11,164 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:11,164 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:11,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:11,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:11,165 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:11,165 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:11,165 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:11,165 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:11,165 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:11,166 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:11,166 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:11,166 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:11,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:11,168 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:11,168 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:11,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:11,168 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:11,168 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:11,241 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:11,241 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:11,242 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:11,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:11,242 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:11,242 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:11,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable851 [2022-12-06 07:28:11,242 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-06 07:28:11,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:11,242 INFO L85 PathProgramCache]: Analyzing trace with hash 688783, now seen corresponding path program 1 times [2022-12-06 07:28:11,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:11,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241539179] [2022-12-06 07:28:11,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:11,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:11,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-06 07:28:11,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:11,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241539179] [2022-12-06 07:28:11,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241539179] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:11,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:11,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:11,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126956088] [2022-12-06 07:28:11,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:11,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:11,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:11,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:11,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:11,302 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:11,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:11,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:11,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:11,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:11,338 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:11,338 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:11,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:11,339 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:11,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:11,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:11,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:11,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:11,339 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:11,339 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:11,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:11,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:11,340 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:11,340 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:11,340 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:11,340 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:11,340 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:11,340 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:11,340 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:11,340 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:11,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:11,343 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:11,343 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:11,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:11,343 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:11,343 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:11,416 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:11,417 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:11,417 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:11,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:11,417 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:11,417 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:11,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable852 [2022-12-06 07:28:11,417 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-06 07:28:11,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:11,417 INFO L85 PathProgramCache]: Analyzing trace with hash 31164976, now seen corresponding path program 1 times [2022-12-06 07:28:11,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:11,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774028184] [2022-12-06 07:28:11,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:11,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:11,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:11,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:11,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774028184] [2022-12-06 07:28:11,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774028184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:11,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:11,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:11,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169507997] [2022-12-06 07:28:11,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:11,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:11,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:11,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:11,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:11,478 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:11,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:11,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:11,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:11,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:11,520 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:11,520 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:11,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:11,520 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:11,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:11,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:11,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:11,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:11,521 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:11,521 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:11,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:11,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:11,522 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:11,522 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:11,522 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:11,522 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:11,522 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:11,522 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:11,522 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:11,522 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:11,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:11,524 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:11,524 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:11,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:11,525 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:11,525 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:11,598 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:11,598 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:11,598 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:11,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:11,598 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:11,598 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:11,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable853 [2022-12-06 07:28:11,598 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-06 07:28:11,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:11,599 INFO L85 PathProgramCache]: Analyzing trace with hash 57947085, now seen corresponding path program 1 times [2022-12-06 07:28:11,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:11,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744263239] [2022-12-06 07:28:11,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:11,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28: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-06 07:28:11,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:11,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744263239] [2022-12-06 07:28:11,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744263239] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:11,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:11,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:11,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464024495] [2022-12-06 07:28:11,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:11,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:11,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:11,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:11,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:11,659 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:11,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:11,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:11,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:11,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:11,700 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:11,700 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:11,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:11,701 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:11,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:11,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:11,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:11,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:11,702 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:11,702 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:11,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:11,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:11,702 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:11,702 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:11,702 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:11,703 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:11,703 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:11,703 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:11,703 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:11,703 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:11,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:11,705 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:11,705 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:11,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:11,705 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:11,706 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:11,778 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:11,779 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:11,779 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:11,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:11,779 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:11,779 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:11,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable854 [2022-12-06 07:28:11,779 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-06 07:28:11,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:11,779 INFO L85 PathProgramCache]: Analyzing trace with hash 88423278, now seen corresponding path program 1 times [2022-12-06 07:28:11,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:11,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202955607] [2022-12-06 07:28:11,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:11,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28: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-06 07:28:11,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:11,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202955607] [2022-12-06 07:28:11,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202955607] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:11,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:11,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:11,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213177774] [2022-12-06 07:28:11,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:11,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:11,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:11,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:11,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:11,848 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:11,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:11,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:11,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:11,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:11,884 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:11,884 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:11,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:11,885 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:11,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:11,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:11,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:11,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:11,886 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:11,886 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:11,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:11,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:11,886 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:11,886 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:11,887 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:11,887 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:11,887 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:11,887 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:11,887 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:11,887 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:11,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:11,889 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:11,889 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:11,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 114 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:11,889 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:11,890 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:11,963 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:11,964 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:11,964 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:11,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:11,964 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:11,964 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:11,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable855 [2022-12-06 07:28:11,964 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-06 07:28:11,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:11,964 INFO L85 PathProgramCache]: Analyzing trace with hash 115205387, now seen corresponding path program 1 times [2022-12-06 07:28:11,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:11,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491799034] [2022-12-06 07:28:11,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:11,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28: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-06 07:28:12,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:12,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491799034] [2022-12-06 07:28:12,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491799034] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:12,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:12,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:12,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41893651] [2022-12-06 07:28:12,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:12,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:12,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:12,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:12,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:12,026 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:12,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:12,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:12,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:12,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:12,063 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:12,063 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:12,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:12,064 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:12,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:12,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:12,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:12,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:12,064 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:12,064 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:12,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:12,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:12,065 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:12,065 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:12,065 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:12,065 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:12,065 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:12,065 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:12,065 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:12,065 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:12,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:12,068 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:12,068 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:12,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:12,068 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:12,068 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:12,142 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:12,143 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:12,143 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:12,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:12,143 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:12,143 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:12,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable856 [2022-12-06 07:28:12,143 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-06 07:28:12,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:12,144 INFO L85 PathProgramCache]: Analyzing trace with hash 145681580, now seen corresponding path program 1 times [2022-12-06 07:28:12,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:12,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113186366] [2022-12-06 07:28:12,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:12,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:12,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-06 07:28:12,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:12,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113186366] [2022-12-06 07:28:12,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113186366] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:12,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:12,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:12,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140287369] [2022-12-06 07:28:12,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:12,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:12,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:12,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:12,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:12,204 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:12,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:12,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:12,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:12,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:12,241 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:12,241 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:12,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:12,241 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:12,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:12,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:12,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:12,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:12,242 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:12,242 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:12,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:12,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:12,243 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:12,243 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:12,243 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:12,243 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:12,243 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:12,243 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:12,243 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:12,243 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:12,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:12,245 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:12,245 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:12,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:12,246 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:12,246 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:12,321 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:12,322 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:28:12,322 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:12,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:12,322 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:12,322 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:12,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable857 [2022-12-06 07:28:12,322 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-06 07:28:12,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:12,322 INFO L85 PathProgramCache]: Analyzing trace with hash 172463689, now seen corresponding path program 1 times [2022-12-06 07:28:12,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:12,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376573474] [2022-12-06 07:28:12,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:12,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:12,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-06 07:28:12,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:12,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376573474] [2022-12-06 07:28:12,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376573474] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:12,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:12,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:12,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819788234] [2022-12-06 07:28:12,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:12,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:12,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:12,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:12,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:12,384 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:12,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:12,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:12,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:12,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:12,425 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:12,425 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:12,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:12,426 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:12,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:12,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:12,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:12,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:12,426 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:12,427 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:12,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:12,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:12,427 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:12,427 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:12,427 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:12,427 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:12,428 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:12,428 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:12,428 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:12,428 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:12,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:12,430 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:12,430 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:12,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 144 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:12,430 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:12,430 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:12,505 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:12,506 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:28:12,506 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:12,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:12,506 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:12,506 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:12,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable858 [2022-12-06 07:28:12,506 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-06 07:28:12,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:12,506 INFO L85 PathProgramCache]: Analyzing trace with hash 202939882, now seen corresponding path program 1 times [2022-12-06 07:28:12,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:12,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338281535] [2022-12-06 07:28:12,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:12,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:12,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-06 07:28:12,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:12,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338281535] [2022-12-06 07:28:12,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338281535] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:12,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:12,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:12,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599454907] [2022-12-06 07:28:12,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:12,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:12,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:12,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:12,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:12,567 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:12,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:12,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:12,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:12,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:12,604 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:12,604 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:12,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:12,604 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:12,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:12,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:12,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:12,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:12,605 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:12,605 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:12,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:12,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:12,606 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:12,606 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:12,606 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:12,606 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:12,606 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:12,606 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:12,606 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:12,606 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:12,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:12,608 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:12,609 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:12,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:12,609 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:12,609 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:12,682 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:12,682 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:12,682 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:12,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:12,683 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:12,683 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:12,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable859 [2022-12-06 07:28:12,683 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-06 07:28:12,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:12,683 INFO L85 PathProgramCache]: Analyzing trace with hash 229721991, now seen corresponding path program 1 times [2022-12-06 07:28:12,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:12,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535016084] [2022-12-06 07:28:12,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:12,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:12,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-06 07:28:12,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:12,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535016084] [2022-12-06 07:28:12,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535016084] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:12,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:12,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:12,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034009794] [2022-12-06 07:28:12,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:12,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:12,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:12,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:12,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:12,743 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:12,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:12,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:12,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:12,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:12,783 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:12,784 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:12,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:12,784 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:12,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:12,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:12,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:12,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:12,785 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:12,785 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:12,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:12,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:12,785 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:12,785 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:12,786 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:12,786 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:12,786 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:12,786 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:12,786 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:12,786 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:12,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:12,788 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:12,788 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:12,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:12,788 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:12,788 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:12,866 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:12,867 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:28:12,867 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:12,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:12,867 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:12,867 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:12,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable860 [2022-12-06 07:28:12,867 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-06 07:28:12,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:12,867 INFO L85 PathProgramCache]: Analyzing trace with hash 260198184, now seen corresponding path program 1 times [2022-12-06 07:28:12,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:12,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131154739] [2022-12-06 07:28:12,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:12,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:12,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-06 07:28:12,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:12,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131154739] [2022-12-06 07:28:12,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131154739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:12,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:12,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:12,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610208901] [2022-12-06 07:28:12,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:12,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:12,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:12,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:12,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:12,936 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:12,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:12,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:12,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:12,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:12,972 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:12,973 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:12,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:12,973 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:12,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:12,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:12,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:12,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:12,974 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:12,974 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:12,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:12,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:12,975 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:12,975 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:12,975 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:12,975 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:12,975 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:12,975 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:12,976 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:12,976 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:12,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:12,979 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:12,979 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:12,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:12,980 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:12,980 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:13,072 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:13,072 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 07:28:13,072 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:13,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:13,072 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:13,072 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:13,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable861 [2022-12-06 07:28:13,073 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-06 07:28:13,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:13,073 INFO L85 PathProgramCache]: Analyzing trace with hash 286980293, now seen corresponding path program 1 times [2022-12-06 07:28:13,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:13,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248961042] [2022-12-06 07:28:13,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:13,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:13,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-06 07:28:13,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:13,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248961042] [2022-12-06 07:28:13,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248961042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:13,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:13,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:13,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994181291] [2022-12-06 07:28:13,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:13,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:13,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:13,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:13,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:13,136 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:13,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:13,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:13,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:13,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:13,177 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:13,178 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:13,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:13,178 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:13,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:13,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:13,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:13,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:13,179 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:13,179 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:13,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:13,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:13,180 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:13,180 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:13,180 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:13,180 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:13,180 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:13,180 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:13,180 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:13,180 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:13,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:13,182 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:13,182 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:13,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:13,183 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:13,183 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:13,258 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:13,258 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:13,258 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:13,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:13,258 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:13,258 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:13,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable862 [2022-12-06 07:28:13,258 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-06 07:28:13,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:13,259 INFO L85 PathProgramCache]: Analyzing trace with hash 317456486, now seen corresponding path program 1 times [2022-12-06 07:28:13,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:13,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303408851] [2022-12-06 07:28:13,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:13,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:13,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:13,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-06 07:28:13,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:13,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303408851] [2022-12-06 07:28:13,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303408851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:13,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:13,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:13,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465886187] [2022-12-06 07:28:13,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:13,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:13,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:13,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:13,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:13,326 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:13,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:13,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:13,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:13,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:13,369 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:13,369 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:13,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:13,369 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:13,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:13,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:13,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:13,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:13,370 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:13,370 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:13,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:13,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:13,371 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:13,371 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:13,371 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:13,371 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:13,371 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:13,371 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:13,371 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:13,371 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:13,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:13,373 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:13,374 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:13,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:13,374 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:13,374 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:13,447 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:13,448 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:13,448 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:13,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:13,448 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:13,448 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:13,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable863 [2022-12-06 07:28:13,448 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-06 07:28:13,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:13,448 INFO L85 PathProgramCache]: Analyzing trace with hash 344238595, now seen corresponding path program 1 times [2022-12-06 07:28:13,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:13,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200044249] [2022-12-06 07:28:13,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:13,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:13,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-06 07:28:13,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:13,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200044249] [2022-12-06 07:28:13,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200044249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:13,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:13,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:13,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151118333] [2022-12-06 07:28:13,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:13,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:13,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:13,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:13,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:13,512 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:13,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:13,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:13,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:13,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:13,548 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:13,548 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:13,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:13,548 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:13,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:13,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:13,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:13,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:13,549 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:13,549 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:13,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:13,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:13,550 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:13,550 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:13,550 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:13,550 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:13,550 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:13,550 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:13,550 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:13,550 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:13,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:13,553 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:13,553 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:13,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:13,553 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:13,553 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:13,626 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:13,627 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:13,627 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:13,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:13,627 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:13,627 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:13,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable864 [2022-12-06 07:28:13,627 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-06 07:28:13,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:13,627 INFO L85 PathProgramCache]: Analyzing trace with hash 374714788, now seen corresponding path program 1 times [2022-12-06 07:28:13,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:13,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079243835] [2022-12-06 07:28:13,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:13,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:13,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-06 07:28:13,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:13,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079243835] [2022-12-06 07:28:13,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079243835] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:13,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:13,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:13,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852729994] [2022-12-06 07:28:13,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:13,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:13,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:13,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:13,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:13,693 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:13,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:13,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:13,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:13,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:13,736 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:13,736 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:13,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:13,736 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:13,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:13,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:13,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:13,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:13,737 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:13,737 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:13,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:13,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:13,738 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:13,738 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:13,738 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:13,738 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:13,738 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:13,738 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:13,738 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:13,738 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:13,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:13,740 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:13,741 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:13,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:13,741 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:13,741 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:13,814 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:13,815 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:13,815 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:13,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:13,815 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:13,815 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:13,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable865 [2022-12-06 07:28:13,815 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-06 07:28:13,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:13,815 INFO L85 PathProgramCache]: Analyzing trace with hash 401496897, now seen corresponding path program 1 times [2022-12-06 07:28:13,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:13,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552322499] [2022-12-06 07:28:13,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:13,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:13,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:13,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:13,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552322499] [2022-12-06 07:28:13,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552322499] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:13,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:13,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:13,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993047344] [2022-12-06 07:28:13,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:13,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:13,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:13,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:13,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:13,886 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:13,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:13,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:13,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:13,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:13,927 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:13,928 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:13,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:13,928 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:13,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:13,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:13,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:13,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:13,929 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:13,929 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:13,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:13,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:13,929 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:13,930 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:13,930 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:13,930 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:13,930 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:13,930 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:13,930 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:13,930 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:13,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:13,932 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:13,932 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:13,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:13,933 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:13,933 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:14,005 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:14,006 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:14,006 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:14,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:14,006 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:14,006 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:14,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable866 [2022-12-06 07:28:14,006 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-06 07:28:14,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:14,006 INFO L85 PathProgramCache]: Analyzing trace with hash 431973090, now seen corresponding path program 1 times [2022-12-06 07:28:14,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:14,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915193082] [2022-12-06 07:28:14,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:14,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:14,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-06 07:28:14,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:14,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915193082] [2022-12-06 07:28:14,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915193082] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:14,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:14,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:14,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329239794] [2022-12-06 07:28:14,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:14,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:14,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:14,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:14,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:14,072 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:14,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:14,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:14,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:14,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:14,120 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:14,121 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:14,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:14,121 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:14,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:14,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:14,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:14,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:14,122 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:14,122 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:14,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:14,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:14,123 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:14,123 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:14,123 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:14,123 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:14,123 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:14,123 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:14,123 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:14,123 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:14,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:14,125 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:14,125 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:14,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:14,126 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:14,126 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:14,200 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:14,200 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:14,201 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:14,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:14,201 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:14,201 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:14,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable867 [2022-12-06 07:28:14,201 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-06 07:28:14,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:14,201 INFO L85 PathProgramCache]: Analyzing trace with hash 458755199, now seen corresponding path program 1 times [2022-12-06 07:28:14,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:14,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506405576] [2022-12-06 07:28:14,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:14,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:14,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-06 07:28:14,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:14,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506405576] [2022-12-06 07:28:14,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506405576] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:14,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:14,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:14,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683071664] [2022-12-06 07:28:14,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:14,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:14,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:14,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:14,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:14,259 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:14,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:14,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:14,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:14,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:14,302 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:14,302 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:14,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:14,303 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:14,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:14,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:14,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:14,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:14,303 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:14,303 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:14,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:14,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:14,304 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:14,304 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:14,304 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:14,304 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:14,304 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:14,304 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:14,304 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:14,304 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:14,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:14,307 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:14,307 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:14,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:14,307 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:14,307 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:14,381 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:14,381 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:14,381 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:14,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:14,381 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:14,382 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:14,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable868 [2022-12-06 07:28:14,382 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-06 07:28:14,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:14,382 INFO L85 PathProgramCache]: Analyzing trace with hash 489231392, now seen corresponding path program 1 times [2022-12-06 07:28:14,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:14,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669659142] [2022-12-06 07:28:14,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:14,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28: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-06 07:28:14,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:14,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669659142] [2022-12-06 07:28:14,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669659142] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:14,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:14,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:14,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198427776] [2022-12-06 07:28:14,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:14,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:14,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:14,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:14,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:14,442 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:14,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:14,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:14,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:14,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:14,485 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:14,485 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:14,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:14,485 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:14,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:14,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:14,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:14,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:14,486 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:14,486 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:14,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:14,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:14,487 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:14,487 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:14,487 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:14,487 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:14,487 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:14,487 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:14,487 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:14,487 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:14,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:14,490 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:14,490 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:14,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:14,490 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:14,490 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:14,566 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:14,567 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:28:14,567 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:14,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:14,567 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:14,567 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:14,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable869 [2022-12-06 07:28:14,567 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-06 07:28:14,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:14,568 INFO L85 PathProgramCache]: Analyzing trace with hash 516013501, now seen corresponding path program 1 times [2022-12-06 07:28:14,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:14,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982542482] [2022-12-06 07:28:14,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:14,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:14,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-06 07:28:14,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:14,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982542482] [2022-12-06 07:28:14,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982542482] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:14,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:14,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:14,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70557867] [2022-12-06 07:28:14,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:14,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:14,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:14,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:14,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:14,630 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:14,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:14,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:14,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:14,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:14,669 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:14,669 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:14,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:14,670 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:14,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:14,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:14,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:14,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:14,670 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:14,670 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:14,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:14,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:14,671 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:14,671 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:14,671 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:14,671 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:14,671 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:14,672 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:14,672 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:14,672 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:14,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:14,674 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:14,674 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:14,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:14,674 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:14,674 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:14,748 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:14,749 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:14,749 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:14,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:14,749 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:14,749 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:14,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable870 [2022-12-06 07:28:14,749 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-06 07:28:14,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:14,750 INFO L85 PathProgramCache]: Analyzing trace with hash 546489694, now seen corresponding path program 1 times [2022-12-06 07:28:14,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:14,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811405707] [2022-12-06 07:28:14,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:14,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:14,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-06 07:28:14,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:14,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811405707] [2022-12-06 07:28:14,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811405707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:14,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:14,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:14,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774778160] [2022-12-06 07:28:14,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:14,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:14,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:14,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:14,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:14,808 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:14,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:14,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:14,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:14,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:14,845 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:14,845 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:14,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:14,845 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:14,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:14,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:14,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:14,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:14,846 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:14,846 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:14,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:14,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:14,846 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:14,847 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:14,847 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:14,847 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:14,847 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:14,847 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:14,847 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:14,847 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:14,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:14,849 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:14,849 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:14,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:14,850 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:14,850 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:14,923 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:14,924 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:14,924 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:14,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:14,924 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:14,924 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:14,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable871 [2022-12-06 07:28:14,924 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-06 07:28:14,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:14,925 INFO L85 PathProgramCache]: Analyzing trace with hash 573271803, now seen corresponding path program 1 times [2022-12-06 07:28:14,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:14,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052246976] [2022-12-06 07:28:14,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:14,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:15,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-06 07:28:15,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:15,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052246976] [2022-12-06 07:28:15,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052246976] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:15,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:15,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:15,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582709058] [2022-12-06 07:28:15,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:15,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:15,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:15,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:15,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:15,009 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:15,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:15,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:15,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:15,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:15,046 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:15,046 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:15,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:15,046 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:15,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:15,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:15,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:15,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:15,047 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:15,047 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:15,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:15,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:15,048 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:15,048 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:15,048 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:15,048 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:15,048 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:15,049 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:15,049 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:15,049 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:15,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:15,051 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:15,051 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:15,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:15,051 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:15,051 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:15,126 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:15,127 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:28:15,127 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:15,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:15,127 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:15,127 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:15,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable872 [2022-12-06 07:28:15,127 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-06 07:28:15,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:15,127 INFO L85 PathProgramCache]: Analyzing trace with hash 603747996, now seen corresponding path program 1 times [2022-12-06 07:28:15,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:15,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950692186] [2022-12-06 07:28:15,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:15,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:15,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-06 07:28:15,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:15,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950692186] [2022-12-06 07:28:15,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950692186] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:15,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:15,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:15,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336684460] [2022-12-06 07:28:15,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:15,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:15,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:15,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:15,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:15,185 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:15,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:15,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:15,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:15,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:15,226 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:15,226 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:15,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:15,227 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:15,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:15,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:15,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:15,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:15,227 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:15,228 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:15,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:15,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:15,228 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:15,228 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:15,228 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:15,228 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:15,228 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:15,229 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:15,229 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:15,229 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:15,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:15,231 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:15,231 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:15,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:15,231 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:15,231 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:15,305 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:15,305 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:15,306 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:15,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:15,306 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:15,306 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:15,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable873 [2022-12-06 07:28:15,306 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-06 07:28:15,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:15,306 INFO L85 PathProgramCache]: Analyzing trace with hash 630530105, now seen corresponding path program 1 times [2022-12-06 07:28:15,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:15,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089395760] [2022-12-06 07:28:15,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:15,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:15,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-06 07:28:15,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:15,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089395760] [2022-12-06 07:28:15,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089395760] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:15,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:15,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:15,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974430155] [2022-12-06 07:28:15,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:15,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:15,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:15,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:15,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:15,372 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:15,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:15,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:15,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:15,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:15,414 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:15,414 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:15,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:15,414 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:15,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:15,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:15,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:15,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:15,415 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:15,415 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:15,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:15,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:15,416 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:15,416 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:15,416 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:15,416 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:15,416 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:15,416 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:15,416 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:15,416 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:15,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:15,418 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:15,418 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:15,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:15,419 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:15,419 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:15,494 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:15,495 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:28:15,495 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:15,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:15,495 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:15,495 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:15,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable874 [2022-12-06 07:28:15,495 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-06 07:28:15,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:15,495 INFO L85 PathProgramCache]: Analyzing trace with hash 661006298, now seen corresponding path program 1 times [2022-12-06 07:28:15,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:15,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394404068] [2022-12-06 07:28:15,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:15,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:15,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:15,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:15,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394404068] [2022-12-06 07:28:15,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394404068] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:15,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:15,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:15,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721322937] [2022-12-06 07:28:15,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:15,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:15,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:15,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:15,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:15,554 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:15,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:15,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:15,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:15,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:15,596 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:15,597 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:15,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:15,597 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:15,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:15,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:15,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:15,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:15,598 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:15,598 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:15,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:15,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:15,598 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:15,598 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:15,599 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:15,599 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:15,599 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:15,599 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:15,599 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:15,599 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:15,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:15,601 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:15,601 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:15,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:15,602 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:15,602 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:15,677 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:15,678 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:28:15,678 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:15,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:15,678 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:15,678 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:15,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable875 [2022-12-06 07:28:15,678 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-06 07:28:15,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:15,678 INFO L85 PathProgramCache]: Analyzing trace with hash 687788407, now seen corresponding path program 1 times [2022-12-06 07:28:15,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:15,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837914421] [2022-12-06 07:28:15,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:15,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:15,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:15,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-06 07:28:15,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:15,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837914421] [2022-12-06 07:28:15,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837914421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:15,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:15,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:15,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985471445] [2022-12-06 07:28:15,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:15,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:15,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:15,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:15,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:15,738 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:15,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:15,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:15,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:15,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:15,779 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:15,779 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:15,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:15,780 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:15,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:15,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:15,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:15,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:15,780 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:15,780 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:15,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:15,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:15,781 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:15,781 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:15,781 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:15,781 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:15,781 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:15,782 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:15,782 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:15,782 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:15,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:15,784 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:15,784 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:15,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:15,784 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:15,784 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:15,858 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:15,858 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:15,858 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:15,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:15,858 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:15,858 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:15,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable876 [2022-12-06 07:28:15,859 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-06 07:28:15,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:15,859 INFO L85 PathProgramCache]: Analyzing trace with hash 718264600, now seen corresponding path program 1 times [2022-12-06 07:28:15,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:15,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455000037] [2022-12-06 07:28:15,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:15,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:15,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-06 07:28:15,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:15,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455000037] [2022-12-06 07:28:15,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455000037] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:15,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:15,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:15,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603716281] [2022-12-06 07:28:15,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:15,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:15,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:15,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:15,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:15,917 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:15,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:15,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:15,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:15,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:15,961 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:15,961 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:15,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:15,961 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:15,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:15,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:15,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:15,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:15,962 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:15,962 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:15,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:15,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:15,963 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:15,963 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:15,963 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:15,963 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:15,963 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:15,963 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:15,963 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:15,963 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:15,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:15,966 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:15,966 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:15,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:15,966 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:15,966 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:16,038 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:16,039 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:16,039 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:16,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:16,039 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:16,039 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:16,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable877 [2022-12-06 07:28:16,039 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-06 07:28:16,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:16,039 INFO L85 PathProgramCache]: Analyzing trace with hash 745046709, now seen corresponding path program 1 times [2022-12-06 07:28:16,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:16,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800671232] [2022-12-06 07:28:16,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:16,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:16,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-06 07:28:16,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:16,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800671232] [2022-12-06 07:28:16,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800671232] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:16,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:16,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:16,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259387595] [2022-12-06 07:28:16,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:16,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:16,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:16,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:16,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:16,099 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:16,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:16,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:16,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:16,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:16,139 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:16,140 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:16,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:16,140 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:16,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:16,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:16,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:16,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:16,141 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:16,141 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:16,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:16,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:16,142 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:16,142 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:16,142 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:16,142 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:16,142 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:16,142 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:16,142 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:16,142 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:16,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:16,144 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:16,144 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:16,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:16,145 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:16,145 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:16,217 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:16,218 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:16,218 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:16,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:16,218 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:16,218 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:16,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable878 [2022-12-06 07:28:16,218 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-06 07:28:16,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:16,218 INFO L85 PathProgramCache]: Analyzing trace with hash 775522902, now seen corresponding path program 1 times [2022-12-06 07:28:16,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:16,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632195838] [2022-12-06 07:28:16,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:16,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:16,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:16,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-06 07:28:16,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:16,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632195838] [2022-12-06 07:28:16,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632195838] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:16,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:16,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:16,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104247886] [2022-12-06 07:28:16,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:16,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:16,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:16,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:16,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:16,278 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:16,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:16,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:16,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:16,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:16,320 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:16,320 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:16,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:16,320 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:16,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:16,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:16,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:16,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:16,321 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:16,321 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:16,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:16,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:16,321 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:16,322 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:16,322 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:16,322 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:16,322 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:16,322 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:16,322 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:16,322 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:16,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:16,324 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:16,324 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:16,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:16,325 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:16,325 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:16,397 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:16,398 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:16,398 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:16,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:16,398 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:16,398 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:16,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable879 [2022-12-06 07:28:16,398 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-06 07:28:16,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:16,399 INFO L85 PathProgramCache]: Analyzing trace with hash 802305011, now seen corresponding path program 1 times [2022-12-06 07:28:16,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:16,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284585425] [2022-12-06 07:28:16,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:16,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:16,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-06 07:28:16,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:16,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284585425] [2022-12-06 07:28:16,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284585425] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:16,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:16,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:16,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470298441] [2022-12-06 07:28:16,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:16,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:16,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:16,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:16,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:16,461 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:16,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:16,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:16,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:16,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:16,497 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:16,497 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:16,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:16,497 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:16,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:16,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:16,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:16,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:16,498 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:16,498 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:16,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:16,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:16,499 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:16,499 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:16,499 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:16,499 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:16,499 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:16,499 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:16,499 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:16,499 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:16,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:16,501 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:16,501 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:16,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:16,502 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:16,502 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:16,575 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:16,576 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:16,576 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:16,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:16,576 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:16,576 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:16,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable880 [2022-12-06 07:28:16,576 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-06 07:28:16,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:16,576 INFO L85 PathProgramCache]: Analyzing trace with hash 832781204, now seen corresponding path program 1 times [2022-12-06 07:28:16,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:16,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217796634] [2022-12-06 07:28:16,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:16,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:16,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-06 07:28:16,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:16,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217796634] [2022-12-06 07:28:16,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217796634] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:16,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:16,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:16,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492399300] [2022-12-06 07:28:16,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:16,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:16,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:16,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:16,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:16,637 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:16,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:16,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:16,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:16,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:16,678 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:16,678 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:16,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:16,679 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:16,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:16,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:16,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:16,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:16,679 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:16,680 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:16,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:16,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:16,680 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:16,680 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:16,680 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:16,680 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:16,681 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:16,681 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:16,681 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:16,681 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:16,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:16,683 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:16,683 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:16,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:16,683 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:16,683 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:16,756 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:16,757 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:16,757 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:16,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:16,757 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:16,757 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:16,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable881 [2022-12-06 07:28:16,757 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-06 07:28:16,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:16,758 INFO L85 PathProgramCache]: Analyzing trace with hash 859563313, now seen corresponding path program 1 times [2022-12-06 07:28:16,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:16,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629075615] [2022-12-06 07:28:16,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:16,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:16,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-06 07:28:16,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:16,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629075615] [2022-12-06 07:28:16,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629075615] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:16,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:16,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:16,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142704885] [2022-12-06 07:28:16,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:16,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:16,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:16,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:16,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:16,819 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:16,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:16,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:16,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:16,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:16,854 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:16,854 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:16,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:16,855 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:16,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:16,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:16,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:16,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:16,856 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:16,856 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:16,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:16,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:16,856 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:16,856 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:16,857 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:16,857 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:16,857 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:16,857 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:16,857 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:16,857 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:16,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:16,859 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:16,859 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:16,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:16,860 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:16,860 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:16,934 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:16,934 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:16,934 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:16,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:16,934 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:16,934 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:16,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable882 [2022-12-06 07:28:16,935 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-06 07:28:16,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:16,935 INFO L85 PathProgramCache]: Analyzing trace with hash 890039506, now seen corresponding path program 1 times [2022-12-06 07:28:16,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:16,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314946852] [2022-12-06 07:28:16,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:16,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:17,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-06 07:28:17,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:17,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314946852] [2022-12-06 07:28:17,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314946852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:17,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:17,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:17,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225995274] [2022-12-06 07:28:17,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:17,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:17,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:17,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:17,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:17,005 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:17,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:17,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:17,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:17,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:17,042 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:17,043 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:17,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:17,043 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:17,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:17,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:17,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:17,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:17,044 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:17,044 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:17,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:17,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:17,044 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:17,044 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:17,045 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:17,045 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:17,045 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:17,045 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:17,045 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:17,045 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:17,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:17,048 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:17,048 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:17,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:17,049 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:17,049 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:17,144 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:17,145 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 07:28:17,145 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:17,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:17,145 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:17,146 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:17,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable883 [2022-12-06 07:28:17,146 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-06 07:28:17,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:17,146 INFO L85 PathProgramCache]: Analyzing trace with hash 916821615, now seen corresponding path program 1 times [2022-12-06 07:28:17,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:17,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705888696] [2022-12-06 07:28:17,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:17,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:17,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:17,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-06 07:28:17,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:17,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705888696] [2022-12-06 07:28:17,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705888696] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:17,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:17,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:17,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594773106] [2022-12-06 07:28:17,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:17,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:17,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:17,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:17,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:17,227 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:17,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:17,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:17,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:17,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:17,270 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:17,270 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:17,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:17,270 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:17,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:17,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:17,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:17,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:17,271 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:17,271 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:17,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:17,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:17,271 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:17,272 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:17,272 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:17,272 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:17,272 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:17,272 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:17,272 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:17,272 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:17,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:17,274 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:17,274 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:17,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:17,275 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:17,275 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:17,347 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:17,348 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:17,348 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:17,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:17,348 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:17,348 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:17,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable884 [2022-12-06 07:28:17,348 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-06 07:28:17,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:17,348 INFO L85 PathProgramCache]: Analyzing trace with hash 947297808, now seen corresponding path program 1 times [2022-12-06 07:28:17,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:17,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309796630] [2022-12-06 07:28:17,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:17,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:17,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:17,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:17,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309796630] [2022-12-06 07:28:17,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309796630] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:17,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:17,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:17,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776580457] [2022-12-06 07:28:17,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:17,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:17,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:17,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:17,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:17,406 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:17,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:17,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:17,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:17,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:17,448 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:17,448 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:17,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:17,449 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:17,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:17,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:17,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:17,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:17,452 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:17,452 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:17,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:17,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:17,452 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:17,452 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:17,453 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:17,453 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:17,453 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:17,453 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:17,453 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:17,453 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:17,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:17,455 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:17,455 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:17,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:17,456 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:17,456 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:17,527 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:17,528 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:17,528 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:17,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:17,528 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:17,528 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:17,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable885 [2022-12-06 07:28:17,528 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-06 07:28:17,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:17,528 INFO L85 PathProgramCache]: Analyzing trace with hash 974079917, now seen corresponding path program 1 times [2022-12-06 07:28:17,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:17,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934352907] [2022-12-06 07:28:17,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:17,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:17,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-06 07:28:17,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:17,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934352907] [2022-12-06 07:28:17,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934352907] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:17,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:17,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:17,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398689529] [2022-12-06 07:28:17,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:17,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:17,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:17,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:17,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:17,590 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:17,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:17,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:17,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:17,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:17,626 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:17,626 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:17,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:17,627 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:17,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:17,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:17,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:17,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:17,627 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:17,627 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:17,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:17,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:17,628 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:17,628 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:17,628 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:17,629 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:17,629 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:17,629 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:17,629 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:17,629 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:17,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:17,631 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:17,631 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:17,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:17,631 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:17,631 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:17,705 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:17,706 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:17,706 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:17,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:17,706 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:17,706 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:17,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable886 [2022-12-06 07:28:17,706 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-06 07:28:17,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:17,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1004556110, now seen corresponding path program 1 times [2022-12-06 07:28:17,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:17,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586454226] [2022-12-06 07:28:17,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:17,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:17,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-06 07:28:17,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:17,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586454226] [2022-12-06 07:28:17,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586454226] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:17,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:17,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:17,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831617310] [2022-12-06 07:28:17,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:17,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:17,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:17,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:17,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:17,764 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:17,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:17,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:17,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:17,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:17,807 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:17,807 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:17,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:17,807 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:17,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:17,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:17,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:17,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:17,808 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:17,808 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:17,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:17,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:17,808 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:17,809 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:17,809 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:17,809 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:17,809 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:17,809 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:17,809 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:17,809 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:17,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:17,811 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:17,811 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:17,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:17,812 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:17,812 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:17,884 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:17,885 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:17,885 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:17,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:17,885 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:17,885 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:17,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable887 [2022-12-06 07:28:17,885 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-06 07:28:17,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:17,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1031338219, now seen corresponding path program 1 times [2022-12-06 07:28:17,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:17,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651280138] [2022-12-06 07:28:17,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:17,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:17,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-06 07:28:17,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:17,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651280138] [2022-12-06 07:28:17,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651280138] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:17,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:17,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:17,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519483720] [2022-12-06 07:28:17,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:17,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:17,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:17,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:17,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:17,946 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:17,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:17,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:17,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:17,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:17,993 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:17,994 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:17,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 371 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:17,994 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:17,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:17,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:17,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:17,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:17,995 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:17,995 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:17,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:17,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:17,995 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:17,995 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:17,996 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:17,996 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:17,996 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:17,996 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:17,996 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:17,996 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:17,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:17,998 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:17,998 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:17,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:17,999 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:17,999 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:18,074 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:18,075 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:28:18,075 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:18,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:18,075 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:18,075 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:18,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable888 [2022-12-06 07:28:18,075 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-06 07:28:18,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:18,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1061814412, now seen corresponding path program 1 times [2022-12-06 07:28:18,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:18,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165572357] [2022-12-06 07:28:18,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:18,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:18,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-06 07:28:18,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:18,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165572357] [2022-12-06 07:28:18,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165572357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:18,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:18,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:18,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337193055] [2022-12-06 07:28:18,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:18,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:18,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:18,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:18,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:18,137 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:18,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:18,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:18,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:18,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:18,173 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:18,173 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:18,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:18,173 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:18,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:18,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:18,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:18,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:18,174 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:18,174 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:18,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:18,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:18,174 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:18,175 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:18,175 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:18,175 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:18,175 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:18,175 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:18,175 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:18,175 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:18,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:18,177 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:18,177 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:18,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:18,178 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:18,178 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:18,251 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:18,252 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:18,252 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:18,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:18,252 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:18,252 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:18,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable889 [2022-12-06 07:28:18,252 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-06 07:28:18,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:18,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1088596521, now seen corresponding path program 1 times [2022-12-06 07:28:18,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:18,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792296672] [2022-12-06 07:28:18,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:18,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:18,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-06 07:28:18,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:18,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792296672] [2022-12-06 07:28:18,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792296672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:18,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:18,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:18,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710640946] [2022-12-06 07:28:18,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:18,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:18,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:18,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:18,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:18,315 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:18,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:18,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:18,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:18,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:18,351 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:18,351 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:18,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:18,352 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:18,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:18,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:18,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:18,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:18,352 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:18,352 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:18,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:18,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:18,353 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:18,353 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:18,353 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:18,353 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:18,353 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:18,354 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:18,354 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:18,354 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:18,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:18,356 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:18,356 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:18,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:18,356 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:18,356 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:18,430 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:18,431 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:18,431 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:18,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:18,431 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:18,431 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:18,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable890 [2022-12-06 07:28:18,431 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-06 07:28:18,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:18,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1119072714, now seen corresponding path program 1 times [2022-12-06 07:28:18,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:18,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902436218] [2022-12-06 07:28:18,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:18,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:18,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-06 07:28:18,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:18,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902436218] [2022-12-06 07:28:18,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902436218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:18,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:18,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:18,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327841734] [2022-12-06 07:28:18,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:18,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:18,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:18,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:18,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:18,508 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:18,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:18,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:18,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:18,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:18,545 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:18,546 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:18,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:18,546 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:18,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:18,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:18,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:18,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:18,547 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:18,547 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:18,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:18,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:18,548 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:18,548 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:18,548 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:18,548 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:18,548 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:18,548 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:18,548 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:18,548 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:18,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:18,551 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:18,551 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:18,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:18,551 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:18,551 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:18,626 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:18,626 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:18,626 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:18,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:18,626 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:18,627 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:18,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable891 [2022-12-06 07:28:18,627 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-06 07:28:18,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:18,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1145854823, now seen corresponding path program 1 times [2022-12-06 07:28:18,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:18,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449507495] [2022-12-06 07:28:18,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:18,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:18,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-06 07:28:18,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:18,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449507495] [2022-12-06 07:28:18,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449507495] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:18,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:18,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:18,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022339914] [2022-12-06 07:28:18,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:18,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:18,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:18,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:18,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:18,689 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:18,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:18,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:18,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:18,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:18,725 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:18,725 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:18,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:18,726 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:18,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:18,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:18,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:18,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:18,727 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:18,727 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:18,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:18,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:18,727 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:18,727 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:18,727 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:18,728 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:18,728 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:18,728 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:18,728 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:18,728 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:18,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:18,730 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:18,730 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:18,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:18,730 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:18,730 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:18,807 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:18,807 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:28:18,807 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:18,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:18,807 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:18,807 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:18,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable892 [2022-12-06 07:28:18,808 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-06 07:28:18,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:18,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1176331016, now seen corresponding path program 1 times [2022-12-06 07:28:18,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:18,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949465422] [2022-12-06 07:28:18,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:18,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:18,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-06 07:28:18,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:18,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949465422] [2022-12-06 07:28:18,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949465422] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:18,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:18,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:18,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603747904] [2022-12-06 07:28:18,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:18,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:18,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:18,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:18,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:18,874 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:18,875 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:18,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:18,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:18,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:18,911 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:18,912 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:18,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:18,912 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:18,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:18,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:18,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:18,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:18,913 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:18,913 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:18,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:18,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:18,913 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:18,913 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:18,914 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:18,914 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:18,914 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:18,914 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:18,914 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:18,914 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:18,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:18,916 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:18,916 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:18,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:18,916 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:18,916 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:18,989 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:18,989 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:18,990 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:18,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:18,990 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:18,990 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:18,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable893 [2022-12-06 07:28:18,990 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-06 07:28:18,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:18,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1203113125, now seen corresponding path program 1 times [2022-12-06 07:28:18,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:18,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793774685] [2022-12-06 07:28:18,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:18,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:19,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-06 07:28:19,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:19,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793774685] [2022-12-06 07:28:19,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793774685] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:19,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:19,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:19,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681815318] [2022-12-06 07:28:19,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:19,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:19,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:19,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:19,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:19,063 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:19,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:19,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:19,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:19,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:19,119 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:19,119 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:19,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:19,120 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:19,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:19,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:19,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:19,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:19,120 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:19,120 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:19,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:19,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:19,121 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:19,121 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:19,122 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:19,122 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:19,122 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:19,122 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:19,122 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:19,122 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:19,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:19,124 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:19,124 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:19,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:19,124 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:19,124 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:19,198 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:19,198 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:19,199 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:19,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:19,199 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:19,199 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:19,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable894 [2022-12-06 07:28:19,199 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-06 07:28:19,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:19,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1233589318, now seen corresponding path program 1 times [2022-12-06 07:28:19,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:19,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177759388] [2022-12-06 07:28:19,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:19,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:19,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-06 07:28:19,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:19,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177759388] [2022-12-06 07:28:19,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177759388] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:19,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:19,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:19,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154701081] [2022-12-06 07:28:19,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:19,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:19,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:19,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:19,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:19,262 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:19,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:19,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:19,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:19,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:19,306 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:19,307 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:19,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:19,307 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:19,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:19,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:19,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:19,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:19,308 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:19,308 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:19,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:19,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:19,308 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:19,308 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:19,309 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:19,309 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:19,309 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:19,309 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:19,309 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:19,309 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:19,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:19,311 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:19,311 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:19,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:19,311 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:19,311 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:19,385 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:19,385 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:19,386 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:19,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:19,386 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:19,386 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:19,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable895 [2022-12-06 07:28:19,386 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-06 07:28:19,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:19,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1260371427, now seen corresponding path program 1 times [2022-12-06 07:28:19,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:19,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222347253] [2022-12-06 07:28:19,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:19,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:19,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-06 07:28:19,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:19,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222347253] [2022-12-06 07:28:19,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222347253] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:19,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:19,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:19,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393126674] [2022-12-06 07:28:19,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:19,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:19,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:19,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:19,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:19,447 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:19,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:19,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:19,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:19,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:19,486 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:19,486 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:19,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:19,487 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:19,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:19,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:19,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:19,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:19,488 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:19,488 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:19,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:19,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:19,488 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:19,488 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:19,489 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:19,489 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:19,489 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:19,489 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:19,489 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:19,489 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:19,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:19,491 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:19,491 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:19,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:19,492 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:19,492 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:19,564 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:19,565 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:19,565 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:19,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:19,565 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:19,565 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:19,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable896 [2022-12-06 07:28:19,565 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-06 07:28:19,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:19,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1290847620, now seen corresponding path program 1 times [2022-12-06 07:28:19,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:19,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801374451] [2022-12-06 07:28:19,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:19,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:19,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-06 07:28:19,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:19,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801374451] [2022-12-06 07:28:19,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801374451] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:19,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:19,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:19,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197392994] [2022-12-06 07:28:19,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:19,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:19,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:19,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:19,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:19,624 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:19,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:19,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:19,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:19,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:19,668 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:19,668 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:19,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:19,668 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:19,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:19,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:19,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:19,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:19,669 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:19,669 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:19,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:19,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:19,670 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:19,670 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:19,670 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:19,670 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:19,670 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:19,670 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:19,670 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:19,670 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:19,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:19,672 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:19,672 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:19,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 118 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:19,673 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:19,673 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:19,747 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:19,747 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:19,747 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:19,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:19,747 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:19,747 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:19,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable897 [2022-12-06 07:28:19,748 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-06 07:28:19,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:19,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1317629729, now seen corresponding path program 1 times [2022-12-06 07:28:19,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:19,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123846501] [2022-12-06 07:28:19,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:19,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:19,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-06 07:28:19,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:19,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123846501] [2022-12-06 07:28:19,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123846501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:19,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:19,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:19,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897476334] [2022-12-06 07:28:19,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:19,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:19,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:19,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:19,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:19,808 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:19,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:19,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:19,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:19,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:19,849 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:19,849 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:19,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:19,849 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:19,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:19,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:19,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:19,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:19,850 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:19,850 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:19,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:19,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:19,851 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:19,851 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:19,851 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:19,851 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:19,851 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:19,851 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:19,851 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:19,851 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:19,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:19,853 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:19,854 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:19,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:19,854 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:19,854 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:19,927 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:19,927 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:19,927 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:19,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:19,928 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:19,928 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:19,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable898 [2022-12-06 07:28:19,928 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-06 07:28:19,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:19,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1348105922, now seen corresponding path program 1 times [2022-12-06 07:28:19,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:19,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673627082] [2022-12-06 07:28:19,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:19,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:19,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-06 07:28:19,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:19,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673627082] [2022-12-06 07:28:19,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673627082] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:19,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:19,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:19,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940103998] [2022-12-06 07:28:19,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:19,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:19,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:19,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:19,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:19,987 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:19,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:19,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:19,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:19,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:20,048 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:20,049 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:20,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:20,049 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:20,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:20,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:20,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:20,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:20,050 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:20,050 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:20,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:20,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:20,050 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:20,050 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:20,050 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:20,051 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:20,051 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:20,051 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:20,051 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:20,051 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:20,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:20,061 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:20,061 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:20,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:20,061 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:20,062 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:20,135 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:20,135 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:28:20,136 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:20,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:20,136 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:20,136 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:20,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable899 [2022-12-06 07:28:20,136 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-06 07:28:20,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:20,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1374888031, now seen corresponding path program 1 times [2022-12-06 07:28:20,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:20,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936379158] [2022-12-06 07:28:20,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:20,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28: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-06 07:28:20,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:20,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936379158] [2022-12-06 07:28:20,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936379158] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:20,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:20,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:20,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964996869] [2022-12-06 07:28:20,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:20,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:20,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:20,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:20,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:20,215 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:20,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:20,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:20,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:20,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:20,257 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:20,258 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:20,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:20,258 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:20,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:20,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:20,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:20,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:20,259 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:20,259 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:20,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:20,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:20,260 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:20,260 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:20,260 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:20,260 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:20,260 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:20,261 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:20,261 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:20,261 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:20,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:20,264 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:20,264 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:20,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:20,264 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:20,264 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:20,349 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:20,350 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-06 07:28:20,350 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:20,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:20,350 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:20,350 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:20,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable900 [2022-12-06 07:28:20,350 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-06 07:28:20,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:20,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1405364224, now seen corresponding path program 1 times [2022-12-06 07:28:20,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:20,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093623987] [2022-12-06 07:28:20,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:20,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:20,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-06 07:28:20,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:20,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093623987] [2022-12-06 07:28:20,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093623987] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:20,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:20,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:20,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344572572] [2022-12-06 07:28:20,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:20,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:20,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:20,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:20,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:20,409 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:20,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:20,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:20,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:20,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:20,450 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:20,450 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:20,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:20,450 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:20,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:20,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:20,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:20,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:20,451 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:20,451 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:20,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:20,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:20,452 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:20,452 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:20,452 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:20,452 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:20,452 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:20,452 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:20,452 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:20,452 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:20,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:20,454 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:20,454 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:20,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:20,455 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:20,455 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:20,527 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:20,528 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:20,528 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:20,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:20,528 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:20,528 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:20,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable901 [2022-12-06 07:28:20,528 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-06 07:28:20,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:20,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1432146333, now seen corresponding path program 1 times [2022-12-06 07:28:20,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:20,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519523880] [2022-12-06 07:28:20,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:20,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:20,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-06 07:28:20,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:20,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519523880] [2022-12-06 07:28:20,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519523880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:20,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:20,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:20,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266996333] [2022-12-06 07:28:20,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:20,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:20,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:20,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:20,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:20,589 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:20,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:20,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:20,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:20,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:20,625 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:20,625 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:20,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:20,626 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:20,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:20,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:20,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:20,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:20,627 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:20,627 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:20,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:20,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:20,627 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:20,627 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:20,628 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:20,628 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:20,628 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:20,628 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:20,628 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:20,628 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:20,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:20,630 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:20,630 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:20,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:20,631 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:20,631 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:20,704 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:20,705 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:20,705 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:20,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:20,705 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:20,705 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:20,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable902 [2022-12-06 07:28:20,705 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-06 07:28:20,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:20,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1462622526, now seen corresponding path program 1 times [2022-12-06 07:28:20,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:20,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177444841] [2022-12-06 07:28:20,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:20,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:20,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-06 07:28:20,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:20,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177444841] [2022-12-06 07:28:20,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177444841] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:20,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:20,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:20,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184939224] [2022-12-06 07:28:20,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:20,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:20,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:20,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:20,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:20,763 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:20,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:20,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:20,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:20,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:20,806 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:20,806 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:20,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:20,807 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:20,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:20,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:20,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:20,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:20,807 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:20,807 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:20,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:20,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:20,808 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:20,808 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:20,808 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:20,808 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:20,808 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:20,808 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:20,808 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:20,808 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:20,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:20,811 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:20,811 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:20,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:20,811 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:20,811 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:20,897 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:20,897 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 07:28:20,897 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:20,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:20,897 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:20,897 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:20,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable903 [2022-12-06 07:28:20,898 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-06 07:28:20,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:20,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1489404635, now seen corresponding path program 1 times [2022-12-06 07:28:20,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:20,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038954714] [2022-12-06 07:28:20,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:20,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:20,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-06 07:28:20,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:20,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038954714] [2022-12-06 07:28:20,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038954714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:20,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:20,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:20,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822328828] [2022-12-06 07:28:20,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:20,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:20,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:20,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:20,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:20,959 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:20,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:20,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:20,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:20,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:20,999 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:20,999 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:20,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:21,000 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:21,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:21,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:21,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:21,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:21,000 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:21,000 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:21,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:21,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:21,001 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:21,001 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:21,001 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:21,001 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:21,001 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:21,001 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:21,002 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:21,002 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:21,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:21,004 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:21,004 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:21,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:21,004 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:21,004 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:21,076 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:21,077 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:21,077 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:21,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:21,077 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:21,077 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:21,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable904 [2022-12-06 07:28:21,077 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-06 07:28:21,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:21,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1519880828, now seen corresponding path program 1 times [2022-12-06 07:28:21,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:21,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021966133] [2022-12-06 07:28:21,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:21,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:21,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-06 07:28:21,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:21,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021966133] [2022-12-06 07:28:21,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021966133] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:21,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:21,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:21,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955397078] [2022-12-06 07:28:21,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:21,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:21,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:21,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:21,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:21,163 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:21,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:21,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:21,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:21,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:21,208 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:21,208 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:21,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:21,208 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:21,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:21,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:21,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:21,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:21,210 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:21,210 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:21,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:21,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:21,211 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:21,211 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:21,211 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:21,211 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:21,211 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:21,212 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:21,212 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:21,212 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:21,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:21,214 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:21,214 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:21,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:21,214 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:21,214 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:21,287 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:21,287 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:21,287 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:21,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:21,287 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:21,287 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:21,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable905 [2022-12-06 07:28:21,287 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-06 07:28:21,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:21,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1546662937, now seen corresponding path program 1 times [2022-12-06 07:28:21,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:21,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906099069] [2022-12-06 07:28:21,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:21,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:21,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-06 07:28:21,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:21,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906099069] [2022-12-06 07:28:21,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906099069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:21,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:21,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:21,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648339062] [2022-12-06 07:28:21,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:21,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:21,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:21,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:21,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:21,350 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:21,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:21,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:21,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:21,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:21,390 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:21,390 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:21,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:21,390 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:21,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:21,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:21,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:21,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:21,391 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:21,391 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:21,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:21,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:21,392 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:21,392 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:21,392 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:21,392 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:21,392 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:21,392 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:21,392 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:21,392 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:21,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:21,394 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:21,394 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:21,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:21,395 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:21,395 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:21,469 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:21,470 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:21,470 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:21,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:21,470 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:21,470 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:21,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable906 [2022-12-06 07:28:21,470 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-06 07:28:21,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:21,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1577139130, now seen corresponding path program 1 times [2022-12-06 07:28:21,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:21,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672617261] [2022-12-06 07:28:21,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:21,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:21,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-06 07:28:21,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:21,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672617261] [2022-12-06 07:28:21,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672617261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:21,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:21,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:21,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659165454] [2022-12-06 07:28:21,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:21,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:21,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:21,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:21,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:21,529 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:21,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:21,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:21,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:21,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:21,565 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:21,566 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:21,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 349 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:21,566 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:21,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:21,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:21,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:21,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:21,566 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:21,567 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:21,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:21,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:21,567 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:21,567 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:21,567 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:21,567 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:21,567 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:21,568 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:21,568 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:21,568 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:21,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:21,570 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:21,570 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:21,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:21,570 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:21,570 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:21,641 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:21,642 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:21,642 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:21,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:21,642 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:21,642 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:21,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable907 [2022-12-06 07:28:21,642 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-06 07:28:21,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:21,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1603921239, now seen corresponding path program 1 times [2022-12-06 07:28:21,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:21,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601136355] [2022-12-06 07:28:21,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:21,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:21,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-06 07:28:21,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:21,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601136355] [2022-12-06 07:28:21,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601136355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:21,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:21,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:21,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039781850] [2022-12-06 07:28:21,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:21,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:21,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:21,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:21,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:21,703 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:21,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:21,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:21,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:21,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:21,745 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:21,746 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:21,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:21,746 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:21,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:21,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:21,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:21,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:21,747 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:21,747 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:21,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:21,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:21,747 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:21,748 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:21,748 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:21,748 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:21,748 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:21,748 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:21,748 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:21,748 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:21,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:21,750 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:21,750 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:21,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:21,750 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:21,751 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:21,823 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:21,823 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:21,823 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:21,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:21,823 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:21,824 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:21,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable908 [2022-12-06 07:28:21,824 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-06 07:28:21,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:21,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1634397432, now seen corresponding path program 1 times [2022-12-06 07:28:21,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:21,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471491469] [2022-12-06 07:28:21,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:21,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:21,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:21,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-06 07:28:21,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:21,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471491469] [2022-12-06 07:28:21,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471491469] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:21,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:21,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:21,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604063522] [2022-12-06 07:28:21,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:21,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:21,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:21,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:21,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:21,881 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:21,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:21,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:21,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:21,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:21,917 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:21,917 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:21,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:21,917 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:21,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:21,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:21,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:21,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:21,918 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:21,918 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:21,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:21,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:21,918 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:21,918 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:21,919 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:21,919 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:21,919 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:21,919 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:21,919 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:21,919 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:21,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:21,921 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:21,921 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:21,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:21,921 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:21,921 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:21,994 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:21,994 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:21,994 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:21,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:21,995 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:21,995 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:21,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable909 [2022-12-06 07:28:21,995 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-06 07:28:21,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:21,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1661179541, now seen corresponding path program 1 times [2022-12-06 07:28:21,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:21,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906401392] [2022-12-06 07:28:21,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:21,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:22,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-06 07:28:22,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:22,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906401392] [2022-12-06 07:28:22,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906401392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:22,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:22,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:22,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949374587] [2022-12-06 07:28:22,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:22,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:22,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:22,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:22,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:22,063 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:22,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:22,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:22,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:22,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:22,104 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:22,104 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:22,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:22,104 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:22,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:22,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:22,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:22,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:22,105 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:22,105 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:22,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:22,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:22,113 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:22,113 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:22,113 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:22,113 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:22,113 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:22,114 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:22,114 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:22,114 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:22,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:22,117 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:22,117 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:22,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:22,118 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:22,118 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:22,194 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:22,194 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:28:22,194 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:22,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:22,194 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:22,194 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:22,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable910 [2022-12-06 07:28:22,195 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-06 07:28:22,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:22,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1691655734, now seen corresponding path program 1 times [2022-12-06 07:28:22,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:22,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236601803] [2022-12-06 07:28:22,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:22,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:22,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-06 07:28:22,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:22,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236601803] [2022-12-06 07:28:22,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236601803] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:22,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:22,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:22,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740782960] [2022-12-06 07:28:22,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:22,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:22,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:22,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:22,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:22,252 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:22,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:22,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:22,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:22,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:22,293 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:22,293 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:22,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:22,293 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:22,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:22,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:22,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:22,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:22,294 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:22,294 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:22,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:22,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:22,294 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:22,294 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:22,295 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:22,295 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:22,295 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:22,295 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:22,295 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:22,295 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:22,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:22,298 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:22,298 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:22,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:22,299 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:22,299 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:22,370 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:22,371 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:22,371 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:22,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:22,371 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:22,371 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:22,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable911 [2022-12-06 07:28:22,371 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-06 07:28:22,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:22,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1718437843, now seen corresponding path program 1 times [2022-12-06 07:28:22,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:22,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467003182] [2022-12-06 07:28:22,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:22,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:22,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-06 07:28:22,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:22,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467003182] [2022-12-06 07:28:22,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467003182] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:22,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:22,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:22,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778774348] [2022-12-06 07:28:22,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:22,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:22,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:22,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:22,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:22,431 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:22,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:22,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:22,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:22,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:22,467 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:22,467 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:22,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:22,468 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:22,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:22,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:22,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:22,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:22,468 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:22,469 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:22,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:22,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:22,469 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:22,469 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:22,469 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:22,469 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:22,469 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:22,470 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:22,470 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:22,470 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:22,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:22,472 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:22,472 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:22,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:22,472 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:22,472 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:22,544 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:22,544 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:22,544 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:22,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:22,544 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:22,544 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:22,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable912 [2022-12-06 07:28:22,544 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-06 07:28:22,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:22,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1748914036, now seen corresponding path program 1 times [2022-12-06 07:28:22,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:22,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950370542] [2022-12-06 07:28:22,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:22,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:22,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-06 07:28:22,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:22,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950370542] [2022-12-06 07:28:22,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950370542] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:22,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:22,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:22,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340430420] [2022-12-06 07:28:22,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:22,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:22,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:22,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:22,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:22,604 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:22,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:22,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:22,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:22,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:22,640 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:22,640 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:22,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:22,641 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:22,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:22,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:22,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:22,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:22,641 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:22,641 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:22,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:22,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:22,642 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:22,642 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:22,642 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:22,642 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:22,642 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:22,643 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:22,643 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:22,643 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:22,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:22,645 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:22,645 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:22,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:22,645 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:22,645 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:22,717 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:22,718 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:22,718 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:22,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:22,718 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:22,718 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:22,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable913 [2022-12-06 07:28:22,718 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-06 07:28:22,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:22,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1775696145, now seen corresponding path program 1 times [2022-12-06 07:28:22,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:22,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882704867] [2022-12-06 07:28:22,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:22,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:22,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:22,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:22,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:22,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882704867] [2022-12-06 07:28:22,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882704867] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:22,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:22,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:22,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257485797] [2022-12-06 07:28:22,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:22,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:22,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:22,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:22,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:22,782 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:22,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:22,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:22,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:22,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:22,818 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:22,818 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:22,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:22,819 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:22,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:22,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:22,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:22,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:22,819 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:22,819 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:22,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:22,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:22,820 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:22,820 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:22,820 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:22,820 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:22,820 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:22,821 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:22,821 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:22,821 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:22,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:22,823 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:22,823 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:22,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:22,823 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:22,823 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:22,896 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:22,897 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:22,897 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:22,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:22,897 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:22,897 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:22,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable914 [2022-12-06 07:28:22,897 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-06 07:28:22,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:22,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1806172338, now seen corresponding path program 1 times [2022-12-06 07:28:22,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:22,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079762843] [2022-12-06 07:28:22,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:22,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:22,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-06 07:28:22,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:22,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079762843] [2022-12-06 07:28:22,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079762843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:22,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:22,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:22,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883686476] [2022-12-06 07:28:22,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:22,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:22,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:22,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:22,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:22,957 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:22,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:22,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:22,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:22,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:23,000 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:23,000 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:23,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:23,001 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:23,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:23,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:23,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:23,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:23,001 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:23,001 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:23,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:23,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:23,002 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:23,002 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:23,002 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:23,002 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:23,002 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:23,002 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:23,002 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:23,002 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:23,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:23,005 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:23,005 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:23,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:23,005 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:23,005 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:23,078 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:23,079 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:23,079 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:23,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:23,079 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:23,079 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:23,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable915 [2022-12-06 07:28:23,079 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-06 07:28:23,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:23,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1832954447, now seen corresponding path program 1 times [2022-12-06 07:28:23,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:23,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935559273] [2022-12-06 07:28:23,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:23,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:23,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:23,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-06 07:28:23,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:23,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935559273] [2022-12-06 07:28:23,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935559273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:23,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:23,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:23,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159871167] [2022-12-06 07:28:23,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:23,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:23,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:23,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:23,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:23,149 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:23,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:23,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:23,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:23,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:23,184 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:23,184 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:23,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:23,185 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:23,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:23,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:23,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:23,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:23,185 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:23,185 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:23,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:23,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:23,186 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:23,186 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:23,186 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:23,186 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:23,186 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:23,186 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:23,187 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:23,187 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:23,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:23,189 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:23,189 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:23,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:23,189 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:23,189 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:23,261 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:23,262 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:23,262 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:23,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:23,262 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:23,262 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:23,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable916 [2022-12-06 07:28:23,262 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-06 07:28:23,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:23,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1863430640, now seen corresponding path program 1 times [2022-12-06 07:28:23,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:23,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508919312] [2022-12-06 07:28:23,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:23,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:23,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-06 07:28:23,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:23,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508919312] [2022-12-06 07:28:23,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508919312] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:23,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:23,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:23,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867612394] [2022-12-06 07:28:23,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:23,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:23,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:23,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:23,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:23,330 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:23,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:23,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:23,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:23,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:23,371 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:23,371 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:23,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:23,372 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:23,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:23,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:23,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:23,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:23,372 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:23,372 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:23,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:23,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:23,373 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:23,373 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:23,373 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:23,373 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:23,373 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:23,373 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:23,373 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:23,373 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:23,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:23,376 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:23,376 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:23,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:23,376 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:23,376 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:23,449 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:23,449 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:23,449 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:23,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:23,450 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:23,450 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:23,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable917 [2022-12-06 07:28:23,450 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-06 07:28:23,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:23,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1890212749, now seen corresponding path program 1 times [2022-12-06 07:28:23,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:23,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879527913] [2022-12-06 07:28:23,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:23,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:23,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28: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-06 07:28:23,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:23,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879527913] [2022-12-06 07:28:23,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879527913] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:23,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:23,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:23,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924226893] [2022-12-06 07:28:23,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:23,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:23,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:23,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:23,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:23,515 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:23,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:23,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:23,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:23,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:23,551 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:23,551 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:23,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:23,552 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:23,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:23,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:23,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:23,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:23,552 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:23,552 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:23,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:23,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:23,553 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:23,553 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:23,553 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:23,553 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:23,553 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:23,553 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:23,553 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:23,553 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:23,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:23,556 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:23,556 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:23,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:23,556 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:23,556 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:23,631 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:23,631 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:23,631 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:23,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:23,632 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:23,632 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:23,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable918 [2022-12-06 07:28:23,632 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-06 07:28:23,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:23,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1920688942, now seen corresponding path program 1 times [2022-12-06 07:28:23,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:23,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55989542] [2022-12-06 07:28:23,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:23,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:23,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:23,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:23,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:23,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55989542] [2022-12-06 07:28:23,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55989542] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:23,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:23,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:23,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530683058] [2022-12-06 07:28:23,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:23,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:23,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:23,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:23,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:23,691 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:23,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:23,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:23,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:23,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:23,728 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:23,728 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:23,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:23,729 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:23,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:23,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:23,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:23,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:23,729 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:23,729 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:23,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:23,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:23,730 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:23,730 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:23,730 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:23,730 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:23,730 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:23,730 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:23,731 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:23,731 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:23,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:23,733 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:23,733 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:23,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:23,733 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:23,733 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:23,807 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:23,808 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:23,808 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:23,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:23,808 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:23,808 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:23,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable919 [2022-12-06 07:28:23,808 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-06 07:28:23,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:23,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1947471051, now seen corresponding path program 1 times [2022-12-06 07:28:23,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:23,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836843224] [2022-12-06 07:28:23,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:23,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:23,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:23,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-06 07:28:23,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:23,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836843224] [2022-12-06 07:28:23,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836843224] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:23,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:23,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:23,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703071874] [2022-12-06 07:28:23,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:23,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:23,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:23,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:23,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:23,870 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:23,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:23,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:23,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:23,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:23,914 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:23,915 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:23,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:23,915 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:23,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:23,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:23,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:23,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:23,916 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:23,916 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:23,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:23,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:23,917 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:23,917 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:23,917 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:23,917 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:23,917 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:23,917 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:23,917 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:23,917 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:23,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:23,921 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:23,921 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:23,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:23,921 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:23,921 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:24,017 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:24,018 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-06 07:28:24,018 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:24,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:24,018 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:24,018 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:24,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable920 [2022-12-06 07:28:24,019 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-06 07:28:24,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:24,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1977947244, now seen corresponding path program 1 times [2022-12-06 07:28:24,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:24,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300760930] [2022-12-06 07:28:24,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:24,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:24,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-06 07:28:24,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:24,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300760930] [2022-12-06 07:28:24,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300760930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:24,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:24,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:24,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819656164] [2022-12-06 07:28:24,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:24,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:24,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:24,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:24,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:24,097 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:24,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:24,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:24,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:24,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:24,142 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:24,142 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:24,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:24,142 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:24,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:24,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:24,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:24,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:24,143 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:24,143 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:24,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:24,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:24,144 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:24,144 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:24,144 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:24,144 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:24,144 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:24,144 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:24,144 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:24,144 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:24,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:24,155 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:24,155 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:24,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:24,155 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:24,155 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:24,227 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:24,228 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:28:24,228 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:24,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:24,228 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:24,228 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:24,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable921 [2022-12-06 07:28:24,228 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-06 07:28:24,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:24,228 INFO L85 PathProgramCache]: Analyzing trace with hash 2004729353, now seen corresponding path program 1 times [2022-12-06 07:28:24,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:24,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365915412] [2022-12-06 07:28:24,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:24,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:24,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:24,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:24,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365915412] [2022-12-06 07:28:24,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365915412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:24,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:24,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:24,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389165400] [2022-12-06 07:28:24,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:24,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:24,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:24,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:24,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:24,287 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:24,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:24,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:24,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:24,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:24,328 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:24,328 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:24,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:24,329 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:24,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:24,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:24,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:24,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:24,329 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:24,329 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:24,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:24,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:24,330 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:24,330 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:24,330 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:24,330 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:24,330 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:24,330 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:24,330 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:24,330 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:24,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:24,333 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:24,333 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:24,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:24,333 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:24,333 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:24,405 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:24,406 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:24,406 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:24,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:24,406 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:24,406 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:24,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable922 [2022-12-06 07:28:24,406 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-06 07:28:24,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:24,406 INFO L85 PathProgramCache]: Analyzing trace with hash 2035205546, now seen corresponding path program 1 times [2022-12-06 07:28:24,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:24,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687723098] [2022-12-06 07:28:24,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:24,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:24,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:24,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:24,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687723098] [2022-12-06 07:28:24,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687723098] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:24,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:24,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:24,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743337185] [2022-12-06 07:28:24,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:24,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:24,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:24,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:24,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:24,463 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:24,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:24,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:24,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:24,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:24,504 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:24,504 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:24,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 349 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:24,505 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:24,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:24,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:24,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:24,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:24,505 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:24,505 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:24,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:24,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:24,506 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:24,506 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:24,506 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:24,506 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:24,506 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:24,506 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:24,506 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:24,507 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:24,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:24,509 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:24,509 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:24,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:24,509 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:24,509 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:24,583 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:24,584 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:24,584 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:24,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:24,584 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:24,584 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:24,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable923 [2022-12-06 07:28:24,584 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-06 07:28:24,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:24,584 INFO L85 PathProgramCache]: Analyzing trace with hash 2061987655, now seen corresponding path program 1 times [2022-12-06 07:28:24,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:24,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862186551] [2022-12-06 07:28:24,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:24,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:24,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-06 07:28:24,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:24,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862186551] [2022-12-06 07:28:24,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862186551] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:24,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:24,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:24,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625386528] [2022-12-06 07:28:24,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:24,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:24,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:24,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:24,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:24,644 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:24,644 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:24,644 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:24,644 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:24,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:24,684 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:24,685 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:24,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 371 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:24,685 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:24,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:24,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:24,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:24,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:24,686 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:24,686 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:24,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:24,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:24,686 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:24,686 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:24,687 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:24,687 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:24,687 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:24,687 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:24,687 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:24,687 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:24,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:24,689 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:24,689 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:24,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:24,689 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:24,689 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:24,762 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:24,763 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:24,763 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:24,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:24,763 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:24,763 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:24,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable924 [2022-12-06 07:28:24,763 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-06 07:28:24,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:24,763 INFO L85 PathProgramCache]: Analyzing trace with hash 2092463848, now seen corresponding path program 1 times [2022-12-06 07:28:24,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:24,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798092296] [2022-12-06 07:28:24,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:24,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:24,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:24,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:24,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798092296] [2022-12-06 07:28:24,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798092296] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:24,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:24,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:24,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836013243] [2022-12-06 07:28:24,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:24,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:24,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:24,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:24,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:24,825 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:24,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:24,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:24,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:24,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:24,861 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:24,861 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:24,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:24,862 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:24,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:24,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:24,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:24,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:24,862 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:24,862 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:24,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:24,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:24,863 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:24,863 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:24,863 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:24,863 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:24,863 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:24,863 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:24,863 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:24,864 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:24,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:24,866 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:24,866 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:24,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:24,866 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:24,866 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:24,939 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:24,939 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:24,939 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:24,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:24,939 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:24,939 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:24,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable925 [2022-12-06 07:28:24,940 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-06 07:28:24,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:24,940 INFO L85 PathProgramCache]: Analyzing trace with hash 2119245957, now seen corresponding path program 1 times [2022-12-06 07:28:24,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:24,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242638751] [2022-12-06 07:28:24,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:24,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:24,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-06 07:28:24,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:24,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242638751] [2022-12-06 07:28:24,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242638751] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:24,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:24,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:24,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885008268] [2022-12-06 07:28:24,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:24,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:24,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:25,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:25,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:25,000 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:25,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:25,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:25,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:25,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:25,036 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:25,036 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:25,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:25,036 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:25,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:25,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:25,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:25,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:25,037 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:25,037 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:25,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:25,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:25,037 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:25,037 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:25,038 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:25,038 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:25,038 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:25,038 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:25,038 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:25,038 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:25,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:25,040 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:25,040 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:25,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:25,040 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:25,040 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:25,114 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:25,114 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:25,115 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:25,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:25,115 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:25,115 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:25,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable926 [2022-12-06 07:28:25,115 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-06 07:28:25,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:25,115 INFO L85 PathProgramCache]: Analyzing trace with hash -2145245146, now seen corresponding path program 1 times [2022-12-06 07:28:25,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:25,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615567156] [2022-12-06 07:28:25,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:25,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28: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-06 07:28:25,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:25,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615567156] [2022-12-06 07:28:25,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615567156] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:25,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:25,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:25,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804356327] [2022-12-06 07:28:25,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:25,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:25,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:25,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:25,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:25,182 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:25,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:25,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:25,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:25,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:25,223 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:25,223 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:25,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:25,223 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:25,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:25,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:25,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:25,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:25,224 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:25,224 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:25,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:25,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:25,224 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:25,225 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:25,225 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:25,225 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:25,225 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:25,225 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:25,225 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:25,225 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:25,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:25,227 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:25,227 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:25,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:25,228 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:25,228 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:25,301 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:25,302 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:25,302 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:25,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:25,302 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:25,302 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:25,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable927 [2022-12-06 07:28:25,302 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-06 07:28:25,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:25,302 INFO L85 PathProgramCache]: Analyzing trace with hash -2118463037, now seen corresponding path program 1 times [2022-12-06 07:28:25,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:25,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803049680] [2022-12-06 07:28:25,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:25,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:25,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-06 07:28:25,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:25,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803049680] [2022-12-06 07:28:25,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803049680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:25,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:25,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:25,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736657134] [2022-12-06 07:28:25,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:25,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:25,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:25,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:25,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:25,363 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:25,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:25,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:25,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:25,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:25,399 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:25,399 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:25,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:25,399 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:25,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:25,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:25,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:25,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:25,400 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:25,400 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:25,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:25,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:25,401 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:25,401 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:25,401 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:25,401 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:25,401 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:25,401 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:25,401 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:25,401 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:25,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:25,403 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:25,403 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:25,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:25,404 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:25,404 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:25,477 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:25,478 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:25,478 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:25,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:25,478 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:25,478 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:25,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable928 [2022-12-06 07:28:25,478 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-06 07:28:25,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:25,478 INFO L85 PathProgramCache]: Analyzing trace with hash -2087986844, now seen corresponding path program 1 times [2022-12-06 07:28:25,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:25,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307603967] [2022-12-06 07:28:25,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:25,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:25,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-06 07:28:25,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:25,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307603967] [2022-12-06 07:28:25,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307603967] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:25,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:25,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:25,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471087984] [2022-12-06 07:28:25,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:25,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:25,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:25,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:25,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:25,535 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:25,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:25,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:25,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:25,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:25,572 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:25,572 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:25,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:25,572 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:25,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:25,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:25,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:25,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:25,573 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:25,573 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:25,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:25,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:25,574 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:25,574 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:25,574 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:25,574 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:25,574 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:25,574 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:25,574 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:25,574 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:25,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:25,576 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:25,576 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:25,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:25,577 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:25,577 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:25,650 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:25,650 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:25,650 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:25,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:25,650 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:25,650 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:25,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable929 [2022-12-06 07:28:25,650 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-06 07:28:25,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:25,651 INFO L85 PathProgramCache]: Analyzing trace with hash -2061204735, now seen corresponding path program 1 times [2022-12-06 07:28:25,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:25,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513012194] [2022-12-06 07:28:25,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:25,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:25,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-06 07:28:25,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:25,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513012194] [2022-12-06 07:28:25,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513012194] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:25,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:25,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:25,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692540621] [2022-12-06 07:28:25,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:25,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:25,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:25,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:25,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:25,711 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:25,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:25,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:25,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:25,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:25,757 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:25,757 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:25,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:25,758 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:25,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:25,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:25,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:25,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:25,758 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:25,759 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:25,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:25,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:25,759 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:25,759 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:25,759 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:25,759 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:25,760 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:25,760 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:25,760 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:25,760 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:25,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:25,762 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:25,762 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:25,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:25,762 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:25,762 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:25,835 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:25,836 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:25,836 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:25,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:25,836 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:25,836 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:25,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable930 [2022-12-06 07:28:25,836 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-06 07:28:25,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:25,836 INFO L85 PathProgramCache]: Analyzing trace with hash -2030728542, now seen corresponding path program 1 times [2022-12-06 07:28:25,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:25,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940474772] [2022-12-06 07:28:25,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:25,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:25,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-06 07:28:25,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:25,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940474772] [2022-12-06 07:28:25,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940474772] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:25,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:25,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:25,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939450969] [2022-12-06 07:28:25,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:25,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:25,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:25,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:25,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:25,898 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:25,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:25,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:25,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:25,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:25,938 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:25,938 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:25,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:25,939 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:25,939 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:25,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:25,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:25,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:25,939 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:25,939 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:25,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:25,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:25,940 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:25,940 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:25,940 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:25,940 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:25,940 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:25,940 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:25,940 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:25,941 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:25,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:25,943 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:25,943 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:25,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:25,943 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:25,943 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:26,015 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:26,016 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:26,016 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:26,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:26,016 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:26,016 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:26,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable931 [2022-12-06 07:28:26,016 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-06 07:28:26,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:26,016 INFO L85 PathProgramCache]: Analyzing trace with hash -2003946433, now seen corresponding path program 1 times [2022-12-06 07:28:26,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:26,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325636464] [2022-12-06 07:28:26,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:26,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:26,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-06 07:28:26,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:26,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325636464] [2022-12-06 07:28:26,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325636464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:26,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:26,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:26,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625360464] [2022-12-06 07:28:26,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:26,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:26,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:26,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:26,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:26,076 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:26,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:26,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:26,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:26,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:26,116 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:26,117 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:26,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:26,117 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:26,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:26,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:26,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:26,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:26,118 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:26,118 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:26,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:26,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:26,118 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:26,118 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:26,119 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:26,119 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:26,119 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:26,119 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:26,119 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:26,119 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:26,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:26,121 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:26,121 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:26,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:26,121 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:26,121 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:26,204 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:26,204 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 07:28:26,204 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:26,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:26,204 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:26,205 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:26,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable932 [2022-12-06 07:28:26,205 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-06 07:28:26,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:26,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1973470240, now seen corresponding path program 1 times [2022-12-06 07:28:26,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:26,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631632440] [2022-12-06 07:28:26,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:26,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:26,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-06 07:28:26,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:26,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631632440] [2022-12-06 07:28:26,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631632440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:26,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:26,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:26,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288145311] [2022-12-06 07:28:26,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:26,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:26,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:26,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:26,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:26,262 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:26,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:26,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:26,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:26,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:26,304 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:26,304 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:26,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 349 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:26,304 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:26,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:26,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:26,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:26,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:26,305 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:26,305 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:26,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:26,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:26,305 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:26,305 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:26,306 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:26,306 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:26,306 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:26,306 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:26,306 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:26,306 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:26,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:26,308 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:26,308 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:26,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:26,308 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:26,308 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:26,382 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:26,382 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:26,382 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:26,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:26,382 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:26,382 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:26,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable933 [2022-12-06 07:28:26,382 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-06 07:28:26,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:26,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1946688131, now seen corresponding path program 1 times [2022-12-06 07:28:26,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:26,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896965977] [2022-12-06 07:28:26,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:26,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:26,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-06 07:28:26,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:26,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896965977] [2022-12-06 07:28:26,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896965977] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:26,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:26,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:26,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458478097] [2022-12-06 07:28:26,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:26,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:26,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:26,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:26,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:26,445 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:26,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:26,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:26,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:26,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:26,486 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:26,486 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:26,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:26,486 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:26,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:26,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:26,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:26,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:26,487 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:26,487 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:26,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:26,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:26,488 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:26,488 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:26,488 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:26,488 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:26,488 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:26,488 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:26,488 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:26,488 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:26,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:26,490 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:26,490 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:26,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:26,491 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:26,491 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:26,564 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:26,565 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:26,565 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:26,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:26,565 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:26,565 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:26,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable934 [2022-12-06 07:28:26,565 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-06 07:28:26,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:26,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1916211938, now seen corresponding path program 1 times [2022-12-06 07:28:26,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:26,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146031152] [2022-12-06 07:28:26,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:26,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:26,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:26,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146031152] [2022-12-06 07:28:26,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146031152] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:26,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:26,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:26,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839330418] [2022-12-06 07:28:26,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:26,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:26,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:26,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:26,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:26,621 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:26,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:26,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:26,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:26,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:26,658 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:26,658 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:26,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 349 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:26,658 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:26,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:26,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:26,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:26,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:26,659 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:26,659 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:26,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:26,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:26,659 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:26,659 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:26,660 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:26,660 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:26,660 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:26,660 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:26,660 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:26,660 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:26,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:26,662 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:26,662 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:26,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:26,662 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:26,662 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:26,734 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:26,735 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:26,735 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:26,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:26,735 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:26,735 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:26,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable935 [2022-12-06 07:28:26,735 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-06 07:28:26,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:26,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1889429829, now seen corresponding path program 1 times [2022-12-06 07:28:26,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:26,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591473789] [2022-12-06 07:28:26,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:26,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:26,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-06 07:28:26,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:26,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591473789] [2022-12-06 07:28:26,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591473789] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:26,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:26,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:26,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368558011] [2022-12-06 07:28:26,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:26,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:26,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:26,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:26,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:26,795 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:26,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:26,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:26,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:26,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:26,833 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:26,833 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:26,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 370 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:26,834 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:26,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:26,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:26,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:26,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:26,834 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:26,834 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:26,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:26,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:26,835 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:26,835 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:26,835 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:26,835 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:26,835 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:26,835 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:26,835 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:26,835 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:26,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:26,838 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:26,838 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:26,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:26,838 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:26,838 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:26,911 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:26,912 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:26,912 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:26,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:26,912 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:26,912 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:26,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable936 [2022-12-06 07:28:26,912 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-06 07:28:26,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:26,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1858953636, now seen corresponding path program 1 times [2022-12-06 07:28:26,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:26,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97649662] [2022-12-06 07:28:26,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:26,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:26,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-06 07:28:26,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:26,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97649662] [2022-12-06 07:28:26,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97649662] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:26,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:26,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:26,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681328156] [2022-12-06 07:28:26,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:26,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:26,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:26,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:26,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:26,971 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:26,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:26,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:26,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:26,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:27,011 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:27,012 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:27,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:27,012 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:27,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:27,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:27,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:27,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:27,013 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:27,013 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:27,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:27,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:27,013 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:27,014 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:27,014 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:27,014 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:27,014 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:27,014 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:27,014 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:27,014 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:27,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:27,016 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:27,016 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:27,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:27,017 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:27,017 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:27,115 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:27,116 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-06 07:28:27,116 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:27,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:27,116 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:27,116 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:27,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable937 [2022-12-06 07:28:27,117 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-06 07:28:27,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:27,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1832171527, now seen corresponding path program 1 times [2022-12-06 07:28:27,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:27,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725672445] [2022-12-06 07:28:27,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:27,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:27,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-06 07:28:27,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:27,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725672445] [2022-12-06 07:28:27,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725672445] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:27,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:27,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:27,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797647426] [2022-12-06 07:28:27,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:27,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:27,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:27,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:27,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:27,207 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:27,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:27,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:27,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:27,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:27,250 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:27,250 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:27,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:27,251 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:27,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:27,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:27,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:27,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:27,252 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:27,252 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:27,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:27,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:27,253 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:27,253 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:27,253 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:27,253 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:27,253 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:27,253 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:27,253 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:27,254 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:27,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:27,256 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:27,257 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:27,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:27,257 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:27,257 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:27,330 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:27,331 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:27,331 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:27,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:27,331 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:27,331 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:27,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable938 [2022-12-06 07:28:27,331 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-06 07:28:27,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:27,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1801695334, now seen corresponding path program 1 times [2022-12-06 07:28:27,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:27,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716464900] [2022-12-06 07:28:27,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:27,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:27,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-06 07:28:27,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:27,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716464900] [2022-12-06 07:28:27,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716464900] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:27,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:27,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:27,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234707326] [2022-12-06 07:28:27,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:27,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:27,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:27,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:27,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:27,389 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:27,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:27,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:27,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:27,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:27,425 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:27,426 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:27,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:27,426 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:27,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:27,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:27,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:27,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:27,427 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:27,427 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:27,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:27,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:27,427 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:27,427 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:27,428 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:27,428 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:27,428 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:27,428 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:27,428 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:27,428 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:27,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:27,430 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:27,430 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:27,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:27,430 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:27,430 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:27,502 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:27,502 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:28:27,503 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:27,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:27,503 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:27,503 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:27,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable939 [2022-12-06 07:28:27,503 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-06 07:28:27,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:27,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1774913225, now seen corresponding path program 1 times [2022-12-06 07:28:27,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:27,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239650466] [2022-12-06 07:28:27,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:27,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:27,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-06 07:28:27,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:27,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239650466] [2022-12-06 07:28:27,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239650466] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:27,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:27,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:27,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706470581] [2022-12-06 07:28:27,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:27,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:27,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:27,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:27,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:27,562 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:27,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:27,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:27,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:27,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:27,603 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:27,604 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:27,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:27,604 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:27,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:27,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:27,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:27,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:27,604 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:27,605 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:27,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:27,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:27,605 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:27,605 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:27,605 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:27,605 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:27,606 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:27,606 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:27,606 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:27,606 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:27,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:27,608 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:27,608 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:27,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:27,608 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:27,608 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:27,681 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:27,682 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:27,682 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:27,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:27,682 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:27,682 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:27,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable940 [2022-12-06 07:28:27,682 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-06 07:28:27,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:27,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1744437032, now seen corresponding path program 1 times [2022-12-06 07:28:27,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:27,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189737393] [2022-12-06 07:28:27,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:27,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:27,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-06 07:28:27,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:27,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189737393] [2022-12-06 07:28:27,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189737393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:27,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:27,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:27,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156331621] [2022-12-06 07:28:27,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:27,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:27,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:27,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:27,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:27,739 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:27,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:27,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:27,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:27,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:27,781 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:27,781 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:27,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:27,781 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:27,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:27,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:27,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:27,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:27,782 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:27,782 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:27,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:27,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:27,782 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:27,783 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:27,783 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:27,783 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:27,783 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:27,783 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:27,783 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:27,783 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:27,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:27,785 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:27,785 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:27,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:27,785 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:27,786 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:27,858 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:27,859 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:27,859 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:27,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:27,859 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:27,859 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:27,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable941 [2022-12-06 07:28:27,859 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-06 07:28:27,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:27,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1717654923, now seen corresponding path program 1 times [2022-12-06 07:28:27,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:27,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960222104] [2022-12-06 07:28:27,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:27,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:27,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-06 07:28:27,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:27,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960222104] [2022-12-06 07:28:27,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960222104] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:27,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:27,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:27,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831893375] [2022-12-06 07:28:27,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:27,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:27,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:27,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:27,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:27,921 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:27,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:27,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:27,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:27,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:27,955 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:27,955 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:27,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:27,955 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:27,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:27,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:27,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:27,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:27,956 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:27,956 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:27,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:27,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:27,957 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:27,957 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:27,957 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:27,957 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:27,957 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:27,957 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:27,957 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:27,957 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:27,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:27,960 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:27,960 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:27,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:27,960 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:27,960 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:28,032 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:28,033 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:28,033 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:28,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:28,033 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:28,033 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:28,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable942 [2022-12-06 07:28:28,033 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-06 07:28:28,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:28,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1687178730, now seen corresponding path program 1 times [2022-12-06 07:28:28,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:28,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28303444] [2022-12-06 07:28:28,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:28,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:28,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-06 07:28:28,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:28,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28303444] [2022-12-06 07:28:28,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28303444] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:28,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:28,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:28,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870050861] [2022-12-06 07:28:28,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:28,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:28,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:28,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:28,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:28,094 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:28,094 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:28,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:28,094 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:28,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:28,136 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:28,136 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:28,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:28,136 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:28,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:28,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:28,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:28,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:28,137 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:28,137 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:28,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:28,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:28,137 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:28,138 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:28,138 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:28,138 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:28,138 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:28,138 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:28,138 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:28,138 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:28,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:28,140 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:28,140 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:28,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:28,141 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:28,141 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:28,213 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:28,213 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:28,213 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:28,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:28,213 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:28,213 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:28,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable943 [2022-12-06 07:28:28,213 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-06 07:28:28,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:28,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1660396621, now seen corresponding path program 1 times [2022-12-06 07:28:28,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:28,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39735948] [2022-12-06 07:28:28,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:28,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:28,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-06 07:28:28,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:28,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39735948] [2022-12-06 07:28:28,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39735948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:28,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:28,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:28,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412203376] [2022-12-06 07:28:28,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:28,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:28,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:28,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:28,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:28,280 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:28,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:28,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:28,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:28,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:28,319 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:28,319 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:28,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:28,319 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:28,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:28,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:28,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:28,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:28,320 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:28,320 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:28,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:28,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:28,320 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:28,320 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:28,321 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:28,321 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:28,321 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:28,321 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:28,321 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:28,321 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:28,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:28,323 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:28,323 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:28,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:28,323 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:28,323 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:28,395 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:28,396 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:28,396 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:28,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:28,396 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:28,396 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:28,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable944 [2022-12-06 07:28:28,396 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-06 07:28:28,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:28,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1629920428, now seen corresponding path program 1 times [2022-12-06 07:28:28,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:28,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265886089] [2022-12-06 07:28:28,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:28,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:28,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:28,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-06 07:28:28,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:28,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265886089] [2022-12-06 07:28:28,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265886089] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:28,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:28,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:28,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836472283] [2022-12-06 07:28:28,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:28,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:28,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:28,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:28,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:28,457 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:28,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:28,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:28,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:28,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:28,499 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:28,499 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:28,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:28,499 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:28,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:28,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:28,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:28,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:28,500 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:28,500 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:28,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:28,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:28,501 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:28,501 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:28,501 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:28,501 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:28,501 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:28,501 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:28,501 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:28,501 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:28,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:28,503 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:28,503 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:28,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:28,504 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:28,504 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:28,577 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:28,577 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:28,577 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:28,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:28,577 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:28,577 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:28,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable945 [2022-12-06 07:28:28,578 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-06 07:28:28,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:28,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1603138319, now seen corresponding path program 1 times [2022-12-06 07:28:28,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:28,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386625641] [2022-12-06 07:28:28,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:28,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:28,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-06 07:28:28,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:28,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386625641] [2022-12-06 07:28:28,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386625641] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:28,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:28,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:28,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85005697] [2022-12-06 07:28:28,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:28,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:28,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:28,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:28,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:28,638 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:28,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:28,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:28,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:28,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:28,679 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:28,679 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:28,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:28,679 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:28,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:28,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:28,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:28,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:28,680 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:28,680 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:28,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:28,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:28,681 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:28,681 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:28,681 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:28,681 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:28,681 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:28,681 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:28,681 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:28,681 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:28,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:28,683 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:28,683 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:28,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:28,684 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:28,684 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:28,756 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:28,757 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:28,757 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:28,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:28,757 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:28,757 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:28,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable946 [2022-12-06 07:28:28,757 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-06 07:28:28,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:28,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1572662126, now seen corresponding path program 1 times [2022-12-06 07:28:28,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:28,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135174725] [2022-12-06 07:28:28,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:28,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:28,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-06 07:28:28,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:28,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135174725] [2022-12-06 07:28:28,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135174725] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:28,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:28,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:28,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263590727] [2022-12-06 07:28:28,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:28,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:28,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:28,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:28,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:28,814 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:28,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:28,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:28,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:28,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:28,851 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:28,851 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:28,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:28,852 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:28,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:28,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:28,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:28,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:28,852 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:28,852 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:28,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:28,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:28,853 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:28,853 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:28,853 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:28,853 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:28,853 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:28,853 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:28,853 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:28,854 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:28,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:28,856 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:28,856 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:28,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:28,856 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:28,856 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:28,929 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:28,930 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:28,930 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:28,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:28,930 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:28,930 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:28,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable947 [2022-12-06 07:28:28,930 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-06 07:28:28,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:28,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1545880017, now seen corresponding path program 1 times [2022-12-06 07:28:28,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:28,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851777469] [2022-12-06 07:28:28,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:28,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:28,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-06 07:28:28,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:28,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851777469] [2022-12-06 07:28:28,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851777469] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:28,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:28,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:28,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407044560] [2022-12-06 07:28:28,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:28,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:28,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:28,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:28,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:28,987 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:28,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:28,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:28,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:28,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:29,024 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:29,024 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:29,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:29,024 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:29,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:29,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:29,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:29,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:29,025 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:29,025 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:29,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:29,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:29,026 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:29,026 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:29,026 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:29,026 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:29,026 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:29,026 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:29,026 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:29,026 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:29,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:29,029 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:29,029 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:29,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:29,029 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:29,029 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:29,101 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:29,101 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:29,102 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:29,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:29,102 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:29,102 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:29,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable948 [2022-12-06 07:28:29,102 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-06 07:28:29,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:29,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1515403824, now seen corresponding path program 1 times [2022-12-06 07:28:29,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:29,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910441972] [2022-12-06 07:28:29,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:29,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:29,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-06 07:28:29,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:29,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910441972] [2022-12-06 07:28:29,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910441972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:29,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:29,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:29,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890069842] [2022-12-06 07:28:29,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:29,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:29,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:29,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:29,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:29,169 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:29,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:29,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:29,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:29,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:29,211 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:29,211 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:29,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:29,212 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:29,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:29,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:29,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:29,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:29,212 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:29,212 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:29,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:29,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:29,213 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:29,213 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:29,213 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:29,213 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:29,213 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:29,213 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:29,213 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:29,213 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:29,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:29,216 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:29,216 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:29,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:29,216 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:29,216 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:29,287 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:29,288 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:29,288 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:29,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:29,288 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:29,288 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:29,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable949 [2022-12-06 07:28:29,288 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-06 07:28:29,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:29,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1488621715, now seen corresponding path program 1 times [2022-12-06 07:28:29,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:29,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110132222] [2022-12-06 07:28:29,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:29,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:29,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:29,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-06 07:28:29,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:29,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110132222] [2022-12-06 07:28:29,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110132222] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:29,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:29,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:29,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467065190] [2022-12-06 07:28:29,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:29,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:29,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:29,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:29,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:29,348 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:29,348 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:29,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:29,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:29,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:29,389 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:29,389 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:29,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:29,389 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:29,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:29,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:29,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:29,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:29,390 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:29,390 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:29,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:29,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:29,390 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:29,390 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:29,391 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:29,391 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:29,391 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:29,391 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:29,391 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:29,391 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:29,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:29,393 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:29,393 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:29,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:29,393 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:29,393 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:29,465 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:29,465 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:28:29,466 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:29,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:29,466 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:29,466 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:29,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable950 [2022-12-06 07:28:29,466 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-06 07:28:29,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:29,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1458145522, now seen corresponding path program 1 times [2022-12-06 07:28:29,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:29,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504406929] [2022-12-06 07:28:29,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:29,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:29,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-06 07:28:29,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:29,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504406929] [2022-12-06 07:28:29,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504406929] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:29,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:29,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:29,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276243606] [2022-12-06 07:28:29,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:29,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:29,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:29,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:29,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:29,526 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:29,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:29,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:29,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:29,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:29,562 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:29,562 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:29,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:29,563 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:29,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:29,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:29,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:29,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:29,563 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:29,563 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:29,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:29,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:29,564 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:29,564 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:29,564 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:29,564 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:29,564 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:29,564 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:29,564 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:29,564 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:29,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:29,566 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:29,566 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:29,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:29,567 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:29,567 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:29,640 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:29,641 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:29,641 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:29,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:29,641 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:29,641 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:29,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable951 [2022-12-06 07:28:29,641 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-06 07:28:29,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:29,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1431363413, now seen corresponding path program 1 times [2022-12-06 07:28:29,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:29,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711459291] [2022-12-06 07:28:29,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:29,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:29,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-06 07:28:29,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:29,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711459291] [2022-12-06 07:28:29,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711459291] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:29,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:29,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:29,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420367909] [2022-12-06 07:28:29,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:29,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:29,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:29,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:29,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:29,700 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:29,700 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:29,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:29,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:29,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:29,740 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:29,740 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:29,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:29,741 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:29,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:29,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:29,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:29,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:29,741 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:29,741 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:29,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:29,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:29,742 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:29,742 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:29,742 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:29,742 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:29,742 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:29,742 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:29,742 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:29,742 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:29,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:29,745 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:29,745 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:29,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:29,745 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:29,745 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:29,817 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:29,817 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:29,817 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:29,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:29,817 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:29,817 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:29,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable952 [2022-12-06 07:28:29,818 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-06 07:28:29,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:29,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1400887220, now seen corresponding path program 1 times [2022-12-06 07:28:29,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:29,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074384053] [2022-12-06 07:28:29,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:29,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:29,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-06 07:28:29,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:29,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074384053] [2022-12-06 07:28:29,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074384053] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:29,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:29,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:29,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280883586] [2022-12-06 07:28:29,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:29,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:29,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:29,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:29,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:29,874 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:29,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:29,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:29,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:29,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:29,917 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:29,917 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:29,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:29,918 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:29,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:29,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:29,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:29,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:29,918 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:29,918 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:29,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:29,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:29,919 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:29,919 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:29,919 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:29,919 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:29,919 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:29,919 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:29,919 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:29,920 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:29,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:29,922 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:29,922 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:29,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:29,922 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:29,922 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:29,999 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:29,999 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:28:29,999 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:29,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:29,999 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:29,999 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:30,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable953 [2022-12-06 07:28:30,000 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-06 07:28:30,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:30,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1374105111, now seen corresponding path program 1 times [2022-12-06 07:28:30,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:30,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248305908] [2022-12-06 07:28:30,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:30,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:30,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:30,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-06 07:28:30,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:30,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248305908] [2022-12-06 07:28:30,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248305908] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:30,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:30,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:30,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492679395] [2022-12-06 07:28:30,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:30,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:30,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:30,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:30,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:30,061 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:30,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:30,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:30,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:30,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:30,095 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:30,095 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:30,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:30,095 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:30,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:30,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:30,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:30,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:30,096 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:30,096 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:30,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:30,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:30,097 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:30,097 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:30,097 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:30,097 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:30,097 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:30,097 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:30,097 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:30,097 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:30,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:30,099 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:30,099 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:30,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:30,100 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:30,100 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:30,174 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:30,174 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:30,174 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:30,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:30,174 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:30,175 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:30,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable954 [2022-12-06 07:28:30,175 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-06 07:28:30,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:30,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1343628918, now seen corresponding path program 1 times [2022-12-06 07:28:30,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:30,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270935992] [2022-12-06 07:28:30,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:30,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:30,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-06 07:28:30,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:30,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270935992] [2022-12-06 07:28:30,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270935992] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:30,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:30,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:30,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52870433] [2022-12-06 07:28:30,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:30,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:30,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:30,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:30,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:30,242 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:30,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:30,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:30,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:30,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:30,284 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:30,284 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:30,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:30,284 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:30,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:30,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:30,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:30,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:30,285 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:30,285 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:30,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:30,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:30,286 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:30,286 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:30,286 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:30,286 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:30,286 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:30,286 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:30,286 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:30,286 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:30,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:30,288 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:30,288 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:30,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:30,289 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:30,289 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:30,361 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:30,361 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:30,361 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:30,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:30,361 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:30,361 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:30,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable955 [2022-12-06 07:28:30,362 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-06 07:28:30,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:30,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1316846809, now seen corresponding path program 1 times [2022-12-06 07:28:30,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:30,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455607622] [2022-12-06 07:28:30,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:30,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:30,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-06 07:28:30,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:30,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455607622] [2022-12-06 07:28:30,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455607622] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:30,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:30,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:30,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342051155] [2022-12-06 07:28:30,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:30,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:30,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:30,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:30,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:30,423 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:30,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:30,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:30,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:30,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:30,461 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:30,462 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:30,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:30,462 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:30,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:30,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:30,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:30,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:30,463 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:30,463 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:30,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:30,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:30,463 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:30,463 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:30,463 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:30,463 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:30,464 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:30,464 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:30,464 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:30,464 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:30,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:30,466 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:30,466 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:30,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:30,466 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:30,466 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:30,538 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:30,539 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:30,539 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:30,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:30,539 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:30,539 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:30,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable956 [2022-12-06 07:28:30,539 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-06 07:28:30,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:30,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1286370616, now seen corresponding path program 1 times [2022-12-06 07:28:30,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:30,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569272307] [2022-12-06 07:28:30,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:30,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:30,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-06 07:28:30,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:30,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569272307] [2022-12-06 07:28:30,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569272307] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:30,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:30,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:30,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088321603] [2022-12-06 07:28:30,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:30,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:30,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:30,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:30,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:30,595 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:30,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:30,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:30,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:30,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:30,632 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:30,632 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:30,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:30,632 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:30,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:30,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:30,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:30,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:30,633 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:30,633 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:30,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:30,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:30,633 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:30,634 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:30,634 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:30,634 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:30,634 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:30,634 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:30,634 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:30,634 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:30,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:30,636 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:30,636 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:30,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:30,637 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:30,637 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:30,711 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:30,711 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:30,711 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:30,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:30,711 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:30,711 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:30,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable957 [2022-12-06 07:28:30,712 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-06 07:28:30,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:30,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1259588507, now seen corresponding path program 1 times [2022-12-06 07:28:30,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:30,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732333844] [2022-12-06 07:28:30,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:30,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:30,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-06 07:28:30,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:30,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732333844] [2022-12-06 07:28:30,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732333844] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:30,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:30,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:30,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090755513] [2022-12-06 07:28:30,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:30,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:30,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:30,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:30,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:30,771 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:30,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:30,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:30,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:30,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:30,805 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:30,805 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:30,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 370 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:30,805 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:30,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:30,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:30,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:30,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:30,806 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:30,806 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:30,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:30,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:30,807 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:30,807 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:30,807 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:30,807 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:30,807 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:30,807 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:30,807 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:30,807 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:30,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:30,809 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:30,809 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:30,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:30,810 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:30,810 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:30,889 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:30,890 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 07:28:30,890 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:30,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:30,890 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:30,890 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:30,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable958 [2022-12-06 07:28:30,890 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-06 07:28:30,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:30,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1229112314, now seen corresponding path program 1 times [2022-12-06 07:28:30,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:30,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041900277] [2022-12-06 07:28:30,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:30,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:30,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:30,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-06 07:28:30,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:30,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041900277] [2022-12-06 07:28:30,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041900277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:30,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:30,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:30,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350333373] [2022-12-06 07:28:30,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:30,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:30,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:30,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:30,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:30,948 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:30,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:30,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:30,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:30,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:30,989 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:30,989 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:30,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:30,990 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:30,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:30,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:30,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:30,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:30,990 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:30,990 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:30,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:30,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:30,991 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:30,991 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:30,991 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:30,991 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:30,991 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:30,991 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:30,991 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:30,992 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:30,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:30,994 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:30,994 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:30,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:30,994 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:30,994 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:31,069 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:31,069 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:31,069 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:31,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:31,069 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:31,069 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:31,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable959 [2022-12-06 07:28:31,070 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-06 07:28:31,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:31,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1202330205, now seen corresponding path program 1 times [2022-12-06 07:28:31,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:31,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342871781] [2022-12-06 07:28:31,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:31,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28: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-06 07:28:31,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:31,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342871781] [2022-12-06 07:28:31,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342871781] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:31,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:31,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:31,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257968638] [2022-12-06 07:28:31,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:31,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:31,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:31,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:31,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:31,129 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:31,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:31,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:31,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:31,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:31,176 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:31,176 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:31,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 371 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:31,177 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:31,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:31,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:31,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:31,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:31,177 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:31,177 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:31,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:31,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:31,178 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:31,178 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:31,178 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:31,178 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:31,178 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:31,178 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:31,178 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:31,178 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:31,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:31,181 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:31,181 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:31,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:31,181 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:31,181 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:31,252 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:31,253 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:31,253 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:31,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:31,253 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:31,253 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:31,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable960 [2022-12-06 07:28:31,253 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-06 07:28:31,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:31,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1171854012, now seen corresponding path program 1 times [2022-12-06 07:28:31,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:31,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118771372] [2022-12-06 07:28:31,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:31,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:31,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:31,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-06 07:28:31,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:31,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118771372] [2022-12-06 07:28:31,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118771372] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:31,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:31,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:31,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207626600] [2022-12-06 07:28:31,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:31,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:31,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:31,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:31,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:31,317 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:31,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:31,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:31,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:31,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:31,354 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:31,354 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:31,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:31,354 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:31,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:31,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:31,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:31,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:31,355 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:31,355 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:31,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:31,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:31,356 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:31,356 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:31,356 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:31,356 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:31,356 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:31,356 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:31,356 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:31,357 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:31,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:31,360 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:31,360 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:31,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:31,360 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:31,360 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:31,453 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:31,454 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 07:28:31,454 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:31,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:31,454 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:31,454 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:31,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable961 [2022-12-06 07:28:31,455 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-06 07:28:31,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:31,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1145071903, now seen corresponding path program 1 times [2022-12-06 07:28:31,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:31,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122582375] [2022-12-06 07:28:31,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:31,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:31,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-06 07:28:31,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:31,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122582375] [2022-12-06 07:28:31,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122582375] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:31,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:31,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:31,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471799471] [2022-12-06 07:28:31,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:31,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:31,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:31,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:31,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:31,532 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:31,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:31,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:31,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:31,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:31,579 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:31,579 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:31,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:31,580 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:31,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:31,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:31,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:31,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:31,580 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:31,580 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:31,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:31,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:31,581 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:31,581 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:31,582 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:31,582 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:31,582 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:31,582 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:31,582 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:31,582 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:31,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:31,585 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:31,585 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:31,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:31,585 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:31,586 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:31,676 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:31,677 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 07:28:31,677 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:31,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:31,677 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:31,677 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:31,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable962 [2022-12-06 07:28:31,678 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-06 07:28:31,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:31,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1114595710, now seen corresponding path program 1 times [2022-12-06 07:28:31,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:31,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808461001] [2022-12-06 07:28:31,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:31,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:31,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:31,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-06 07:28:31,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:31,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808461001] [2022-12-06 07:28:31,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808461001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:31,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:31,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:31,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521632129] [2022-12-06 07:28:31,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:31,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:31,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:31,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:31,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:31,753 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:31,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:31,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:31,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:31,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:31,790 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:31,790 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:31,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:31,791 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:31,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:31,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:31,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:31,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:31,791 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:31,791 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:31,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:31,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:31,792 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:31,792 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:31,792 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:31,792 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:31,792 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:31,793 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:31,793 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:31,793 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:31,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:31,795 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:31,795 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:31,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:31,795 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:31,795 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:31,870 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:31,870 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:31,870 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:31,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:31,870 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:31,871 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:31,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable963 [2022-12-06 07:28:31,871 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-06 07:28:31,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:31,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1087813601, now seen corresponding path program 1 times [2022-12-06 07:28:31,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:31,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013057003] [2022-12-06 07:28:31,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:31,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:31,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-06 07:28:31,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:31,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013057003] [2022-12-06 07:28:31,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013057003] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:31,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:31,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:31,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948585173] [2022-12-06 07:28:31,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:31,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:31,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:31,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:31,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:31,930 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:31,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:31,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:31,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:31,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:31,972 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:31,972 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:31,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:31,972 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:31,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:31,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:31,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:31,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:31,973 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:31,973 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:31,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:31,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:31,974 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:31,974 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:31,974 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:31,974 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:31,974 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:31,974 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:31,974 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:31,974 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:31,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:31,976 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:31,976 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:31,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:31,977 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:31,977 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:32,047 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:32,048 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:28:32,048 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:32,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:32,048 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:32,048 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:32,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable964 [2022-12-06 07:28:32,048 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-06 07:28:32,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:32,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1057337408, now seen corresponding path program 1 times [2022-12-06 07:28:32,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:32,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677895534] [2022-12-06 07:28:32,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:32,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:32,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:32,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-06 07:28:32,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:32,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677895534] [2022-12-06 07:28:32,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677895534] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:32,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:32,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:32,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989910760] [2022-12-06 07:28:32,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:32,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:32,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:32,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:32,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:32,106 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:32,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:32,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:32,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:32,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:32,141 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:32,141 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:32,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:32,142 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:32,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:32,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:32,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:32,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:32,142 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:32,142 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:32,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:32,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:32,143 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:32,143 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:32,143 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:32,143 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:32,143 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:32,143 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:32,143 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:32,144 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:32,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:32,146 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:32,146 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:32,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:32,146 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:32,146 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:32,219 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:32,219 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:32,219 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:32,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:32,219 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:32,219 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:32,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable965 [2022-12-06 07:28:32,220 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-06 07:28:32,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:32,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1030555299, now seen corresponding path program 1 times [2022-12-06 07:28:32,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:32,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883884925] [2022-12-06 07:28:32,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:32,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:32,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-06 07:28:32,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:32,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883884925] [2022-12-06 07:28:32,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883884925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:32,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:32,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:32,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785090016] [2022-12-06 07:28:32,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:32,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:32,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:32,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:32,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:32,289 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:32,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:32,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:32,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:32,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:32,325 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:32,325 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:32,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:32,326 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:32,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:32,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:32,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:32,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:32,326 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:32,326 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:32,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:32,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:32,327 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:32,327 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:32,327 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:32,327 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:32,327 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:32,328 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:32,328 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:32,328 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:32,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:32,330 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:32,330 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:32,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:32,330 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:32,330 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:32,404 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:32,404 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:32,404 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:32,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:32,404 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:32,404 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:32,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable966 [2022-12-06 07:28:32,404 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-06 07:28:32,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:32,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1000079106, now seen corresponding path program 1 times [2022-12-06 07:28:32,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:32,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793025154] [2022-12-06 07:28:32,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:32,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:32,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-06 07:28:32,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:32,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793025154] [2022-12-06 07:28:32,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793025154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:32,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:32,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:32,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381133253] [2022-12-06 07:28:32,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:32,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:32,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:32,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:32,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:32,465 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:32,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:32,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:32,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:32,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:32,507 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:32,508 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:32,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:32,508 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:32,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:32,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:32,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:32,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:32,509 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:32,509 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:32,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:32,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:32,509 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:32,509 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:32,509 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:32,510 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:32,510 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:32,510 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:32,510 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:32,510 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:32,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:32,512 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:32,512 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:32,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:32,512 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:32,512 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:32,585 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:32,585 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:32,585 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:32,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:32,586 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:32,586 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:32,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable967 [2022-12-06 07:28:32,586 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-06 07:28:32,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:32,586 INFO L85 PathProgramCache]: Analyzing trace with hash -973296997, now seen corresponding path program 1 times [2022-12-06 07:28:32,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:32,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947475525] [2022-12-06 07:28:32,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:32,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:32,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-06 07:28:32,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:32,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947475525] [2022-12-06 07:28:32,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947475525] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:32,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:32,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:32,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965884719] [2022-12-06 07:28:32,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:32,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:32,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:32,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:32,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:32,648 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:32,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:32,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:32,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:32,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:32,683 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:32,683 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:32,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:32,683 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:32,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:32,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:32,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:32,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:32,684 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:32,684 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:32,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:32,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:32,685 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:32,685 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:32,685 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:32,685 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:32,685 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:32,685 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:32,685 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:32,685 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:32,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:32,687 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:32,687 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:32,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:32,688 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:32,688 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:32,761 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:32,761 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:32,761 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:32,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:32,762 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:32,762 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:32,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable968 [2022-12-06 07:28:32,762 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-06 07:28:32,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:32,762 INFO L85 PathProgramCache]: Analyzing trace with hash -942820804, now seen corresponding path program 1 times [2022-12-06 07:28:32,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:32,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987177556] [2022-12-06 07:28:32,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:32,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:32,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:32,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:32,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987177556] [2022-12-06 07:28:32,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987177556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:32,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:32,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:32,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284729658] [2022-12-06 07:28:32,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:32,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:32,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:32,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:32,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:32,819 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:32,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:32,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:32,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:32,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:32,855 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:32,855 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:32,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:32,855 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:32,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:32,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:32,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:32,856 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:32,856 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:32,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:32,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:32,857 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:32,857 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:32,857 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:32,857 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:32,857 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:32,857 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:32,857 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:32,857 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:32,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:32,859 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:32,859 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:32,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:32,860 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:32,860 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:32,932 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:32,933 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:32,933 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:32,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:32,933 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:32,933 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:32,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable969 [2022-12-06 07:28:32,933 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-06 07:28:32,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:32,933 INFO L85 PathProgramCache]: Analyzing trace with hash -916038695, now seen corresponding path program 1 times [2022-12-06 07:28:32,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:32,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524242200] [2022-12-06 07:28:32,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:32,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:32,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-06 07:28:32,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:32,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524242200] [2022-12-06 07:28:32,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524242200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:32,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:32,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:32,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793631187] [2022-12-06 07:28:32,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:32,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:32,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:32,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:32,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:32,995 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:32,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:32,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:32,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:32,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:33,036 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:33,036 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:33,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:33,037 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:33,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:33,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:33,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:33,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:33,037 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:33,037 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:33,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:33,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:33,038 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:33,038 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:33,038 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:33,038 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:33,038 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:33,038 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:33,038 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:33,038 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:33,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:33,040 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:33,041 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:33,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:33,041 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:33,041 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:33,114 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:33,114 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:33,114 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:33,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:33,114 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:33,114 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:33,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable970 [2022-12-06 07:28:33,115 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-06 07:28:33,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:33,115 INFO L85 PathProgramCache]: Analyzing trace with hash -885562502, now seen corresponding path program 1 times [2022-12-06 07:28:33,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:33,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500848338] [2022-12-06 07:28:33,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:33,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:33,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-06 07:28:33,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:33,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500848338] [2022-12-06 07:28:33,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500848338] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:33,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:33,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:33,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794361914] [2022-12-06 07:28:33,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:33,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:33,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:33,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:33,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:33,173 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:33,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:33,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:33,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:33,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:33,217 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:33,217 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:33,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:33,218 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:33,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:33,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:33,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:33,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:33,218 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:33,218 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:33,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:33,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:33,219 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:33,219 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:33,219 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:33,219 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:33,219 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:33,219 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:33,219 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:33,219 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:33,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:33,222 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:33,222 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:33,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:33,222 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:33,222 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:33,296 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:33,297 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:33,297 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:33,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:33,297 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:33,297 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:33,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable971 [2022-12-06 07:28:33,297 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-06 07:28:33,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:33,297 INFO L85 PathProgramCache]: Analyzing trace with hash -858780393, now seen corresponding path program 1 times [2022-12-06 07:28:33,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:33,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087099866] [2022-12-06 07:28:33,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:33,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:33,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:33,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:33,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087099866] [2022-12-06 07:28:33,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087099866] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:33,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:33,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:33,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918179488] [2022-12-06 07:28:33,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:33,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:33,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:33,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:33,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:33,358 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:33,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:33,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:33,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:33,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:33,396 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:33,397 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:33,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:33,397 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:33,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:33,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:33,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:33,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:33,398 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:33,398 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:33,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:33,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:33,398 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:33,398 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:33,399 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:33,399 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:33,399 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:33,399 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:33,399 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:33,399 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:33,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:33,402 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:33,402 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:33,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:33,403 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:33,403 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:33,475 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:33,476 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:33,476 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:33,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:33,476 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:33,476 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:33,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable972 [2022-12-06 07:28:33,476 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-06 07:28:33,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:33,476 INFO L85 PathProgramCache]: Analyzing trace with hash -828304200, now seen corresponding path program 1 times [2022-12-06 07:28:33,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:33,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089273213] [2022-12-06 07:28:33,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:33,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:33,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:33,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-06 07:28:33,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:33,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089273213] [2022-12-06 07:28:33,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089273213] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:33,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:33,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:33,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585283225] [2022-12-06 07:28:33,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:33,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:33,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:33,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:33,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:33,536 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:33,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:33,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:33,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:33,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:33,577 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:33,577 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:33,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:33,578 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:33,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:33,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:33,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:33,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:33,578 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:33,578 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:33,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:33,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:33,579 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:33,579 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:33,579 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:33,579 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:33,579 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:33,579 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:33,579 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:33,579 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:33,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:33,582 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:33,582 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:33,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:33,582 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:33,582 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:33,654 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:33,654 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:33,654 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:33,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:33,655 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:33,655 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:33,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable973 [2022-12-06 07:28:33,655 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-06 07:28:33,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:33,655 INFO L85 PathProgramCache]: Analyzing trace with hash -801522091, now seen corresponding path program 1 times [2022-12-06 07:28:33,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:33,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865222239] [2022-12-06 07:28:33,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:33,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:33,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-06 07:28:33,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:33,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865222239] [2022-12-06 07:28:33,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865222239] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:33,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:33,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:33,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135009744] [2022-12-06 07:28:33,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:33,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:33,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:33,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:33,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:33,715 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:33,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:33,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:33,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:33,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:33,750 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:33,751 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:33,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:33,751 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:33,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:33,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:33,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:33,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:33,752 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:33,752 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:33,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:33,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:33,753 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:33,753 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:33,753 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:33,753 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:33,753 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:33,753 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:33,753 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:33,753 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:33,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:33,756 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:33,756 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:33,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:33,756 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:33,756 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:33,829 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:33,829 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:33,829 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:33,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:33,829 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:33,829 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:33,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable974 [2022-12-06 07:28:33,829 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-06 07:28:33,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:33,830 INFO L85 PathProgramCache]: Analyzing trace with hash -771045898, now seen corresponding path program 1 times [2022-12-06 07:28:33,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:33,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071562264] [2022-12-06 07:28:33,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:33,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:33,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-06 07:28:33,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:33,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071562264] [2022-12-06 07:28:33,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071562264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:33,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:33,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:33,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943111990] [2022-12-06 07:28:33,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:33,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:33,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:33,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:33,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:33,887 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:33,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:33,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:33,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:33,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:33,928 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:33,928 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:33,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:33,929 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:33,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:33,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:33,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:33,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:33,929 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:33,929 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:33,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:33,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:33,930 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:33,930 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:33,930 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:33,930 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:33,930 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:33,930 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:33,930 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:33,930 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:33,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:33,932 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:33,933 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:33,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 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 116. Up to 16 conditions per place. [2022-12-06 07:28:33,933 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:33,933 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:34,006 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:34,007 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:34,007 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:34,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:34,007 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:34,007 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:34,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable975 [2022-12-06 07:28:34,007 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-06 07:28:34,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:34,007 INFO L85 PathProgramCache]: Analyzing trace with hash -744263789, now seen corresponding path program 1 times [2022-12-06 07:28:34,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:34,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903004999] [2022-12-06 07:28:34,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:34,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:34,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-06 07:28:34,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:34,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903004999] [2022-12-06 07:28:34,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903004999] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:34,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:34,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:34,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468931067] [2022-12-06 07:28:34,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:34,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:34,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:34,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:34,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:34,069 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:34,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:34,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:34,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:34,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:34,105 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:34,105 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:34,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:34,105 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:34,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:34,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:34,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:34,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:34,106 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:34,106 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:34,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:34,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:34,107 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:34,107 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:34,107 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:34,107 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:34,107 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:34,107 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:34,107 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:34,107 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:34,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:34,109 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:34,109 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:34,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:34,110 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:34,110 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:34,183 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:34,184 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:34,184 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:34,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:34,184 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:34,184 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:34,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable976 [2022-12-06 07:28:34,184 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-06 07:28:34,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:34,184 INFO L85 PathProgramCache]: Analyzing trace with hash -713787596, now seen corresponding path program 1 times [2022-12-06 07:28:34,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:34,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659833] [2022-12-06 07:28:34,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:34,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:34,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-06 07:28:34,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:34,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659833] [2022-12-06 07:28:34,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:34,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:34,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:34,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092695492] [2022-12-06 07:28:34,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:34,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:34,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:34,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:34,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:34,249 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:34,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:34,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:34,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:34,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:34,284 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:34,284 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:34,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:34,285 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:34,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:34,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:34,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:34,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:34,285 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:34,285 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:34,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:34,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:34,286 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:34,286 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:34,286 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:34,286 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:34,286 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:34,286 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:34,286 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:34,286 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:34,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:34,288 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:34,289 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:34,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:34,289 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:34,289 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:34,360 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:34,361 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:34,361 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:34,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:34,361 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:34,361 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:34,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable977 [2022-12-06 07:28:34,361 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-06 07:28:34,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:34,361 INFO L85 PathProgramCache]: Analyzing trace with hash -687005487, now seen corresponding path program 1 times [2022-12-06 07:28:34,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:34,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865410730] [2022-12-06 07:28:34,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:34,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:34,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-06 07:28:34,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:34,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865410730] [2022-12-06 07:28:34,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865410730] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:34,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:34,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:34,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342997783] [2022-12-06 07:28:34,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:34,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:34,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:34,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:34,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:34,422 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:34,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:34,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:34,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:34,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:34,458 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:34,458 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:34,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:34,459 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:34,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:34,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:34,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:34,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:34,459 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:34,459 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:34,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:34,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:34,460 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:34,460 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:34,460 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:34,460 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:34,460 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:34,460 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:34,460 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:34,460 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:34,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:34,462 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:34,463 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:34,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:34,463 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:34,463 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:34,536 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:34,537 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:34,537 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:34,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:34,537 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:34,537 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:34,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable978 [2022-12-06 07:28:34,537 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-06 07:28:34,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:34,537 INFO L85 PathProgramCache]: Analyzing trace with hash -656529294, now seen corresponding path program 1 times [2022-12-06 07:28:34,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:34,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698791373] [2022-12-06 07:28:34,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:34,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:34,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-06 07:28:34,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:34,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698791373] [2022-12-06 07:28:34,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698791373] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:34,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:34,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:34,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326318433] [2022-12-06 07:28:34,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:34,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:34,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:34,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:34,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:34,598 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:34,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:34,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:34,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:34,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:34,635 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:34,635 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:34,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:34,635 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:34,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:34,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:34,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:34,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:34,636 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:34,636 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:34,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:34,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:34,637 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:34,637 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:34,637 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:34,637 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:34,637 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:34,637 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:34,637 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:34,637 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:34,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:34,639 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:34,639 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:34,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:34,640 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:34,640 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:34,712 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:34,713 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:34,713 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:34,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:34,713 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:34,713 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:34,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable979 [2022-12-06 07:28:34,713 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-06 07:28:34,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:34,713 INFO L85 PathProgramCache]: Analyzing trace with hash -629747185, now seen corresponding path program 1 times [2022-12-06 07:28:34,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:34,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534813783] [2022-12-06 07:28:34,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:34,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:34,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:34,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:34,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534813783] [2022-12-06 07:28:34,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534813783] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:34,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:34,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:34,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118672013] [2022-12-06 07:28:34,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:34,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:34,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:34,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:34,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:34,774 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:34,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:34,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:34,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:34,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:34,815 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:34,815 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:34,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:34,816 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:34,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:34,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:34,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:34,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:34,816 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:34,816 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:34,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:34,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:34,817 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:34,817 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:34,817 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:34,817 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:34,817 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:34,818 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:34,818 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:34,818 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:34,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:34,820 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:34,820 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:34,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:34,820 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:34,820 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:34,893 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:34,893 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:34,893 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:34,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:34,893 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:34,893 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:34,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable980 [2022-12-06 07:28:34,894 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-06 07:28:34,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:34,894 INFO L85 PathProgramCache]: Analyzing trace with hash -599270992, now seen corresponding path program 1 times [2022-12-06 07:28:34,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:34,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882175727] [2022-12-06 07:28:34,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:34,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:34,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-06 07:28:34,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:34,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882175727] [2022-12-06 07:28:34,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882175727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:34,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:34,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:34,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780978549] [2022-12-06 07:28:34,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:34,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:34,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:34,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:34,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:34,969 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:34,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:34,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:34,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:34,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:35,022 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:35,023 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:35,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:35,023 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:35,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:35,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:35,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:35,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:35,024 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:35,024 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:35,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:35,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:35,025 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:35,025 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:35,025 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:35,025 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:35,025 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:35,025 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:35,025 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:35,025 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:35,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:35,027 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:35,027 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:35,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 118 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:35,028 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:35,028 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:35,101 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:35,101 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:35,101 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:35,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:35,101 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:35,101 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:35,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable981 [2022-12-06 07:28:35,102 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-06 07:28:35,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:35,102 INFO L85 PathProgramCache]: Analyzing trace with hash -572488883, now seen corresponding path program 1 times [2022-12-06 07:28:35,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:35,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880706373] [2022-12-06 07:28:35,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:35,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:35,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-06 07:28:35,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:35,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880706373] [2022-12-06 07:28:35,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880706373] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:35,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:35,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:35,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648320298] [2022-12-06 07:28:35,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:35,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:35,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:35,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:35,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:35,173 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:35,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:35,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:35,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:35,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:35,208 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:35,209 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:35,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:35,209 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:35,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:35,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:35,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:35,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:35,210 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:35,210 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:35,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:35,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:35,210 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:35,210 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:35,210 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:35,211 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:35,211 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:35,211 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:35,211 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:35,211 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:35,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:35,213 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:35,213 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:35,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:35,213 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:35,213 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:35,286 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:35,287 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:35,287 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:35,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:35,287 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:35,287 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:35,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable982 [2022-12-06 07:28:35,287 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-06 07:28:35,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:35,287 INFO L85 PathProgramCache]: Analyzing trace with hash -542012690, now seen corresponding path program 1 times [2022-12-06 07:28:35,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:35,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196402094] [2022-12-06 07:28:35,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:35,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:35,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-06 07:28:35,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:35,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196402094] [2022-12-06 07:28:35,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196402094] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:35,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:35,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:35,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614176690] [2022-12-06 07:28:35,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:35,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:35,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:35,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:35,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:35,345 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:35,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:35,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:35,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:35,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:35,387 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:35,388 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:35,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:35,388 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:35,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:35,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:35,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:35,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:35,389 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:35,389 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:35,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:35,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:35,389 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:35,389 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:35,390 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:35,390 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:35,390 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:35,390 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:35,390 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:35,390 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:35,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:35,394 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:35,394 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:35,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:35,394 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:35,394 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:35,477 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:35,478 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 07:28:35,478 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:35,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:35,478 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:35,478 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:35,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable983 [2022-12-06 07:28:35,478 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-06 07:28:35,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:35,479 INFO L85 PathProgramCache]: Analyzing trace with hash -515230581, now seen corresponding path program 1 times [2022-12-06 07:28:35,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:35,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357409430] [2022-12-06 07:28:35,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:35,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:35,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-06 07:28:35,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:35,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357409430] [2022-12-06 07:28:35,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357409430] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:35,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:35,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:35,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920118749] [2022-12-06 07:28:35,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:35,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:35,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:35,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:35,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:35,541 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:35,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:35,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:35,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:35,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:35,575 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:35,575 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:35,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:35,576 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:35,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:35,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:35,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:35,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:35,576 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:35,576 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:35,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:35,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:35,577 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:35,577 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:35,577 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:35,577 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:35,577 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:35,577 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:35,577 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:35,577 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:35,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:35,580 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:35,580 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:35,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:35,580 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:35,580 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:35,653 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:35,654 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:35,654 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:35,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:35,654 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:35,654 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:35,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable984 [2022-12-06 07:28:35,654 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-06 07:28:35,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:35,654 INFO L85 PathProgramCache]: Analyzing trace with hash -484754388, now seen corresponding path program 1 times [2022-12-06 07:28:35,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:35,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278852900] [2022-12-06 07:28:35,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:35,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:35,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:35,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-06 07:28:35,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:35,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278852900] [2022-12-06 07:28:35,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278852900] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:35,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:35,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:35,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687558766] [2022-12-06 07:28:35,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:35,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:35,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:35,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:35,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:35,714 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:35,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:35,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:35,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:35,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:35,751 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:35,751 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:35,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 336 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:35,751 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:35,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:35,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:35,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:35,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:35,752 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:35,752 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:35,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:35,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:35,752 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:35,753 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:35,753 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:35,753 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:35,753 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:35,753 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:35,753 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:35,753 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:35,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:35,755 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:35,755 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:35,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:35,756 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:35,756 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:35,827 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:35,828 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:35,828 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:35,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:35,828 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:35,828 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:35,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable985 [2022-12-06 07:28:35,828 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-06 07:28:35,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:35,828 INFO L85 PathProgramCache]: Analyzing trace with hash -457972279, now seen corresponding path program 1 times [2022-12-06 07:28:35,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:35,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387089419] [2022-12-06 07:28:35,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:35,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28: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-06 07:28:35,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:35,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387089419] [2022-12-06 07:28:35,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387089419] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:35,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:35,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:35,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478500223] [2022-12-06 07:28:35,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:35,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:35,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:35,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:35,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:35,891 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:35,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:35,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:35,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:35,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:35,926 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:35,926 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:35,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:35,926 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:35,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:35,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:35,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:35,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:35,927 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:35,927 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:35,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:35,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:35,928 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:35,928 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:35,928 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:35,928 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:35,928 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:35,928 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:35,928 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:35,928 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:35,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:35,930 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:35,930 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:35,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:35,931 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:35,931 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:36,002 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:36,003 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:36,003 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:36,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:36,003 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:36,003 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:36,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable986 [2022-12-06 07:28:36,003 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-06 07:28:36,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:36,003 INFO L85 PathProgramCache]: Analyzing trace with hash -427496086, now seen corresponding path program 1 times [2022-12-06 07:28:36,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:36,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874211739] [2022-12-06 07:28:36,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:36,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:36,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-06 07:28:36,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:36,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874211739] [2022-12-06 07:28:36,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874211739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:36,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:36,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:36,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374921717] [2022-12-06 07:28:36,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:36,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:36,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:36,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:36,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:36,061 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:36,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:36,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:36,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:36,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:36,096 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:36,096 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:36,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:36,097 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:36,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:36,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:36,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:36,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:36,097 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:36,097 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:36,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:36,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:36,098 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:36,098 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:36,098 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:36,098 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:36,098 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:36,098 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:36,098 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:36,098 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:36,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:36,101 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:36,101 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:36,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:36,101 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:36,101 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:36,194 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:36,195 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 07:28:36,195 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:36,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:36,195 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:36,195 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:36,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable987 [2022-12-06 07:28:36,195 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-06 07:28:36,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:36,195 INFO L85 PathProgramCache]: Analyzing trace with hash -400713977, now seen corresponding path program 1 times [2022-12-06 07:28:36,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:36,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103029764] [2022-12-06 07:28:36,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:36,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:36,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:36,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-06 07:28:36,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:36,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103029764] [2022-12-06 07:28:36,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103029764] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:36,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:36,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:36,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93185255] [2022-12-06 07:28:36,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:36,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:36,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:36,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:36,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:36,283 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:36,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:36,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:36,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:36,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:36,331 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:36,331 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:36,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:36,332 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:36,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:36,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:36,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:36,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:36,333 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:36,333 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:36,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:36,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:36,333 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:36,334 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:36,334 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:36,334 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:36,334 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:36,334 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:36,334 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:36,334 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:36,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:36,337 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:36,337 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:36,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:36,338 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:36,338 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:36,433 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:36,434 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 07:28:36,434 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:36,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:36,434 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:36,434 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:36,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable988 [2022-12-06 07:28:36,435 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-06 07:28:36,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:36,435 INFO L85 PathProgramCache]: Analyzing trace with hash -370237784, now seen corresponding path program 1 times [2022-12-06 07:28:36,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:36,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947921886] [2022-12-06 07:28:36,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:36,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:36,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-06 07:28:36,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:36,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947921886] [2022-12-06 07:28:36,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947921886] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:36,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:36,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:36,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159788800] [2022-12-06 07:28:36,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:36,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:36,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:36,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:36,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:36,513 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:36,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:36,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:36,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:36,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:36,568 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:36,568 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:36,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:36,569 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:36,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:36,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:36,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:36,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:36,569 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:36,569 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:36,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:36,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:36,570 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:36,570 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:36,571 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:36,571 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:36,571 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:36,571 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:36,571 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:36,571 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:36,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:36,574 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:36,574 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:36,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:36,574 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:36,575 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:36,655 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:36,655 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:28:36,655 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:36,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:36,655 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:36,655 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:36,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable989 [2022-12-06 07:28:36,656 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-06 07:28:36,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:36,656 INFO L85 PathProgramCache]: Analyzing trace with hash -343455675, now seen corresponding path program 1 times [2022-12-06 07:28:36,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:36,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430649988] [2022-12-06 07:28:36,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:36,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:36,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-06 07:28:36,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:36,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430649988] [2022-12-06 07:28:36,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430649988] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:36,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:36,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:36,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612415908] [2022-12-06 07:28:36,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:36,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:36,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:36,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:36,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:36,718 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:36,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:36,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:36,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:36,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:36,758 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:36,758 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:36,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:36,759 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:36,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:36,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:36,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:36,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:36,759 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:36,759 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:36,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:36,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:36,760 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:36,760 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:36,760 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:36,760 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:36,760 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:36,761 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:36,761 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:36,761 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:36,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:36,763 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:36,763 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:36,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:36,763 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:36,763 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:36,836 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:36,837 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:36,837 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:36,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:36,837 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:36,837 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:36,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable990 [2022-12-06 07:28:36,837 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-06 07:28:36,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:36,838 INFO L85 PathProgramCache]: Analyzing trace with hash -312979482, now seen corresponding path program 1 times [2022-12-06 07:28:36,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:36,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726057013] [2022-12-06 07:28:36,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:36,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:36,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-06 07:28:36,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:36,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726057013] [2022-12-06 07:28:36,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726057013] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:36,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:36,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:36,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086496624] [2022-12-06 07:28:36,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:36,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:36,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:36,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:36,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:36,895 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:36,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:36,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:36,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:36,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:36,930 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:36,930 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:36,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:36,931 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:36,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:36,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:36,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:36,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:36,931 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:36,931 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:36,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:36,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:36,932 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:36,932 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:36,932 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:36,932 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:36,932 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:36,932 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:36,932 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:36,932 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:36,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:36,935 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:36,935 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:36,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:36,936 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:36,936 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:37,008 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:37,009 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:37,009 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:37,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:37,009 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:37,009 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:37,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable991 [2022-12-06 07:28:37,009 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-06 07:28:37,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:37,010 INFO L85 PathProgramCache]: Analyzing trace with hash -286197373, now seen corresponding path program 1 times [2022-12-06 07:28:37,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:37,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515759788] [2022-12-06 07:28:37,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:37,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:37,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-06 07:28:37,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:37,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515759788] [2022-12-06 07:28:37,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515759788] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:37,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:37,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:37,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212442073] [2022-12-06 07:28:37,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:37,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:37,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:37,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:37,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:37,071 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:37,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:37,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:37,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:37,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:37,111 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:37,112 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:37,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:37,112 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:37,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:37,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:37,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:37,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:37,113 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:37,113 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:37,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:37,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:37,113 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:37,113 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:37,113 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:37,113 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:37,114 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:37,114 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:37,114 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:37,114 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:37,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:37,116 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:37,116 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:37,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:37,116 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:37,116 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:37,190 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:37,191 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:37,191 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:37,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:37,191 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:37,191 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:37,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable992 [2022-12-06 07:28:37,192 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-06 07:28:37,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:37,192 INFO L85 PathProgramCache]: Analyzing trace with hash -255721180, now seen corresponding path program 1 times [2022-12-06 07:28:37,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:37,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193550924] [2022-12-06 07:28:37,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:37,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:37,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:37,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-06 07:28:37,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:37,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193550924] [2022-12-06 07:28:37,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193550924] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:37,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:37,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:37,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325094188] [2022-12-06 07:28:37,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:37,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:37,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:37,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:37,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:37,259 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:37,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:37,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:37,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:37,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:37,294 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:37,295 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:37,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:37,295 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:37,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:37,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:37,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:37,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:37,296 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:37,296 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:37,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:37,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:37,296 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:37,296 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:37,297 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:37,297 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:37,297 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:37,297 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:37,297 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:37,297 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:37,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:37,299 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:37,299 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:37,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:37,299 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:37,299 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:37,373 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:37,374 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:37,374 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:37,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:37,374 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:37,374 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:37,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable993 [2022-12-06 07:28:37,374 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-06 07:28:37,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:37,374 INFO L85 PathProgramCache]: Analyzing trace with hash -228939071, now seen corresponding path program 1 times [2022-12-06 07:28:37,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:37,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917945615] [2022-12-06 07:28:37,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:37,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:37,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-06 07:28:37,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:37,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917945615] [2022-12-06 07:28:37,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917945615] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:37,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:37,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:37,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285129348] [2022-12-06 07:28:37,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:37,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:37,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:37,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:37,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:37,436 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:37,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:37,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:37,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:37,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:37,477 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:37,477 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:37,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:37,478 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:37,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:37,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:37,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:37,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:37,478 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:37,478 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:37,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:37,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:37,479 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:37,479 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:37,479 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:37,479 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:37,479 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:37,479 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:37,479 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:37,479 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:37,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:37,482 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:37,482 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:37,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:37,482 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:37,482 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:37,556 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:37,556 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:37,556 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:37,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:37,556 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:37,556 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:37,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable994 [2022-12-06 07:28:37,557 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-06 07:28:37,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:37,557 INFO L85 PathProgramCache]: Analyzing trace with hash -198462878, now seen corresponding path program 1 times [2022-12-06 07:28:37,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:37,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967243602] [2022-12-06 07:28:37,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:37,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:37,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-06 07:28:37,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:37,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967243602] [2022-12-06 07:28:37,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967243602] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:37,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:37,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:37,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302782906] [2022-12-06 07:28:37,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:37,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:37,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:37,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:37,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:37,616 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:37,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:37,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:37,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:37,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:37,652 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:37,652 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:37,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:37,653 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:37,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:37,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:37,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:37,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:37,653 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:37,653 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:37,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:37,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:37,654 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:37,654 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:37,654 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:37,654 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:37,654 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:37,654 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:37,654 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:37,654 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:37,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:37,657 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:37,657 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:37,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:37,657 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:37,657 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:37,729 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:37,729 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:37,729 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:37,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:37,729 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:37,729 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:37,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable995 [2022-12-06 07:28:37,730 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-06 07:28:37,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:37,730 INFO L85 PathProgramCache]: Analyzing trace with hash -171680769, now seen corresponding path program 1 times [2022-12-06 07:28:37,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:37,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945454427] [2022-12-06 07:28:37,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:37,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:37,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-06 07:28:37,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:37,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945454427] [2022-12-06 07:28:37,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945454427] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:37,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:37,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:37,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422047422] [2022-12-06 07:28:37,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:37,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:37,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:37,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:37,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:37,792 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:37,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:37,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:37,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:37,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:37,828 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:37,828 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:37,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:37,828 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:37,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:37,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:37,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:37,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:37,829 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:37,829 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:37,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:37,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:37,829 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:37,829 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:37,830 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:37,830 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:37,830 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:37,830 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:37,830 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:37,830 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:37,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:37,832 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:37,832 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:37,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:37,832 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:37,832 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:37,906 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:37,907 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:37,907 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:37,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:37,907 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:37,907 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:37,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable996 [2022-12-06 07:28:37,907 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-06 07:28:37,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:37,907 INFO L85 PathProgramCache]: Analyzing trace with hash -141204576, now seen corresponding path program 1 times [2022-12-06 07:28:37,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:37,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153175019] [2022-12-06 07:28:37,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:37,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:37,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-06 07:28:37,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:37,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153175019] [2022-12-06 07:28:37,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153175019] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:37,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:37,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:37,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29816463] [2022-12-06 07:28:37,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:37,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:37,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:37,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:37,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:37,965 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:37,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:37,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:37,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:37,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:38,006 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:38,006 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:38,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:38,007 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:38,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:38,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:38,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:38,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:38,007 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:38,007 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:38,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:38,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:38,008 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:38,008 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:38,008 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:38,008 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:38,008 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:38,008 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:38,008 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:38,008 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:38,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:38,010 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:38,010 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:38,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:38,011 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:38,011 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:38,084 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:38,084 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:38,084 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:38,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:38,084 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:38,084 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:38,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable997 [2022-12-06 07:28:38,084 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-06 07:28:38,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:38,085 INFO L85 PathProgramCache]: Analyzing trace with hash -114422467, now seen corresponding path program 1 times [2022-12-06 07:28:38,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:38,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161460983] [2022-12-06 07:28:38,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:38,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28: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-06 07:28:38,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:38,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161460983] [2022-12-06 07:28:38,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161460983] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:38,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:38,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:38,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614122305] [2022-12-06 07:28:38,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:38,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:38,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:38,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:38,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:38,145 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:38,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:38,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:38,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:38,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:38,181 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:38,181 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:38,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:38,181 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:38,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:38,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:38,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:38,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:38,182 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:38,182 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:38,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:38,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:38,182 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:38,182 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:38,183 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:38,183 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:38,183 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:38,183 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:38,183 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:38,183 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:38,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:38,185 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:38,185 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:38,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:38,185 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:38,185 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:38,258 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:38,258 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:38,258 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:38,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:38,258 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:38,258 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:38,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable998 [2022-12-06 07:28:38,258 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-06 07:28:38,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:38,259 INFO L85 PathProgramCache]: Analyzing trace with hash -83946274, now seen corresponding path program 1 times [2022-12-06 07:28:38,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:38,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49111808] [2022-12-06 07:28:38,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:38,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:38,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:38,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:38,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49111808] [2022-12-06 07:28:38,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49111808] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:38,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:38,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:38,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644644827] [2022-12-06 07:28:38,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:38,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:38,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:38,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:38,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:38,324 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:38,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:38,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:38,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:38,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:38,365 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:38,365 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:38,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:38,365 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:38,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:38,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:38,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:38,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:38,366 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:38,366 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:38,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:38,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:38,366 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:38,367 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:38,367 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:38,367 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:38,367 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:38,367 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:38,367 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:38,367 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:38,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:38,369 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:38,369 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:38,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:38,369 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:38,369 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:38,442 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:38,442 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:38,443 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:38,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:38,443 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:38,443 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:38,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable999 [2022-12-06 07:28:38,443 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-06 07:28:38,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:38,443 INFO L85 PathProgramCache]: Analyzing trace with hash -57164165, now seen corresponding path program 1 times [2022-12-06 07:28:38,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:38,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852250637] [2022-12-06 07:28:38,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:38,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:38,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:38,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:38,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852250637] [2022-12-06 07:28:38,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852250637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:38,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:38,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:38,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780224740] [2022-12-06 07:28:38,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:38,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:38,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:38,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:38,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:38,505 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:38,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:38,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:38,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:38,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:38,541 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:38,542 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:38,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:38,542 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:38,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:38,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:38,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:38,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:38,543 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:38,543 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:38,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:38,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:38,543 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:38,543 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:38,544 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:38,544 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:38,544 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:38,544 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:38,544 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:38,544 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:38,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:38,546 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:38,546 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:38,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:38,547 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:38,547 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:38,618 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:38,619 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:38,619 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:38,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:38,619 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:38,619 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:38,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1000 [2022-12-06 07:28:38,619 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-06 07:28:38,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:38,619 INFO L85 PathProgramCache]: Analyzing trace with hash -26687972, now seen corresponding path program 1 times [2022-12-06 07:28:38,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:38,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987945526] [2022-12-06 07:28:38,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:38,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:38,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-06 07:28:38,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:38,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987945526] [2022-12-06 07:28:38,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987945526] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:38,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:38,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:38,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118467697] [2022-12-06 07:28:38,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:38,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:38,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:38,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:38,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:38,684 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:38,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:38,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:38,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:38,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:38,721 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:38,721 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:38,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:38,722 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:38,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:38,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:38,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:38,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:38,722 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:38,723 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:38,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:38,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:38,723 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:38,723 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:38,723 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:38,723 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:38,723 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:38,724 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:38,724 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:38,724 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:38,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:38,726 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:38,726 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:38,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:38,726 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:38,726 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:38,813 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:38,813 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-06 07:28:38,814 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:38,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:38,814 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:38,814 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:38,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1001 [2022-12-06 07:28:38,814 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-06 07:28:38,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:38,814 INFO L85 PathProgramCache]: Analyzing trace with hash 94137, now seen corresponding path program 1 times [2022-12-06 07:28:38,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:38,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452966052] [2022-12-06 07:28:38,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:38,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:38,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:38,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:38,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452966052] [2022-12-06 07:28:38,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452966052] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:38,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:38,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:38,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524530314] [2022-12-06 07:28:38,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:38,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:38,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:38,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:38,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:38,875 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:38,875 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:38,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:38,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:38,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:38,911 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:38,911 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:38,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:38,911 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:38,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:38,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:38,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:38,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:38,912 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:38,912 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:38,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:38,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:38,913 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:38,913 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:38,913 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:38,913 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:38,913 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:38,913 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:38,913 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:38,913 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:38,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:38,915 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:38,916 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:38,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:38,916 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:38,916 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:38,989 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:38,990 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:38,990 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:38,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:38,990 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:38,990 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:38,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1002 [2022-12-06 07:28:38,990 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-06 07:28:38,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:38,990 INFO L85 PathProgramCache]: Analyzing trace with hash 30570330, now seen corresponding path program 1 times [2022-12-06 07:28:38,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:38,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902833664] [2022-12-06 07:28:38,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:38,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:39,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-06 07:28:39,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:39,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902833664] [2022-12-06 07:28:39,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902833664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:39,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:39,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:39,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447433946] [2022-12-06 07:28:39,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:39,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:39,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:39,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:39,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:39,048 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:39,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:39,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:39,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:39,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:39,090 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:39,090 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:39,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 356 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:39,091 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:39,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:39,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:39,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:39,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:39,091 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:39,092 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:39,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:39,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:39,092 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:39,092 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:39,092 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:39,092 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:39,092 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:39,093 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:39,093 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:39,093 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:39,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:39,095 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:39,095 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:39,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:39,095 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:39,095 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:39,167 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:39,168 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:39,168 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:39,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:39,168 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:39,168 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:39,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1003 [2022-12-06 07:28:39,168 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-06 07:28:39,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:39,169 INFO L85 PathProgramCache]: Analyzing trace with hash 57352439, now seen corresponding path program 1 times [2022-12-06 07:28:39,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:39,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054873831] [2022-12-06 07:28:39,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:39,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:39,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-06 07:28:39,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:39,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054873831] [2022-12-06 07:28:39,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054873831] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:39,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:39,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:39,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410511085] [2022-12-06 07:28:39,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:39,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:39,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:39,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:39,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:39,239 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:39,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:39,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:39,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:39,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:39,274 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:39,274 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:39,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:39,275 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:39,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:39,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:39,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:39,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:39,275 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:39,275 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:39,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:39,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:39,276 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:39,276 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:39,276 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:39,276 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:39,276 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:39,276 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:39,276 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:39,276 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:39,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:39,278 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:39,279 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:39,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:39,279 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:39,279 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:39,352 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:39,353 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:39,353 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:39,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:39,353 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:39,353 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:39,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1004 [2022-12-06 07:28:39,353 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-06 07:28:39,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:39,353 INFO L85 PathProgramCache]: Analyzing trace with hash 87828632, now seen corresponding path program 1 times [2022-12-06 07:28:39,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:39,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781218717] [2022-12-06 07:28:39,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:39,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:39,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-06 07:28:39,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:39,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781218717] [2022-12-06 07:28:39,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781218717] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:39,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:39,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:39,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947747113] [2022-12-06 07:28:39,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:39,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:39,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:39,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:39,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:39,412 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:39,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:39,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:39,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:39,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:39,448 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:39,448 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:39,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:39,448 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:39,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:39,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:39,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:39,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:39,449 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:39,449 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:39,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:39,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:39,450 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:39,450 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:39,450 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:39,450 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:39,450 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:39,450 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:39,450 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:39,450 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:39,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:39,452 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:39,452 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:39,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:39,453 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:39,453 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:39,556 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:39,557 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-06 07:28:39,557 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:39,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:39,557 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:39,557 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:39,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1005 [2022-12-06 07:28:39,557 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-06 07:28:39,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:39,557 INFO L85 PathProgramCache]: Analyzing trace with hash 114610741, now seen corresponding path program 1 times [2022-12-06 07:28:39,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:39,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647559750] [2022-12-06 07:28:39,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:39,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:39,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-06 07:28:39,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:39,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647559750] [2022-12-06 07:28:39,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647559750] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:39,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:39,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:39,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904943727] [2022-12-06 07:28:39,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:39,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:39,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:39,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:39,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:39,638 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:39,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:39,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:39,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:39,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:39,693 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:39,693 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:39,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:39,694 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:39,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:39,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:39,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:39,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:39,695 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:39,695 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:39,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:39,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:39,696 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:39,696 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:39,696 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:39,696 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:39,696 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:39,696 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:39,696 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:39,697 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:39,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:39,699 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:39,700 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:39,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:39,700 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:39,700 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:39,790 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:39,790 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 07:28:39,790 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:39,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:39,790 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:39,790 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:39,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1006 [2022-12-06 07:28:39,791 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-06 07:28:39,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:39,791 INFO L85 PathProgramCache]: Analyzing trace with hash 145086934, now seen corresponding path program 1 times [2022-12-06 07:28:39,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:39,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108722651] [2022-12-06 07:28:39,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:39,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:39,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-06 07:28:39,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:39,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108722651] [2022-12-06 07:28:39,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108722651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:39,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:39,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:39,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858003901] [2022-12-06 07:28:39,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:39,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:39,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:39,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:39,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:39,849 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:39,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:39,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:39,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:39,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:39,891 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:39,891 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:39,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:39,892 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:39,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:39,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:39,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:39,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:39,892 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:39,892 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:39,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:39,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:39,893 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:39,893 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:39,893 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:39,893 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:39,893 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:39,893 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:39,894 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:39,894 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:39,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:39,896 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:39,896 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:39,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:39,896 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:39,896 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:39,968 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:39,969 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:39,969 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:39,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:39,969 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:39,969 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:39,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1007 [2022-12-06 07:28:39,969 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-06 07:28:39,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:39,969 INFO L85 PathProgramCache]: Analyzing trace with hash 171869043, now seen corresponding path program 1 times [2022-12-06 07:28:39,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:39,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026702672] [2022-12-06 07:28:39,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:39,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:40,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-06 07:28:40,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:40,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026702672] [2022-12-06 07:28:40,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026702672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:40,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:40,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:40,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427652823] [2022-12-06 07:28:40,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:40,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:40,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:40,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:40,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:40,031 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:40,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:40,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:40,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:40,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:40,072 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:40,072 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:40,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 373 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:40,073 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:40,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:40,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:40,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:40,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:40,073 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:40,073 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:40,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:40,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:40,074 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:40,074 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:40,074 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:40,074 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:40,074 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:40,074 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:40,075 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:40,075 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:40,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:40,077 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:40,077 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:40,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:40,077 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:40,077 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:40,162 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:40,163 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 07:28:40,163 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:40,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:40,163 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:40,163 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:40,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1008 [2022-12-06 07:28:40,163 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-06 07:28:40,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:40,163 INFO L85 PathProgramCache]: Analyzing trace with hash 202345236, now seen corresponding path program 1 times [2022-12-06 07:28:40,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:40,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065025349] [2022-12-06 07:28:40,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:40,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:40,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:40,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-06 07:28:40,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:40,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065025349] [2022-12-06 07:28:40,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065025349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:40,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:40,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:40,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781587136] [2022-12-06 07:28:40,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:40,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:40,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:40,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:40,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:40,224 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:40,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:40,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:40,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:40,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:40,266 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:40,267 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:40,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:40,267 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:40,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:40,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:40,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:40,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:40,268 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:40,268 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:40,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:40,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:40,268 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:40,268 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:40,269 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:40,269 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:40,269 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:40,269 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:40,269 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:40,269 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:40,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:40,271 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:40,271 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:40,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:40,271 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:40,271 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:40,344 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:40,344 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:40,345 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:40,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:40,345 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:40,345 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:40,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1009 [2022-12-06 07:28:40,345 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-06 07:28:40,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:40,345 INFO L85 PathProgramCache]: Analyzing trace with hash 229127345, now seen corresponding path program 1 times [2022-12-06 07:28:40,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:40,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657968632] [2022-12-06 07:28:40,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:40,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:40,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:40,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-06 07:28:40,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:40,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657968632] [2022-12-06 07:28:40,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657968632] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:40,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:40,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:40,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893141722] [2022-12-06 07:28:40,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:40,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:40,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:40,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:40,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:40,413 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:40,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:40,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:40,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:40,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:40,448 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:40,448 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:40,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:40,449 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:40,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:40,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:40,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:40,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:40,449 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:40,449 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:40,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:40,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:40,450 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:40,450 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:40,450 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:40,450 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:40,450 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:40,451 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:40,451 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:40,451 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:40,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:40,453 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:40,453 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:40,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:40,453 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:40,453 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:40,526 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:40,527 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:40,527 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:40,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:40,527 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:40,527 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:40,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1010 [2022-12-06 07:28:40,527 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-06 07:28:40,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:40,527 INFO L85 PathProgramCache]: Analyzing trace with hash 259603538, now seen corresponding path program 1 times [2022-12-06 07:28:40,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:40,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241553201] [2022-12-06 07:28:40,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:40,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:40,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:40,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:40,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241553201] [2022-12-06 07:28:40,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241553201] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:40,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:40,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:40,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987764712] [2022-12-06 07:28:40,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:40,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:40,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:40,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:40,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:40,587 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:40,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:40,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:40,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:40,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:40,623 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:40,623 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:40,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:40,623 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:40,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:40,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:40,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:40,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:40,624 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:40,624 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:40,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:40,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:40,625 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:40,625 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:40,625 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:40,625 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:40,625 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:40,625 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:40,625 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:40,625 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:40,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:40,627 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:40,627 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:40,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:40,628 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:40,628 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:40,700 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:40,701 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:40,701 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:40,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:40,701 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:40,701 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:40,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1011 [2022-12-06 07:28:40,701 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-06 07:28:40,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:40,701 INFO L85 PathProgramCache]: Analyzing trace with hash 286385647, now seen corresponding path program 1 times [2022-12-06 07:28:40,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:40,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401443827] [2022-12-06 07:28:40,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:40,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:40,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-06 07:28:40,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:40,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401443827] [2022-12-06 07:28:40,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401443827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:40,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:40,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:40,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671313173] [2022-12-06 07:28:40,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:40,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:40,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:40,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:40,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:40,763 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:40,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:40,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:40,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:40,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:40,803 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:40,804 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:40,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:40,804 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:40,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:40,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:40,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:40,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:40,805 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:40,805 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:40,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:40,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:40,805 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:40,805 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:40,806 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:40,806 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:40,806 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:40,806 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:40,806 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:40,806 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:40,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:40,808 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:40,808 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:40,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:40,808 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:40,808 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:40,881 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:40,882 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:40,882 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:40,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:40,882 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:40,882 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:40,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1012 [2022-12-06 07:28:40,882 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-06 07:28:40,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:40,882 INFO L85 PathProgramCache]: Analyzing trace with hash 316861840, now seen corresponding path program 1 times [2022-12-06 07:28:40,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:40,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222756137] [2022-12-06 07:28:40,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:40,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:40,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-06 07:28:40,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:40,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222756137] [2022-12-06 07:28:40,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222756137] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:40,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:40,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:40,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860598352] [2022-12-06 07:28:40,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:40,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:40,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:40,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:40,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:40,943 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:40,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:40,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:40,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:40,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:40,984 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:40,984 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:40,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:40,985 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:40,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:40,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:40,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:40,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:40,985 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:40,985 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:40,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:40,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:40,986 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:40,986 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:40,986 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:40,986 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:40,986 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:40,986 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:40,986 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:40,986 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:40,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:40,988 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:40,989 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:40,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 118 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:40,989 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:40,989 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:41,060 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:41,061 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:41,061 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:41,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:41,061 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:41,061 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:41,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1013 [2022-12-06 07:28:41,061 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-06 07:28:41,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:41,061 INFO L85 PathProgramCache]: Analyzing trace with hash 343643949, now seen corresponding path program 1 times [2022-12-06 07:28:41,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:41,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686603825] [2022-12-06 07:28:41,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:41,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:41,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-06 07:28:41,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:41,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686603825] [2022-12-06 07:28:41,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686603825] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:41,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:41,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:41,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789038] [2022-12-06 07:28:41,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:41,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:41,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:41,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:41,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:41,126 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:41,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:41,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:41,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:41,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:41,166 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:41,166 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:41,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:41,167 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:41,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:41,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:41,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:41,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:41,167 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:41,167 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:41,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:41,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:41,168 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:41,168 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:41,168 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:41,168 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:41,168 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:41,169 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:41,169 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:41,169 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:41,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:41,171 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:41,171 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:41,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:41,171 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:41,171 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:41,245 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:41,245 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:41,245 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:41,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:41,245 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:41,245 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:41,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1014 [2022-12-06 07:28:41,245 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-06 07:28:41,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:41,246 INFO L85 PathProgramCache]: Analyzing trace with hash 374120142, now seen corresponding path program 1 times [2022-12-06 07:28:41,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:41,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020884367] [2022-12-06 07:28:41,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:41,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:41,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-06 07:28:41,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:41,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020884367] [2022-12-06 07:28:41,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020884367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:41,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:41,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:41,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049882024] [2022-12-06 07:28:41,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:41,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:41,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:41,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:41,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:41,313 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:41,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:41,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:41,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:41,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:41,354 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:41,354 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:41,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:41,354 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:41,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:41,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:41,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:41,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:41,355 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:41,355 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:41,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:41,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:41,356 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:41,356 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:41,356 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:41,356 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:41,356 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:41,356 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:41,356 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:41,356 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:41,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:41,358 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:41,358 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:41,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:41,359 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:41,359 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:41,431 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:41,431 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:41,431 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:41,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:41,432 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:41,432 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:41,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1015 [2022-12-06 07:28:41,432 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-06 07:28:41,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:41,432 INFO L85 PathProgramCache]: Analyzing trace with hash 400902251, now seen corresponding path program 1 times [2022-12-06 07:28:41,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:41,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264433368] [2022-12-06 07:28:41,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:41,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:41,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-06 07:28:41,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:41,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264433368] [2022-12-06 07:28:41,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264433368] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:41,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:41,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:41,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853151128] [2022-12-06 07:28:41,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:41,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:41,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:41,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:41,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:41,493 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:41,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:41,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:41,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:41,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:41,533 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:41,534 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:41,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 356 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:41,534 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:41,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:41,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:41,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:41,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:41,535 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:41,535 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:41,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:41,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:41,535 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:41,535 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:41,535 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:41,536 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:41,536 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:41,536 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:41,536 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:41,536 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:41,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:41,538 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:41,538 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:41,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:41,538 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:41,538 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:41,612 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:41,612 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:41,612 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:41,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:41,612 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:41,612 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:41,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1016 [2022-12-06 07:28:41,613 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-06 07:28:41,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:41,613 INFO L85 PathProgramCache]: Analyzing trace with hash 431378444, now seen corresponding path program 1 times [2022-12-06 07:28:41,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:41,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732022980] [2022-12-06 07:28:41,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:41,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:41,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-06 07:28:41,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:41,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732022980] [2022-12-06 07:28:41,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732022980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:41,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:41,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:41,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489149021] [2022-12-06 07:28:41,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:41,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:41,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:41,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:41,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:41,679 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:41,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:41,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:41,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:41,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:41,714 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:41,715 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:41,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:41,715 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:41,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:41,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:41,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:41,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:41,716 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:41,716 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:41,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:41,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:41,716 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:41,716 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:41,717 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:41,717 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:41,717 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:41,717 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:41,717 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:41,717 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:41,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:41,719 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:41,719 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:41,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:41,719 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:41,719 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:41,791 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:41,792 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:41,792 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:41,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:41,792 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:41,792 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:41,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1017 [2022-12-06 07:28:41,792 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-06 07:28:41,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:41,792 INFO L85 PathProgramCache]: Analyzing trace with hash 458160553, now seen corresponding path program 1 times [2022-12-06 07:28:41,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:41,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882736197] [2022-12-06 07:28:41,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:41,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:41,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-06 07:28:41,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:41,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882736197] [2022-12-06 07:28:41,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882736197] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:41,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:41,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:41,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132077174] [2022-12-06 07:28:41,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:41,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:41,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:41,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:41,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:41,853 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:41,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:41,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:41,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:41,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:41,889 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:41,889 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:41,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:41,890 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:41,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:41,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:41,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:41,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:41,890 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:41,890 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:41,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:41,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:41,891 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:41,891 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:41,891 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:41,891 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:41,891 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:41,892 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:41,892 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:41,892 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:41,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:41,894 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:41,894 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:41,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:41,894 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:41,894 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:41,965 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:41,966 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:41,966 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:41,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:41,966 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:41,966 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:41,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1018 [2022-12-06 07:28:41,966 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-06 07:28:41,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:41,966 INFO L85 PathProgramCache]: Analyzing trace with hash 488636746, now seen corresponding path program 1 times [2022-12-06 07:28:41,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:41,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612419572] [2022-12-06 07:28:41,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:41,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:42,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-06 07:28:42,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:42,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612419572] [2022-12-06 07:28:42,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612419572] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:42,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:42,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:42,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325966150] [2022-12-06 07:28:42,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:42,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:42,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:42,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:42,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:42,026 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:42,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:42,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:42,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:42,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:42,062 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:42,063 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:42,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:42,063 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:42,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:42,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:42,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:42,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:42,064 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:42,064 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:42,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:42,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:42,064 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:42,064 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:42,065 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:42,065 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:42,065 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:42,065 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:42,065 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:42,065 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:42,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:42,067 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:42,067 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:42,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:42,067 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:42,068 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:42,142 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:42,142 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:42,142 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:42,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:42,142 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:42,142 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:42,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1019 [2022-12-06 07:28:42,142 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-06 07:28:42,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:42,143 INFO L85 PathProgramCache]: Analyzing trace with hash 515418855, now seen corresponding path program 1 times [2022-12-06 07:28:42,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:42,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341510824] [2022-12-06 07:28:42,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:42,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:42,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-06 07:28:42,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:42,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341510824] [2022-12-06 07:28:42,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341510824] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:42,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:42,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:42,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208029420] [2022-12-06 07:28:42,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:42,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:42,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:42,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:42,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:42,203 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:42,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:42,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:42,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:42,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:42,244 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:42,244 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:42,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:42,244 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:42,244 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:42,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:42,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:42,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:42,245 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:42,245 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:42,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:42,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:42,246 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:42,246 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:42,246 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:42,246 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:42,246 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:42,246 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:42,246 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:42,246 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:42,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:42,248 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:42,248 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:42,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:42,248 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:42,249 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:42,321 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:42,321 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:42,321 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:42,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:42,321 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:42,322 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:42,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1020 [2022-12-06 07:28:42,322 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-06 07:28:42,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:42,322 INFO L85 PathProgramCache]: Analyzing trace with hash 545895048, now seen corresponding path program 1 times [2022-12-06 07:28:42,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:42,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54301248] [2022-12-06 07:28:42,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:42,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:42,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-06 07:28:42,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:42,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54301248] [2022-12-06 07:28:42,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54301248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:42,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:42,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:42,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147169148] [2022-12-06 07:28:42,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:42,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:42,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:42,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:42,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:42,391 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:42,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:42,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:42,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:42,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:42,427 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:42,428 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:42,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:42,428 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:42,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:42,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:42,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:42,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:42,429 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:42,429 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:42,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:42,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:42,429 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:42,429 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:42,429 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:42,429 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:42,430 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:42,430 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:42,430 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:42,430 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:42,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:42,432 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:42,432 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:42,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:42,432 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:42,432 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:42,506 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:42,506 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:42,506 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:42,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:42,506 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:42,506 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:42,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1021 [2022-12-06 07:28:42,507 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-06 07:28:42,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:42,507 INFO L85 PathProgramCache]: Analyzing trace with hash 572677157, now seen corresponding path program 1 times [2022-12-06 07:28:42,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:42,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804139819] [2022-12-06 07:28:42,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:42,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:42,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-06 07:28:42,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:42,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804139819] [2022-12-06 07:28:42,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804139819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:42,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:42,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:42,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677497732] [2022-12-06 07:28:42,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:42,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:42,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:42,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:42,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:42,574 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:42,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:42,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:42,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:42,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:42,609 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:42,609 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:42,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:42,610 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:42,610 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:42,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:42,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:42,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:42,610 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:42,610 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:42,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:42,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:42,611 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:42,611 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:42,611 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:42,611 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:42,611 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:42,612 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:42,612 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:42,612 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:42,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:42,614 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:42,614 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:42,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:42,614 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:42,614 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:42,686 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:42,687 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:42,687 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:42,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:42,687 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:42,687 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:42,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1022 [2022-12-06 07:28:42,687 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-06 07:28:42,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:42,687 INFO L85 PathProgramCache]: Analyzing trace with hash 603153350, now seen corresponding path program 1 times [2022-12-06 07:28:42,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:42,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216860908] [2022-12-06 07:28:42,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:42,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:42,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-06 07:28:42,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:42,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216860908] [2022-12-06 07:28:42,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216860908] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:42,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:42,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:42,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014386265] [2022-12-06 07:28:42,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:42,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:42,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:42,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:42,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:42,748 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:42,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:42,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:42,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:42,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:42,785 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:42,786 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:42,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:42,786 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:42,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:42,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:42,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:42,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:42,787 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:42,787 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:42,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:42,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:42,787 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:42,787 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:42,787 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:42,788 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:42,788 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:42,788 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:42,788 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:42,788 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:42,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:42,791 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:42,791 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:42,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:42,792 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:42,792 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:42,877 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:42,877 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 07:28:42,877 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:42,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:42,878 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:42,878 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:42,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1023 [2022-12-06 07:28:42,878 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-06 07:28:42,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:42,878 INFO L85 PathProgramCache]: Analyzing trace with hash 629935459, now seen corresponding path program 1 times [2022-12-06 07:28:42,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:42,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665782574] [2022-12-06 07:28:42,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:42,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:42,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-06 07:28:42,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:42,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665782574] [2022-12-06 07:28:42,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665782574] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:42,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:42,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:42,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297805824] [2022-12-06 07:28:42,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:42,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:42,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:42,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:42,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:42,940 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:42,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:42,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:42,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:42,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:42,985 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:42,986 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:42,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:42,986 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:42,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:42,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:42,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:42,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:42,987 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:42,987 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:42,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:42,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:42,987 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:42,988 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:42,988 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:42,988 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:42,988 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:42,988 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:42,988 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:42,988 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:42,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:42,990 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:42,990 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:42,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:42,991 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:42,991 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:43,069 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:43,069 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:28:43,069 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:43,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:43,069 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:43,069 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:43,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1024 [2022-12-06 07:28:43,070 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-06 07:28:43,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:43,070 INFO L85 PathProgramCache]: Analyzing trace with hash 660411652, now seen corresponding path program 1 times [2022-12-06 07:28:43,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:43,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976236430] [2022-12-06 07:28:43,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:43,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:43,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-06 07:28:43,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:43,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976236430] [2022-12-06 07:28:43,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976236430] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:43,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:43,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:43,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027742084] [2022-12-06 07:28:43,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:43,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:43,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:43,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:43,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:43,136 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:43,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:43,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:43,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:43,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:43,174 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:43,175 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:43,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:43,175 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:43,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:43,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:43,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:43,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:43,176 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:43,176 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:43,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:43,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:43,176 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:43,176 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:43,177 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:43,177 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:43,177 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:43,177 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:43,177 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:43,177 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:43,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:43,179 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:43,179 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:43,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:43,180 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:43,180 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:43,253 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:43,253 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:43,253 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:43,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:43,254 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:43,254 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:43,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1025 [2022-12-06 07:28:43,254 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-06 07:28:43,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:43,254 INFO L85 PathProgramCache]: Analyzing trace with hash 687193761, now seen corresponding path program 1 times [2022-12-06 07:28:43,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:43,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093537184] [2022-12-06 07:28:43,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:43,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:43,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:43,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:43,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093537184] [2022-12-06 07:28:43,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093537184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:43,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:43,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:43,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572830124] [2022-12-06 07:28:43,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:43,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:43,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:43,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:43,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:43,326 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:43,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:43,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:43,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:43,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:43,361 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:43,361 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:43,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:43,362 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:43,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:43,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:43,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:43,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:43,362 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:43,362 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:43,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:43,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:43,363 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:43,363 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:43,363 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:43,363 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:43,363 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:43,363 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:43,364 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:43,364 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:43,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:43,366 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:43,366 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:43,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:43,366 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:43,366 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:43,441 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:43,441 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:43,441 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:43,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:43,441 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:43,441 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:43,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1026 [2022-12-06 07:28:43,441 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-06 07:28:43,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:43,442 INFO L85 PathProgramCache]: Analyzing trace with hash 717669954, now seen corresponding path program 1 times [2022-12-06 07:28:43,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:43,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456513413] [2022-12-06 07:28:43,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:43,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:43,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-06 07:28:43,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:43,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456513413] [2022-12-06 07:28:43,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456513413] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:43,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:43,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:43,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979240030] [2022-12-06 07:28:43,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:43,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:43,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:43,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:43,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:43,501 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:43,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:43,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:43,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:43,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:43,537 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:43,537 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:43,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:43,538 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:43,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:43,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:43,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:43,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:43,538 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:43,538 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:43,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:43,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:43,539 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:43,539 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:43,539 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:43,539 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:43,539 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:43,539 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:43,539 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:43,539 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:43,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:43,542 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:43,542 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:43,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:43,542 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:43,542 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:43,615 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:43,615 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:43,615 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:43,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:43,615 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:43,615 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:43,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1027 [2022-12-06 07:28:43,616 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-06 07:28:43,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:43,616 INFO L85 PathProgramCache]: Analyzing trace with hash 744452063, now seen corresponding path program 1 times [2022-12-06 07:28:43,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:43,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220632786] [2022-12-06 07:28:43,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:43,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:43,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-06 07:28:43,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:43,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220632786] [2022-12-06 07:28:43,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220632786] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:43,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:43,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:43,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179683710] [2022-12-06 07:28:43,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:43,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:43,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:43,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:43,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:43,674 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:43,674 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:43,674 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:43,674 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:43,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:43,710 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:43,710 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:43,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:43,711 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:43,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:43,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:43,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:43,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:43,711 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:43,711 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:43,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:43,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:43,712 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:43,712 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:43,712 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:43,712 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:43,712 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:43,712 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:43,712 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:43,712 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:43,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:43,714 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:43,715 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:43,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:43,715 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:43,715 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:43,788 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:43,789 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:43,789 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:43,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:43,789 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:43,789 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:43,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1028 [2022-12-06 07:28:43,789 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-06 07:28:43,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:43,790 INFO L85 PathProgramCache]: Analyzing trace with hash 774928256, now seen corresponding path program 1 times [2022-12-06 07:28:43,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:43,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400932453] [2022-12-06 07:28:43,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:43,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:43,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-06 07:28:43,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:43,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400932453] [2022-12-06 07:28:43,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400932453] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:43,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:43,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:43,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149090510] [2022-12-06 07:28:43,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:43,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:43,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:43,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:43,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:43,847 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:43,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:43,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:43,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:43,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:43,888 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:43,888 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:43,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:43,889 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:43,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:43,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:43,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:43,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:43,889 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:43,890 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:43,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:43,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:43,890 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:43,890 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:43,890 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:43,890 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:43,891 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:43,891 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:43,891 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:43,891 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:43,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:43,893 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:43,893 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:43,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:43,893 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:43,893 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:43,966 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:43,967 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:43,967 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:43,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:43,967 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:43,967 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:43,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1029 [2022-12-06 07:28:43,967 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-06 07:28:43,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:43,967 INFO L85 PathProgramCache]: Analyzing trace with hash 801710365, now seen corresponding path program 1 times [2022-12-06 07:28:43,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:43,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44944854] [2022-12-06 07:28:43,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:43,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:44,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-06 07:28:44,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:44,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44944854] [2022-12-06 07:28:44,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44944854] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:44,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:44,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:44,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807471711] [2022-12-06 07:28:44,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:44,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:44,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:44,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:44,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:44,030 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:44,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:44,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:44,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:44,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:44,066 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:44,066 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:44,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:44,066 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:44,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:44,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:44,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:44,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:44,067 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:44,067 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:44,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:44,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:44,068 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:44,068 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:44,068 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:44,068 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:44,068 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:44,068 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:44,068 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:44,068 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:44,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:44,070 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:44,070 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:44,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:44,071 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:44,071 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:44,143 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:44,144 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:44,144 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:44,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:44,144 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:44,144 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:44,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1030 [2022-12-06 07:28:44,144 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-06 07:28:44,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:44,144 INFO L85 PathProgramCache]: Analyzing trace with hash 832186558, now seen corresponding path program 1 times [2022-12-06 07:28:44,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:44,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429817621] [2022-12-06 07:28:44,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:44,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:44,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-06 07:28:44,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:44,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429817621] [2022-12-06 07:28:44,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429817621] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:44,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:44,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:44,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039485431] [2022-12-06 07:28:44,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:44,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:44,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:44,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:44,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:44,204 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:44,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:44,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:44,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:44,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:44,247 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:44,247 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:44,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:44,248 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:44,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:44,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:44,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:44,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:44,248 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:44,248 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:44,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:44,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:44,249 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:44,249 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:44,249 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:44,249 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:44,249 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:44,249 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:44,249 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:44,249 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:44,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:44,259 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:44,259 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:44,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:44,260 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:44,260 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:44,333 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:44,333 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:28:44,333 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:44,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:44,334 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:44,334 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:44,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1031 [2022-12-06 07:28:44,334 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-06 07:28:44,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:44,334 INFO L85 PathProgramCache]: Analyzing trace with hash 858968667, now seen corresponding path program 1 times [2022-12-06 07:28:44,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:44,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156918051] [2022-12-06 07:28:44,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:44,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:44,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-06 07:28:44,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:44,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156918051] [2022-12-06 07:28:44,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156918051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:44,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:44,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:44,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941095452] [2022-12-06 07:28:44,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:44,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:44,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:44,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:44,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:44,397 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:44,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:44,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:44,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:44,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:44,435 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:44,436 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:44,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:44,436 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:44,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:44,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:44,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:44,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:44,436 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:44,437 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:44,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:44,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:44,437 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:44,437 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:44,437 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:44,437 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:44,438 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:44,438 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:44,438 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:44,438 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:44,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:44,440 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:44,440 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:44,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:44,440 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:44,440 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:44,514 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:44,514 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:44,514 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:44,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:44,515 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:44,515 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:44,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1032 [2022-12-06 07:28:44,515 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-06 07:28:44,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:44,515 INFO L85 PathProgramCache]: Analyzing trace with hash 889444860, now seen corresponding path program 1 times [2022-12-06 07:28:44,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:44,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860215582] [2022-12-06 07:28:44,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:44,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:44,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:44,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:44,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860215582] [2022-12-06 07:28:44,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860215582] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:44,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:44,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:44,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073177593] [2022-12-06 07:28:44,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:44,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:44,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:44,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:44,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:44,573 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:44,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:44,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:44,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:44,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:44,610 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:44,610 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:44,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:44,611 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:44,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:44,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:44,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:44,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:44,611 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:44,612 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:44,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:44,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:44,612 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:44,612 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:44,612 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:44,612 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:44,612 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:44,613 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:44,613 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:44,613 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:44,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:44,615 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:44,615 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:44,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:44,615 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:44,615 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:44,688 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:44,688 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:44,688 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:44,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:44,688 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:44,689 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:44,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1033 [2022-12-06 07:28:44,689 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-06 07:28:44,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:44,689 INFO L85 PathProgramCache]: Analyzing trace with hash 916226969, now seen corresponding path program 1 times [2022-12-06 07:28:44,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:44,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11723747] [2022-12-06 07:28:44,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:44,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:44,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-06 07:28:44,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:44,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11723747] [2022-12-06 07:28:44,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11723747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:44,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:44,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:44,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274750398] [2022-12-06 07:28:44,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:44,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:44,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:44,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:44,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:44,749 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:44,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:44,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:44,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:44,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:44,790 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:44,790 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:44,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 371 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:44,790 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:44,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:44,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:44,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:44,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:44,791 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:44,791 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:44,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:44,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:44,792 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:44,792 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:44,792 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:44,792 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:44,792 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:44,792 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:44,792 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:44,792 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:44,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:44,795 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:44,795 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:44,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:44,795 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:44,795 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:44,868 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:44,869 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:44,869 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:44,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:44,869 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:44,869 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:44,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1034 [2022-12-06 07:28:44,869 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-06 07:28:44,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:44,869 INFO L85 PathProgramCache]: Analyzing trace with hash 946703162, now seen corresponding path program 1 times [2022-12-06 07:28:44,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:44,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678749901] [2022-12-06 07:28:44,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:44,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:44,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-06 07:28:44,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:44,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678749901] [2022-12-06 07:28:44,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678749901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:44,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:44,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:44,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500341449] [2022-12-06 07:28:44,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:44,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:44,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:44,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:44,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:44,929 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:44,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:44,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:44,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:44,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:44,964 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:44,965 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:44,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:44,965 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:44,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:44,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:44,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:44,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:44,966 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:44,966 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:44,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:44,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:44,966 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:44,966 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:44,966 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:44,966 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:44,967 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:44,967 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:44,967 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:44,967 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:44,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:44,969 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:44,969 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:44,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:44,969 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:44,969 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:45,041 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:45,042 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:45,042 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:45,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:45,042 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:45,042 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:45,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1035 [2022-12-06 07:28:45,042 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-06 07:28:45,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:45,042 INFO L85 PathProgramCache]: Analyzing trace with hash 973485271, now seen corresponding path program 1 times [2022-12-06 07:28:45,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:45,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073720238] [2022-12-06 07:28:45,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:45,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:45,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:45,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-06 07:28:45,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:45,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073720238] [2022-12-06 07:28:45,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073720238] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:45,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:45,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:45,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936097731] [2022-12-06 07:28:45,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:45,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:45,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:45,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:45,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:45,105 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:45,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:45,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:45,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:45,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:45,141 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:45,141 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:45,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:45,141 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:45,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:45,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:45,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:45,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:45,142 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:45,142 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:45,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:45,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:45,142 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:45,142 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:45,143 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:45,143 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:45,143 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:45,143 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:45,143 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:45,143 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:45,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:45,145 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:45,145 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:45,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:45,145 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:45,145 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:45,219 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:45,220 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:45,220 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:45,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:45,220 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:45,220 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:45,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1036 [2022-12-06 07:28:45,220 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-06 07:28:45,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:45,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1003961464, now seen corresponding path program 1 times [2022-12-06 07:28:45,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:45,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401885109] [2022-12-06 07:28:45,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:45,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:45,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-06 07:28:45,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:45,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401885109] [2022-12-06 07:28:45,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401885109] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:45,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:45,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:45,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155817292] [2022-12-06 07:28:45,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:45,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:45,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:45,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:45,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:45,290 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:45,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:45,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:45,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:45,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:45,332 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:45,332 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:45,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:45,332 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:45,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:45,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:45,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:45,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:45,333 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:45,333 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:45,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:45,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:45,334 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:45,334 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:45,334 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:45,334 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:45,334 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:45,334 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:45,334 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:45,334 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:45,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:45,336 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:45,336 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:45,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:45,337 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:45,337 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:45,409 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:45,410 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:45,410 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:45,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:45,410 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:45,410 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:45,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1037 [2022-12-06 07:28:45,410 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-06 07:28:45,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:45,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1030743573, now seen corresponding path program 1 times [2022-12-06 07:28:45,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:45,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730817860] [2022-12-06 07:28:45,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:45,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28: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-06 07:28:45,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:45,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730817860] [2022-12-06 07:28:45,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730817860] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:45,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:45,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:45,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084805725] [2022-12-06 07:28:45,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:45,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:45,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:45,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:45,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:45,471 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:45,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:45,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:45,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:45,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:45,507 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:45,507 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:45,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:45,508 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:45,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:45,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:45,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:45,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:45,508 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:45,508 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:45,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:45,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:45,509 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:45,509 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:45,509 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:45,509 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:45,509 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:45,509 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:45,509 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:45,509 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:45,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:45,512 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:45,512 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:45,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:45,512 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:45,512 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:45,584 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:45,585 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:45,585 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:45,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:45,585 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:45,585 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:45,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1038 [2022-12-06 07:28:45,585 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-06 07:28:45,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:45,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1061219766, now seen corresponding path program 1 times [2022-12-06 07:28:45,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:45,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637537841] [2022-12-06 07:28:45,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:45,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:45,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-06 07:28:45,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:45,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637537841] [2022-12-06 07:28:45,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637537841] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:45,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:45,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:45,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966972358] [2022-12-06 07:28:45,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:45,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:45,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:45,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:45,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:45,642 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:45,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:45,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:45,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:45,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:45,679 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:45,679 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:45,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:45,680 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:45,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:45,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:45,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:45,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:45,680 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:45,680 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:45,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:45,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:45,681 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:45,681 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:45,681 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:45,681 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:45,681 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:45,681 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:45,681 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:45,681 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:45,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:45,684 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:45,684 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:45,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:45,684 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:45,684 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:45,755 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:45,756 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:45,756 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:45,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:45,756 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:45,756 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:45,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1039 [2022-12-06 07:28:45,756 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-06 07:28:45,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:45,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1088001875, now seen corresponding path program 1 times [2022-12-06 07:28:45,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:45,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004334085] [2022-12-06 07:28:45,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:45,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:45,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:45,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-06 07:28:45,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:45,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004334085] [2022-12-06 07:28:45,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004334085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:45,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:45,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:45,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286266481] [2022-12-06 07:28:45,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:45,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:45,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:45,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:45,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:45,819 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:45,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:45,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:45,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:45,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:45,858 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:45,858 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:45,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:45,858 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:45,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:45,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:45,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:45,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:45,859 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:45,859 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:45,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:45,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:45,860 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:45,860 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:45,860 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:45,860 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:45,860 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:45,860 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:45,860 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:45,860 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:45,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:45,862 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:45,862 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:45,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:45,863 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:45,863 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:45,934 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:45,935 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:45,935 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:45,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:45,935 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:45,935 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:45,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1040 [2022-12-06 07:28:45,935 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-06 07:28:45,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:45,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1118478068, now seen corresponding path program 1 times [2022-12-06 07:28:45,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:45,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098576401] [2022-12-06 07:28:45,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:45,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:45,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-06 07:28:45,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:45,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098576401] [2022-12-06 07:28:45,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098576401] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:45,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:45,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:45,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146864733] [2022-12-06 07:28:45,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:45,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:45,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:45,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:45,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:45,995 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:45,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:45,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:45,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:45,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:46,036 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:46,037 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:46,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:46,037 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:46,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:46,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:46,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:46,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:46,038 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:46,038 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:46,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:46,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:46,038 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:46,038 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:46,038 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:46,039 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:46,039 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:46,039 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:46,039 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:46,039 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:46,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:46,041 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:46,041 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:46,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:46,041 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:46,041 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:46,113 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:46,114 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:46,114 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:46,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:46,114 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:46,114 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:46,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1041 [2022-12-06 07:28:46,114 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-06 07:28:46,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:46,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1145260177, now seen corresponding path program 1 times [2022-12-06 07:28:46,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:46,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945769855] [2022-12-06 07:28:46,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:46,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:46,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-06 07:28:46,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:46,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945769855] [2022-12-06 07:28:46,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945769855] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:46,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:46,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:46,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390863839] [2022-12-06 07:28:46,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:46,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:46,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:46,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:46,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:46,175 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:46,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:46,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:46,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:46,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:46,216 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:46,217 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:46,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:46,225 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:46,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:46,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:46,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:46,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:46,226 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:46,226 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:46,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:46,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:46,226 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:46,226 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:46,227 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:46,227 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:46,227 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:46,227 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:46,227 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:46,227 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:46,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:46,229 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:46,229 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:46,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:46,230 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:46,230 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:46,303 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:46,303 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:46,303 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:46,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:46,303 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:46,303 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:46,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1042 [2022-12-06 07:28:46,304 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-06 07:28:46,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:46,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1175736370, now seen corresponding path program 1 times [2022-12-06 07:28:46,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:46,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395976137] [2022-12-06 07:28:46,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:46,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:46,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:46,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-06 07:28:46,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:46,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395976137] [2022-12-06 07:28:46,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395976137] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:46,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:46,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:46,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774622528] [2022-12-06 07:28:46,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:46,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:46,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:46,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:46,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:46,362 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:46,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:46,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:46,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:46,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:46,398 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:46,398 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:46,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:46,399 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:46,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:46,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:46,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:46,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:46,399 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:46,399 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:46,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:46,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:46,400 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:46,400 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:46,400 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:46,400 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:46,400 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:46,401 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:46,401 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:46,401 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:46,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:46,403 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:46,403 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:46,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:46,403 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:46,403 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:46,476 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:46,476 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:46,476 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:46,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:46,476 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:46,476 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:46,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1043 [2022-12-06 07:28:46,476 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-06 07:28:46,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:46,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1202518479, now seen corresponding path program 1 times [2022-12-06 07:28:46,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:46,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967279953] [2022-12-06 07:28:46,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:46,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:46,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-06 07:28:46,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:46,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967279953] [2022-12-06 07:28:46,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967279953] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:46,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:46,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:46,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102426427] [2022-12-06 07:28:46,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:46,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:46,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:46,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:46,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:46,537 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:46,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:46,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:46,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:46,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:46,573 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:46,573 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:46,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:46,574 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:46,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:46,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:46,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:46,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:46,574 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:46,574 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:46,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:46,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:46,575 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:46,575 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:46,575 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:46,575 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:46,575 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:46,575 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:46,575 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:46,575 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:46,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:46,578 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:46,578 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:46,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:46,578 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:46,578 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:46,651 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:46,652 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:46,652 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:46,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:46,652 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:46,652 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:46,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1044 [2022-12-06 07:28:46,652 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-06 07:28:46,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:46,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1232994672, now seen corresponding path program 1 times [2022-12-06 07:28:46,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:46,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752898165] [2022-12-06 07:28:46,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:46,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:46,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-06 07:28:46,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:46,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752898165] [2022-12-06 07:28:46,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752898165] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:46,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:46,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:46,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256017521] [2022-12-06 07:28:46,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:46,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:46,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:46,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:46,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:46,711 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:46,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:46,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:46,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:46,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:46,753 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:46,753 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:46,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:46,753 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:46,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:46,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:46,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:46,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:46,754 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:46,754 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:46,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:46,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:46,754 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:46,755 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:46,755 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:46,755 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:46,755 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:46,755 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:46,755 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:46,755 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:46,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:46,757 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:46,757 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:46,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:46,758 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:46,758 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:46,831 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:46,832 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:46,832 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:46,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:46,832 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:46,832 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:46,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1045 [2022-12-06 07:28:46,832 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-06 07:28:46,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:46,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1259776781, now seen corresponding path program 1 times [2022-12-06 07:28:46,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:46,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026376387] [2022-12-06 07:28:46,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:46,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:46,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-06 07:28:46,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:46,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026376387] [2022-12-06 07:28:46,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026376387] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:46,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:46,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:46,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190579727] [2022-12-06 07:28:46,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:46,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:46,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:46,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:46,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:46,893 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:46,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:46,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:46,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:46,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:46,933 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:46,933 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:46,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:46,934 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:46,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:46,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:46,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:46,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:46,934 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:46,934 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:46,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:46,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:46,935 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:46,935 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:46,935 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:46,935 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:46,935 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:46,935 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:46,935 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:46,935 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:46,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:46,938 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:46,938 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:46,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:46,938 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:46,938 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:47,011 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:47,012 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:47,012 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:47,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:47,012 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:47,012 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:47,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1046 [2022-12-06 07:28:47,012 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-06 07:28:47,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:47,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1290252974, now seen corresponding path program 1 times [2022-12-06 07:28:47,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:47,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513914891] [2022-12-06 07:28:47,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:47,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:47,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-06 07:28:47,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:47,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513914891] [2022-12-06 07:28:47,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513914891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:47,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:47,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:47,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227893237] [2022-12-06 07:28:47,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:47,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:47,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:47,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:47,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:47,070 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:47,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:47,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:47,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:47,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:47,113 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:47,113 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:47,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:47,113 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:47,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:47,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:47,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:47,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:47,114 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:47,114 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:47,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:47,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:47,115 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:47,115 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:47,115 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:47,115 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:47,115 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:47,115 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:47,115 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:47,115 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:47,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:47,117 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:47,117 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:47,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:47,118 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:47,118 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:47,191 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:47,192 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:47,192 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:47,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:47,192 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:47,192 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:47,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1047 [2022-12-06 07:28:47,192 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-06 07:28:47,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:47,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1317035083, now seen corresponding path program 1 times [2022-12-06 07:28:47,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:47,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978593015] [2022-12-06 07:28:47,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:47,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28: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-06 07:28:47,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:47,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978593015] [2022-12-06 07:28:47,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978593015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:47,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:47,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:47,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860786827] [2022-12-06 07:28:47,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:47,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:47,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:47,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:47,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:47,264 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:47,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:47,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:47,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:47,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:47,298 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:47,298 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:47,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:47,298 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:47,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:47,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:47,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:47,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:47,299 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:47,299 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:47,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:47,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:47,300 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:47,300 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:47,300 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:47,300 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:47,300 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:47,300 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:47,300 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:47,300 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:47,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:47,302 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:47,302 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:47,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:47,303 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:47,303 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:47,375 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:47,376 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:47,376 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:47,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:47,376 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:47,376 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:47,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1048 [2022-12-06 07:28:47,376 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-06 07:28:47,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:47,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1347511276, now seen corresponding path program 1 times [2022-12-06 07:28:47,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:47,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120310159] [2022-12-06 07:28:47,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:47,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:47,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-06 07:28:47,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:47,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120310159] [2022-12-06 07:28:47,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120310159] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:47,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:47,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:47,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359473655] [2022-12-06 07:28:47,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:47,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:47,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:47,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:47,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:47,435 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:47,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:47,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:47,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:47,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:47,471 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:47,471 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:47,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:47,471 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:47,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:47,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:47,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:47,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:47,472 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:47,472 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:47,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:47,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:47,473 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:47,473 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:47,473 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:47,473 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:47,473 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:47,473 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:47,473 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:47,473 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:47,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:47,475 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:47,475 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:47,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:47,476 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:47,476 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:47,548 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:47,549 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:47,549 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:47,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:47,549 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:47,549 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:47,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1049 [2022-12-06 07:28:47,549 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-06 07:28:47,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:47,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1374293385, now seen corresponding path program 1 times [2022-12-06 07:28:47,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:47,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276818357] [2022-12-06 07:28:47,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:47,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:47,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-06 07:28:47,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:47,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276818357] [2022-12-06 07:28:47,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276818357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:47,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:47,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:47,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463281050] [2022-12-06 07:28:47,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:47,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:47,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:47,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:47,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:47,611 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:47,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:47,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:47,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:47,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:47,647 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:47,647 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:47,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:47,647 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:47,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:47,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:47,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:47,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:47,648 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:47,648 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:47,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:47,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:47,649 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:47,649 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:47,649 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:47,649 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:47,649 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:47,649 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:47,649 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:47,649 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:47,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:47,651 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:47,651 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:47,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:47,652 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:47,652 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:47,722 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:47,723 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:28:47,723 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:47,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:47,723 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:47,723 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:47,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1050 [2022-12-06 07:28:47,723 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-06 07:28:47,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:47,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1404769578, now seen corresponding path program 1 times [2022-12-06 07:28:47,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:47,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138321446] [2022-12-06 07:28:47,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:47,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:47,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-06 07:28:47,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:47,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138321446] [2022-12-06 07:28:47,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138321446] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:47,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:47,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:47,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492750701] [2022-12-06 07:28:47,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:47,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:47,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:47,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:47,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:47,783 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:47,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:47,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:47,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:47,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:47,825 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:47,825 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:47,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:47,825 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:47,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:47,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:47,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:47,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:47,826 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:47,826 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:47,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:47,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:47,827 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:47,827 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:47,827 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:47,827 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:47,827 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:47,827 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:47,827 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:47,827 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:47,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:47,830 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:47,830 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:47,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 116 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:47,830 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:47,830 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:47,905 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:47,906 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:28:47,906 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:47,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:47,906 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:47,906 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:47,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1051 [2022-12-06 07:28:47,906 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-06 07:28:47,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:47,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1431551687, now seen corresponding path program 1 times [2022-12-06 07:28:47,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:47,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070997680] [2022-12-06 07:28:47,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:47,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:47,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-06 07:28:47,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:47,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070997680] [2022-12-06 07:28:47,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070997680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:47,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:47,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:47,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792280481] [2022-12-06 07:28:47,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:47,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:47,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:47,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:47,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:47,967 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:47,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:47,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:47,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:47,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:48,008 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:48,008 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:48,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:48,008 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:48,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:48,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:48,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:48,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:48,009 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:48,009 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:48,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:48,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:48,010 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:48,010 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:48,010 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:48,010 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:48,010 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:48,010 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:48,010 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:48,010 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:48,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:48,012 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:48,012 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:48,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:48,013 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:48,013 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:48,085 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:48,085 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:48,085 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:48,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:48,086 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:48,086 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:48,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1052 [2022-12-06 07:28:48,086 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-06 07:28:48,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:48,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1462027880, now seen corresponding path program 1 times [2022-12-06 07:28:48,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:48,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097817087] [2022-12-06 07:28:48,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:48,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:48,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-06 07:28:48,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:48,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097817087] [2022-12-06 07:28:48,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097817087] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:48,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:48,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:48,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431456281] [2022-12-06 07:28:48,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:48,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:48,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:48,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:48,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:48,146 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:48,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:48,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:48,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:48,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:48,196 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:48,197 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:48,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:48,197 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:48,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:48,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:48,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:48,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:48,198 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:48,198 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:48,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:48,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:48,198 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:48,198 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:48,198 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:48,199 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:48,199 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:48,199 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:48,199 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:48,199 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:48,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:48,201 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:48,201 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:48,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:48,201 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:48,201 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:48,272 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:48,273 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:28:48,273 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:48,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:48,273 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:48,273 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:48,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1053 [2022-12-06 07:28:48,273 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-06 07:28:48,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:48,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1488809989, now seen corresponding path program 1 times [2022-12-06 07:28:48,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:48,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487304134] [2022-12-06 07:28:48,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:48,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:48,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-06 07:28:48,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:48,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487304134] [2022-12-06 07:28:48,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487304134] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:48,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:48,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:48,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103489603] [2022-12-06 07:28:48,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:48,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:48,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:48,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:48,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:48,336 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:48,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:48,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:48,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:48,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:48,370 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:48,370 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:48,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:48,371 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:48,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:48,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:48,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:48,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:48,371 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:48,371 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:48,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:48,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:48,372 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:48,372 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:48,372 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:48,372 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:48,372 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:48,372 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:48,372 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:48,373 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:48,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:48,375 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:48,375 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:48,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:48,375 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:48,375 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:48,446 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:48,447 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:48,447 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:48,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:48,447 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:48,447 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:48,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1054 [2022-12-06 07:28:48,447 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-06 07:28:48,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:48,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1519286182, now seen corresponding path program 1 times [2022-12-06 07:28:48,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:48,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181105793] [2022-12-06 07:28:48,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:48,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:48,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-06 07:28:48,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:48,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181105793] [2022-12-06 07:28:48,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181105793] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:48,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:48,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:48,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814294895] [2022-12-06 07:28:48,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:48,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:48,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:48,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:48,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:48,505 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:48,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:48,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:48,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:48,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:48,540 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:48,540 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:48,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:48,541 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:48,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:48,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:48,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:48,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:48,541 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:48,541 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:48,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:48,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:48,542 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:48,542 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:48,542 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:48,542 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:48,542 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:48,542 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:48,542 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:48,543 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:48,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:48,545 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:48,545 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:48,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:48,545 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:48,545 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:48,617 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:48,617 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:48,617 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:48,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:48,617 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:48,618 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:48,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1055 [2022-12-06 07:28:48,618 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-06 07:28:48,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:48,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1546068291, now seen corresponding path program 1 times [2022-12-06 07:28:48,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:48,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323409811] [2022-12-06 07:28:48,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:48,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:48,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-06 07:28:48,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:48,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323409811] [2022-12-06 07:28:48,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323409811] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:48,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:48,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:48,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446736845] [2022-12-06 07:28:48,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:48,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:48,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:48,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:48,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:48,681 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:48,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:48,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:48,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:48,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:48,717 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:48,717 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:48,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:48,718 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:48,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:48,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:48,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:48,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:48,719 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:48,719 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:48,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:48,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:48,719 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:48,719 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:48,720 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:48,720 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:48,720 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:48,720 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:48,720 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:48,720 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:48,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:48,722 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:48,722 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:48,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:48,722 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:48,722 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:48,795 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:48,796 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:48,796 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:48,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:48,796 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:48,796 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:48,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1056 [2022-12-06 07:28:48,796 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-06 07:28:48,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:48,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1576544484, now seen corresponding path program 1 times [2022-12-06 07:28:48,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:48,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220707425] [2022-12-06 07:28:48,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:48,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:48,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-06 07:28:48,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:48,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220707425] [2022-12-06 07:28:48,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220707425] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:48,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:48,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:48,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496901254] [2022-12-06 07:28:48,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:48,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:48,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:48,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:48,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:48,855 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:48,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:48,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:48,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:48,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:48,896 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:48,896 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:48,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:48,897 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:48,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:48,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:48,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:48,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:48,897 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:48,897 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:48,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:48,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:48,898 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:48,898 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:48,898 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:48,898 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:48,898 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:48,898 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:48,898 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:48,898 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:48,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:48,901 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:48,901 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:48,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:48,901 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:48,901 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:48,973 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:48,973 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:48,973 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:48,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:48,974 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:48,974 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:48,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1057 [2022-12-06 07:28:48,974 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-06 07:28:48,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:48,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1603326593, now seen corresponding path program 1 times [2022-12-06 07:28:48,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:48,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789184667] [2022-12-06 07:28:48,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:48,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:49,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-06 07:28:49,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:49,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789184667] [2022-12-06 07:28:49,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789184667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:49,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:49,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:49,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308959978] [2022-12-06 07:28:49,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:49,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:49,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:49,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:49,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:49,035 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:49,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:49,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:49,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:49,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:49,075 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:49,075 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:49,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:49,076 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:49,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:49,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:49,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:49,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:49,076 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:49,076 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:49,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:49,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:49,077 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:49,077 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:49,077 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:49,077 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:49,077 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:49,078 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:49,078 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:49,078 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:49,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:49,080 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:49,080 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:49,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:49,080 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:49,080 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:49,152 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:49,152 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:49,152 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:49,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:49,152 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:49,152 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:49,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1058 [2022-12-06 07:28:49,153 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-06 07:28:49,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:49,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1633802786, now seen corresponding path program 1 times [2022-12-06 07:28:49,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:49,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056643031] [2022-12-06 07:28:49,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:49,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:49,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-06 07:28:49,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:49,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056643031] [2022-12-06 07:28:49,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056643031] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:49,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:49,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:49,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356915746] [2022-12-06 07:28:49,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:49,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:49,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:49,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:49,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:49,232 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:49,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:49,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:49,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:49,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:49,273 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:49,273 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:49,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 349 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:49,274 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:49,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:49,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:49,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:49,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:49,274 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:49,274 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:49,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:49,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:49,275 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:49,275 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:49,275 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:49,275 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:49,275 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:49,275 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:49,275 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:49,275 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:49,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:49,278 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:49,278 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:49,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:49,278 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:49,278 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:49,351 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:49,351 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:49,351 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:49,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:49,352 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:49,352 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:49,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1059 [2022-12-06 07:28:49,352 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-06 07:28:49,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:49,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1660584895, now seen corresponding path program 1 times [2022-12-06 07:28:49,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:49,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192229282] [2022-12-06 07:28:49,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:49,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28: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-06 07:28:49,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:49,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192229282] [2022-12-06 07:28:49,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192229282] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:49,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:49,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:49,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456715505] [2022-12-06 07:28:49,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:49,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:49,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:49,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:49,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:49,413 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:49,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:49,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:49,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:49,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:49,455 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:49,455 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:49,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:49,455 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:49,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:49,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:49,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:49,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:49,456 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:49,456 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:49,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:49,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:49,456 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:49,456 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:49,457 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:49,457 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:49,457 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:49,457 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:49,457 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:49,457 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:49,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:49,459 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:49,459 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:49,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:49,459 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:49,459 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:49,532 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:49,532 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:49,533 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:49,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:49,533 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:49,533 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:49,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1060 [2022-12-06 07:28:49,533 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-06 07:28:49,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:49,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1691061088, now seen corresponding path program 1 times [2022-12-06 07:28:49,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:49,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631105127] [2022-12-06 07:28:49,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:49,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:49,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-06 07:28:49,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:49,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631105127] [2022-12-06 07:28:49,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631105127] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:49,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:49,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:49,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133360137] [2022-12-06 07:28:49,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:49,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:49,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:49,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:49,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:49,592 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:49,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:49,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:49,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:49,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:49,628 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:49,628 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:49,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:49,629 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:49,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:49,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:49,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:49,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:49,629 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:49,629 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:49,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:49,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:49,630 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:49,630 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:49,630 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:49,630 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:49,630 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:49,630 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:49,630 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:49,631 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:49,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:49,633 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:49,633 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:49,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:49,633 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:49,633 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:49,706 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:49,706 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:49,706 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:49,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:49,706 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:49,706 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:49,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1061 [2022-12-06 07:28:49,706 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-06 07:28:49,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:49,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1717843197, now seen corresponding path program 1 times [2022-12-06 07:28:49,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:49,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277622826] [2022-12-06 07:28:49,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:49,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:49,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-06 07:28:49,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:49,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277622826] [2022-12-06 07:28:49,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277622826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:49,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:49,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:49,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928751784] [2022-12-06 07:28:49,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:49,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:49,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:49,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:49,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:49,768 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:49,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:49,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:49,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:49,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:49,803 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:49,804 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:49,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:49,804 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:49,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:49,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:49,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:49,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:49,805 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:49,805 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:49,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:49,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:49,805 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:49,805 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:49,805 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:49,805 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:49,806 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:49,806 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:49,806 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:49,806 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:49,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:49,808 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:49,808 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:49,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:49,808 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:49,808 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:49,881 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:49,881 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:49,881 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:49,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:49,882 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:49,882 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:49,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1062 [2022-12-06 07:28:49,882 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-06 07:28:49,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:49,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1748319390, now seen corresponding path program 1 times [2022-12-06 07:28:49,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:49,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484734518] [2022-12-06 07:28:49,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:49,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:49,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:49,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-06 07:28:49,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:49,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484734518] [2022-12-06 07:28:49,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484734518] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:49,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:49,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:49,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581638165] [2022-12-06 07:28:49,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:49,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:49,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:49,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:49,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:49,941 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:49,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:49,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:49,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:49,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:49,983 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:49,983 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:49,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:49,984 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:49,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:49,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:49,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:49,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:49,984 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:49,984 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:49,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:49,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:49,985 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:49,985 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:49,985 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:49,985 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:49,985 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:49,985 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:49,986 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:49,986 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:49,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:49,988 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:49,988 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:49,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:49,988 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:49,988 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:50,062 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:50,063 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:50,063 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:50,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:50,063 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:50,063 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:50,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1063 [2022-12-06 07:28:50,063 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-06 07:28:50,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:50,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1775101499, now seen corresponding path program 1 times [2022-12-06 07:28:50,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:50,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333032365] [2022-12-06 07:28:50,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:50,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:50,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-06 07:28:50,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:50,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333032365] [2022-12-06 07:28:50,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333032365] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:50,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:50,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:50,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686529777] [2022-12-06 07:28:50,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:50,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:50,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:50,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:50,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:50,135 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:50,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:50,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:50,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:50,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:50,170 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:50,170 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:50,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:50,170 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:50,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:50,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:50,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:50,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:50,171 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:50,171 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:50,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:50,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:50,171 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:50,171 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:50,172 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:50,172 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:50,172 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:50,172 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:50,172 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:50,172 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:50,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:50,174 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:50,174 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:50,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:50,174 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:50,174 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:50,246 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:50,246 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:28:50,246 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:50,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:50,246 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:50,246 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:50,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1064 [2022-12-06 07:28:50,247 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-06 07:28:50,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:50,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1805577692, now seen corresponding path program 1 times [2022-12-06 07:28:50,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:50,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145611058] [2022-12-06 07:28:50,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:50,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:50,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-06 07:28:50,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:50,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145611058] [2022-12-06 07:28:50,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145611058] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:50,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:50,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:50,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366472625] [2022-12-06 07:28:50,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:50,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:50,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:50,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:50,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:50,310 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:50,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:50,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:50,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:50,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:50,353 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:50,353 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:50,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:50,354 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:50,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:50,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:50,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:50,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:50,354 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:50,354 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:50,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:50,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:50,355 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:50,355 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:50,355 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:50,355 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:50,355 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:50,355 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:50,355 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:50,355 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:50,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:50,357 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:50,357 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:50,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:50,358 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:50,358 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:50,438 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:50,438 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 07:28:50,438 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:50,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:50,438 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:50,438 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:50,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1065 [2022-12-06 07:28:50,439 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-06 07:28:50,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:50,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1832359801, now seen corresponding path program 1 times [2022-12-06 07:28:50,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:50,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758876962] [2022-12-06 07:28:50,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:50,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:50,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:50,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-06 07:28:50,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:50,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758876962] [2022-12-06 07:28:50,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758876962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:50,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:50,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:50,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773860127] [2022-12-06 07:28:50,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:50,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:50,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:50,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:50,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:50,500 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:50,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:50,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:50,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:50,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:50,535 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:50,535 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:50,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:50,536 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:50,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:50,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:50,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:50,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:50,536 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:50,536 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:50,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:50,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:50,537 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:50,537 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:50,537 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:50,537 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:50,537 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:50,538 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:50,538 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:50,538 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:50,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:50,540 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:50,540 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:50,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:50,540 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:50,540 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:50,620 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:50,620 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 07:28:50,620 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:50,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:50,620 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:50,620 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:50,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1066 [2022-12-06 07:28:50,621 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-06 07:28:50,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:50,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1862835994, now seen corresponding path program 1 times [2022-12-06 07:28:50,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:50,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111684339] [2022-12-06 07:28:50,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:50,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:50,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-06 07:28:50,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:50,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111684339] [2022-12-06 07:28:50,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111684339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:50,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:50,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:50,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475034610] [2022-12-06 07:28:50,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:50,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:50,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:50,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:50,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:50,680 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:50,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:50,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:50,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:50,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:50,717 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:50,717 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:50,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:50,717 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:50,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:50,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:50,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:50,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:50,718 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:50,718 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:50,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:50,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:50,718 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:50,718 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:50,719 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:50,719 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:50,719 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:50,719 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:50,719 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:50,719 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:50,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:50,721 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:50,721 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:50,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:50,721 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:50,721 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:50,794 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:50,795 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:50,795 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:50,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:50,795 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:50,795 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:50,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1067 [2022-12-06 07:28:50,795 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-06 07:28:50,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:50,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1889618103, now seen corresponding path program 1 times [2022-12-06 07:28:50,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:50,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474136597] [2022-12-06 07:28:50,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:50,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:50,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:50,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:50,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474136597] [2022-12-06 07:28:50,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474136597] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:50,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:50,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:50,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94923323] [2022-12-06 07:28:50,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:50,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:50,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:50,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:50,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:50,860 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:50,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:50,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:50,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:50,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:50,902 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:50,902 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:50,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:50,902 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:50,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:50,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:50,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:50,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:50,903 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:50,903 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:50,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:50,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:50,904 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:50,904 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:50,904 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:50,904 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:50,904 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:50,904 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:50,904 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:50,904 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:50,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:50,906 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:50,906 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:50,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:50,907 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:50,907 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:50,986 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:50,986 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:28:50,986 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:50,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:50,987 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:50,987 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:50,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1068 [2022-12-06 07:28:50,987 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-06 07:28:50,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:50,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1920094296, now seen corresponding path program 1 times [2022-12-06 07:28:50,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:50,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905618674] [2022-12-06 07:28:50,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:50,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28: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-06 07:28:51,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:51,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905618674] [2022-12-06 07:28:51,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905618674] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:51,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:51,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:51,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548379895] [2022-12-06 07:28:51,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:51,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:51,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:51,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:51,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:51,045 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:51,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:51,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:51,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:51,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:51,093 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:51,093 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:51,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:51,094 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:51,094 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:51,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:51,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:51,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:51,094 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:51,094 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:51,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:51,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:51,095 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:51,095 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:51,095 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:51,095 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:51,095 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:51,096 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:51,096 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:51,096 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:51,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:51,098 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:51,098 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:51,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:51,098 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:51,098 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:51,172 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:51,172 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:51,172 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:51,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:51,173 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:51,173 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:51,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1069 [2022-12-06 07:28:51,173 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-06 07:28:51,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:51,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1946876405, now seen corresponding path program 1 times [2022-12-06 07:28:51,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:51,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543416294] [2022-12-06 07:28:51,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:51,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:51,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-06 07:28:51,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:51,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543416294] [2022-12-06 07:28:51,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543416294] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:51,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:51,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:51,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710240101] [2022-12-06 07:28:51,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:51,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:51,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:51,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:51,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:51,248 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:51,248 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:51,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:51,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:51,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:51,284 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:51,284 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:51,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:51,284 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:51,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:51,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:51,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:51,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:51,285 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:51,285 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:51,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:51,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:51,285 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:51,286 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:51,286 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:51,286 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:51,286 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:51,286 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:51,286 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:51,286 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:51,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:51,288 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:51,288 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:51,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:51,288 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:51,289 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:51,361 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:51,362 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:51,362 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:51,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:51,362 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:51,362 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:51,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1070 [2022-12-06 07:28:51,362 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-06 07:28:51,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:51,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1977352598, now seen corresponding path program 1 times [2022-12-06 07:28:51,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:51,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829362121] [2022-12-06 07:28:51,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:51,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:51,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-06 07:28:51,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:51,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829362121] [2022-12-06 07:28:51,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829362121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:51,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:51,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:51,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141119395] [2022-12-06 07:28:51,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:51,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:51,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:51,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:51,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:51,424 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:51,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:51,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:51,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:51,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:51,465 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:51,465 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:51,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:51,466 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:51,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:51,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:51,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:51,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:51,466 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:51,466 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:51,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:51,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:51,467 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:51,467 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:51,467 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:51,467 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:51,467 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:51,467 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:51,467 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:51,467 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:51,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:51,470 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:51,470 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:51,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:51,470 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:51,470 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:51,543 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:51,543 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:51,543 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:51,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:51,544 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:51,544 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:51,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1071 [2022-12-06 07:28:51,544 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-06 07:28:51,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:51,544 INFO L85 PathProgramCache]: Analyzing trace with hash 2004134707, now seen corresponding path program 1 times [2022-12-06 07:28:51,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:51,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491928843] [2022-12-06 07:28:51,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:51,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:51,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:51,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:51,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491928843] [2022-12-06 07:28:51,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491928843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:51,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:51,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:51,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769931120] [2022-12-06 07:28:51,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:51,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:51,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:51,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:51,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:51,605 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:51,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:51,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:51,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:51,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:51,641 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:51,642 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:51,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 370 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:51,642 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:51,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:51,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:51,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:51,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:51,643 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:51,643 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:51,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:51,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:51,643 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:51,643 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:51,643 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:51,644 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:51,644 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:51,644 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:51,644 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:51,644 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:51,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:51,646 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:51,646 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:51,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:51,646 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:51,646 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:51,720 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:51,721 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:51,721 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:51,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:51,721 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:51,721 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:51,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1072 [2022-12-06 07:28:51,721 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-06 07:28:51,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:51,721 INFO L85 PathProgramCache]: Analyzing trace with hash 2034610900, now seen corresponding path program 1 times [2022-12-06 07:28:51,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:51,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709809129] [2022-12-06 07:28:51,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:51,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:51,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-06 07:28:51,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:51,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709809129] [2022-12-06 07:28:51,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709809129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:51,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:51,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:51,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457393913] [2022-12-06 07:28:51,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:51,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:51,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:51,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:51,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:51,781 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:51,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:51,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:51,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:51,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:51,824 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:51,824 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:51,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:51,825 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:51,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:51,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:51,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:51,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:51,825 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:51,825 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:51,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:51,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:51,826 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:51,826 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:51,826 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:51,826 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:51,826 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:51,826 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:51,826 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:51,826 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:51,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:51,829 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:51,829 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:51,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:51,829 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:51,829 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:51,903 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:51,904 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:51,904 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:51,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:51,904 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:51,904 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:51,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1073 [2022-12-06 07:28:51,904 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-06 07:28:51,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:51,905 INFO L85 PathProgramCache]: Analyzing trace with hash 2061393009, now seen corresponding path program 1 times [2022-12-06 07:28:51,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:51,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728342480] [2022-12-06 07:28:51,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:51,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:51,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:51,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-06 07:28:51,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:51,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728342480] [2022-12-06 07:28:51,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728342480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:51,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:51,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:51,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044228310] [2022-12-06 07:28:51,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:51,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:51,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:51,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:51,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:51,966 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:51,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:51,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:51,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:51,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:52,005 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:52,005 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:52,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:52,006 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:52,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:52,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:52,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:52,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:52,006 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:52,006 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:52,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:52,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:52,007 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:52,007 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:52,007 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:52,007 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:52,007 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:52,008 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:52,008 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:52,008 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:52,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:52,010 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:52,010 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:52,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:52,010 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:52,010 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:52,084 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:52,085 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:52,085 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:52,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:52,085 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:52,085 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:52,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1074 [2022-12-06 07:28:52,085 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-06 07:28:52,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:52,085 INFO L85 PathProgramCache]: Analyzing trace with hash 2091869202, now seen corresponding path program 1 times [2022-12-06 07:28:52,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:52,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031633417] [2022-12-06 07:28:52,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:52,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28: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-06 07:28:52,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:52,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031633417] [2022-12-06 07:28:52,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031633417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:52,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:52,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:52,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310257147] [2022-12-06 07:28:52,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:52,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:52,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:52,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:52,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:52,155 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:52,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:52,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:52,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:52,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:52,198 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:52,198 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:52,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:52,198 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:52,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:52,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:52,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:52,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:52,199 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:52,199 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:52,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:52,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:52,200 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:52,200 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:52,200 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:52,200 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:52,200 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:52,200 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:52,200 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:52,200 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:52,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:52,202 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:52,202 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:52,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:52,203 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:52,203 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:52,276 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:52,276 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:52,276 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:52,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:52,276 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:52,276 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:52,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1075 [2022-12-06 07:28:52,277 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-06 07:28:52,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:52,277 INFO L85 PathProgramCache]: Analyzing trace with hash 2118651311, now seen corresponding path program 1 times [2022-12-06 07:28:52,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:52,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239886770] [2022-12-06 07:28:52,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:52,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28: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-06 07:28:52,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:52,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239886770] [2022-12-06 07:28:52,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239886770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:52,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:52,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:52,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738837059] [2022-12-06 07:28:52,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:52,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:52,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:52,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:52,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:52,338 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:52,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:52,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:52,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:52,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:52,376 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:52,377 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:52,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 371 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:52,377 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:52,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:52,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:52,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:52,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:52,378 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:52,378 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:52,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:52,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:52,378 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:52,379 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:52,379 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:52,379 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:52,379 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:52,379 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:52,379 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:52,379 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:52,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:52,381 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:52,381 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:52,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:52,381 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:52,382 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:52,454 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:52,455 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:52,455 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:52,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:52,455 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:52,455 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:52,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1076 [2022-12-06 07:28:52,455 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-06 07:28:52,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:52,456 INFO L85 PathProgramCache]: Analyzing trace with hash -2145839792, now seen corresponding path program 1 times [2022-12-06 07:28:52,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:52,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178832606] [2022-12-06 07:28:52,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:52,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:52,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-06 07:28:52,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:52,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178832606] [2022-12-06 07:28:52,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178832606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:52,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:52,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:52,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578367763] [2022-12-06 07:28:52,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:52,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:52,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:52,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:52,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:52,514 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:52,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:52,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:52,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:52,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:52,555 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:52,555 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:52,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:52,556 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:52,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:52,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:52,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:52,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:52,556 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:52,556 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:52,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:52,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:52,557 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:52,557 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:52,557 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:52,557 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:52,557 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:52,557 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:52,557 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:52,558 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:52,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:52,560 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:52,560 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:52,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:52,560 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:52,560 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:52,633 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:52,634 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:52,634 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:52,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:52,634 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:52,634 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:52,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1077 [2022-12-06 07:28:52,634 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-06 07:28:52,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:52,634 INFO L85 PathProgramCache]: Analyzing trace with hash -2119057683, now seen corresponding path program 1 times [2022-12-06 07:28:52,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:52,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251723639] [2022-12-06 07:28:52,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:52,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:52,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-06 07:28:52,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:52,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251723639] [2022-12-06 07:28:52,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251723639] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:52,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:52,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:52,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263659669] [2022-12-06 07:28:52,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:52,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:52,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:52,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:52,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:52,696 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:52,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:52,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:52,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:52,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:52,732 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:52,732 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:52,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 371 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:52,733 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:52,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:52,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:52,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:52,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:52,733 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:52,733 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:52,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:52,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:52,734 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:52,734 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:52,734 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:52,734 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:52,734 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:52,734 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:52,734 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:52,734 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:52,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:52,737 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:52,737 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:52,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:52,737 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:52,737 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:52,809 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:52,809 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:52,809 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:52,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:52,809 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:52,809 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:52,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1078 [2022-12-06 07:28:52,810 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-06 07:28:52,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:52,810 INFO L85 PathProgramCache]: Analyzing trace with hash -2088581490, now seen corresponding path program 1 times [2022-12-06 07:28:52,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:52,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090509366] [2022-12-06 07:28:52,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:52,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:52,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-06 07:28:52,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:52,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090509366] [2022-12-06 07:28:52,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090509366] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:52,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:52,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:52,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046168933] [2022-12-06 07:28:52,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:52,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:52,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:52,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:52,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:52,869 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:52,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:52,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:52,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:52,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:52,910 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:52,911 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:52,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:52,911 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:52,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:52,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:52,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:52,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:52,912 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:52,912 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:52,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:52,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:52,912 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:52,912 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:52,912 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:52,913 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:52,913 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:52,913 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:52,913 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:52,913 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:52,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:52,915 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:52,915 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:52,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:52,915 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:52,915 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:52,989 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:52,990 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:52,990 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:52,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:52,990 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:52,990 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:52,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1079 [2022-12-06 07:28:52,990 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-06 07:28:52,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:52,990 INFO L85 PathProgramCache]: Analyzing trace with hash -2061799381, now seen corresponding path program 1 times [2022-12-06 07:28:52,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:52,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369072428] [2022-12-06 07:28:52,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:52,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:53,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-06 07:28:53,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:53,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369072428] [2022-12-06 07:28:53,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369072428] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:53,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:53,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:53,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180717779] [2022-12-06 07:28:53,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:53,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:53,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:53,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:53,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:53,052 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:53,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:53,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:53,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:53,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:53,088 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:53,088 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:53,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:53,089 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:53,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:53,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:53,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:53,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:53,089 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:53,090 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:53,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:53,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:53,090 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:53,090 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:53,090 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:53,090 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:53,091 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:53,091 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:53,091 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:53,091 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:53,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:53,093 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:53,093 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:53,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:53,093 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:53,093 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:53,175 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:53,176 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-06 07:28:53,176 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:53,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:53,176 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:53,176 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:53,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1080 [2022-12-06 07:28:53,176 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-06 07:28:53,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:53,176 INFO L85 PathProgramCache]: Analyzing trace with hash -2031323188, now seen corresponding path program 1 times [2022-12-06 07:28:53,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:53,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639122380] [2022-12-06 07:28:53,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:53,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:53,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:53,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-06 07:28:53,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:53,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639122380] [2022-12-06 07:28:53,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639122380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:53,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:53,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:53,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264991] [2022-12-06 07:28:53,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:53,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:53,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:53,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:53,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:53,237 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:53,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:53,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:53,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:53,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:53,280 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:53,280 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:53,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:53,281 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:53,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:53,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:53,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:53,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:53,281 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:53,281 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:53,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:53,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:53,282 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:53,282 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:53,282 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:53,282 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:53,282 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:53,282 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:53,283 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:53,283 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:53,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:53,285 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:53,285 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:53,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:53,285 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:53,285 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:53,359 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:53,359 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:53,359 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:53,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:53,360 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:53,360 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:53,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1081 [2022-12-06 07:28:53,360 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-06 07:28:53,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:53,360 INFO L85 PathProgramCache]: Analyzing trace with hash -2004541079, now seen corresponding path program 1 times [2022-12-06 07:28:53,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:53,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491724366] [2022-12-06 07:28:53,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:53,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:53,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-06 07:28:53,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:53,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491724366] [2022-12-06 07:28:53,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491724366] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:53,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:53,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:53,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193074911] [2022-12-06 07:28:53,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:53,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:53,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:53,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:53,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:53,422 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:53,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:53,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:53,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:53,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:53,461 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:53,461 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:53,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:53,461 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:53,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:53,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:53,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:53,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:53,462 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:53,462 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:53,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:53,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:53,462 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:53,462 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:53,463 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:53,463 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:53,463 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:53,463 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:53,463 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:53,463 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:53,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:53,465 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:53,465 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:53,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:53,465 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:53,465 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:53,540 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:53,541 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:53,541 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:53,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:53,541 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:53,541 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:53,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1082 [2022-12-06 07:28:53,541 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-06 07:28:53,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:53,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1974064886, now seen corresponding path program 1 times [2022-12-06 07:28:53,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:53,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520891645] [2022-12-06 07:28:53,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:53,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:53,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-06 07:28:53,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:53,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520891645] [2022-12-06 07:28:53,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520891645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:53,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:53,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:53,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804628431] [2022-12-06 07:28:53,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:53,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:53,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:53,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:53,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:53,601 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:53,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:53,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:53,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:53,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:53,642 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:53,642 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:53,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:53,643 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:53,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:53,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:53,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:53,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:53,643 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:53,643 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:53,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:53,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:53,644 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:53,644 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:53,644 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:53,644 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:53,644 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:53,645 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:53,645 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:53,645 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:53,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:53,647 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:53,647 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:53,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:53,647 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:53,647 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:53,721 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:53,722 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:53,722 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:53,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:53,722 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:53,722 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:53,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1083 [2022-12-06 07:28:53,722 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-06 07:28:53,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:53,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1947282777, now seen corresponding path program 1 times [2022-12-06 07:28:53,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:53,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916949932] [2022-12-06 07:28:53,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:53,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:53,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:53,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-06 07:28:53,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:53,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916949932] [2022-12-06 07:28:53,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916949932] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:53,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:53,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:53,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257459578] [2022-12-06 07:28:53,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:53,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:53,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:53,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:53,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:53,785 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:53,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:53,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:53,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:53,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:53,826 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:53,826 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:53,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 356 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:53,827 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:53,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:53,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:53,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:53,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:53,827 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:53,827 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:53,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:53,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:53,828 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:53,828 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:53,828 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:53,828 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:53,828 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:53,828 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:53,829 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:53,829 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:53,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:53,831 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:53,831 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:53,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:53,831 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:53,831 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:53,907 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:53,907 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:28:53,907 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:53,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:53,907 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:53,907 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:53,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1084 [2022-12-06 07:28:53,908 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-06 07:28:53,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:53,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1916806584, now seen corresponding path program 1 times [2022-12-06 07:28:53,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:53,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522847325] [2022-12-06 07:28:53,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:53,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:53,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-06 07:28:53,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:53,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522847325] [2022-12-06 07:28:53,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522847325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:53,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:53,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:53,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450932192] [2022-12-06 07:28:53,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:53,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:53,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:53,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:53,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:53,968 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:53,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:53,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:53,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:53,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:54,009 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:54,009 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:54,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:54,010 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:54,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:54,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:54,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:54,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:54,010 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:54,010 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:54,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:54,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:54,011 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:54,011 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:54,011 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:54,011 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:54,011 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:54,011 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:54,012 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:54,012 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:54,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:54,014 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:54,014 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:54,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:54,014 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:54,014 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:54,087 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:54,088 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:54,088 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:54,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:54,088 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:54,088 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:54,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1085 [2022-12-06 07:28:54,088 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-06 07:28:54,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:54,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1890024475, now seen corresponding path program 1 times [2022-12-06 07:28:54,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:54,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455443911] [2022-12-06 07:28:54,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:54,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:54,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-06 07:28:54,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:54,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455443911] [2022-12-06 07:28:54,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455443911] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:54,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:54,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:54,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364112271] [2022-12-06 07:28:54,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:54,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:54,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:54,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:54,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:54,162 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:54,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:54,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:54,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:54,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:54,202 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:54,202 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:54,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:54,203 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:54,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:54,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:54,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:54,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:54,203 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:54,203 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:54,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:54,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:54,204 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:54,204 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:54,204 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:54,204 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:54,204 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:54,204 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:54,205 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:54,205 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:54,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:54,207 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:54,207 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:54,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:54,207 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:54,207 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:54,279 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:54,280 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:54,280 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:54,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:54,280 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:54,280 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:54,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1086 [2022-12-06 07:28:54,280 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-06 07:28:54,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:54,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1859548282, now seen corresponding path program 1 times [2022-12-06 07:28:54,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:54,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566875667] [2022-12-06 07:28:54,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:54,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:54,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-06 07:28:54,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:54,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566875667] [2022-12-06 07:28:54,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566875667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:54,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:54,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:54,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146516975] [2022-12-06 07:28:54,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:54,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:54,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:54,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:54,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:54,338 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:54,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:54,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:54,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:54,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:54,380 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:54,380 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:54,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:54,381 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:54,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:54,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:54,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:54,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:54,381 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:54,381 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:54,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:54,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:54,382 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:54,382 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:54,382 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:54,382 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:54,382 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:54,382 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:54,382 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:54,382 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:54,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:54,384 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:54,385 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:54,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:54,385 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:54,385 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:54,457 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:54,458 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:54,458 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:54,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:54,458 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:54,458 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:54,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1087 [2022-12-06 07:28:54,458 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-06 07:28:54,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:54,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1832766173, now seen corresponding path program 1 times [2022-12-06 07:28:54,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:54,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453631607] [2022-12-06 07:28:54,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:54,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:54,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:54,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:54,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453631607] [2022-12-06 07:28:54,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453631607] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:54,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:54,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:54,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104767229] [2022-12-06 07:28:54,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:54,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:54,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:54,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:54,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:54,520 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:54,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:54,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:54,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:54,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:54,555 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:54,555 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:54,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:54,555 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:54,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:54,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:54,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:54,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:54,556 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:54,556 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:54,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:54,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:54,557 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:54,557 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:54,557 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:54,557 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:54,557 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:54,557 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:54,557 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:54,557 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:54,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:54,559 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:54,559 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:54,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:54,560 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:54,560 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:54,631 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:54,632 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:54,632 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:54,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:54,632 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:54,632 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:54,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1088 [2022-12-06 07:28:54,632 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-06 07:28:54,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:54,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1802289980, now seen corresponding path program 1 times [2022-12-06 07:28:54,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:54,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539308293] [2022-12-06 07:28:54,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:54,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:54,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-06 07:28:54,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:54,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539308293] [2022-12-06 07:28:54,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539308293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:54,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:54,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:54,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238807880] [2022-12-06 07:28:54,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:54,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:54,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:54,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:54,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:54,692 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:54,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:54,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:54,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:54,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:54,728 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:54,728 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:54,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:54,729 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:54,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:54,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:54,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:54,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:54,729 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:54,729 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:54,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:54,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:54,730 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:54,730 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:54,730 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:54,730 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:54,730 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:54,730 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:54,730 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:54,730 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:54,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:54,733 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:54,733 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:54,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:54,733 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:54,733 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:54,806 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:54,806 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:54,806 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:54,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:54,806 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:54,806 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:54,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1089 [2022-12-06 07:28:54,806 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-06 07:28:54,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:54,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1775507871, now seen corresponding path program 1 times [2022-12-06 07:28:54,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:54,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129324230] [2022-12-06 07:28:54,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:54,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:54,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-06 07:28:54,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:54,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129324230] [2022-12-06 07:28:54,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129324230] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:54,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:54,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:54,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434762089] [2022-12-06 07:28:54,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:54,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:54,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:54,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:54,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:54,867 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:54,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:54,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:54,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:54,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:54,905 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:54,905 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:54,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:54,906 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:54,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:54,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:54,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:54,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:54,906 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:54,906 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:54,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:54,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:54,907 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:54,907 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:54,907 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:54,907 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:54,907 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:54,907 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:54,907 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:54,907 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:54,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:54,909 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:54,910 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:54,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:54,910 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:54,910 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:54,979 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:54,980 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 73 [2022-12-06 07:28:54,980 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:54,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:54,980 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:54,980 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:54,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1090 [2022-12-06 07:28:54,980 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-06 07:28:54,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:54,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1745031678, now seen corresponding path program 1 times [2022-12-06 07:28:54,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:54,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006674879] [2022-12-06 07:28:54,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:54,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:55,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-06 07:28:55,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:55,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006674879] [2022-12-06 07:28:55,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006674879] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:55,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:55,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:55,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842134827] [2022-12-06 07:28:55,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:55,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:55,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:55,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:55,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:55,041 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:55,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:55,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:55,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:55,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:55,090 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:55,090 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:55,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:55,090 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:55,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:55,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:55,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:55,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:55,091 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:55,091 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:55,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:55,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:55,091 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:55,092 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:55,092 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:55,092 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:55,092 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:55,092 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:55,092 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:55,092 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:55,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:55,094 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:55,094 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:55,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:55,094 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:55,095 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:55,166 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:55,167 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:55,167 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:55,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:55,167 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:55,167 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:55,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1091 [2022-12-06 07:28:55,167 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-06 07:28:55,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:55,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1718249569, now seen corresponding path program 1 times [2022-12-06 07:28:55,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:55,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791362811] [2022-12-06 07:28:55,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:55,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:55,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-06 07:28:55,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:55,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791362811] [2022-12-06 07:28:55,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791362811] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:55,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:55,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:55,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308681458] [2022-12-06 07:28:55,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:55,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:55,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:55,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:55,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:55,229 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:55,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:55,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:55,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:55,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:55,269 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:55,270 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:55,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:55,270 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:55,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:55,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:55,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:55,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:55,271 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:55,271 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:55,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:55,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:55,271 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:55,271 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:55,271 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:55,272 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:55,272 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:55,272 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:55,272 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:55,272 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:55,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:55,274 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:55,274 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:55,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:55,274 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:55,274 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:55,345 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:55,345 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 73 [2022-12-06 07:28:55,345 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:55,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:55,345 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:55,345 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:55,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1092 [2022-12-06 07:28:55,345 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-06 07:28:55,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:55,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1687773376, now seen corresponding path program 1 times [2022-12-06 07:28:55,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:55,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157761887] [2022-12-06 07:28:55,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:55,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:55,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-06 07:28:55,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:55,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157761887] [2022-12-06 07:28:55,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157761887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:55,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:55,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:55,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482537278] [2022-12-06 07:28:55,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:55,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:55,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:55,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:55,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:55,404 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:55,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:55,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:55,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:55,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:55,446 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:55,446 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:55,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:55,446 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:55,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:55,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:55,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:55,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:55,447 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:55,447 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:55,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:55,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:55,447 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:55,448 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:55,448 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:55,448 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:55,448 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:55,448 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:55,448 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:55,448 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:55,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:55,450 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:55,450 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:55,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 122 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:55,450 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:55,451 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:55,525 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:55,526 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:55,526 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:55,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:55,526 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:55,526 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:55,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1093 [2022-12-06 07:28:55,526 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-06 07:28:55,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:55,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1660991267, now seen corresponding path program 1 times [2022-12-06 07:28:55,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:55,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849559744] [2022-12-06 07:28:55,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:55,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:55,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-06 07:28:55,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:55,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849559744] [2022-12-06 07:28:55,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849559744] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:55,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:55,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:55,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021132884] [2022-12-06 07:28:55,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:55,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:55,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:55,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:55,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:55,588 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:55,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:55,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:55,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:55,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:55,628 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:55,628 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:55,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:55,629 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:55,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:55,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:55,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:55,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:55,629 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:55,629 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:55,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:55,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:55,630 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:55,630 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:55,630 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:55,630 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:55,630 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:55,631 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:55,631 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:55,631 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:55,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:55,633 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:55,633 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:55,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:55,633 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:55,633 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:55,709 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:55,709 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:28:55,709 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:55,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:55,710 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:55,710 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:55,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1094 [2022-12-06 07:28:55,710 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-06 07:28:55,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:55,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1630515074, now seen corresponding path program 1 times [2022-12-06 07:28:55,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:55,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672142973] [2022-12-06 07:28:55,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:55,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:55,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-06 07:28:55,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:55,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672142973] [2022-12-06 07:28:55,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672142973] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:55,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:55,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:55,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551509112] [2022-12-06 07:28:55,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:55,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:55,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:55,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:55,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:55,769 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:55,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:55,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:55,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:55,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:55,811 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:55,811 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:55,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:55,811 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:55,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:55,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:55,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:55,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:55,812 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:55,812 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:55,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:55,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:55,813 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:55,813 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:55,813 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:55,813 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:55,813 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:55,813 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:55,813 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:55,813 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:55,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:55,815 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:55,815 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:55,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:55,816 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:55,816 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:55,889 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:55,889 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:55,889 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:55,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:55,889 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:55,890 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:55,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1095 [2022-12-06 07:28:55,890 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-06 07:28:55,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:55,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1603732965, now seen corresponding path program 1 times [2022-12-06 07:28:55,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:55,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511809148] [2022-12-06 07:28:55,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:55,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:55,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-06 07:28:55,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:55,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511809148] [2022-12-06 07:28:55,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511809148] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:55,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:55,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:55,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305936205] [2022-12-06 07:28:55,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:55,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:55,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:55,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:55,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:55,953 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:55,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:55,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:55,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:55,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:55,989 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:55,989 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:55,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:55,990 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:55,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:55,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:55,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:55,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:55,990 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:55,990 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:55,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:55,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:55,991 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:55,991 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:55,991 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:55,991 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:55,991 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:55,991 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:55,991 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:55,992 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:55,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:55,994 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:55,994 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:55,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:55,994 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:55,994 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:56,066 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:56,067 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:56,067 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:56,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:56,067 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:56,067 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:56,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1096 [2022-12-06 07:28:56,067 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-06 07:28:56,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:56,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1573256772, now seen corresponding path program 1 times [2022-12-06 07:28:56,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:56,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477037599] [2022-12-06 07:28:56,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:56,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:56,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-06 07:28:56,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:56,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477037599] [2022-12-06 07:28:56,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477037599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:56,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:56,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:56,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745526403] [2022-12-06 07:28:56,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:56,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:56,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:56,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:56,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:56,134 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:56,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:56,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:56,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:56,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:56,170 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:56,170 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:56,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:56,170 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:56,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:56,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:56,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:56,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:56,171 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:56,171 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:56,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:56,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:56,172 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:56,172 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:56,172 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:56,172 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:56,172 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:56,172 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:56,172 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:56,172 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:56,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:56,174 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:56,174 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:56,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:56,175 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:56,175 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:56,246 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:56,247 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:56,247 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:56,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:56,247 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:56,247 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:56,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1097 [2022-12-06 07:28:56,247 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-06 07:28:56,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:56,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1546474663, now seen corresponding path program 1 times [2022-12-06 07:28:56,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:56,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241687716] [2022-12-06 07:28:56,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:56,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:56,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-06 07:28:56,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:56,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241687716] [2022-12-06 07:28:56,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241687716] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:56,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:56,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:56,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830215733] [2022-12-06 07:28:56,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:56,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:56,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:56,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:56,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:56,308 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:56,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:56,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:56,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:56,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:56,348 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:56,348 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:56,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:56,349 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:56,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:56,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:56,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:56,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:56,349 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:56,349 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:56,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:56,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:56,350 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:56,350 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:56,350 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:56,350 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:56,350 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:56,351 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:56,351 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:56,351 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:56,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:56,353 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:56,353 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:56,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:56,353 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:56,353 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:56,425 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:56,426 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:56,426 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:56,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:56,426 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:56,426 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:56,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1098 [2022-12-06 07:28:56,426 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-06 07:28:56,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:56,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1515998470, now seen corresponding path program 1 times [2022-12-06 07:28:56,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:56,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429086511] [2022-12-06 07:28:56,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:56,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:56,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:56,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-06 07:28:56,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:56,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429086511] [2022-12-06 07:28:56,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429086511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:56,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:56,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:56,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659227126] [2022-12-06 07:28:56,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:56,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:56,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:56,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:56,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:56,485 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:56,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:56,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:56,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:56,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:56,521 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:56,521 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:56,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:56,522 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:56,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:56,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:56,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:56,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:56,522 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:56,522 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:56,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:56,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:56,523 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:56,523 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:56,523 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:56,523 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:56,523 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:56,523 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:56,523 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:56,523 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:56,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:56,526 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:56,526 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:56,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:56,526 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:56,526 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:56,599 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:56,599 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:56,599 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:56,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:56,599 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:56,599 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:56,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1099 [2022-12-06 07:28:56,600 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-06 07:28:56,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:56,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1489216361, now seen corresponding path program 1 times [2022-12-06 07:28:56,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:56,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921092803] [2022-12-06 07:28:56,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:56,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:56,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-06 07:28:56,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:56,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921092803] [2022-12-06 07:28:56,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921092803] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:56,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:56,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:56,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634058400] [2022-12-06 07:28:56,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:56,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:56,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:56,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:56,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:56,661 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:56,661 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:56,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:56,661 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:56,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:56,701 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:56,701 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:56,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:56,701 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:56,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:56,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:56,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:56,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:56,702 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:56,702 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:56,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:56,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:56,703 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:56,703 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:56,703 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:56,703 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:56,703 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:56,703 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:56,703 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:56,703 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:56,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:56,705 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:56,705 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:56,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:56,706 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:56,706 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:56,781 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:56,781 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:56,781 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:56,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:56,782 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:56,782 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:56,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1100 [2022-12-06 07:28:56,782 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-06 07:28:56,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:56,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1458740168, now seen corresponding path program 1 times [2022-12-06 07:28:56,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:56,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596892217] [2022-12-06 07:28:56,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:56,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:56,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-06 07:28:56,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:56,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596892217] [2022-12-06 07:28:56,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596892217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:56,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:56,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:56,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525881031] [2022-12-06 07:28:56,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:56,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:56,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:56,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:56,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:56,839 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:56,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:56,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:56,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:56,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:56,880 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:56,880 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:56,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:56,881 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:56,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:56,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:56,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:56,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:56,881 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:56,881 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:56,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:56,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:56,882 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:56,882 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:56,882 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:56,882 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:56,882 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:56,882 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:56,882 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:56,883 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:56,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:56,885 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:56,885 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:56,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:56,885 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:56,885 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:56,957 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:56,957 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:56,957 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:56,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:56,958 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:56,958 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:56,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1101 [2022-12-06 07:28:56,958 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-06 07:28:56,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:56,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1431958059, now seen corresponding path program 1 times [2022-12-06 07:28:56,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:56,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499807187] [2022-12-06 07:28:56,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:56,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:57,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:57,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:57,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499807187] [2022-12-06 07:28:57,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499807187] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:57,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:57,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:57,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311248045] [2022-12-06 07:28:57,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:57,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:57,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:57,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:57,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:57,029 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:57,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:57,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:57,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:57,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:57,066 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:57,066 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:57,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:57,067 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:57,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:57,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:57,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:57,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:57,067 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:57,067 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:57,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:57,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:57,068 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:57,068 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:57,068 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:57,068 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:57,068 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:57,069 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:57,069 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:57,069 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:57,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:57,071 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:57,071 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:57,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:57,071 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:57,071 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:57,144 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:57,145 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:57,145 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:57,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:57,145 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:57,145 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:57,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1102 [2022-12-06 07:28:57,145 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-06 07:28:57,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:57,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1401481866, now seen corresponding path program 1 times [2022-12-06 07:28:57,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:57,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56720017] [2022-12-06 07:28:57,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:57,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:57,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-06 07:28:57,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:57,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56720017] [2022-12-06 07:28:57,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56720017] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:57,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:57,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:57,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789328916] [2022-12-06 07:28:57,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:57,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:57,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:57,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:57,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:57,203 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:57,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:57,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:57,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:57,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:57,239 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:57,239 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:57,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:57,240 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:57,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:57,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:57,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:57,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:57,240 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:57,240 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:57,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:57,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:57,241 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:57,241 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:57,241 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:57,241 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:57,241 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:57,241 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:57,241 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:57,241 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:57,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:57,244 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:57,244 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:57,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:57,244 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:57,244 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:57,317 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:57,318 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:57,318 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:57,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:57,318 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:57,318 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:57,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1103 [2022-12-06 07:28:57,318 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-06 07:28:57,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:57,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1374699757, now seen corresponding path program 1 times [2022-12-06 07:28:57,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:57,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403111756] [2022-12-06 07:28:57,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:57,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:57,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-06 07:28:57,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:57,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403111756] [2022-12-06 07:28:57,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403111756] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:57,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:57,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:57,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993496138] [2022-12-06 07:28:57,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:57,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:57,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:57,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:57,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:57,379 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:57,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:57,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:57,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:57,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:57,420 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:57,420 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:57,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:57,421 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:57,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:57,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:57,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:57,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:57,421 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:57,421 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:57,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:57,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:57,422 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:57,422 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:57,422 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:57,422 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:57,422 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:57,422 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:57,422 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:57,422 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:57,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:57,425 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:57,425 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:57,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:57,425 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:57,425 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:57,499 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:57,499 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:57,499 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:57,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:57,499 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:57,499 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:57,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1104 [2022-12-06 07:28:57,500 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-06 07:28:57,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:57,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1344223564, now seen corresponding path program 1 times [2022-12-06 07:28:57,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:57,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870930294] [2022-12-06 07:28:57,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:57,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:57,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-06 07:28:57,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:57,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870930294] [2022-12-06 07:28:57,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870930294] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:57,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:57,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:57,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214029698] [2022-12-06 07:28:57,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:57,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:57,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:57,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:57,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:57,561 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:57,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:57,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:57,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:57,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:57,598 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:57,598 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:57,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:57,598 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:57,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:57,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:57,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:57,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:57,599 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:57,599 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:57,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:57,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:57,599 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:57,599 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:57,600 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:57,600 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:57,600 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:57,600 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:57,600 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:57,600 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:57,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:57,602 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:57,602 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:57,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 118 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:57,602 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:57,602 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:57,681 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:57,681 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:28:57,681 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:57,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:57,681 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:57,681 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:57,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1105 [2022-12-06 07:28:57,682 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-06 07:28:57,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:57,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1317441455, now seen corresponding path program 1 times [2022-12-06 07:28:57,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:57,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979421993] [2022-12-06 07:28:57,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:57,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:57,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-06 07:28:57,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:57,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979421993] [2022-12-06 07:28:57,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979421993] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:57,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:57,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:57,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599143594] [2022-12-06 07:28:57,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:57,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:57,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:57,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:57,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:57,744 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:57,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:57,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:57,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:57,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:57,779 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:57,779 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:57,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:57,780 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:57,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:57,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:57,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:57,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:57,780 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:57,781 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:57,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:57,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:57,781 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:57,781 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:57,781 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:57,782 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:57,782 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:57,782 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:57,782 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:57,782 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:57,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:57,784 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:57,784 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:57,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:57,784 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:57,784 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:57,857 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:57,858 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:57,858 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:57,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:57,858 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:57,858 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:57,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1106 [2022-12-06 07:28:57,858 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-06 07:28:57,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:57,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1286965262, now seen corresponding path program 1 times [2022-12-06 07:28:57,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:57,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267115576] [2022-12-06 07:28:57,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:57,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:57,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-06 07:28:57,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:57,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267115576] [2022-12-06 07:28:57,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267115576] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:57,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:57,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:57,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76813941] [2022-12-06 07:28:57,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:57,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:57,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:57,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:57,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:57,920 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:57,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:57,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:57,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:57,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:57,962 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:57,962 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:57,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:57,962 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:57,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:57,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:57,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:57,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:57,963 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:57,963 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:57,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:57,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:57,964 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:57,964 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:57,964 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:57,964 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:57,964 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:57,964 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:57,964 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:57,964 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:57,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:57,966 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:57,966 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:57,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:57,967 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:57,967 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:58,041 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:58,042 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:58,042 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:58,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:58,042 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:58,042 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:58,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1107 [2022-12-06 07:28:58,042 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-06 07:28:58,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:58,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1260183153, now seen corresponding path program 1 times [2022-12-06 07:28:58,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:58,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174592435] [2022-12-06 07:28:58,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:58,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:58,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-06 07:28:58,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:58,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174592435] [2022-12-06 07:28:58,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174592435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:58,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:58,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:58,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758952530] [2022-12-06 07:28:58,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:58,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:58,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:58,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:58,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:58,111 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:58,111 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:58,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:58,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:58,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:58,151 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:58,151 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:58,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:58,152 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:58,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:58,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:58,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:58,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:58,152 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:58,152 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:58,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:58,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:58,153 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:58,153 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:58,153 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:58,153 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:58,153 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:58,153 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:58,153 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:58,154 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:58,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:58,156 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:58,156 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:58,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:58,156 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:58,156 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:58,228 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:58,229 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:58,229 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:58,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:58,229 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:58,229 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:58,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1108 [2022-12-06 07:28:58,229 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-06 07:28:58,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:58,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1229706960, now seen corresponding path program 1 times [2022-12-06 07:28:58,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:58,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317937106] [2022-12-06 07:28:58,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:58,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:58,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-06 07:28:58,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:58,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317937106] [2022-12-06 07:28:58,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317937106] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:58,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:58,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:58,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673421672] [2022-12-06 07:28:58,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:58,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:58,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:58,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:58,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:58,288 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:58,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:58,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:58,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:58,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:58,329 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:58,329 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:58,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 349 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:58,330 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:58,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:58,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:58,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:58,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:58,330 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:58,330 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:58,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:58,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:58,331 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:58,331 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:58,331 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:58,331 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:58,331 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:58,332 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:58,332 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:58,332 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:58,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:58,334 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:58,334 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:58,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:58,334 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:58,334 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:58,406 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:58,406 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:58,407 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:58,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:58,407 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:58,407 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:58,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1109 [2022-12-06 07:28:58,407 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-06 07:28:58,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:58,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1202924851, now seen corresponding path program 1 times [2022-12-06 07:28:58,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:58,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575379604] [2022-12-06 07:28:58,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:58,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:58,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:58,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-06 07:28:58,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:58,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575379604] [2022-12-06 07:28:58,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575379604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:58,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:58,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:58,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75631200] [2022-12-06 07:28:58,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:58,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:58,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:58,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:58,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:58,469 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:58,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:58,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:58,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:58,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:58,504 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:58,504 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:58,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:58,505 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:58,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:58,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:58,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:58,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:58,505 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:58,505 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:58,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:58,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:58,506 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:58,506 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:58,506 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:58,506 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:58,506 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:58,507 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:58,507 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:58,507 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:58,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:58,509 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:58,509 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:58,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:58,509 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:58,509 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:58,582 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:58,583 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:58,583 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:58,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:58,583 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:58,583 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:58,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1110 [2022-12-06 07:28:58,583 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-06 07:28:58,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:58,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1172448658, now seen corresponding path program 1 times [2022-12-06 07:28:58,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:58,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035223215] [2022-12-06 07:28:58,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:58,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:58,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-06 07:28:58,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:58,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035223215] [2022-12-06 07:28:58,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035223215] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:58,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:58,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:58,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72256184] [2022-12-06 07:28:58,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:58,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:58,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:58,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:58,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:58,641 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:58,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:58,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:58,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:58,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:58,683 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:58,683 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:58,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:58,684 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:58,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:58,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:58,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:58,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:58,684 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:58,684 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:58,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:58,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:58,685 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:58,685 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:58,685 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:58,685 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:58,685 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:58,685 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:58,686 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:58,686 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:58,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:58,688 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:58,688 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:58,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:58,688 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:58,688 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:58,760 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:58,761 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:58,761 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:58,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:58,761 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:58,761 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:58,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1111 [2022-12-06 07:28:58,761 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-06 07:28:58,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:58,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1145666549, now seen corresponding path program 1 times [2022-12-06 07:28:58,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:58,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660868033] [2022-12-06 07:28:58,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:58,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:58,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-06 07:28:58,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:58,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660868033] [2022-12-06 07:28:58,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660868033] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:58,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:58,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:58,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896050847] [2022-12-06 07:28:58,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:58,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:58,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:58,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:58,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:58,823 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:58,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:58,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:58,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:58,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:58,862 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:58,862 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:58,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 372 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:58,863 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:58,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:58,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:58,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:58,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:58,863 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:58,863 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:58,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:58,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:58,864 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:58,864 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:58,864 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:58,864 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:58,864 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:58,864 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:58,864 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:58,864 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:58,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:58,866 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:58,867 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:58,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:58,867 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:58,867 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:58,940 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:58,941 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:58,941 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:58,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:58,941 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:58,941 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:58,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1112 [2022-12-06 07:28:58,941 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-06 07:28:58,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:58,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1115190356, now seen corresponding path program 1 times [2022-12-06 07:28:58,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:58,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055210432] [2022-12-06 07:28:58,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:58,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:59,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-06 07:28:59,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:59,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055210432] [2022-12-06 07:28:59,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055210432] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:59,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:59,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:59,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636635882] [2022-12-06 07:28:59,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:59,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:59,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:59,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:59,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:59,009 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:59,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:59,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:59,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:59,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:59,046 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:59,046 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:28:59,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:59,046 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:59,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:59,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:59,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:59,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:59,047 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:59,047 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:59,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:59,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:59,047 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:59,047 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:59,048 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:59,048 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:59,048 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:59,048 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:59,048 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:59,048 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:59,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:59,050 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:59,050 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:59,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:59,050 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:59,050 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:59,123 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:59,123 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:28:59,123 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:59,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:59,124 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:59,124 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:59,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1113 [2022-12-06 07:28:59,124 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-06 07:28:59,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:59,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1088408247, now seen corresponding path program 1 times [2022-12-06 07:28:59,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:59,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508154073] [2022-12-06 07:28:59,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:59,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:59,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:59,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-06 07:28:59,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:59,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508154073] [2022-12-06 07:28:59,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508154073] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:59,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:59,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:59,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109635046] [2022-12-06 07:28:59,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:59,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:59,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:59,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:59,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:59,185 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:59,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:59,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:59,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:59,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:59,224 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:59,224 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:59,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:59,225 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:59,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:59,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:59,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:59,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:59,225 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:59,225 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:59,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:59,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:59,226 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:59,226 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:59,226 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:59,226 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:59,226 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:59,226 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:59,226 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:59,226 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:59,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:59,229 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:59,229 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:59,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:59,229 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:59,229 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:59,302 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:59,303 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:59,303 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:59,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:59,303 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:59,303 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:59,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1114 [2022-12-06 07:28:59,303 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-06 07:28:59,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:59,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1057932054, now seen corresponding path program 1 times [2022-12-06 07:28:59,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:59,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515049568] [2022-12-06 07:28:59,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:59,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:59,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-06 07:28:59,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:59,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515049568] [2022-12-06 07:28:59,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515049568] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:59,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:59,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:59,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420765514] [2022-12-06 07:28:59,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:59,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:59,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:59,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:59,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:59,362 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:59,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:59,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:59,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:59,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:59,397 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:59,398 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:59,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 349 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:59,398 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:59,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:59,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:59,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:59,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:59,399 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:59,399 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:59,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:59,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:59,399 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:59,399 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:59,399 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:59,399 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:59,400 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:59,400 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:59,400 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:59,400 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:59,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:59,402 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:59,402 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:59,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:59,402 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:59,402 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:59,475 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:59,475 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:28:59,476 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:59,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:59,476 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:59,476 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:59,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1115 [2022-12-06 07:28:59,476 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-06 07:28:59,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:59,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1031149945, now seen corresponding path program 1 times [2022-12-06 07:28:59,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:59,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780070934] [2022-12-06 07:28:59,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:59,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:59,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-06 07:28:59,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:59,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780070934] [2022-12-06 07:28:59,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780070934] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:59,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:59,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:59,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735672235] [2022-12-06 07:28:59,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:59,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:59,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:59,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:59,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:59,537 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:59,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:59,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:59,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:59,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:59,578 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:59,578 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:59,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 374 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:59,578 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:59,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:59,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:59,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:59,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:59,579 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:59,579 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:59,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:59,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:59,580 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:59,580 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:59,580 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:59,580 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:59,580 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:59,580 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:59,580 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:59,580 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:59,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:59,582 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:59,582 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:59,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:59,583 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:59,583 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:28:59,657 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:59,657 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:28:59,657 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:28:59,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:59,657 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:59,657 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:59,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1116 [2022-12-06 07:28:59,657 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-06 07:28:59,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:59,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1000673752, now seen corresponding path program 1 times [2022-12-06 07:28:59,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:59,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919162738] [2022-12-06 07:28:59,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:59,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:59,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-06 07:28:59,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:59,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919162738] [2022-12-06 07:28:59,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919162738] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:59,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:59,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:59,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750709124] [2022-12-06 07:28:59,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:59,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:59,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:59,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:59,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:59,719 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:59,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:59,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:59,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:59,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:59,760 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:28:59,760 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:28:59,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:28:59,761 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:28:59,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:59,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:59,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:59,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:59,761 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:59,761 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:59,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:59,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:59,762 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:59,762 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:59,762 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:59,762 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:59,762 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:59,762 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:59,763 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:59,763 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:59,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:59,765 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:28:59,765 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:28:59,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:28:59,765 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:59,765 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:28:59,840 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:59,840 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:28:59,840 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:28:59,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:59,841 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:59,841 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:59,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1117 [2022-12-06 07:28:59,841 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-06 07:28:59,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:59,841 INFO L85 PathProgramCache]: Analyzing trace with hash -973891643, now seen corresponding path program 1 times [2022-12-06 07:28:59,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:59,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128434885] [2022-12-06 07:28:59,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:59,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28: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-06 07:28:59,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:59,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128434885] [2022-12-06 07:28:59,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128434885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:59,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:59,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:28:59,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741725770] [2022-12-06 07:28:59,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:59,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:59,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:59,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:59,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:59,904 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:28:59,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:59,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:59,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:28:59,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:59,944 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:28:59,945 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:28:59,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:28:59,945 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:28:59,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:59,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:59,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:59,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:28:59,954 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:28:59,954 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:28:59,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:28:59,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:59,955 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:59,955 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:28:59,955 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:28:59,955 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:59,955 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:59,955 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:59,955 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:59,955 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:59,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:59,958 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:28:59,958 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:28:59,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:28:59,958 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:28:59,958 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:00,032 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:00,033 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:00,033 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:00,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:00,033 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:00,033 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:00,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1118 [2022-12-06 07:29:00,033 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-06 07:29:00,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:00,034 INFO L85 PathProgramCache]: Analyzing trace with hash -943415450, now seen corresponding path program 1 times [2022-12-06 07:29:00,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:00,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024794579] [2022-12-06 07:29:00,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:00,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:00,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-06 07:29:00,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:00,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024794579] [2022-12-06 07:29:00,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024794579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:00,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:00,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:00,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995557940] [2022-12-06 07:29:00,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:00,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:00,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:00,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:00,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:00,093 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:00,094 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:00,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:00,094 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:00,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:00,136 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:00,136 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:00,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:00,137 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:00,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:00,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:00,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:00,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:00,137 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:00,137 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:00,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:00,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:00,138 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:00,138 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:00,138 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:00,138 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:00,138 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:00,138 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:00,138 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:00,138 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:00,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:00,141 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:00,141 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:00,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:00,141 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:00,141 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:00,220 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:00,221 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 07:29:00,221 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:00,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:00,221 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:00,221 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:00,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1119 [2022-12-06 07:29:00,221 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-06 07:29:00,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:00,222 INFO L85 PathProgramCache]: Analyzing trace with hash -916633341, now seen corresponding path program 1 times [2022-12-06 07:29:00,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:00,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216472962] [2022-12-06 07:29:00,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:00,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:00,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-06 07:29:00,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:00,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216472962] [2022-12-06 07:29:00,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216472962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:00,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:00,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:00,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286308142] [2022-12-06 07:29:00,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:00,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:00,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:00,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:00,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:00,284 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:00,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:00,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:00,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:00,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:00,325 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:00,325 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:00,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:00,325 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:00,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:00,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:00,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:00,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:00,326 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:00,326 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:00,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:00,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:00,327 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:00,327 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:00,327 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:00,327 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:00,327 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:00,327 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:00,327 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:00,327 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:00,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:00,329 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:00,329 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:00,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:00,330 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:00,330 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:00,404 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:00,404 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:00,404 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:00,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:00,404 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:00,405 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:00,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1120 [2022-12-06 07:29:00,405 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-06 07:29:00,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:00,405 INFO L85 PathProgramCache]: Analyzing trace with hash -886157148, now seen corresponding path program 1 times [2022-12-06 07:29:00,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:00,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658224260] [2022-12-06 07:29:00,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:00,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:00,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-06 07:29:00,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:00,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658224260] [2022-12-06 07:29:00,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658224260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:00,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:00,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:00,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805896690] [2022-12-06 07:29:00,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:00,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:00,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:00,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:00,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:00,465 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:00,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:00,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:00,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:00,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:00,502 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:00,502 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:00,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:00,503 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:00,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:00,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:00,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:00,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:00,503 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:00,503 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:00,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:00,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:00,504 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:00,504 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:00,504 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:00,504 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:00,504 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:00,505 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:00,505 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:00,505 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:00,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:00,507 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:00,507 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:00,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:00,507 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:00,507 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:00,581 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:00,581 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:00,582 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:00,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:00,582 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:00,582 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:00,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1121 [2022-12-06 07:29:00,582 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-06 07:29:00,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:00,582 INFO L85 PathProgramCache]: Analyzing trace with hash -859375039, now seen corresponding path program 1 times [2022-12-06 07:29:00,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:00,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108085901] [2022-12-06 07:29:00,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:00,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:00,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-06 07:29:00,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:00,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108085901] [2022-12-06 07:29:00,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108085901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:00,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:00,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:00,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463567093] [2022-12-06 07:29:00,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:00,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:00,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:00,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:00,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:00,647 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:00,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:00,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:00,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:00,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:00,683 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:00,683 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:00,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:00,683 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:00,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:00,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:00,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:00,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:00,684 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:00,684 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:00,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:00,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:00,685 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:00,685 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:00,685 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:00,685 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:00,685 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:00,685 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:00,685 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:00,685 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:00,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:00,687 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:00,687 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:00,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:00,688 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:00,688 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:00,762 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:00,763 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:00,763 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:00,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:00,763 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:00,763 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:00,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1122 [2022-12-06 07:29:00,763 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-06 07:29:00,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:00,763 INFO L85 PathProgramCache]: Analyzing trace with hash -828898846, now seen corresponding path program 1 times [2022-12-06 07:29:00,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:00,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824859616] [2022-12-06 07:29:00,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:00,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:00,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-06 07:29:00,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:00,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824859616] [2022-12-06 07:29:00,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824859616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:00,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:00,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:00,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61778221] [2022-12-06 07:29:00,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:00,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:00,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:00,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:00,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:00,821 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:00,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:00,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:00,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:00,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:00,858 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:00,858 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:00,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:00,858 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:00,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:00,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:00,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:00,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:00,859 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:00,859 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:00,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:00,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:00,860 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:00,860 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:00,860 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:00,860 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:00,860 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:00,860 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:00,860 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:00,860 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:00,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:00,862 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:00,862 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:00,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:00,863 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:00,863 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:00,936 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:00,937 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:00,937 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:00,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:00,937 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:00,937 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:00,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1123 [2022-12-06 07:29:00,937 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-06 07:29:00,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:00,937 INFO L85 PathProgramCache]: Analyzing trace with hash -802116737, now seen corresponding path program 1 times [2022-12-06 07:29:00,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:00,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992479701] [2022-12-06 07:29:00,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:00,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:01,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-06 07:29:01,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:01,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992479701] [2022-12-06 07:29:01,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992479701] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:01,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:01,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:01,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970066426] [2022-12-06 07:29:01,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:01,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:01,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:01,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:01,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:01,009 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:01,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:01,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:01,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:01,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:01,050 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:01,050 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:01,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:01,051 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:01,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:01,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:01,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:01,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:01,051 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:01,051 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:01,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:01,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:01,052 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:01,052 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:01,052 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:01,052 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:01,052 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:01,053 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:01,053 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:01,053 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:01,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:01,055 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:01,055 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:01,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:01,055 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:01,055 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:01,128 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:01,129 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:01,129 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:01,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:01,129 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:01,129 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:01,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1124 [2022-12-06 07:29:01,129 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-06 07:29:01,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:01,129 INFO L85 PathProgramCache]: Analyzing trace with hash -771640544, now seen corresponding path program 1 times [2022-12-06 07:29:01,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:01,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494796303] [2022-12-06 07:29:01,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:01,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:01,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-06 07:29:01,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:01,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494796303] [2022-12-06 07:29:01,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494796303] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:01,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:01,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:01,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078429621] [2022-12-06 07:29:01,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:01,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:01,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:01,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:01,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:01,190 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:01,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:01,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:01,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:01,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:01,232 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:01,232 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:01,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:01,232 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:01,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:01,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:01,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:01,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:01,233 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:01,233 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:01,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:01,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:01,233 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:01,233 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:01,234 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:01,234 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:01,234 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:01,234 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:01,234 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:01,234 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:01,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:01,236 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:01,236 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:01,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:01,237 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:01,237 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:01,309 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:01,309 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:29:01,310 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:01,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:01,310 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:01,310 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:01,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1125 [2022-12-06 07:29:01,310 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-06 07:29:01,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:01,310 INFO L85 PathProgramCache]: Analyzing trace with hash -744858435, now seen corresponding path program 1 times [2022-12-06 07:29:01,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:01,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745316646] [2022-12-06 07:29:01,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:01,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:01,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:01,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-06 07:29:01,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:01,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745316646] [2022-12-06 07:29:01,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745316646] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:01,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:01,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:01,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997459375] [2022-12-06 07:29:01,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:01,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:01,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:01,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:01,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:01,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:01,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:01,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:01,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:01,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:01,412 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:01,412 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:01,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:01,412 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:01,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:01,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:01,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:01,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:01,413 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:01,413 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:01,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:01,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:01,413 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:01,414 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:01,414 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:01,414 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:01,414 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:01,414 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:01,414 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:01,414 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:01,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:01,416 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:01,416 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:01,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:01,417 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:01,417 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:01,493 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:01,494 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:29:01,494 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:01,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:01,494 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:01,494 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:01,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1126 [2022-12-06 07:29:01,494 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-06 07:29:01,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:01,495 INFO L85 PathProgramCache]: Analyzing trace with hash -714382242, now seen corresponding path program 1 times [2022-12-06 07:29:01,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:01,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672139128] [2022-12-06 07:29:01,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:01,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:01,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-06 07:29:01,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:01,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672139128] [2022-12-06 07:29:01,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672139128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:01,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:01,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:01,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881194362] [2022-12-06 07:29:01,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:01,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:01,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:01,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:01,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:01,554 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:01,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:01,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:01,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:01,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:01,591 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:01,591 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:01,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:01,592 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:01,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:01,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:01,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:01,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:01,592 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:01,592 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:01,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:01,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:01,593 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:01,593 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:01,593 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:01,593 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:01,593 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:01,593 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:01,593 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:01,594 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:01,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:01,596 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:01,596 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:01,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:01,596 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:01,596 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:01,671 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:01,671 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:01,672 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:01,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:01,672 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:01,672 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:01,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1127 [2022-12-06 07:29:01,672 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-06 07:29:01,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:01,672 INFO L85 PathProgramCache]: Analyzing trace with hash -687600133, now seen corresponding path program 1 times [2022-12-06 07:29:01,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:01,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833368453] [2022-12-06 07:29:01,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:01,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29: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-06 07:29:01,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:01,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833368453] [2022-12-06 07:29:01,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833368453] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:01,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:01,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:01,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281072182] [2022-12-06 07:29:01,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:01,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:01,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:01,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:01,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:01,734 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:01,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:01,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:01,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:01,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:01,771 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:01,771 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:01,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:01,772 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:01,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:01,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:01,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:01,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:01,772 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:01,772 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:01,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:01,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:01,773 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:01,773 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:01,773 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:01,773 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:01,773 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:01,773 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:01,773 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:01,773 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:01,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:01,776 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:01,776 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:01,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:01,776 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:01,776 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:01,848 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:01,849 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:01,849 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:01,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:01,849 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:01,849 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:01,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1128 [2022-12-06 07:29:01,849 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-06 07:29:01,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:01,850 INFO L85 PathProgramCache]: Analyzing trace with hash -657123940, now seen corresponding path program 1 times [2022-12-06 07:29:01,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:01,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226164708] [2022-12-06 07:29:01,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:01,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:01,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:01,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-06 07:29:01,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:01,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226164708] [2022-12-06 07:29:01,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226164708] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:01,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:01,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:01,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242592175] [2022-12-06 07:29:01,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:01,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:01,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:01,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:01,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:01,923 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:01,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:01,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:01,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:01,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:01,960 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:01,961 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:01,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:01,961 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:01,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:01,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:01,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:01,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:01,962 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:01,962 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:01,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:01,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:01,962 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:01,962 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:01,963 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:01,963 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:01,963 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:01,963 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:01,963 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:01,963 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:01,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:01,965 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:01,965 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:01,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:01,965 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:01,965 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:02,038 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:02,039 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:02,039 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:02,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:02,039 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:02,039 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:02,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1129 [2022-12-06 07:29:02,039 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-06 07:29:02,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:02,039 INFO L85 PathProgramCache]: Analyzing trace with hash -630341831, now seen corresponding path program 1 times [2022-12-06 07:29:02,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:02,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199657691] [2022-12-06 07:29:02,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:02,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:02,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-06 07:29:02,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:02,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199657691] [2022-12-06 07:29:02,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199657691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:02,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:02,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:02,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616238883] [2022-12-06 07:29:02,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:02,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:02,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:02,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:02,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:02,102 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:02,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:02,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:02,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:02,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:02,145 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:02,145 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:02,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:02,146 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:02,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:02,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:02,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:02,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:02,146 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:02,146 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:02,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:02,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:02,147 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:02,147 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:02,147 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:02,147 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:02,147 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:02,148 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:02,148 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:02,148 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:02,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:02,150 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:02,150 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:02,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 146 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:02,150 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:02,150 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:02,226 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:02,226 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:02,226 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:02,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:02,226 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:02,226 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:02,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1130 [2022-12-06 07:29:02,227 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-06 07:29:02,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:02,227 INFO L85 PathProgramCache]: Analyzing trace with hash -599865638, now seen corresponding path program 1 times [2022-12-06 07:29:02,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:02,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794128562] [2022-12-06 07:29:02,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:02,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:02,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:02,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:02,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794128562] [2022-12-06 07:29:02,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794128562] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:02,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:02,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:02,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673971552] [2022-12-06 07:29:02,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:02,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:02,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:02,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:02,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:02,287 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:02,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:02,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:02,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:02,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:02,329 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:02,329 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:02,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:02,330 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:02,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:02,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:02,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:02,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:02,330 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:02,330 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:02,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:02,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:02,331 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:02,331 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:02,331 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:02,331 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:02,331 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:02,331 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:02,331 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:02,331 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:02,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:02,334 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:02,334 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:02,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:02,334 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:02,334 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:02,409 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:02,409 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:02,410 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:02,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:02,410 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:02,410 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:02,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1131 [2022-12-06 07:29:02,410 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-06 07:29:02,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:02,410 INFO L85 PathProgramCache]: Analyzing trace with hash -573083529, now seen corresponding path program 1 times [2022-12-06 07:29:02,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:02,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470975827] [2022-12-06 07:29:02,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:02,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:02,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-06 07:29:02,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:02,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470975827] [2022-12-06 07:29:02,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470975827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:02,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:02,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:02,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278413203] [2022-12-06 07:29:02,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:02,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:02,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:02,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:02,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:02,468 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:02,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:02,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:02,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:02,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:02,506 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:02,506 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:02,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:02,507 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:02,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:02,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:02,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:02,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:02,507 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:02,507 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:02,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:02,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:02,508 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:02,508 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:02,508 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:02,508 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:02,508 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:02,509 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:02,509 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:02,509 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:02,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:02,511 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:02,511 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:02,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:02,511 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:02,511 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:02,584 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:02,584 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:02,584 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:02,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:02,584 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:02,584 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:02,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1132 [2022-12-06 07:29:02,585 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-06 07:29:02,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:02,585 INFO L85 PathProgramCache]: Analyzing trace with hash -542607336, now seen corresponding path program 1 times [2022-12-06 07:29:02,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:02,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880579286] [2022-12-06 07:29:02,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:02,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:02,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-06 07:29:02,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:02,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880579286] [2022-12-06 07:29:02,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880579286] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:02,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:02,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:02,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745451457] [2022-12-06 07:29:02,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:02,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:02,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:02,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:02,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:02,646 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:02,646 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:02,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:02,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:02,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:02,688 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:02,688 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:02,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:02,689 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:02,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:02,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:02,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:02,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:02,689 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:02,689 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:02,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:02,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:02,690 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:02,690 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:02,690 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:02,690 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:02,690 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:02,690 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:02,691 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:02,691 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:02,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:02,693 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:02,693 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:02,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:02,693 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:02,693 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:02,768 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:02,769 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:02,769 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:02,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:02,769 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:02,769 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:02,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1133 [2022-12-06 07:29:02,769 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-06 07:29:02,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:02,769 INFO L85 PathProgramCache]: Analyzing trace with hash -515825227, now seen corresponding path program 1 times [2022-12-06 07:29:02,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:02,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035698439] [2022-12-06 07:29:02,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:02,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:02,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-06 07:29:02,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:02,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035698439] [2022-12-06 07:29:02,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035698439] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:02,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:02,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:02,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123770870] [2022-12-06 07:29:02,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:02,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:02,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:02,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:02,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:02,831 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:02,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:02,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:02,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:02,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:02,872 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:02,872 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:02,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 356 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:02,872 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:02,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:02,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:02,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:02,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:02,873 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:02,873 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:02,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:02,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:02,874 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:02,874 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:02,874 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:02,874 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:02,874 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:02,874 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:02,874 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:02,874 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:02,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:02,876 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:02,877 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:02,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:02,877 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:02,877 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:02,951 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:02,952 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:02,952 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:02,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:02,952 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:02,952 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:02,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1134 [2022-12-06 07:29:02,959 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-06 07:29:02,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:02,960 INFO L85 PathProgramCache]: Analyzing trace with hash -485349034, now seen corresponding path program 1 times [2022-12-06 07:29:02,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:02,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610253162] [2022-12-06 07:29:02,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:02,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:03,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:03,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:03,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610253162] [2022-12-06 07:29:03,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610253162] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:03,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:03,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:03,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351287638] [2022-12-06 07:29:03,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:03,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:03,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:03,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:03,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:03,020 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:03,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:03,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:03,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:03,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:03,062 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:03,062 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:03,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:03,063 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:03,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:03,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:03,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:03,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:03,063 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:03,063 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:03,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:03,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:03,064 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:03,064 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:03,064 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:03,064 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:03,064 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:03,065 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:03,065 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:03,065 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:03,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:03,067 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:03,067 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:03,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:03,067 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:03,067 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:03,142 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:03,143 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:03,143 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:03,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:03,143 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:03,143 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:03,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1135 [2022-12-06 07:29:03,143 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-06 07:29:03,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:03,144 INFO L85 PathProgramCache]: Analyzing trace with hash -458566925, now seen corresponding path program 1 times [2022-12-06 07:29:03,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:03,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306627237] [2022-12-06 07:29:03,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:03,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:03,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-06 07:29:03,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:03,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306627237] [2022-12-06 07:29:03,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306627237] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:03,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:03,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:03,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322413353] [2022-12-06 07:29:03,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:03,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:03,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:03,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:03,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:03,206 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:03,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:03,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:03,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:03,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:03,242 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:03,242 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:03,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:03,243 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:03,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:03,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:03,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:03,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:03,243 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:03,243 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:03,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:03,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:03,244 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:03,244 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:03,244 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:03,244 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:03,244 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:03,245 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:03,245 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:03,245 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:03,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:03,247 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:03,247 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:03,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:03,247 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:03,247 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:03,321 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:03,321 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:03,321 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:03,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:03,321 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:03,321 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:03,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1136 [2022-12-06 07:29:03,322 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-06 07:29:03,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:03,322 INFO L85 PathProgramCache]: Analyzing trace with hash -428090732, now seen corresponding path program 1 times [2022-12-06 07:29:03,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:03,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464066577] [2022-12-06 07:29:03,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:03,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:03,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-06 07:29:03,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:03,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464066577] [2022-12-06 07:29:03,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464066577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:03,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:03,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:03,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568605511] [2022-12-06 07:29:03,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:03,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:03,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:03,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:03,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:03,381 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:03,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:03,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:03,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:03,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:03,424 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:03,424 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:03,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:03,424 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:03,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:03,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:03,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:03,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:03,425 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:03,425 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:03,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:03,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:03,425 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:03,426 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:03,426 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:03,426 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:03,426 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:03,426 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:03,426 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:03,426 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:03,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:03,428 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:03,428 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:03,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:03,429 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:03,429 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:03,501 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:03,501 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:29:03,501 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:03,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:03,502 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:03,502 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:03,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1137 [2022-12-06 07:29:03,502 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-06 07:29:03,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:03,502 INFO L85 PathProgramCache]: Analyzing trace with hash -401308623, now seen corresponding path program 1 times [2022-12-06 07:29:03,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:03,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323098216] [2022-12-06 07:29:03,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:03,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:03,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-06 07:29:03,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:03,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323098216] [2022-12-06 07:29:03,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323098216] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:03,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:03,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:03,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165851806] [2022-12-06 07:29:03,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:03,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:03,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:03,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:03,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:03,564 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:03,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:03,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:03,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:03,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:03,602 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:03,602 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:03,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:03,603 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:03,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:03,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:03,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:03,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:03,603 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:03,604 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:03,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:03,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:03,604 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:03,604 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:03,604 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:03,604 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:03,605 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:03,605 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:03,605 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:03,605 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:03,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:03,607 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:03,607 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:03,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:03,607 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:03,607 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:03,682 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:03,682 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:03,682 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:03,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:03,683 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:03,683 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:03,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1138 [2022-12-06 07:29:03,683 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-06 07:29:03,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:03,683 INFO L85 PathProgramCache]: Analyzing trace with hash -370832430, now seen corresponding path program 1 times [2022-12-06 07:29:03,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:03,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795329139] [2022-12-06 07:29:03,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:03,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:03,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-06 07:29:03,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:03,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795329139] [2022-12-06 07:29:03,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795329139] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:03,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:03,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:03,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010928377] [2022-12-06 07:29:03,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:03,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:03,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:03,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:03,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:03,743 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:03,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:03,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:03,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:03,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:03,785 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:03,785 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:03,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:03,786 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:03,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:03,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:03,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:03,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:03,786 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:03,786 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:03,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:03,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:03,787 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:03,787 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:03,787 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:03,787 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:03,787 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:03,787 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:03,787 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:03,788 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:03,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:03,790 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:03,790 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:03,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:03,790 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:03,790 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:03,863 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:03,863 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:03,863 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:03,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:03,864 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:03,864 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:03,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1139 [2022-12-06 07:29:03,864 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-06 07:29:03,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:03,864 INFO L85 PathProgramCache]: Analyzing trace with hash -344050321, now seen corresponding path program 1 times [2022-12-06 07:29:03,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:03,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228686782] [2022-12-06 07:29:03,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:03,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:03,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:03,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-06 07:29:03,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:03,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228686782] [2022-12-06 07:29:03,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228686782] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:03,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:03,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:03,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323785938] [2022-12-06 07:29:03,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:03,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:03,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:03,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:03,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:03,935 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:03,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:03,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:03,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:03,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:03,970 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:03,970 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:03,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:03,971 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:03,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:03,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:03,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:03,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:03,971 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:03,971 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:03,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:03,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:03,972 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:03,972 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:03,972 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:03,972 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:03,972 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:03,972 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:03,972 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:03,972 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:03,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:03,974 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:03,974 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:03,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:03,975 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:03,975 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:04,047 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:04,047 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:29:04,047 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:04,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:04,047 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:04,047 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:04,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1140 [2022-12-06 07:29:04,048 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-06 07:29:04,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:04,048 INFO L85 PathProgramCache]: Analyzing trace with hash -313574128, now seen corresponding path program 1 times [2022-12-06 07:29:04,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:04,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53905600] [2022-12-06 07:29:04,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:04,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:04,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-06 07:29:04,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:04,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53905600] [2022-12-06 07:29:04,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53905600] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:04,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:04,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:04,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782176110] [2022-12-06 07:29:04,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:04,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:04,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:04,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:04,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:04,121 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:04,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:04,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:04,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:04,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:04,161 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:04,162 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:04,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:04,162 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:04,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:04,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:04,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:04,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:04,163 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:04,163 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:04,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:04,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:04,163 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:04,163 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:04,163 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:04,164 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:04,164 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:04,164 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:04,164 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:04,164 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:04,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:04,166 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:04,166 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:04,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:04,166 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:04,166 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:04,237 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:04,238 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:29:04,238 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:04,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:04,238 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:04,238 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:04,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1141 [2022-12-06 07:29:04,238 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-06 07:29:04,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:04,239 INFO L85 PathProgramCache]: Analyzing trace with hash -286792019, now seen corresponding path program 1 times [2022-12-06 07:29:04,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:04,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133277928] [2022-12-06 07:29:04,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:04,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:04,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-06 07:29:04,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:04,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133277928] [2022-12-06 07:29:04,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133277928] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:04,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:04,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:04,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438799660] [2022-12-06 07:29:04,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:04,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:04,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:04,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:04,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:04,301 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:04,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:04,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:04,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:04,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:04,342 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:04,342 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:04,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:04,343 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:04,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:04,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:04,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:04,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:04,343 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:04,344 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:04,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:04,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:04,344 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:04,344 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:04,344 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:04,344 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:04,344 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:04,345 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:04,345 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:04,345 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:04,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:04,347 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:04,347 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:04,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:04,347 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:04,347 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:04,421 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:04,422 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:04,422 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:04,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:04,422 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:04,422 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:04,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1142 [2022-12-06 07:29:04,422 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-06 07:29:04,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:04,423 INFO L85 PathProgramCache]: Analyzing trace with hash -256315826, now seen corresponding path program 1 times [2022-12-06 07:29:04,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:04,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032448274] [2022-12-06 07:29:04,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:04,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:04,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:04,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-06 07:29:04,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:04,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032448274] [2022-12-06 07:29:04,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032448274] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:04,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:04,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:04,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417930818] [2022-12-06 07:29:04,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:04,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:04,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:04,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:04,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:04,481 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:04,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:04,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:04,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:04,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:04,517 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:04,517 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:04,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:04,518 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:04,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:04,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:04,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:04,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:04,518 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:04,518 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:04,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:04,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:04,519 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:04,519 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:04,519 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:04,519 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:04,519 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:04,519 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:04,519 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:04,519 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:04,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:04,521 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:04,522 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:04,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:04,522 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:04,522 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:04,594 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:04,595 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:04,595 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:04,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:04,595 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:04,595 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:04,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1143 [2022-12-06 07:29:04,595 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-06 07:29:04,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:04,596 INFO L85 PathProgramCache]: Analyzing trace with hash -229533717, now seen corresponding path program 1 times [2022-12-06 07:29:04,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:04,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459585753] [2022-12-06 07:29:04,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:04,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:04,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-06 07:29:04,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:04,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459585753] [2022-12-06 07:29:04,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459585753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:04,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:04,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:04,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729631466] [2022-12-06 07:29:04,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:04,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:04,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:04,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:04,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:04,656 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:04,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:04,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:04,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:04,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:04,697 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:04,697 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:04,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:04,697 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:04,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:04,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:04,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:04,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:04,698 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:04,698 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:04,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:04,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:04,699 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:04,699 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:04,699 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:04,699 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:04,699 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:04,699 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:04,699 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:04,699 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:04,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:04,701 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:04,701 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:04,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:04,702 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:04,702 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:04,774 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:04,775 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:04,775 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:04,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:04,775 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:04,775 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:04,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1144 [2022-12-06 07:29:04,775 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-06 07:29:04,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:04,776 INFO L85 PathProgramCache]: Analyzing trace with hash -199057524, now seen corresponding path program 1 times [2022-12-06 07:29:04,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:04,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314009105] [2022-12-06 07:29:04,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:04,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:04,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-06 07:29:04,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:04,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314009105] [2022-12-06 07:29:04,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314009105] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:04,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:04,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:04,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561523406] [2022-12-06 07:29:04,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:04,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:04,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:04,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:04,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:04,834 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:04,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:04,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:04,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:04,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:04,876 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:04,876 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:04,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:04,876 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:04,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:04,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:04,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:04,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:04,877 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:04,877 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:04,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:04,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:04,878 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:04,878 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:04,878 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:04,878 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:04,878 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:04,878 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:04,878 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:04,878 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:04,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:04,888 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:04,888 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:04,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:04,888 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:04,888 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:04,961 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:04,962 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:29:04,962 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:04,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:04,962 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:04,962 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:04,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1145 [2022-12-06 07:29:04,962 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-06 07:29:04,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:04,962 INFO L85 PathProgramCache]: Analyzing trace with hash -172275415, now seen corresponding path program 1 times [2022-12-06 07:29:04,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:04,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39338544] [2022-12-06 07:29:04,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:04,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:04,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:05,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-06 07:29:05,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:05,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39338544] [2022-12-06 07:29:05,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39338544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:05,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:05,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:05,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770739194] [2022-12-06 07:29:05,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:05,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:05,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:05,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:05,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:05,024 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:05,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:05,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:05,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:05,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:05,063 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:05,063 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:05,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:05,064 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:05,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:05,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:05,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:05,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:05,064 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:05,064 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:05,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:05,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:05,065 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:05,065 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:05,065 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:05,065 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:05,065 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:05,065 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:05,066 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:05,066 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:05,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:05,068 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:05,068 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:05,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:05,068 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:05,068 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:05,142 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:05,143 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:05,143 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:05,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:05,143 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:05,143 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:05,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1146 [2022-12-06 07:29:05,143 INFO L420 AbstractCegarLoop]: === Iteration 1148 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:29:05,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:05,143 INFO L85 PathProgramCache]: Analyzing trace with hash -141799222, now seen corresponding path program 1 times [2022-12-06 07:29:05,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:05,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479907481] [2022-12-06 07:29:05,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:05,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:05,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-06 07:29:05,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:05,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479907481] [2022-12-06 07:29:05,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479907481] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:05,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:05,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:05,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448228862] [2022-12-06 07:29:05,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:05,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:05,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:05,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:05,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:05,202 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:05,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:05,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:05,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:05,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:05,238 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:05,238 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:05,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:05,238 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:05,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:05,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:05,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:05,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:05,239 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:05,239 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:05,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:05,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:05,240 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:05,240 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:05,240 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:05,240 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:05,240 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:05,240 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:05,240 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:05,240 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:05,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:05,242 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:05,242 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:05,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:05,243 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:05,243 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:05,317 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:05,317 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:05,317 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:05,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:05,317 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:05,317 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:05,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1147 [2022-12-06 07:29:05,318 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-06 07:29:05,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:05,318 INFO L85 PathProgramCache]: Analyzing trace with hash -115017113, now seen corresponding path program 1 times [2022-12-06 07:29:05,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:05,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959864985] [2022-12-06 07:29:05,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:05,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:05,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-06 07:29:05,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:05,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959864985] [2022-12-06 07:29:05,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959864985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:05,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:05,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:05,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713606120] [2022-12-06 07:29:05,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:05,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:05,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:05,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:05,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:05,378 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:05,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:05,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:05,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:05,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:05,419 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:05,419 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:05,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:05,420 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:05,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:05,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:05,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:05,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:05,420 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:05,420 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:05,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:05,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:05,421 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:05,421 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:05,421 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:05,421 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:05,421 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:05,421 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:05,421 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:05,422 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:05,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:05,424 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:05,424 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:05,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:05,424 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:05,424 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:05,497 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:05,498 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:05,498 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:05,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:05,498 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:05,498 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:05,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1148 [2022-12-06 07:29:05,498 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-06 07:29:05,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:05,498 INFO L85 PathProgramCache]: Analyzing trace with hash -84540920, now seen corresponding path program 1 times [2022-12-06 07:29:05,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:05,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970162319] [2022-12-06 07:29:05,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:05,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:05,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:05,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-06 07:29:05,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:05,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970162319] [2022-12-06 07:29:05,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970162319] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:05,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:05,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:05,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798215671] [2022-12-06 07:29:05,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:05,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:05,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:05,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:05,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:05,558 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:05,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:05,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:05,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:05,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:05,600 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:05,600 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:05,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:05,600 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:05,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:05,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:05,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:05,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:05,601 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:05,601 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:05,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:05,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:05,602 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:05,602 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:05,602 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:05,602 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:05,602 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:05,602 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:05,602 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:05,602 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:05,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:05,604 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:05,604 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:05,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:05,605 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:05,605 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:05,679 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:05,680 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:05,680 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:05,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:05,680 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:05,680 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:05,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1149 [2022-12-06 07:29:05,680 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-06 07:29:05,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:05,680 INFO L85 PathProgramCache]: Analyzing trace with hash -57758811, now seen corresponding path program 1 times [2022-12-06 07:29:05,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:05,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144405194] [2022-12-06 07:29:05,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:05,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:05,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-06 07:29:05,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:05,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144405194] [2022-12-06 07:29:05,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144405194] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:05,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:05,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:05,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100371115] [2022-12-06 07:29:05,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:05,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:05,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:05,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:05,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:05,745 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:05,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:05,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:05,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:05,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:05,786 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:05,786 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:05,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:05,787 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:05,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:05,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:05,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:05,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:05,787 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:05,787 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:05,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:05,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:05,788 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:05,788 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:05,788 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:05,788 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:05,788 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:05,789 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:05,789 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:05,789 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:05,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:05,791 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:05,791 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:05,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:05,791 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:05,791 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:05,875 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:05,876 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 07:29:05,876 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:05,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:05,876 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:05,876 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:05,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1150 [2022-12-06 07:29:05,876 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-06 07:29:05,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:05,877 INFO L85 PathProgramCache]: Analyzing trace with hash -27282618, now seen corresponding path program 1 times [2022-12-06 07:29:05,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:05,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554665033] [2022-12-06 07:29:05,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:05,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:05,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-06 07:29:05,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:05,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554665033] [2022-12-06 07:29:05,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554665033] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:05,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:05,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:05,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522777637] [2022-12-06 07:29:05,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:05,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:05,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:05,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:05,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:05,945 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:05,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:05,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:05,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:05,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:05,988 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:05,988 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:05,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 350 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:05,988 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:05,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:05,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:05,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:05,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:05,989 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:05,989 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:05,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:05,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:05,990 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:05,990 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:05,990 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:05,990 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:05,990 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:05,990 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:05,990 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:05,990 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:05,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:05,992 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:05,992 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:05,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:05,993 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:05,993 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:06,067 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:06,068 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:06,068 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:06,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:06,068 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:06,068 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:06,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1151 [2022-12-06 07:29:06,068 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-06 07:29:06,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:06,068 INFO L85 PathProgramCache]: Analyzing trace with hash -500509, now seen corresponding path program 1 times [2022-12-06 07:29:06,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:06,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711221497] [2022-12-06 07:29:06,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:06,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:06,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-06 07:29:06,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:06,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711221497] [2022-12-06 07:29:06,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711221497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:06,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:06,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:06,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855454008] [2022-12-06 07:29:06,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:06,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:06,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:06,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:06,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:06,130 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:06,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:06,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:06,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:06,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:06,172 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:06,172 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:06,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:06,172 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:06,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:06,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:06,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:06,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:06,173 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:06,173 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:06,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:06,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:06,174 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:06,174 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:06,174 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:06,174 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:06,174 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:06,174 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:06,174 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:06,174 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:06,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:06,176 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:06,176 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:06,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:06,177 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:06,177 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:06,251 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:06,251 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:06,252 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:06,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:06,252 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:06,252 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:06,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1152 [2022-12-06 07:29:06,252 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-06 07:29:06,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:06,252 INFO L85 PathProgramCache]: Analyzing trace with hash 29975684, now seen corresponding path program 1 times [2022-12-06 07:29:06,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:06,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555073354] [2022-12-06 07:29:06,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:06,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29: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-06 07:29:06,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:06,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555073354] [2022-12-06 07:29:06,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555073354] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:06,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:06,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:06,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486548196] [2022-12-06 07:29:06,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:06,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:06,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:06,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:06,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:06,312 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:06,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:06,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:06,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:06,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:06,348 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:06,349 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:06,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:06,349 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:06,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:06,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:06,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:06,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:06,350 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:06,350 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:06,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:06,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:06,350 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:06,350 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:06,351 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:06,351 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:06,351 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:06,351 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:06,351 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:06,351 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:06,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:06,353 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:06,353 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:06,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:06,354 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:06,354 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:06,428 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:06,428 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:06,428 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:06,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:06,428 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:06,428 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:06,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1153 [2022-12-06 07:29:06,429 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-06 07:29:06,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:06,429 INFO L85 PathProgramCache]: Analyzing trace with hash 56757793, now seen corresponding path program 1 times [2022-12-06 07:29:06,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:06,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793788014] [2022-12-06 07:29:06,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:06,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:06,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:06,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:06,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793788014] [2022-12-06 07:29:06,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793788014] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:06,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:06,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:06,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980477958] [2022-12-06 07:29:06,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:06,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:06,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:06,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:06,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:06,491 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:06,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:06,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:06,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:06,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:06,526 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:06,527 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:06,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:06,527 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:06,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:06,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:06,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:06,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:06,528 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:06,528 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:06,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:06,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:06,528 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:06,528 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:06,529 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:06,529 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:06,529 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:06,529 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:06,529 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:06,529 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:06,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:06,531 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:06,531 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:06,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:06,532 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:06,532 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:06,606 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:06,607 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:06,607 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:06,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:06,607 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:06,607 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:06,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1154 [2022-12-06 07:29:06,607 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-06 07:29:06,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:06,607 INFO L85 PathProgramCache]: Analyzing trace with hash 87233986, now seen corresponding path program 1 times [2022-12-06 07:29:06,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:06,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438583163] [2022-12-06 07:29:06,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:06,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:06,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-06 07:29:06,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:06,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438583163] [2022-12-06 07:29:06,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438583163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:06,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:06,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:06,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424023514] [2022-12-06 07:29:06,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:06,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:06,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:06,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:06,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:06,667 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:06,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:06,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:06,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:06,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:06,709 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:06,709 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:06,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:06,710 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:06,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:06,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:06,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:06,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:06,710 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:06,710 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:06,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:06,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:06,711 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:06,711 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:06,711 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:06,711 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:06,711 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:06,712 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:06,712 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:06,712 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:06,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:06,715 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:06,715 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:06,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:06,715 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:06,715 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:06,789 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:06,790 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:06,790 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:06,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:06,790 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:06,790 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:06,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1155 [2022-12-06 07:29:06,790 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-06 07:29:06,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:06,790 INFO L85 PathProgramCache]: Analyzing trace with hash 114016095, now seen corresponding path program 1 times [2022-12-06 07:29:06,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:06,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354407789] [2022-12-06 07:29:06,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:06,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:06,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-06 07:29:06,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:06,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354407789] [2022-12-06 07:29:06,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354407789] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:06,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:06,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:06,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391240965] [2022-12-06 07:29:06,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:06,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:06,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:06,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:06,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:06,863 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:06,863 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:06,863 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:06,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:06,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:06,899 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:06,899 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:06,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:06,899 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:06,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:06,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:06,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:06,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:06,900 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:06,900 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:06,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:06,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:06,901 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:06,901 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:06,901 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:06,901 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:06,901 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:06,901 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:06,901 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:06,901 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:06,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:06,904 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:06,904 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:06,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:06,904 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:06,904 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:06,981 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:06,981 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:29:06,981 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:06,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:06,981 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:06,982 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:06,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1156 [2022-12-06 07:29:06,982 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-06 07:29:06,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:06,982 INFO L85 PathProgramCache]: Analyzing trace with hash 144492288, now seen corresponding path program 1 times [2022-12-06 07:29:06,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:06,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378154239] [2022-12-06 07:29:06,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:06,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:07,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-06 07:29:07,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:07,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378154239] [2022-12-06 07:29:07,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378154239] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:07,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:07,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:07,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112803843] [2022-12-06 07:29:07,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:07,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:07,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:07,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:07,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:07,041 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:07,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:07,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:07,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:07,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:07,078 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:07,079 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:07,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:07,079 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:07,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:07,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:07,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:07,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:07,080 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:07,080 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:07,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:07,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:07,080 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:07,080 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:07,081 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:07,081 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:07,081 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:07,081 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:07,081 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:07,081 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:07,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:07,083 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:07,083 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:07,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:07,083 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:07,083 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:07,158 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:07,158 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:07,159 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:07,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:07,159 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:07,159 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:07,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1157 [2022-12-06 07:29:07,159 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-06 07:29:07,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:07,159 INFO L85 PathProgramCache]: Analyzing trace with hash 171274397, now seen corresponding path program 1 times [2022-12-06 07:29:07,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:07,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728190356] [2022-12-06 07:29:07,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:07,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:07,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:07,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:07,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728190356] [2022-12-06 07:29:07,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728190356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:07,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:07,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:07,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626369564] [2022-12-06 07:29:07,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:07,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:07,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:07,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:07,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:07,221 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:07,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:07,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:07,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:07,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:07,258 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:07,258 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:07,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:07,258 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:07,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:07,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:07,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:07,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:07,259 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:07,259 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:07,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:07,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:07,260 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:07,260 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:07,260 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:07,260 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:07,260 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:07,260 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:07,260 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:07,260 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:07,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:07,262 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:07,262 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:07,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:07,263 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:07,263 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:07,337 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:07,337 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:07,337 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:07,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:07,338 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:07,338 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:07,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1158 [2022-12-06 07:29:07,338 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-06 07:29:07,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:07,338 INFO L85 PathProgramCache]: Analyzing trace with hash 201750590, now seen corresponding path program 1 times [2022-12-06 07:29:07,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:07,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323551326] [2022-12-06 07:29:07,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:07,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:07,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-06 07:29:07,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:07,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323551326] [2022-12-06 07:29:07,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323551326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:07,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:07,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:07,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083038744] [2022-12-06 07:29:07,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:07,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:07,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:07,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:07,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:07,419 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:07,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:07,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:07,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:07,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:07,463 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:07,463 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:07,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:07,464 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:07,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:07,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:07,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:07,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:07,464 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:07,464 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:07,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:07,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:07,465 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:07,466 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:07,466 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:07,466 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:07,466 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:07,466 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:07,466 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:07,466 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:07,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:07,469 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:07,469 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:07,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:07,469 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:07,469 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:07,543 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:07,543 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:07,543 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:07,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:07,544 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:07,544 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:07,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1159 [2022-12-06 07:29:07,544 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-06 07:29:07,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:07,544 INFO L85 PathProgramCache]: Analyzing trace with hash 228532699, now seen corresponding path program 1 times [2022-12-06 07:29:07,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:07,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979734041] [2022-12-06 07:29:07,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:07,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:07,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-06 07:29:07,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:07,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979734041] [2022-12-06 07:29:07,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979734041] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:07,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:07,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:07,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420052909] [2022-12-06 07:29:07,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:07,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:07,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:07,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:07,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:07,607 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:07,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:07,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:07,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:07,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:07,648 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:07,648 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:07,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:07,648 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:07,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:07,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:07,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:07,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:07,649 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:07,649 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:07,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:07,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:07,650 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:07,650 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:07,650 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:07,650 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:07,650 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:07,650 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:07,650 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:07,650 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:07,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:07,652 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:07,652 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:07,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:07,653 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:07,653 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:07,725 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:07,726 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:07,726 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:07,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:07,726 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:07,726 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:07,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1160 [2022-12-06 07:29:07,726 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-06 07:29:07,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:07,727 INFO L85 PathProgramCache]: Analyzing trace with hash 259008892, now seen corresponding path program 1 times [2022-12-06 07:29:07,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:07,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433921429] [2022-12-06 07:29:07,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:07,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:07,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:07,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:07,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433921429] [2022-12-06 07:29:07,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433921429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:07,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:07,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:07,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041591027] [2022-12-06 07:29:07,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:07,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:07,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:07,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:07,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:07,786 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:07,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:07,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:07,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:07,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:07,825 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:07,825 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:07,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:07,825 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:07,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:07,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:07,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:07,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:07,826 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:07,826 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:07,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:07,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:07,827 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:07,827 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:07,827 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:07,827 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:07,827 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:07,827 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:07,827 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:07,827 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:07,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:07,830 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:07,830 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:07,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:07,830 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:07,830 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:07,904 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:07,905 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:07,905 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:07,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:07,905 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:07,905 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:07,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1161 [2022-12-06 07:29:07,905 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-06 07:29:07,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:07,906 INFO L85 PathProgramCache]: Analyzing trace with hash 285791001, now seen corresponding path program 1 times [2022-12-06 07:29:07,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:07,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883445397] [2022-12-06 07:29:07,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:07,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:07,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-06 07:29:07,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:07,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883445397] [2022-12-06 07:29:07,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883445397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:07,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:07,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:07,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201779694] [2022-12-06 07:29:07,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:07,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:07,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:07,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:07,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:07,978 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:07,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:07,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:07,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:07,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:08,020 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:08,020 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:08,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:08,021 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:08,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:08,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:08,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:08,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:08,021 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:08,021 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:08,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:08,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:08,022 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:08,022 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:08,022 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:08,022 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:08,022 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:08,022 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:08,022 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:08,022 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:08,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:08,025 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:08,025 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:08,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:08,025 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:08,025 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:08,100 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:08,100 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:08,100 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:08,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:08,100 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:08,100 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:08,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1162 [2022-12-06 07:29:08,101 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-06 07:29:08,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:08,101 INFO L85 PathProgramCache]: Analyzing trace with hash 316267194, now seen corresponding path program 1 times [2022-12-06 07:29:08,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:08,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222783874] [2022-12-06 07:29:08,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:08,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:08,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-06 07:29:08,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:08,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222783874] [2022-12-06 07:29:08,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222783874] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:08,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:08,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:08,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358516001] [2022-12-06 07:29:08,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:08,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:08,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:08,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:08,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:08,159 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:08,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:08,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:08,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:08,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:08,195 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:08,195 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:08,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:08,195 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:08,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:08,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:08,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:08,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:08,196 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:08,196 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:08,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:08,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:08,197 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:08,197 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:08,197 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:08,197 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:08,197 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:08,197 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:08,197 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:08,197 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:08,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:08,200 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:08,200 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:08,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:08,200 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:08,200 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:08,273 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:08,274 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:08,274 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:08,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:08,274 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:08,274 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:08,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1163 [2022-12-06 07:29:08,274 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-06 07:29:08,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:08,275 INFO L85 PathProgramCache]: Analyzing trace with hash 343049303, now seen corresponding path program 1 times [2022-12-06 07:29:08,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:08,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998045189] [2022-12-06 07:29:08,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:08,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:08,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:08,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-06 07:29:08,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:08,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998045189] [2022-12-06 07:29:08,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998045189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:08,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:08,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:08,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557596776] [2022-12-06 07:29:08,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:08,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:08,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:08,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:08,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:08,336 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:08,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:08,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:08,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:08,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:08,373 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:08,373 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:08,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:08,374 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:08,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:08,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:08,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:08,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:08,375 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:08,375 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:08,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:08,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:08,375 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:08,376 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:08,376 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:08,376 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:08,376 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:08,376 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:08,376 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:08,376 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:08,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:08,378 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:08,378 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:08,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:08,379 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:08,379 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:08,453 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:08,453 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:08,453 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:08,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:08,454 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:08,454 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:08,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1164 [2022-12-06 07:29:08,454 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-06 07:29:08,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:08,454 INFO L85 PathProgramCache]: Analyzing trace with hash 373525496, now seen corresponding path program 1 times [2022-12-06 07:29:08,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:08,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658102628] [2022-12-06 07:29:08,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:08,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:08,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-06 07:29:08,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:08,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658102628] [2022-12-06 07:29:08,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658102628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:08,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:08,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:08,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754700470] [2022-12-06 07:29:08,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:08,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:08,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:08,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:08,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:08,515 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:08,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:08,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:08,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:08,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:08,560 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:08,560 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:08,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:08,560 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:08,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:08,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:08,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:08,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:08,561 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:08,561 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:08,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:08,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:08,562 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:08,562 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:08,562 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:08,562 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:08,562 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:08,562 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:08,562 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:08,562 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:08,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:08,564 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:08,564 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:08,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:08,565 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:08,565 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:08,640 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:08,640 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:08,640 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:08,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:08,640 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:08,640 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:08,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1165 [2022-12-06 07:29:08,640 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-06 07:29:08,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:08,641 INFO L85 PathProgramCache]: Analyzing trace with hash 400307605, now seen corresponding path program 1 times [2022-12-06 07:29:08,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:08,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271637198] [2022-12-06 07:29:08,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:08,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:08,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-06 07:29:08,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:08,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271637198] [2022-12-06 07:29:08,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271637198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:08,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:08,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:08,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876984646] [2022-12-06 07:29:08,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:08,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:08,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:08,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:08,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:08,704 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:08,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:08,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:08,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:08,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:08,743 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:08,743 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:08,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 376 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:08,743 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:08,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:08,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:08,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:08,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:08,744 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:08,744 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:08,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:08,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:08,744 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:08,745 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:08,745 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:08,745 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:08,745 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:08,745 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:08,745 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:08,745 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:08,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:08,747 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:08,747 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:08,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:08,747 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:08,748 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:08,822 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:08,823 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:08,823 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:08,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:08,823 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:08,823 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:08,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1166 [2022-12-06 07:29:08,823 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-06 07:29:08,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:08,824 INFO L85 PathProgramCache]: Analyzing trace with hash 430783798, now seen corresponding path program 1 times [2022-12-06 07:29:08,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:08,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311510828] [2022-12-06 07:29:08,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:08,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:08,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-06 07:29:08,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:08,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311510828] [2022-12-06 07:29:08,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311510828] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:08,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:08,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:08,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631118246] [2022-12-06 07:29:08,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:08,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:08,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:08,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:08,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:08,893 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:08,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:08,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:08,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:08,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:08,935 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:08,935 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:08,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:08,935 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:08,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:08,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:08,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:08,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:08,936 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:08,936 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:08,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:08,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:08,937 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:08,937 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:08,937 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:08,937 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:08,937 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:08,937 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:08,937 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:08,937 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:08,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:08,939 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:08,939 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:08,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:08,940 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:08,940 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:09,015 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:09,015 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:09,015 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:09,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:09,015 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:09,015 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:09,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1167 [2022-12-06 07:29:09,016 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-06 07:29:09,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:09,016 INFO L85 PathProgramCache]: Analyzing trace with hash 457565907, now seen corresponding path program 1 times [2022-12-06 07:29:09,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:09,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026461228] [2022-12-06 07:29:09,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:09,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:09,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-06 07:29:09,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:09,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026461228] [2022-12-06 07:29:09,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026461228] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:09,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:09,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:09,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620319817] [2022-12-06 07:29:09,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:09,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:09,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:09,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:09,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:09,077 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:09,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:09,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:09,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:09,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:09,118 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:09,119 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:09,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:09,119 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:09,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:09,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:09,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:09,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:09,120 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:09,120 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:09,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:09,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:09,120 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:09,120 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:09,120 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:09,121 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:09,121 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:09,121 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:09,121 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:09,121 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:09,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:09,123 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:09,123 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:09,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:09,123 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:09,123 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:09,200 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:09,201 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:29:09,201 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:09,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:09,201 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:09,201 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:09,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1168 [2022-12-06 07:29:09,201 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-06 07:29:09,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:09,201 INFO L85 PathProgramCache]: Analyzing trace with hash 488042100, now seen corresponding path program 1 times [2022-12-06 07:29:09,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:09,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72218036] [2022-12-06 07:29:09,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:09,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:09,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-06 07:29:09,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:09,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72218036] [2022-12-06 07:29:09,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72218036] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:09,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:09,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:09,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646912151] [2022-12-06 07:29:09,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:09,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:09,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:09,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:09,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:09,265 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:09,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:09,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:09,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:09,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:09,308 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:09,309 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:09,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:09,309 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:09,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:09,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:09,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:09,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:09,310 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:09,310 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:09,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:09,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:09,310 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:09,310 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:09,311 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:09,311 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:09,311 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:09,311 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:09,311 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:09,311 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:09,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:09,313 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:09,313 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:09,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:09,314 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:09,314 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:09,388 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:09,389 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:09,389 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:09,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:09,389 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:09,389 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:09,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1169 [2022-12-06 07:29:09,389 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-06 07:29:09,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:09,390 INFO L85 PathProgramCache]: Analyzing trace with hash 514824209, now seen corresponding path program 1 times [2022-12-06 07:29:09,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:09,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156768649] [2022-12-06 07:29:09,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:09,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29: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-06 07:29:09,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:09,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156768649] [2022-12-06 07:29:09,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156768649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:09,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:09,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:09,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754872942] [2022-12-06 07:29:09,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:09,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:09,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:09,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:09,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:09,453 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:09,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:09,453 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:09,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:09,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:09,492 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:09,492 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:09,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:09,493 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:09,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:09,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:09,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:09,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:09,493 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:09,493 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:09,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:09,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:09,494 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:09,494 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:09,494 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:09,494 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:09,494 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:09,494 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:09,494 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:09,494 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:09,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:09,496 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:09,497 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:09,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:09,497 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:09,497 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:09,571 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:09,572 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:09,572 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:09,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:09,572 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:09,572 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:09,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1170 [2022-12-06 07:29:09,572 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-06 07:29:09,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:09,572 INFO L85 PathProgramCache]: Analyzing trace with hash 545300402, now seen corresponding path program 1 times [2022-12-06 07:29:09,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:09,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854858420] [2022-12-06 07:29:09,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:09,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:09,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-06 07:29:09,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:09,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854858420] [2022-12-06 07:29:09,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854858420] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:09,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:09,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:09,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668661259] [2022-12-06 07:29:09,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:09,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:09,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:09,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:09,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:09,630 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:09,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:09,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:09,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:09,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:09,672 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:09,672 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:09,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:09,673 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:09,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:09,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:09,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:09,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:09,673 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:09,673 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:09,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:09,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:09,674 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:09,674 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:09,674 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:09,674 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:09,674 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:09,675 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:09,675 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:09,675 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:09,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:09,677 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:09,677 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:09,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:09,677 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:09,677 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:09,750 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:09,750 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:09,750 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:09,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:09,750 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:09,750 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:09,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1171 [2022-12-06 07:29:09,751 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-06 07:29:09,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:09,751 INFO L85 PathProgramCache]: Analyzing trace with hash 572082511, now seen corresponding path program 1 times [2022-12-06 07:29:09,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:09,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110463099] [2022-12-06 07:29:09,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:09,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:09,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-06 07:29:09,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:09,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110463099] [2022-12-06 07:29:09,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110463099] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:09,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:09,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:09,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804294075] [2022-12-06 07:29:09,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:09,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:09,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:09,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:09,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:09,813 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:09,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:09,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:09,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:09,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:09,859 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:09,859 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:09,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:09,860 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:09,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:09,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:09,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:09,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:09,860 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:09,860 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:09,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:09,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:09,861 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:09,861 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:09,861 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:09,861 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:09,861 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:09,862 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:09,862 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:09,862 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:09,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:09,864 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:09,864 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:09,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:09,864 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:09,864 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:09,940 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:09,940 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:09,940 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:09,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:09,941 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:09,941 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:09,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1172 [2022-12-06 07:29:09,941 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-06 07:29:09,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:09,941 INFO L85 PathProgramCache]: Analyzing trace with hash 602558704, now seen corresponding path program 1 times [2022-12-06 07:29:09,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:09,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344722890] [2022-12-06 07:29:09,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:09,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:10,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-06 07:29:10,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:10,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344722890] [2022-12-06 07:29:10,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344722890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:10,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:10,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:10,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958733271] [2022-12-06 07:29:10,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:10,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:10,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:10,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:10,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:10,001 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:10,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:10,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:10,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:10,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:10,043 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:10,044 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:10,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:10,044 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:10,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:10,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:10,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:10,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:10,045 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:10,045 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:10,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:10,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:10,045 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:10,045 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:10,046 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:10,046 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:10,046 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:10,046 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:10,046 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:10,046 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:10,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:10,048 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:10,048 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:10,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:10,048 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:10,049 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:10,122 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:10,122 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:10,122 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:10,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:10,122 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:10,123 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:10,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1173 [2022-12-06 07:29:10,123 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-06 07:29:10,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:10,123 INFO L85 PathProgramCache]: Analyzing trace with hash 629340813, now seen corresponding path program 1 times [2022-12-06 07:29:10,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:10,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578427445] [2022-12-06 07:29:10,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:10,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:10,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-06 07:29:10,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:10,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578427445] [2022-12-06 07:29:10,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578427445] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:10,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:10,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:10,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902856611] [2022-12-06 07:29:10,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:10,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:10,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:10,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:10,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:10,185 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:10,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:10,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:10,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:10,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:10,220 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:10,220 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:10,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:10,220 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:10,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:10,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:10,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:10,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:10,221 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:10,221 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:10,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:10,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:10,222 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:10,222 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:10,222 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:10,222 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:10,222 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:10,222 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:10,222 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:10,222 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:10,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:10,224 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:10,224 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:10,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:10,225 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:10,225 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:10,299 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:10,300 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:10,300 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:10,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:10,300 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:10,300 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:10,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1174 [2022-12-06 07:29:10,300 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-06 07:29:10,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:10,301 INFO L85 PathProgramCache]: Analyzing trace with hash 659817006, now seen corresponding path program 1 times [2022-12-06 07:29:10,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:10,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189910215] [2022-12-06 07:29:10,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:10,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:10,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-06 07:29:10,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:10,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189910215] [2022-12-06 07:29:10,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189910215] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:10,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:10,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:10,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894303403] [2022-12-06 07:29:10,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:10,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:10,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:10,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:10,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:10,363 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:10,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:10,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:10,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:10,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:10,406 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:10,406 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:10,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:10,406 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:10,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:10,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:10,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:10,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:10,407 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:10,407 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:10,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:10,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:10,408 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:10,408 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:10,408 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:10,408 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:10,408 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:10,408 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:10,408 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:10,408 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:10,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:10,410 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:10,411 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:10,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:10,411 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:10,411 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:10,485 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:10,485 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:10,486 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:10,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:10,486 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:10,486 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:10,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1175 [2022-12-06 07:29:10,486 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-06 07:29:10,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:10,486 INFO L85 PathProgramCache]: Analyzing trace with hash 686599115, now seen corresponding path program 1 times [2022-12-06 07:29:10,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:10,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645285925] [2022-12-06 07:29:10,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:10,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:10,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-06 07:29:10,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:10,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645285925] [2022-12-06 07:29:10,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645285925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:10,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:10,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:10,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918234138] [2022-12-06 07:29:10,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:10,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:10,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:10,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:10,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:10,549 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:10,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:10,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:10,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:10,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:10,585 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:10,586 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:10,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:10,586 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:10,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:10,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:10,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:10,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:10,587 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:10,587 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:10,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:10,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:10,587 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:10,587 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:10,588 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:10,588 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:10,588 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:10,588 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:10,588 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:10,588 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:10,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:10,590 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:10,590 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:10,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:10,590 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:10,590 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:10,665 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:10,665 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:10,665 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:10,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:10,666 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:10,666 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:10,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1176 [2022-12-06 07:29:10,666 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-06 07:29:10,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:10,666 INFO L85 PathProgramCache]: Analyzing trace with hash 717075308, now seen corresponding path program 1 times [2022-12-06 07:29:10,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:10,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995791831] [2022-12-06 07:29:10,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:10,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:10,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-06 07:29:10,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:10,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995791831] [2022-12-06 07:29:10,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995791831] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:10,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:10,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:10,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368763941] [2022-12-06 07:29:10,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:10,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:10,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:10,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:10,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:10,727 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:10,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:10,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:10,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:10,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:10,769 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:10,769 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:10,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:10,770 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:10,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:10,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:10,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:10,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:10,770 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:10,770 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:10,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:10,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:10,771 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:10,771 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:10,771 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:10,771 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:10,771 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:10,772 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:10,772 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:10,772 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:10,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:10,774 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:10,774 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:10,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:10,774 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:10,774 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:10,852 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:10,852 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:29:10,852 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:10,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:10,853 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:10,853 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:10,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1177 [2022-12-06 07:29:10,853 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-06 07:29:10,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:10,853 INFO L85 PathProgramCache]: Analyzing trace with hash 743857417, now seen corresponding path program 1 times [2022-12-06 07:29:10,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:10,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121625569] [2022-12-06 07:29:10,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:10,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:10,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-06 07:29:10,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:10,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121625569] [2022-12-06 07:29:10,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121625569] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:10,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:10,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:10,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547725854] [2022-12-06 07:29:10,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:10,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:10,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:10,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:10,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:10,930 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:10,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:10,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:10,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:10,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:10,973 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:10,973 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:10,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:10,974 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:10,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:10,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:10,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:10,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:10,974 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:10,974 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:10,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:10,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:10,975 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:10,975 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:10,975 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:10,975 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:10,975 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:10,976 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:10,976 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:10,976 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:10,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:10,978 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:10,978 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:10,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:10,978 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:10,978 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:11,052 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:11,053 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:11,053 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:11,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:11,053 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:11,053 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:11,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1178 [2022-12-06 07:29:11,053 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-06 07:29:11,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:11,053 INFO L85 PathProgramCache]: Analyzing trace with hash 774333610, now seen corresponding path program 1 times [2022-12-06 07:29:11,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:11,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576450216] [2022-12-06 07:29:11,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:11,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:11,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-06 07:29:11,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:11,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576450216] [2022-12-06 07:29:11,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576450216] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:11,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:11,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:11,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760543636] [2022-12-06 07:29:11,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:11,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:11,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:11,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:11,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:11,122 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:11,122 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:11,122 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:11,122 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:11,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:11,162 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:11,162 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:11,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 349 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:11,163 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:11,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:11,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:11,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:11,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:11,163 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:11,163 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:11,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:11,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:11,164 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:11,164 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:11,164 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:11,164 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:11,164 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:11,164 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:11,165 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:11,165 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:11,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:11,167 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:11,167 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:11,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:11,167 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:11,167 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:11,241 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:11,242 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:11,242 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:11,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:11,242 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:11,242 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:11,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1179 [2022-12-06 07:29:11,242 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-06 07:29:11,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:11,242 INFO L85 PathProgramCache]: Analyzing trace with hash 801115719, now seen corresponding path program 1 times [2022-12-06 07:29:11,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:11,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553275744] [2022-12-06 07:29:11,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:11,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:11,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-06 07:29:11,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:11,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553275744] [2022-12-06 07:29:11,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553275744] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:11,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:11,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:11,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812117025] [2022-12-06 07:29:11,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:11,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:11,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:11,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:11,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:11,305 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:11,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:11,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:11,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:11,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:11,341 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:11,341 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:11,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:11,341 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:11,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:11,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:11,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:11,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:11,342 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:11,342 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:11,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:11,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:11,343 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:11,343 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:11,343 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:11,343 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:11,343 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:11,343 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:11,343 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:11,343 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:11,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:11,345 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:11,345 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:11,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:11,346 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:11,346 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:11,422 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:11,423 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:29:11,423 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:11,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:11,423 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:11,423 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:11,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1180 [2022-12-06 07:29:11,423 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-06 07:29:11,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:11,424 INFO L85 PathProgramCache]: Analyzing trace with hash 831591912, now seen corresponding path program 1 times [2022-12-06 07:29:11,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:11,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557200870] [2022-12-06 07:29:11,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:11,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:11,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-06 07:29:11,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:11,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557200870] [2022-12-06 07:29:11,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557200870] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:11,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:11,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:11,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715617903] [2022-12-06 07:29:11,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:11,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:11,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:11,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:11,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:11,484 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:11,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:11,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:11,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:11,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:11,521 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:11,521 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:11,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:11,522 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:11,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:11,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:11,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:11,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:11,522 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:11,522 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:11,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:11,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:11,523 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:11,523 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:11,523 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:11,523 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:11,523 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:11,523 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:11,523 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:11,524 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:11,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:11,526 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:11,526 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:11,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:11,526 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:11,526 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:11,601 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:11,601 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:11,601 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:11,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:11,602 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:11,602 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:11,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1181 [2022-12-06 07:29:11,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-06 07:29:11,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:11,602 INFO L85 PathProgramCache]: Analyzing trace with hash 858374021, now seen corresponding path program 1 times [2022-12-06 07:29:11,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:11,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115552943] [2022-12-06 07:29:11,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:11,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:11,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-06 07:29:11,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:11,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115552943] [2022-12-06 07:29:11,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115552943] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:11,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:11,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:11,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500321665] [2022-12-06 07:29:11,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:11,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:11,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:11,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:11,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:11,664 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:11,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:11,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:11,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:11,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:11,701 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:11,701 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:11,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:11,701 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:11,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:11,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:11,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:11,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:11,702 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:11,702 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:11,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:11,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:11,703 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:11,703 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:11,703 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:11,703 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:11,703 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:11,703 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:11,703 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:11,703 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:11,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:11,705 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:11,705 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:11,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:11,706 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:11,706 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:11,781 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:11,782 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:11,782 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:11,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:11,782 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:11,782 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:11,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1182 [2022-12-06 07:29:11,782 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-06 07:29:11,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:11,782 INFO L85 PathProgramCache]: Analyzing trace with hash 888850214, now seen corresponding path program 1 times [2022-12-06 07:29:11,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:11,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478074099] [2022-12-06 07:29:11,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:11,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:11,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:11,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:11,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478074099] [2022-12-06 07:29:11,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478074099] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:11,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:11,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:11,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469995388] [2022-12-06 07:29:11,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:11,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:11,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:11,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:11,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:11,851 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:11,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:11,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:11,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:11,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:11,893 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:11,893 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:11,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:11,894 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:11,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:11,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:11,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:11,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:11,894 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:11,894 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:11,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:11,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:11,895 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:11,895 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:11,895 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:11,895 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:11,895 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:11,896 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:11,896 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:11,896 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:11,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:11,898 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:11,898 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:11,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:11,898 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:11,898 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:11,973 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:11,974 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:11,974 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:11,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:11,974 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:11,974 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:11,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1183 [2022-12-06 07:29:11,974 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-06 07:29:11,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:11,974 INFO L85 PathProgramCache]: Analyzing trace with hash 915632323, now seen corresponding path program 1 times [2022-12-06 07:29:11,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:11,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136484475] [2022-12-06 07:29:11,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:11,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:12,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-06 07:29:12,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:12,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136484475] [2022-12-06 07:29:12,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136484475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:12,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:12,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:12,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64434384] [2022-12-06 07:29:12,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:12,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:12,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:12,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:12,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:12,036 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:12,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:12,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:12,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:12,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:12,070 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:12,070 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:12,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:12,071 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:12,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:12,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:12,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:12,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:12,072 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:12,072 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:12,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:12,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:12,072 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:12,072 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:12,072 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:12,073 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:12,073 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:12,073 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:12,073 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:12,073 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:12,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:12,076 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:12,076 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:12,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:12,076 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:12,076 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:12,151 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:12,152 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:12,152 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:12,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:12,152 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:12,152 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:12,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1184 [2022-12-06 07:29:12,152 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-06 07:29:12,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:12,152 INFO L85 PathProgramCache]: Analyzing trace with hash 946108516, now seen corresponding path program 1 times [2022-12-06 07:29:12,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:12,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486499642] [2022-12-06 07:29:12,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:12,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:12,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-06 07:29:12,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:12,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486499642] [2022-12-06 07:29:12,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486499642] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:12,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:12,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:12,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770247393] [2022-12-06 07:29:12,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:12,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:12,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:12,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:12,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:12,211 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:12,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:12,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:12,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:12,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:12,248 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:12,248 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:12,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:12,248 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:12,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:12,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:12,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:12,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:12,249 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:12,249 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:12,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:12,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:12,250 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:12,250 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:12,250 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:12,250 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:12,250 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:12,250 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:12,250 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:12,250 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:12,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:12,252 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:12,252 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:12,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:12,253 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:12,253 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:12,328 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:12,329 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:12,329 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:12,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:12,329 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:12,329 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:12,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1185 [2022-12-06 07:29:12,329 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-06 07:29:12,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:12,329 INFO L85 PathProgramCache]: Analyzing trace with hash 972890625, now seen corresponding path program 1 times [2022-12-06 07:29:12,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:12,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218798855] [2022-12-06 07:29:12,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:12,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:12,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:12,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-06 07:29:12,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:12,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218798855] [2022-12-06 07:29:12,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218798855] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:12,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:12,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:12,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431596511] [2022-12-06 07:29:12,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:12,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:12,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:12,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:12,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:12,392 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:12,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:12,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:12,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:12,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:12,428 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:12,428 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:12,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:12,428 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:12,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:12,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:12,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:12,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:12,429 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:12,429 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:12,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:12,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:12,430 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:12,430 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:12,430 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:12,430 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:12,430 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:12,430 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:12,430 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:12,430 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:12,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:12,432 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:12,432 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:12,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:12,433 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:12,433 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:12,506 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:12,507 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:12,507 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:12,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:12,507 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:12,507 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:12,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1186 [2022-12-06 07:29:12,507 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-06 07:29:12,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:12,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1003366818, now seen corresponding path program 1 times [2022-12-06 07:29:12,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:12,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705291523] [2022-12-06 07:29:12,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:12,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:12,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-06 07:29:12,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:12,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705291523] [2022-12-06 07:29:12,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705291523] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:12,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:12,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:12,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758659416] [2022-12-06 07:29:12,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:12,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:12,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:12,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:12,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:12,567 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:12,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:12,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:12,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:12,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:12,608 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:12,609 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:12,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:12,609 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:12,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:12,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:12,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:12,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:12,610 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:12,610 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:12,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:12,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:12,610 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:12,610 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:12,611 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:12,611 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:12,611 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:12,611 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:12,611 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:12,611 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:12,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:12,613 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:12,613 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:12,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:12,613 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:12,613 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:12,687 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:12,688 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:12,688 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:12,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:12,688 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:12,688 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:12,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1187 [2022-12-06 07:29:12,688 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-06 07:29:12,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:12,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1030148927, now seen corresponding path program 1 times [2022-12-06 07:29:12,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:12,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206228184] [2022-12-06 07:29:12,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:12,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29: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-06 07:29:12,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:12,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206228184] [2022-12-06 07:29:12,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206228184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:12,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:12,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:12,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775028359] [2022-12-06 07:29:12,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:12,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:12,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:12,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:12,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:12,750 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:12,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:12,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:12,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:12,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:12,787 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:12,787 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:12,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:12,788 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:12,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:12,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:12,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:12,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:12,788 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:12,788 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:12,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:12,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:12,789 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:12,789 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:12,789 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:12,789 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:12,789 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:12,789 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:12,790 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:12,790 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:12,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:12,792 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:12,792 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:12,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:12,792 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:12,792 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:12,873 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:12,874 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 07:29:12,874 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:12,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:12,874 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:12,874 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:12,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1188 [2022-12-06 07:29:12,874 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-06 07:29:12,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:12,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1060625120, now seen corresponding path program 1 times [2022-12-06 07:29:12,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:12,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340362901] [2022-12-06 07:29:12,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:12,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:12,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-06 07:29:12,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:12,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340362901] [2022-12-06 07:29:12,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340362901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:12,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:12,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:12,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136398310] [2022-12-06 07:29:12,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:12,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:12,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:12,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:12,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:12,934 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:12,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:12,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:12,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:12,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:12,976 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:12,977 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:12,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:12,977 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:12,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:12,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:12,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:12,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:12,978 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:12,978 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:12,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:12,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:12,978 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:12,978 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:12,978 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:12,979 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:12,979 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:12,979 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:12,979 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:12,979 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:12,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:12,981 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:12,981 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:12,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:12,981 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:12,981 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:13,054 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:13,055 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:13,055 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:13,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:13,055 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:13,055 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:13,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1189 [2022-12-06 07:29:13,055 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-06 07:29:13,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:13,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1087407229, now seen corresponding path program 1 times [2022-12-06 07:29:13,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:13,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304227331] [2022-12-06 07:29:13,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:13,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:13,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-06 07:29:13,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:13,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304227331] [2022-12-06 07:29:13,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304227331] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:13,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:13,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:13,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476368103] [2022-12-06 07:29:13,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:13,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:13,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:13,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:13,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:13,117 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:13,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:13,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:13,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:13,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:13,153 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:13,153 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:13,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:13,153 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:13,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:13,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:13,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:13,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:13,154 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:13,154 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:13,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:13,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:13,155 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:13,155 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:13,155 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:13,155 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:13,156 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:13,156 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:13,156 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:13,156 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:13,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:13,158 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:13,158 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:13,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:13,159 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:13,159 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:13,232 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:13,233 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:13,233 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:13,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:13,233 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:13,233 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:13,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1190 [2022-12-06 07:29:13,233 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-06 07:29:13,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:13,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1117883422, now seen corresponding path program 1 times [2022-12-06 07:29:13,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:13,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822660852] [2022-12-06 07:29:13,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:13,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:13,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:13,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-06 07:29:13,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:13,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822660852] [2022-12-06 07:29:13,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822660852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:13,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:13,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:13,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101670258] [2022-12-06 07:29:13,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:13,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:13,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:13,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:13,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:13,292 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:13,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:13,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:13,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:13,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:13,336 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:13,336 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:13,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:13,336 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:13,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:13,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:13,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:13,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:13,337 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:13,337 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:13,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:13,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:13,338 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:13,338 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:13,338 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:13,338 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:13,338 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:13,338 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:13,338 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:13,338 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:13,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:13,340 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:13,341 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:13,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:13,341 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:13,341 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:13,415 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:13,416 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:13,416 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:13,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:13,416 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:13,416 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:13,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1191 [2022-12-06 07:29:13,416 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-06 07:29:13,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:13,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1144665531, now seen corresponding path program 1 times [2022-12-06 07:29:13,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:13,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91282890] [2022-12-06 07:29:13,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:13,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:13,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-06 07:29:13,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:13,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91282890] [2022-12-06 07:29:13,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91282890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:13,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:13,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:13,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627729409] [2022-12-06 07:29:13,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:13,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:13,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:13,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:13,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:13,479 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:13,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:13,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:13,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:13,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:13,514 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:13,514 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:13,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:13,515 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:13,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:13,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:13,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:13,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:13,516 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:13,516 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:13,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:13,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:13,516 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:13,516 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:13,516 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:13,517 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:13,517 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:13,517 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:13,517 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:13,517 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:13,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:13,519 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:13,519 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:13,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:13,519 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:13,519 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:13,593 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:13,594 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:13,594 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:13,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:13,594 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:13,594 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:13,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1192 [2022-12-06 07:29:13,594 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-06 07:29:13,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:13,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1175141724, now seen corresponding path program 1 times [2022-12-06 07:29:13,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:13,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135460468] [2022-12-06 07:29:13,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:13,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:13,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-06 07:29:13,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:13,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135460468] [2022-12-06 07:29:13,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135460468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:13,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:13,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:13,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063571829] [2022-12-06 07:29:13,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:13,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:13,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:13,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:13,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:13,655 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:13,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:13,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:13,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:13,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:13,692 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:13,692 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:13,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:13,692 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:13,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:13,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:13,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:13,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:13,693 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:13,693 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:13,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:13,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:13,694 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:13,694 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:13,694 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:13,694 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:13,694 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:13,694 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:13,694 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:13,694 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:13,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:13,696 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:13,697 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:13,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:13,697 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:13,697 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:13,773 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:13,774 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:29:13,774 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:13,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:13,774 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:13,774 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:13,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1193 [2022-12-06 07:29:13,774 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-06 07:29:13,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:13,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1201923833, now seen corresponding path program 1 times [2022-12-06 07:29:13,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:13,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716926334] [2022-12-06 07:29:13,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:13,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29: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-06 07:29:13,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:13,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716926334] [2022-12-06 07:29:13,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716926334] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:13,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:13,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:13,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8002382] [2022-12-06 07:29:13,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:13,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:13,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:13,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:13,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:13,848 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:13,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:13,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:13,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:13,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:13,889 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:13,890 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:13,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:13,890 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:13,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:13,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:13,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:13,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:13,891 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:13,891 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:13,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:13,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:13,892 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:13,892 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:13,892 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:13,892 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:13,892 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:13,892 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:13,892 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:13,892 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:13,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:13,895 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:13,896 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:13,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:13,896 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:13,896 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:13,973 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:13,974 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:29:13,974 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:13,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:13,974 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:13,974 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:13,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1194 [2022-12-06 07:29:13,974 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-06 07:29:13,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:13,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1232400026, now seen corresponding path program 1 times [2022-12-06 07:29:13,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:13,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905891089] [2022-12-06 07:29:13,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:13,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:14,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-06 07:29:14,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:14,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905891089] [2022-12-06 07:29:14,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905891089] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:14,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:14,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:14,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101177453] [2022-12-06 07:29:14,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:14,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:14,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:14,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:14,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:14,032 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:14,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:14,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:14,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:14,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:14,082 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:14,082 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:14,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:14,082 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:14,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:14,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:14,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:14,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:14,083 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:14,083 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:14,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:14,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:14,084 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:14,084 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:14,084 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:14,084 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:14,084 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:14,084 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:14,084 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:14,084 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:14,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:14,086 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:14,087 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:14,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:14,087 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:14,087 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:14,161 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:14,162 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:14,162 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:14,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:14,162 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:14,162 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:14,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1195 [2022-12-06 07:29:14,162 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-06 07:29:14,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:14,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1259182135, now seen corresponding path program 1 times [2022-12-06 07:29:14,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:14,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101282319] [2022-12-06 07:29:14,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:14,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:14,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:14,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:14,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101282319] [2022-12-06 07:29:14,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101282319] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:14,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:14,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:14,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519970532] [2022-12-06 07:29:14,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:14,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:14,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:14,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:14,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:14,224 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:14,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:14,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:14,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:14,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:14,264 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:14,264 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:14,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:14,264 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:14,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:14,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:14,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:14,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:14,265 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:14,265 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:14,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:14,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:14,266 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:14,266 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:14,266 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:14,266 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:14,266 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:14,266 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:14,266 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:14,266 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:14,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:14,268 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:14,268 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:14,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:14,269 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:14,269 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:14,343 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:14,343 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:14,343 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:14,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:14,343 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:14,343 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:14,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1196 [2022-12-06 07:29:14,344 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-06 07:29:14,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:14,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1289658328, now seen corresponding path program 1 times [2022-12-06 07:29:14,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:14,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750372180] [2022-12-06 07:29:14,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:14,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:14,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-06 07:29:14,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:14,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750372180] [2022-12-06 07:29:14,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750372180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:14,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:14,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:14,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115906163] [2022-12-06 07:29:14,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:14,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:14,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:14,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:14,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:14,404 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:14,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:14,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:14,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:14,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:14,451 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:14,452 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:14,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:14,452 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:14,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:14,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:14,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:14,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:14,453 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:14,453 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:14,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:14,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:14,454 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:14,454 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:14,454 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:14,454 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:14,455 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:14,455 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:14,455 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:14,455 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:14,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:14,458 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:14,458 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:14,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:14,459 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:14,459 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:14,549 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:14,550 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:29:14,550 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:14,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:14,550 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:14,550 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:14,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1197 [2022-12-06 07:29:14,550 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-06 07:29:14,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:14,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1316440437, now seen corresponding path program 1 times [2022-12-06 07:29:14,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:14,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865707572] [2022-12-06 07:29:14,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:14,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:14,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:14,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:14,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865707572] [2022-12-06 07:29:14,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865707572] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:14,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:14,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:14,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724330885] [2022-12-06 07:29:14,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:14,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:14,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:14,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:14,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:14,613 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:14,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:14,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:14,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:14,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:14,649 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:14,649 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:14,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:14,650 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:14,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:14,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:14,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:14,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:14,650 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:14,650 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:14,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:14,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:14,651 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:14,651 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:14,651 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:14,651 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:14,651 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:14,651 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:14,651 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:14,651 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:14,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:14,654 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:14,654 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:14,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:14,654 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:14,654 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:14,727 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:14,728 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:14,728 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:14,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:14,728 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:14,728 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:14,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1198 [2022-12-06 07:29:14,728 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-06 07:29:14,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:14,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1346916630, now seen corresponding path program 1 times [2022-12-06 07:29:14,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:14,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716766628] [2022-12-06 07:29:14,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:14,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:14,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-06 07:29:14,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:14,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716766628] [2022-12-06 07:29:14,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716766628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:14,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:14,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:14,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493014094] [2022-12-06 07:29:14,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:14,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:14,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:14,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:14,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:14,787 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:14,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:14,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:14,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:14,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:14,837 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:14,837 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:14,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:14,837 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:14,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:14,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:14,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:14,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:14,838 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:14,838 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:14,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:14,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:14,839 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:14,839 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:14,839 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:14,839 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:14,839 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:14,839 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:14,839 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:14,839 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:14,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:14,841 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:14,841 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:14,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:14,842 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:14,842 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:14,915 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:14,916 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:14,916 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:14,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:14,916 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:14,916 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:14,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1199 [2022-12-06 07:29:14,916 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-06 07:29:14,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:14,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1373698739, now seen corresponding path program 1 times [2022-12-06 07:29:14,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:14,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590184732] [2022-12-06 07:29:14,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:14,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:14,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-06 07:29:14,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:14,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590184732] [2022-12-06 07:29:14,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590184732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:14,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:14,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:14,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026764887] [2022-12-06 07:29:14,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:14,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:14,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:14,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:14,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:14,977 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:14,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:14,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:14,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:14,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:15,018 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:15,018 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:15,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:15,019 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:15,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:15,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:15,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:15,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:15,019 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:15,019 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:15,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:15,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:15,020 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:15,020 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:15,020 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:15,020 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:15,020 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:15,021 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:15,021 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:15,021 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:15,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:15,023 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:15,023 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:15,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:15,023 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:15,023 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:15,096 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:15,097 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:15,097 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:15,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:15,097 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:15,097 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:15,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1200 [2022-12-06 07:29:15,097 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-06 07:29:15,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:15,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1404174932, now seen corresponding path program 1 times [2022-12-06 07:29:15,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:15,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514822011] [2022-12-06 07:29:15,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:15,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:15,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-06 07:29:15,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:15,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514822011] [2022-12-06 07:29:15,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514822011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:15,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:15,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:15,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540841636] [2022-12-06 07:29:15,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:15,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:15,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:15,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:15,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:15,160 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:15,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:15,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:15,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:15,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:15,201 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:15,202 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:15,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:15,202 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:15,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:15,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:15,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:15,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:15,203 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:15,203 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:15,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:15,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:15,203 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:15,203 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:15,204 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:15,204 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:15,204 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:15,204 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:15,204 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:15,204 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:15,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:15,206 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:15,206 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:15,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:15,206 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:15,206 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:15,281 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:15,282 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:15,282 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:15,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:15,282 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:15,282 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:15,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1201 [2022-12-06 07:29:15,282 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-06 07:29:15,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:15,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1430957041, now seen corresponding path program 1 times [2022-12-06 07:29:15,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:15,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754897275] [2022-12-06 07:29:15,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:15,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:15,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:15,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-06 07:29:15,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:15,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754897275] [2022-12-06 07:29:15,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754897275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:15,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:15,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:15,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569375017] [2022-12-06 07:29:15,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:15,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:15,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:15,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:15,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:15,345 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:15,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:15,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:15,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:15,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:15,381 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:15,381 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:15,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 370 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:15,382 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:15,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:15,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:15,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:15,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:15,382 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:15,382 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:15,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:15,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:15,383 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:15,383 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:15,383 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:15,383 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:15,383 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:15,383 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:15,383 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:15,383 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:15,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:15,386 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:15,386 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:15,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:15,386 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:15,386 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:15,459 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:15,459 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:15,459 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:15,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:15,459 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:15,460 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:15,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1202 [2022-12-06 07:29:15,460 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-06 07:29:15,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:15,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1461433234, now seen corresponding path program 1 times [2022-12-06 07:29:15,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:15,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262828871] [2022-12-06 07:29:15,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:15,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:15,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-06 07:29:15,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:15,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262828871] [2022-12-06 07:29:15,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262828871] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:15,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:15,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:15,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920616057] [2022-12-06 07:29:15,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:15,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:15,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:15,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:15,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:15,519 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:15,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:15,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:15,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:15,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:15,557 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:15,557 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:15,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:15,558 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:15,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:15,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:15,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:15,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:15,558 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:15,558 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:15,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:15,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:15,559 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:15,559 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:15,559 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:15,559 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:15,559 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:15,559 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:15,560 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:15,560 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:15,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:15,562 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:15,562 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:15,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:15,562 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:15,562 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:15,638 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:15,638 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:15,638 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:15,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:15,638 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:15,638 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:15,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1203 [2022-12-06 07:29:15,639 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-06 07:29:15,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:15,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1488215343, now seen corresponding path program 1 times [2022-12-06 07:29:15,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:15,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29701018] [2022-12-06 07:29:15,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:15,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:15,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-06 07:29:15,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:15,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29701018] [2022-12-06 07:29:15,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29701018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:15,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:15,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:15,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291387973] [2022-12-06 07:29:15,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:15,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:15,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:15,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:15,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:15,700 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:15,700 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:15,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:15,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:15,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:15,742 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:15,742 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:15,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:15,742 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:15,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:15,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:15,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:15,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:15,743 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:15,743 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:15,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:15,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:15,744 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:15,744 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:15,744 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:15,744 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:15,744 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:15,744 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:15,744 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:15,744 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:15,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:15,746 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:15,746 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:15,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:15,747 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:15,747 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:15,821 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:15,821 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:15,821 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:15,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:15,821 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:15,821 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:15,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1204 [2022-12-06 07:29:15,822 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-06 07:29:15,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:15,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1518691536, now seen corresponding path program 1 times [2022-12-06 07:29:15,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:15,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053974879] [2022-12-06 07:29:15,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:15,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:15,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-06 07:29:15,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:15,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053974879] [2022-12-06 07:29:15,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053974879] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:15,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:15,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:15,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858812193] [2022-12-06 07:29:15,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:15,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:15,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:15,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:15,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:15,897 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:15,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:15,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:15,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:15,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:15,940 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:15,941 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:15,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:15,941 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:15,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:15,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:15,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:15,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:15,942 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:15,942 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:15,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:15,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:15,942 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:15,942 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:15,943 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:15,943 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:15,943 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:15,943 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:15,943 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:15,943 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:15,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:15,945 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:15,945 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:15,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:15,945 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:15,945 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:16,022 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:16,023 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:29:16,023 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:16,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:16,023 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:16,023 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:16,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1205 [2022-12-06 07:29:16,023 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-06 07:29:16,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:16,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1545473645, now seen corresponding path program 1 times [2022-12-06 07:29:16,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:16,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162627659] [2022-12-06 07:29:16,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:16,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:16,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-06 07:29:16,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:16,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162627659] [2022-12-06 07:29:16,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162627659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:16,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:16,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:16,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271950301] [2022-12-06 07:29:16,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:16,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:16,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:16,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:16,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:16,086 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:16,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:16,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:16,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:16,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:16,122 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:16,123 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:16,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:16,123 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:16,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:16,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:16,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:16,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:16,124 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:16,124 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:16,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:16,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:16,124 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:16,124 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:16,125 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:16,125 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:16,125 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:16,125 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:16,125 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:16,125 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:16,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:16,127 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:16,127 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:16,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:16,127 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:16,128 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:16,203 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:16,203 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:16,203 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:16,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:16,203 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:16,203 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:16,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1206 [2022-12-06 07:29:16,204 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-06 07:29:16,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:16,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1575949838, now seen corresponding path program 1 times [2022-12-06 07:29:16,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:16,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695272870] [2022-12-06 07:29:16,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:16,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:16,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-06 07:29:16,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:16,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695272870] [2022-12-06 07:29:16,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695272870] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:16,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:16,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:16,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732770262] [2022-12-06 07:29:16,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:16,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:16,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:16,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:16,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:16,262 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:16,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:16,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:16,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:16,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:16,304 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:16,305 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:16,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:16,305 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:16,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:16,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:16,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:16,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:16,306 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:16,306 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:16,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:16,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:16,306 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:16,306 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:16,306 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:16,307 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:16,307 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:16,307 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:16,307 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:16,307 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:16,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:16,309 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:16,309 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:16,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:16,309 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:16,309 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:16,382 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:16,383 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:16,383 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:16,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:16,383 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:16,383 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:16,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1207 [2022-12-06 07:29:16,383 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-06 07:29:16,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:16,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1602731947, now seen corresponding path program 1 times [2022-12-06 07:29:16,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:16,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174471404] [2022-12-06 07:29:16,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:16,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:16,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:16,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-06 07:29:16,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:16,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174471404] [2022-12-06 07:29:16,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174471404] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:16,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:16,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:16,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272908817] [2022-12-06 07:29:16,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:16,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:16,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:16,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:16,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:16,442 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:16,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:16,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:16,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:16,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:16,482 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:16,482 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:16,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:16,482 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:16,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:16,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:16,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:16,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:16,483 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:16,483 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:16,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:16,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:16,484 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:16,484 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:16,484 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:16,484 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:16,484 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:16,484 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:16,484 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:16,484 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:16,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:16,486 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:16,486 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:16,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:16,487 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:16,487 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:16,561 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:16,561 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:16,561 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:16,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:16,561 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:16,562 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:16,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1208 [2022-12-06 07:29:16,562 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-06 07:29:16,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:16,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1633208140, now seen corresponding path program 1 times [2022-12-06 07:29:16,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:16,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469602456] [2022-12-06 07:29:16,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:16,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:16,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-06 07:29:16,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:16,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469602456] [2022-12-06 07:29:16,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469602456] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:16,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:16,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:16,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060765632] [2022-12-06 07:29:16,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:16,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:16,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:16,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:16,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:16,620 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:16,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:16,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:16,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:16,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:16,662 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:16,662 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:16,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:16,663 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:16,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:16,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:16,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:16,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:16,663 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:16,663 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:16,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:16,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:16,664 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:16,664 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:16,664 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:16,664 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:16,664 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:16,665 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:16,665 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:16,665 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:16,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:16,667 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:16,667 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:16,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:16,667 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:16,667 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:16,745 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:16,746 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:29:16,746 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:16,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:16,746 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:16,746 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:16,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1209 [2022-12-06 07:29:16,746 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-06 07:29:16,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:16,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1659990249, now seen corresponding path program 1 times [2022-12-06 07:29:16,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:16,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107138467] [2022-12-06 07:29:16,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:16,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:16,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-06 07:29:16,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:16,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107138467] [2022-12-06 07:29:16,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107138467] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:16,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:16,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:16,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2737441] [2022-12-06 07:29:16,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:16,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:16,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:16,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:16,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:16,819 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:16,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:16,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:16,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:16,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:16,862 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:16,862 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:16,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:16,862 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:16,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:16,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:16,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:16,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:16,863 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:16,863 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:16,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:16,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:16,864 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:16,864 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:16,864 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:16,864 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:16,864 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:16,864 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:16,864 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:16,864 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:16,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:16,866 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:16,866 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:16,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:16,867 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:16,867 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:16,942 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:16,942 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:16,942 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:16,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:16,943 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:16,943 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:16,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1210 [2022-12-06 07:29:16,943 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-06 07:29:16,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:16,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1690466442, now seen corresponding path program 1 times [2022-12-06 07:29:16,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:16,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013013544] [2022-12-06 07:29:16,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:16,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:17,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:17,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:17,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013013544] [2022-12-06 07:29:17,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013013544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:17,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:17,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:17,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286669586] [2022-12-06 07:29:17,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:17,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:17,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:17,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:17,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:17,003 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:17,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:17,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:17,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:17,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:17,039 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:17,039 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:17,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:17,039 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:17,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:17,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:17,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:17,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:17,040 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:17,040 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:17,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:17,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:17,041 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:17,041 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:17,041 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:17,041 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:17,041 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:17,041 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:17,041 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:17,041 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:17,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:17,043 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:17,043 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:17,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:17,044 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:17,044 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:17,119 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:17,120 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:17,120 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:17,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:17,120 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:17,120 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:17,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1211 [2022-12-06 07:29:17,120 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-06 07:29:17,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:17,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1717248551, now seen corresponding path program 1 times [2022-12-06 07:29:17,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:17,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430618544] [2022-12-06 07:29:17,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:17,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:17,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-06 07:29:17,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:17,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430618544] [2022-12-06 07:29:17,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430618544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:17,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:17,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:17,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696910264] [2022-12-06 07:29:17,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:17,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:17,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:17,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:17,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:17,184 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:17,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:17,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:17,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:17,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:17,220 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:17,220 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:17,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:17,220 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:17,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:17,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:17,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:17,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:17,221 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:17,221 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:17,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:17,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:17,222 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:17,222 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:17,222 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:17,222 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:17,222 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:17,222 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:17,222 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:17,222 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:17,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:17,224 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:17,224 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:17,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:17,225 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:17,225 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:17,298 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:17,299 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:17,299 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:17,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:17,299 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:17,299 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:17,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1212 [2022-12-06 07:29:17,299 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-06 07:29:17,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:17,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1747724744, now seen corresponding path program 1 times [2022-12-06 07:29:17,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:17,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682604212] [2022-12-06 07:29:17,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:17,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:17,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-06 07:29:17,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:17,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682604212] [2022-12-06 07:29:17,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682604212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:17,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:17,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:17,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733709591] [2022-12-06 07:29:17,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:17,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:17,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:17,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:17,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:17,361 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:17,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:17,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:17,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:17,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:17,398 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:17,398 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:17,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:17,399 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:17,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:17,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:17,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:17,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:17,400 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:17,400 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:17,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:17,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:17,400 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:17,400 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:17,400 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:17,401 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:17,401 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:17,401 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:17,401 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:17,401 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:17,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:17,403 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:17,403 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:17,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:17,403 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:17,403 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:17,476 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:17,477 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:17,477 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:17,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:17,477 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:17,477 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:17,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1213 [2022-12-06 07:29:17,477 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-06 07:29:17,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:17,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1774506853, now seen corresponding path program 1 times [2022-12-06 07:29:17,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:17,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724039161] [2022-12-06 07:29:17,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:17,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:17,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:17,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-06 07:29:17,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:17,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724039161] [2022-12-06 07:29:17,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724039161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:17,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:17,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:17,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213560467] [2022-12-06 07:29:17,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:17,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:17,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:17,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:17,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:17,541 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:17,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:17,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:17,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:17,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:17,578 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:17,578 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:17,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:17,579 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:17,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:17,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:17,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:17,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:17,580 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:17,580 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:17,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:17,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:17,580 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:17,580 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:17,580 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:17,581 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:17,581 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:17,581 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:17,581 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:17,581 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:17,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:17,583 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:17,583 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:17,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:17,583 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:17,583 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:17,658 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:17,659 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:17,659 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:17,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:17,659 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:17,659 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:17,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1214 [2022-12-06 07:29:17,659 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-06 07:29:17,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:17,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1804983046, now seen corresponding path program 1 times [2022-12-06 07:29:17,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:17,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555906500] [2022-12-06 07:29:17,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:17,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:17,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-06 07:29:17,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:17,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555906500] [2022-12-06 07:29:17,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555906500] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:17,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:17,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:17,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791725104] [2022-12-06 07:29:17,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:17,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:17,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:17,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:17,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:17,720 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:17,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:17,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:17,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:17,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:17,771 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:17,771 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:17,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:17,772 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:17,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:17,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:17,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:17,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:17,772 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:17,772 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:17,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:17,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:17,773 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:17,773 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:17,773 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:17,773 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:17,773 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:17,773 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:17,774 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:17,774 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:17,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:17,776 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:17,776 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:17,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:17,776 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:17,776 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:17,851 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:17,851 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:17,851 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:17,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:17,851 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:17,852 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:17,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1215 [2022-12-06 07:29:17,852 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-06 07:29:17,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:17,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1831765155, now seen corresponding path program 1 times [2022-12-06 07:29:17,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:17,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384473272] [2022-12-06 07:29:17,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:17,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:17,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-06 07:29:17,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:17,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384473272] [2022-12-06 07:29:17,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384473272] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:17,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:17,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:17,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980045052] [2022-12-06 07:29:17,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:17,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:17,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:17,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:17,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:17,915 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:17,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:17,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:17,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:17,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:17,952 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:17,953 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:17,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:17,953 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:17,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:17,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:17,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:17,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:17,954 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:17,954 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:17,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:17,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:17,954 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:17,955 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:17,955 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:17,955 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:17,955 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:17,955 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:17,955 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:17,955 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:17,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:17,957 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:17,957 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:17,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:17,958 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:17,958 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:18,034 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:18,034 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:18,034 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:18,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:18,035 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:18,035 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:18,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1216 [2022-12-06 07:29:18,035 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-06 07:29:18,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:18,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1862241348, now seen corresponding path program 1 times [2022-12-06 07:29:18,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:18,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437944455] [2022-12-06 07:29:18,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:18,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:18,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-06 07:29:18,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:18,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437944455] [2022-12-06 07:29:18,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437944455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:18,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:18,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:18,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910660376] [2022-12-06 07:29:18,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:18,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:18,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:18,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:18,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:18,095 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:18,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:18,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:18,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:18,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:18,132 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:18,133 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:18,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:18,133 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:18,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:18,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:18,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:18,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:18,134 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:18,134 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:18,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:18,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:18,134 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:18,134 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:18,135 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:18,135 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:18,135 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:18,135 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:18,135 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:18,135 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:18,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:18,137 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:18,137 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:18,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:18,137 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:18,137 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:18,213 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:18,214 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:18,214 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:18,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:18,214 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:18,214 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:18,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1217 [2022-12-06 07:29:18,214 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-06 07:29:18,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:18,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1889023457, now seen corresponding path program 1 times [2022-12-06 07:29:18,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:18,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250248214] [2022-12-06 07:29:18,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:18,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:18,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-06 07:29:18,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:18,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250248214] [2022-12-06 07:29:18,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250248214] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:18,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:18,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:18,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260296060] [2022-12-06 07:29:18,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:18,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:18,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:18,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:18,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:18,279 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:18,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:18,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:18,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:18,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:18,318 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:18,318 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:18,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:18,319 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:18,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:18,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:18,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:18,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:18,319 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:18,319 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:18,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:18,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:18,320 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:18,320 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:18,320 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:18,320 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:18,320 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:18,320 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:18,320 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:18,320 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:18,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:18,323 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:18,323 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:18,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:18,323 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:18,323 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:18,397 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:18,398 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:18,398 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:18,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:18,398 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:18,398 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:18,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1218 [2022-12-06 07:29:18,398 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-06 07:29:18,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:18,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1919499650, now seen corresponding path program 1 times [2022-12-06 07:29:18,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:18,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614782447] [2022-12-06 07:29:18,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:18,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:18,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:18,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:18,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614782447] [2022-12-06 07:29:18,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614782447] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:18,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:18,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:18,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550308981] [2022-12-06 07:29:18,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:18,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:18,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:18,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:18,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:18,458 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:18,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:18,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:18,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:18,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:18,500 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:18,500 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:18,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:18,501 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:18,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:18,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:18,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:18,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:18,501 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:18,501 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:18,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:18,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:18,502 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:18,502 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:18,502 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:18,502 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:18,502 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:18,502 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:18,502 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:18,502 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:18,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:18,505 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:18,505 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:18,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:18,505 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:18,505 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:18,579 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:18,580 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:18,580 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:18,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:18,580 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:18,580 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:18,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1219 [2022-12-06 07:29:18,580 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-06 07:29:18,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:18,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1946281759, now seen corresponding path program 1 times [2022-12-06 07:29:18,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:18,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068426844] [2022-12-06 07:29:18,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:18,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:18,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-06 07:29:18,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:18,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068426844] [2022-12-06 07:29:18,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068426844] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:18,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:18,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:18,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445985522] [2022-12-06 07:29:18,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:18,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:18,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:18,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:18,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:18,642 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:18,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:18,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:18,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:18,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:18,684 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:18,684 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:18,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:18,684 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:18,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:18,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:18,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:18,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:18,685 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:18,685 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:18,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:18,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:18,685 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:18,685 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:18,686 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:18,686 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:18,686 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:18,686 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:18,686 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:18,686 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:18,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:18,688 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:18,688 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:18,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:18,688 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:18,688 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:18,765 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:18,766 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:29:18,766 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:18,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:18,766 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:18,766 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:18,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1220 [2022-12-06 07:29:18,766 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-06 07:29:18,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:18,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1976757952, now seen corresponding path program 1 times [2022-12-06 07:29:18,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:18,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081006351] [2022-12-06 07:29:18,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:18,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:18,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-06 07:29:18,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:18,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081006351] [2022-12-06 07:29:18,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081006351] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:18,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:18,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:18,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476002524] [2022-12-06 07:29:18,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:18,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:18,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:18,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:18,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:18,837 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:18,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:18,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:18,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:18,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:18,874 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:18,874 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:18,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:18,875 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:18,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:18,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:18,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:18,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:18,875 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:18,875 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:18,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:18,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:18,876 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:18,876 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:18,876 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:18,876 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:18,876 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:18,876 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:18,877 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:18,877 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:18,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:18,879 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:18,879 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:18,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:18,879 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:18,879 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:18,953 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:18,954 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:18,954 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:18,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:18,954 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:18,954 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:18,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1221 [2022-12-06 07:29:18,954 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-06 07:29:18,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:18,954 INFO L85 PathProgramCache]: Analyzing trace with hash 2003540061, now seen corresponding path program 1 times [2022-12-06 07:29:18,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:18,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190000664] [2022-12-06 07:29:18,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:18,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:19,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-06 07:29:19,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:19,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190000664] [2022-12-06 07:29:19,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190000664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:19,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:19,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:19,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705306263] [2022-12-06 07:29:19,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:19,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:19,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:19,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:19,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:19,016 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:19,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:19,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:19,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:19,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:19,051 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:19,051 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:19,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:19,052 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:19,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:19,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:19,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:19,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:19,052 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:19,052 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:19,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:19,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:19,053 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:19,053 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:19,053 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:19,053 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:19,053 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:19,053 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:19,053 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:19,053 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:19,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:19,055 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:19,056 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:19,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:19,056 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:19,056 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:19,130 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:19,131 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:19,131 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:19,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:19,131 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:19,131 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:19,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1222 [2022-12-06 07:29:19,131 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-06 07:29:19,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:19,131 INFO L85 PathProgramCache]: Analyzing trace with hash 2034016254, now seen corresponding path program 1 times [2022-12-06 07:29:19,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:19,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992671327] [2022-12-06 07:29:19,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:19,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:19,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-06 07:29:19,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:19,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992671327] [2022-12-06 07:29:19,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992671327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:19,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:19,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:19,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321245928] [2022-12-06 07:29:19,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:19,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:19,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:19,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:19,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:19,190 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:19,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:19,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:19,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:19,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:19,233 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:19,233 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:19,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:19,233 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:19,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:19,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:19,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:19,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:19,234 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:19,234 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:19,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:19,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:19,235 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:19,235 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:19,235 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:19,235 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:19,235 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:19,235 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:19,235 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:19,235 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:19,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:19,237 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:19,237 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:19,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:19,238 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:19,238 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:19,313 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:19,313 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:19,313 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:19,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:19,313 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:19,313 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:19,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1223 [2022-12-06 07:29:19,314 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-06 07:29:19,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:19,314 INFO L85 PathProgramCache]: Analyzing trace with hash 2060798363, now seen corresponding path program 1 times [2022-12-06 07:29:19,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:19,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872160120] [2022-12-06 07:29:19,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:19,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:19,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-06 07:29:19,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:19,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872160120] [2022-12-06 07:29:19,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872160120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:19,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:19,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:19,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901862257] [2022-12-06 07:29:19,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:19,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:19,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:19,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:19,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:19,377 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:19,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:19,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:19,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:19,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:19,418 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:19,419 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:19,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:19,419 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:19,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:19,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:19,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:19,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:19,420 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:19,420 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:19,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:19,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:19,420 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:19,420 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:19,421 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:19,421 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:19,421 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:19,421 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:19,421 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:19,421 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:19,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:19,423 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:19,423 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:19,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:19,423 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:19,423 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:19,497 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:19,498 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:19,498 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:19,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:19,498 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:19,498 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:19,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1224 [2022-12-06 07:29:19,498 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-06 07:29:19,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:19,499 INFO L85 PathProgramCache]: Analyzing trace with hash 2091274556, now seen corresponding path program 1 times [2022-12-06 07:29:19,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:19,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830508498] [2022-12-06 07:29:19,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:19,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:19,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-06 07:29:19,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:19,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830508498] [2022-12-06 07:29:19,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830508498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:19,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:19,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:19,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715145647] [2022-12-06 07:29:19,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:19,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:19,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:19,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:19,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:19,562 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:19,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:19,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:19,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:19,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:19,606 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:19,606 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:19,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:19,606 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:19,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:19,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:19,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:19,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:19,607 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:19,607 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:19,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:19,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:19,608 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:19,608 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:19,608 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:19,608 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:19,608 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:19,608 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:19,608 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:19,608 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:19,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:19,610 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:19,610 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:19,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:19,611 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:19,611 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:19,686 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:19,686 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:19,686 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:19,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:19,686 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:19,687 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:19,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1225 [2022-12-06 07:29:19,687 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-06 07:29:19,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:19,687 INFO L85 PathProgramCache]: Analyzing trace with hash 2118056665, now seen corresponding path program 1 times [2022-12-06 07:29:19,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:19,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969575575] [2022-12-06 07:29:19,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:19,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:19,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:19,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:19,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969575575] [2022-12-06 07:29:19,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969575575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:19,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:19,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:19,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835421898] [2022-12-06 07:29:19,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:19,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:19,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:19,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:19,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:19,762 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:19,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:19,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:19,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:19,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:19,803 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:19,803 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:19,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:19,804 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:19,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:19,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:19,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:19,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:19,804 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:19,804 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:19,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:19,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:19,805 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:19,805 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:19,805 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:19,805 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:19,805 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:19,806 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:19,806 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:19,806 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:19,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:19,808 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:19,808 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:19,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:19,808 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:19,808 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:19,883 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:19,884 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:19,884 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:19,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:19,884 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:19,884 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:19,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1226 [2022-12-06 07:29:19,884 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-06 07:29:19,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:19,884 INFO L85 PathProgramCache]: Analyzing trace with hash -2146434438, now seen corresponding path program 1 times [2022-12-06 07:29:19,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:19,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944690101] [2022-12-06 07:29:19,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:19,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:19,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-06 07:29:19,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:19,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944690101] [2022-12-06 07:29:19,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944690101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:19,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:19,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:19,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107117416] [2022-12-06 07:29:19,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:19,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:19,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:19,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:19,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:19,943 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:19,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:19,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:19,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:19,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:19,987 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:19,987 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:19,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:19,987 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:19,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:19,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:19,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:19,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:19,988 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:19,988 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:19,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:19,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:19,989 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:19,989 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:19,989 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:19,989 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:19,989 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:19,989 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:19,989 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:19,989 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:19,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:19,992 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:19,992 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:19,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 116 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:19,992 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:19,992 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:20,068 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:20,069 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:29:20,069 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:20,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:20,069 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:20,069 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:20,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1227 [2022-12-06 07:29:20,069 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-06 07:29:20,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:20,069 INFO L85 PathProgramCache]: Analyzing trace with hash -2119652329, now seen corresponding path program 1 times [2022-12-06 07:29:20,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:20,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809698256] [2022-12-06 07:29:20,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:20,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:20,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-06 07:29:20,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:20,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809698256] [2022-12-06 07:29:20,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809698256] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:20,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:20,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:20,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114236229] [2022-12-06 07:29:20,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:20,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:20,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:20,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:20,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:20,140 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:20,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:20,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:20,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:20,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:20,183 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:20,183 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:20,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:20,184 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:20,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:20,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:20,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:20,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:20,184 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:20,184 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:20,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:20,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:20,185 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:20,185 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:20,186 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:20,186 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:20,186 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:20,186 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:20,186 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:20,186 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:20,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:20,189 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:20,189 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:20,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:20,189 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:20,189 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:20,264 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:20,264 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:20,264 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:20,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:20,265 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:20,265 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:20,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1228 [2022-12-06 07:29:20,265 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-06 07:29:20,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:20,265 INFO L85 PathProgramCache]: Analyzing trace with hash -2089176136, now seen corresponding path program 1 times [2022-12-06 07:29:20,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:20,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324335783] [2022-12-06 07:29:20,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:20,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:20,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-06 07:29:20,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:20,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324335783] [2022-12-06 07:29:20,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324335783] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:20,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:20,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:20,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041655329] [2022-12-06 07:29:20,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:20,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:20,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:20,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:20,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:20,323 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:20,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:20,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:20,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:20,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:20,366 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:20,366 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:20,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:20,367 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:20,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:20,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:20,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:20,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:20,368 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:20,368 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:20,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:20,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:20,368 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:20,368 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:20,368 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:20,369 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:20,369 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:20,369 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:20,369 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:20,369 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:20,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:20,371 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:20,371 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:20,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:20,371 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:20,372 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:20,447 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:20,448 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:20,448 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:20,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:20,448 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:20,448 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:20,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1229 [2022-12-06 07:29:20,448 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-06 07:29:20,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:20,448 INFO L85 PathProgramCache]: Analyzing trace with hash -2062394027, now seen corresponding path program 1 times [2022-12-06 07:29:20,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:20,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18389071] [2022-12-06 07:29:20,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:20,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:20,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-06 07:29:20,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:20,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18389071] [2022-12-06 07:29:20,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18389071] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:20,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:20,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:20,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401178614] [2022-12-06 07:29:20,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:20,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:20,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:20,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:20,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:20,511 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:20,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:20,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:20,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:20,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:20,548 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:20,548 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:20,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 354 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:20,548 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:20,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:20,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:20,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:20,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:20,549 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:20,549 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:20,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:20,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:20,549 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:20,550 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:20,550 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:20,550 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:20,550 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:20,550 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:20,550 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:20,550 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:20,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:20,552 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:20,552 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:20,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:20,553 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:20,553 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:20,629 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:20,630 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:29:20,630 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:20,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:20,630 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:20,630 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:20,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1230 [2022-12-06 07:29:20,630 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-06 07:29:20,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:20,630 INFO L85 PathProgramCache]: Analyzing trace with hash -2031917834, now seen corresponding path program 1 times [2022-12-06 07:29:20,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:20,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867197846] [2022-12-06 07:29:20,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:20,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:20,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:20,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:20,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867197846] [2022-12-06 07:29:20,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867197846] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:20,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:20,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:20,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035855389] [2022-12-06 07:29:20,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:20,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:20,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:20,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:20,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:20,691 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:20,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:20,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:20,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:20,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:20,739 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:20,739 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:20,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:20,739 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:20,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:20,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:20,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:20,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:20,740 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:20,740 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:20,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:20,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:20,740 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:20,741 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:20,741 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:20,741 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:20,741 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:20,741 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:20,741 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:20,741 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:20,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:20,743 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:20,743 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:20,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:20,744 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:20,744 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:20,820 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:20,821 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:29:20,821 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:20,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:20,821 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:20,821 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:20,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1231 [2022-12-06 07:29:20,821 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-06 07:29:20,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:20,822 INFO L85 PathProgramCache]: Analyzing trace with hash -2005135725, now seen corresponding path program 1 times [2022-12-06 07:29:20,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:20,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920988227] [2022-12-06 07:29:20,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:20,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:20,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-06 07:29:20,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:20,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920988227] [2022-12-06 07:29:20,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920988227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:20,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:20,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:20,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578056641] [2022-12-06 07:29:20,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:20,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:20,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:20,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:20,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:20,884 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:20,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:20,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:20,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:20,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:20,926 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:20,926 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:20,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:20,926 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:20,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:20,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:20,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:20,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:20,927 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:20,927 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:20,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:20,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:20,928 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:20,928 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:20,928 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:20,928 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:20,928 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:20,928 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:20,928 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:20,928 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:20,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:20,930 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:20,930 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:20,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:20,931 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:20,931 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:21,018 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:21,019 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-06 07:29:21,019 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:21,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:21,019 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:21,019 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:21,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1232 [2022-12-06 07:29:21,019 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-06 07:29:21,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:21,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1974659532, now seen corresponding path program 1 times [2022-12-06 07:29:21,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:21,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423829231] [2022-12-06 07:29:21,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:21,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:21,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-06 07:29:21,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:21,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423829231] [2022-12-06 07:29:21,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423829231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:21,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:21,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:21,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065646932] [2022-12-06 07:29:21,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:21,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:21,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:21,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:21,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:21,081 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:21,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:21,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:21,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:21,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:21,120 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:21,121 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:21,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:21,121 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:21,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:21,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:21,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:21,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:21,122 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:21,122 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:21,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:21,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:21,122 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:21,122 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:21,122 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:21,123 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:21,123 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:21,123 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:21,123 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:21,123 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:21,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:21,125 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:21,125 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:21,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:21,125 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:21,125 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:21,201 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:21,202 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:21,202 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:21,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:21,202 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:21,202 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:21,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1233 [2022-12-06 07:29:21,202 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-06 07:29:21,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:21,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1947877423, now seen corresponding path program 1 times [2022-12-06 07:29:21,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:21,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994621541] [2022-12-06 07:29:21,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:21,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:21,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-06 07:29:21,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:21,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994621541] [2022-12-06 07:29:21,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994621541] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:21,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:21,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:21,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227950968] [2022-12-06 07:29:21,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:21,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:21,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:21,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:21,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:21,264 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:21,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:21,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:21,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:21,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:21,306 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:21,306 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:21,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:21,307 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:21,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:21,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:21,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:21,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:21,307 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:21,307 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:21,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:21,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:21,308 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:21,308 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:21,308 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:21,308 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:21,308 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:21,308 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:21,308 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:21,308 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:21,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:21,311 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:21,311 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:21,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:21,311 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:21,311 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:21,387 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:21,387 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:21,387 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:21,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:21,388 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:21,388 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:21,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1234 [2022-12-06 07:29:21,388 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-06 07:29:21,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:21,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1917401230, now seen corresponding path program 1 times [2022-12-06 07:29:21,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:21,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299772645] [2022-12-06 07:29:21,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:21,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:21,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-06 07:29:21,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:21,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299772645] [2022-12-06 07:29:21,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299772645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:21,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:21,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:21,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480022988] [2022-12-06 07:29:21,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:21,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:21,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:21,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:21,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:21,449 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:21,449 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:21,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:21,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:21,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:21,493 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:21,494 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:21,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:21,494 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:21,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:21,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:21,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:21,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:21,495 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:21,495 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:21,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:21,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:21,495 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:21,495 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:21,496 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:21,496 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:21,496 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:21,496 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:21,496 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:21,496 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:21,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:21,498 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:21,498 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:21,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:21,499 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:21,499 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:21,576 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:21,576 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:29:21,576 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:21,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:21,576 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:21,576 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:21,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1235 [2022-12-06 07:29:21,576 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-06 07:29:21,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:21,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1890619121, now seen corresponding path program 1 times [2022-12-06 07:29:21,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:21,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934060163] [2022-12-06 07:29:21,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:21,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:21,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-06 07:29:21,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:21,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934060163] [2022-12-06 07:29:21,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934060163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:21,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:21,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:21,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025587026] [2022-12-06 07:29:21,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:21,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:21,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:21,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:21,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:21,640 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:21,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:21,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:21,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:21,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:21,676 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:21,677 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:21,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:21,677 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:21,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:21,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:21,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:21,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:21,678 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:21,678 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:21,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:21,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:21,678 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:21,678 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:21,679 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:21,679 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:21,679 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:21,679 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:21,679 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:21,679 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:21,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:21,681 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:21,681 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:21,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:21,682 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:21,682 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:21,758 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:21,759 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:29:21,759 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:21,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:21,759 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:21,759 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:21,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1236 [2022-12-06 07:29:21,759 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-06 07:29:21,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:21,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1860142928, now seen corresponding path program 1 times [2022-12-06 07:29:21,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:21,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900080139] [2022-12-06 07:29:21,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:21,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:21,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-06 07:29:21,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:21,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900080139] [2022-12-06 07:29:21,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900080139] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:21,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:21,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:21,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161932079] [2022-12-06 07:29:21,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:21,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:21,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:21,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:21,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:21,827 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:21,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:21,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:21,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:21,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:21,870 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:21,870 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:21,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:21,871 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:21,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:21,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:21,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:21,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:21,871 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:21,871 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:21,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:21,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:21,872 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:21,872 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:21,872 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:21,872 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:21,872 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:21,872 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:21,872 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:21,872 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:21,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:21,874 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:21,875 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:21,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:21,875 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:21,875 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:21,949 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:21,950 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:21,950 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:21,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:21,950 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:21,950 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:21,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1237 [2022-12-06 07:29:21,950 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-06 07:29:21,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:21,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1833360819, now seen corresponding path program 1 times [2022-12-06 07:29:21,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:21,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978190589] [2022-12-06 07:29:21,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:21,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:22,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-06 07:29:22,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:22,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978190589] [2022-12-06 07:29:22,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978190589] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:22,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:22,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:22,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124063721] [2022-12-06 07:29:22,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:22,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:22,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:22,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:22,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:22,014 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:22,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:22,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:22,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:22,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:22,053 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:22,054 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:22,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:22,054 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:22,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:22,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:22,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:22,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:22,055 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:22,055 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:22,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:22,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:22,055 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:22,055 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:22,056 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:22,056 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:22,056 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:22,056 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:22,056 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:22,056 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:22,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:22,058 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:22,058 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:22,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:22,058 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:22,058 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:22,132 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:22,133 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:22,133 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:22,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:22,133 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:22,133 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:22,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1238 [2022-12-06 07:29:22,133 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-06 07:29:22,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:22,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1802884626, now seen corresponding path program 1 times [2022-12-06 07:29:22,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:22,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926380536] [2022-12-06 07:29:22,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:22,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:22,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:22,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:22,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926380536] [2022-12-06 07:29:22,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926380536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:22,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:22,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:22,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811855373] [2022-12-06 07:29:22,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:22,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:22,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:22,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:22,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:22,193 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:22,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:22,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:22,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:22,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:22,229 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:22,229 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:22,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:22,230 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:22,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:22,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:22,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:22,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:22,230 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:22,230 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:22,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:22,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:22,231 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:22,231 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:22,231 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:22,231 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:22,231 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:22,232 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:22,232 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:22,232 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:22,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:22,234 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:22,234 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:22,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:22,234 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:22,234 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:22,309 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:22,310 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:22,310 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:22,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:22,310 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:22,310 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:22,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1239 [2022-12-06 07:29:22,310 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-06 07:29:22,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:22,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1776102517, now seen corresponding path program 1 times [2022-12-06 07:29:22,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:22,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552050143] [2022-12-06 07:29:22,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:22,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:22,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:22,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-06 07:29:22,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:22,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552050143] [2022-12-06 07:29:22,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552050143] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:22,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:22,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:22,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487559747] [2022-12-06 07:29:22,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:22,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:22,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:22,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:22,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:22,373 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:22,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:22,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:22,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:22,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:22,415 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:22,415 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:22,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:22,416 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:22,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:22,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:22,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:22,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:22,416 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:22,416 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:22,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:22,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:22,417 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:22,417 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:22,417 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:22,417 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:22,417 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:22,417 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:22,417 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:22,417 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:22,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:22,420 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:22,420 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:22,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:22,420 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:22,420 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:22,493 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:22,494 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:22,494 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:22,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:22,494 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:22,494 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:22,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1240 [2022-12-06 07:29:22,494 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-06 07:29:22,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:22,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1745626324, now seen corresponding path program 1 times [2022-12-06 07:29:22,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:22,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994486511] [2022-12-06 07:29:22,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:22,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:22,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-06 07:29:22,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:22,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994486511] [2022-12-06 07:29:22,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994486511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:22,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:22,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:22,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554076533] [2022-12-06 07:29:22,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:22,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:22,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:22,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:22,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:22,555 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:22,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:22,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:22,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:22,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:22,598 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:22,598 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:22,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:22,599 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:22,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:22,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:22,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:22,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:22,600 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:22,600 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:22,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:22,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:22,600 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:22,600 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:22,600 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:22,601 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:22,601 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:22,601 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:22,601 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:22,601 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:22,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:22,603 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:22,603 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:22,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:22,603 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:22,603 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:22,677 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:22,678 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:22,678 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:22,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:22,678 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:22,678 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:22,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1241 [2022-12-06 07:29:22,678 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-06 07:29:22,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:22,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1718844215, now seen corresponding path program 1 times [2022-12-06 07:29:22,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:22,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724648442] [2022-12-06 07:29:22,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:22,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:22,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-06 07:29:22,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:22,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724648442] [2022-12-06 07:29:22,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724648442] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:22,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:22,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:22,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220502410] [2022-12-06 07:29:22,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:22,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:22,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:22,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:22,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:22,753 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:22,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:22,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:22,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:22,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:22,790 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:22,790 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:22,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:22,791 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:22,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:22,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:22,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:22,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:22,791 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:22,791 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:22,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:22,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:22,792 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:22,792 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:22,792 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:22,792 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:22,792 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:22,793 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:22,793 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:22,793 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:22,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:22,795 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:22,795 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:22,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:22,795 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:22,795 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:22,870 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:22,870 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:22,871 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:22,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:22,871 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:22,871 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:22,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1242 [2022-12-06 07:29:22,871 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-06 07:29:22,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:22,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1688368022, now seen corresponding path program 1 times [2022-12-06 07:29:22,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:22,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377073437] [2022-12-06 07:29:22,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:22,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:22,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:22,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-06 07:29:22,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:22,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377073437] [2022-12-06 07:29:22,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377073437] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:22,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:22,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:22,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073179573] [2022-12-06 07:29:22,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:22,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:22,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:22,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:22,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:22,930 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:22,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:22,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:22,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:22,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:22,976 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:22,976 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:22,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:22,976 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:22,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:22,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:22,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:22,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:22,977 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:22,977 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:22,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:22,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:22,977 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:22,978 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:22,978 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:22,978 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:22,978 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:22,978 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:22,978 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:22,978 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:22,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:22,980 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:22,980 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:22,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:22,981 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:22,981 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:23,054 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:23,055 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:23,055 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:23,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:23,055 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:23,055 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:23,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1243 [2022-12-06 07:29:23,056 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-06 07:29:23,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:23,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1661585913, now seen corresponding path program 1 times [2022-12-06 07:29:23,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:23,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495767393] [2022-12-06 07:29:23,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:23,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:23,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-06 07:29:23,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:23,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495767393] [2022-12-06 07:29:23,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495767393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:23,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:23,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:23,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931576423] [2022-12-06 07:29:23,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:23,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:23,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:23,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:23,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:23,118 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:23,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:23,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:23,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:23,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:23,159 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:23,159 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:23,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:23,160 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:23,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:23,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:23,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:23,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:23,160 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:23,160 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:23,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:23,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:23,161 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:23,161 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:23,161 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:23,161 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:23,162 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:23,162 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:23,162 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:23,162 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:23,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:23,164 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:23,164 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:23,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:23,164 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:23,164 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:23,238 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:23,239 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:23,239 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:23,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:23,239 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:23,239 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:23,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1244 [2022-12-06 07:29:23,239 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-06 07:29:23,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:23,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1631109720, now seen corresponding path program 1 times [2022-12-06 07:29:23,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:23,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315735642] [2022-12-06 07:29:23,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:23,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29: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-06 07:29:23,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:23,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315735642] [2022-12-06 07:29:23,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315735642] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:23,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:23,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:23,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954783613] [2022-12-06 07:29:23,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:23,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:23,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:23,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:23,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:23,298 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:23,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:23,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:23,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:23,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:23,340 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:23,340 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:23,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:23,341 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:23,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:23,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:23,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:23,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:23,341 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:23,341 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:23,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:23,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:23,342 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:23,342 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:23,342 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:23,342 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:23,342 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:23,343 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:23,343 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:23,343 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:23,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:23,345 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:23,345 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:23,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:23,345 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:23,345 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:23,421 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:23,422 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:29:23,422 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:23,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:23,422 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:23,422 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:23,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1245 [2022-12-06 07:29:23,422 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-06 07:29:23,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:23,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1604327611, now seen corresponding path program 1 times [2022-12-06 07:29:23,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:23,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849810225] [2022-12-06 07:29:23,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:23,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:23,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-06 07:29:23,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:23,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849810225] [2022-12-06 07:29:23,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849810225] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:23,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:23,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:23,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782163335] [2022-12-06 07:29:23,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:23,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:23,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:23,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:23,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:23,486 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:23,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:23,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:23,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:23,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:23,522 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:23,522 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:23,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 356 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:23,523 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:23,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:23,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:23,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:23,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:23,523 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:23,523 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:23,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:23,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:23,524 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:23,524 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:23,524 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:23,524 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:23,524 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:23,525 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:23,525 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:23,525 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:23,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:23,527 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:23,527 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:23,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:23,527 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:23,527 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:23,601 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:23,601 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:23,602 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:23,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:23,602 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:23,602 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:23,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1246 [2022-12-06 07:29:23,602 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-06 07:29:23,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:23,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1573851418, now seen corresponding path program 1 times [2022-12-06 07:29:23,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:23,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350945236] [2022-12-06 07:29:23,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:23,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:23,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-06 07:29:23,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:23,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350945236] [2022-12-06 07:29:23,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350945236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:23,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:23,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:23,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456137493] [2022-12-06 07:29:23,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:23,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:23,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:23,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:23,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:23,661 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:23,661 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:23,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:23,661 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:23,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:23,703 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:23,703 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:23,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:23,704 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:23,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:23,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:23,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:23,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:23,704 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:23,705 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:23,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:23,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:23,705 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:23,705 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:23,705 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:23,705 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:23,705 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:23,706 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:23,706 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:23,706 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:23,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:23,717 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:23,717 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:23,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:23,717 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:23,717 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:23,794 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:23,794 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 07:29:23,794 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:23,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:23,794 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:23,795 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:23,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1247 [2022-12-06 07:29:23,795 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-06 07:29:23,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:23,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1547069309, now seen corresponding path program 1 times [2022-12-06 07:29:23,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:23,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337626065] [2022-12-06 07:29:23,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:23,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:23,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-06 07:29:23,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:23,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337626065] [2022-12-06 07:29:23,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337626065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:23,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:23,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:23,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770067557] [2022-12-06 07:29:23,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:23,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:23,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:23,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:23,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:23,858 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:23,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:23,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:23,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:23,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:23,899 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:23,900 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:23,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:23,900 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:23,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:23,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:23,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:23,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:23,901 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:23,901 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:23,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:23,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:23,901 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:23,901 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:23,902 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:23,902 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:23,902 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:23,902 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:23,902 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:23,902 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:23,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:23,904 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:23,904 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:23,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:23,904 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:23,905 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:23,981 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:23,982 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:29:23,982 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:23,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:23,982 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:23,982 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:23,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1248 [2022-12-06 07:29:23,982 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-06 07:29:23,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:23,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1516593116, now seen corresponding path program 1 times [2022-12-06 07:29:23,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:23,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330345863] [2022-12-06 07:29:23,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:23,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:24,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-06 07:29:24,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:24,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330345863] [2022-12-06 07:29:24,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330345863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:24,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:24,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:24,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263334256] [2022-12-06 07:29:24,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:24,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:24,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:24,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:24,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:24,042 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:24,042 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:24,042 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:24,042 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:24,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:24,083 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:24,083 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:24,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:24,084 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:24,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:24,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:24,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:24,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:24,084 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:24,084 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:24,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:24,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:24,085 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:24,085 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:24,085 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:24,085 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:24,085 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:24,085 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:24,085 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:24,086 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:24,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:24,088 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:24,088 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:24,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:24,088 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:24,088 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:24,163 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:24,164 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:24,164 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:24,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:24,164 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:24,164 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:24,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1249 [2022-12-06 07:29:24,164 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-06 07:29:24,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:24,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1489811007, now seen corresponding path program 1 times [2022-12-06 07:29:24,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:24,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949347160] [2022-12-06 07:29:24,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:24,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:24,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-06 07:29:24,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:24,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949347160] [2022-12-06 07:29:24,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949347160] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:24,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:24,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:24,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104822200] [2022-12-06 07:29:24,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:24,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:24,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:24,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:24,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:24,226 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:24,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:24,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:24,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:24,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:24,262 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:24,262 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:24,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:24,263 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:24,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:24,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:24,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:24,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:24,263 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:24,263 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:24,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:24,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:24,264 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:24,264 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:24,264 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:24,264 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:24,265 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:24,265 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:24,265 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:24,265 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:24,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:24,267 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:24,267 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:24,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:24,268 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:24,268 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:24,341 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:24,341 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:24,341 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:24,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:24,341 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:24,341 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:24,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1250 [2022-12-06 07:29:24,342 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-06 07:29:24,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:24,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1459334814, now seen corresponding path program 1 times [2022-12-06 07:29:24,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:24,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606397698] [2022-12-06 07:29:24,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:24,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:24,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-06 07:29:24,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:24,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606397698] [2022-12-06 07:29:24,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606397698] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:24,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:24,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:24,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205823670] [2022-12-06 07:29:24,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:24,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:24,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:24,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:24,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:24,401 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:24,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:24,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:24,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:24,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:24,438 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:24,438 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:24,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:24,439 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:24,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:24,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:24,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:24,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:24,439 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:24,439 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:24,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:24,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:24,440 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:24,440 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:24,440 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:24,440 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:24,440 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:24,441 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:24,441 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:24,441 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:24,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:24,443 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:24,443 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:24,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:24,443 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:24,443 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:24,517 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:24,517 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:24,517 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:24,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:24,518 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:24,518 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:24,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1251 [2022-12-06 07:29:24,518 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-06 07:29:24,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:24,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1432552705, now seen corresponding path program 1 times [2022-12-06 07:29:24,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:24,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902909464] [2022-12-06 07:29:24,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:24,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:24,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:24,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:24,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902909464] [2022-12-06 07:29:24,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902909464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:24,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:24,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:24,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123245560] [2022-12-06 07:29:24,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:24,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:24,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:24,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:24,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:24,583 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:24,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:24,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:24,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:24,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:24,625 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:24,625 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:24,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:24,625 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:24,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:24,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:24,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:24,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:24,626 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:24,626 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:24,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:24,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:24,627 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:24,627 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:24,627 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:24,627 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:24,627 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:24,627 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:24,627 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:24,627 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:24,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:24,629 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:24,630 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:24,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:24,630 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:24,630 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:24,706 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:24,706 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:24,706 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:24,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:24,706 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:24,707 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:24,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1252 [2022-12-06 07:29:24,707 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-06 07:29:24,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:24,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1402076512, now seen corresponding path program 1 times [2022-12-06 07:29:24,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:24,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635072880] [2022-12-06 07:29:24,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:24,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:24,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-06 07:29:24,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:24,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635072880] [2022-12-06 07:29:24,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635072880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:24,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:24,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:24,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732298259] [2022-12-06 07:29:24,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:24,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:24,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:24,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:24,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:24,777 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:24,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:24,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:24,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:24,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:24,820 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:24,820 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:24,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:24,821 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:24,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:24,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:24,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:24,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:24,821 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:24,821 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:24,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:24,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:24,822 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:24,822 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:24,822 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:24,822 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:24,822 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:24,822 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:24,822 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:24,822 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:24,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:24,825 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:24,825 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:24,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:24,825 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:24,825 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:24,899 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:24,900 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:24,900 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:24,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:24,900 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:24,900 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:24,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1253 [2022-12-06 07:29:24,900 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-06 07:29:24,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:24,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1375294403, now seen corresponding path program 1 times [2022-12-06 07:29:24,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:24,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503169489] [2022-12-06 07:29:24,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:24,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:24,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-06 07:29:24,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:24,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503169489] [2022-12-06 07:29:24,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503169489] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:24,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:24,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:24,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881197632] [2022-12-06 07:29:24,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:24,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:24,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:24,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:24,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:24,962 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:24,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:24,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:24,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:24,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:25,004 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:25,004 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:25,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:25,004 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:25,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:25,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:25,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:25,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:25,005 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:25,005 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:25,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:25,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:25,006 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:25,006 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:25,006 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:25,006 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:25,006 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:25,006 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:25,006 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:25,006 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:25,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:25,008 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:25,008 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:25,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:25,009 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:25,009 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:25,083 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:25,084 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:25,084 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:25,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:25,084 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:25,084 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:25,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1254 [2022-12-06 07:29:25,084 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-06 07:29:25,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:25,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1344818210, now seen corresponding path program 1 times [2022-12-06 07:29:25,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:25,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368853182] [2022-12-06 07:29:25,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:25,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:25,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-06 07:29:25,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:25,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368853182] [2022-12-06 07:29:25,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368853182] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:25,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:25,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:25,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351939106] [2022-12-06 07:29:25,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:25,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:25,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:25,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:25,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:25,143 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:25,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:25,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:25,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:25,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:25,180 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:25,180 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:25,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:25,180 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:25,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:25,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:25,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:25,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:25,181 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:25,181 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:25,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:25,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:25,182 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:25,182 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:25,182 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:25,182 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:25,182 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:25,182 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:25,182 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:25,182 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:25,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:25,184 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:25,184 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:25,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:25,185 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:25,185 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:25,258 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:25,259 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:25,259 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:25,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:25,259 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:25,259 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:25,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1255 [2022-12-06 07:29:25,259 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-06 07:29:25,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:25,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1318036101, now seen corresponding path program 1 times [2022-12-06 07:29:25,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:25,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627110916] [2022-12-06 07:29:25,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:25,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:25,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-06 07:29:25,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:25,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627110916] [2022-12-06 07:29:25,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627110916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:25,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:25,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:25,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877699679] [2022-12-06 07:29:25,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:25,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:25,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:25,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:25,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:25,323 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:25,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:25,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:25,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:25,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:25,365 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:25,366 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:25,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:25,366 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:25,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:25,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:25,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:25,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:25,367 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:25,367 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:25,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:25,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:25,367 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:25,367 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:25,367 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:25,368 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:25,368 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:25,368 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:25,368 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:25,368 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:25,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:25,370 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:25,370 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:25,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:25,370 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:25,370 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:25,443 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:25,444 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:25,444 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:25,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:25,444 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:25,444 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:25,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1256 [2022-12-06 07:29:25,444 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-06 07:29:25,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:25,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1287559908, now seen corresponding path program 1 times [2022-12-06 07:29:25,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:25,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505478737] [2022-12-06 07:29:25,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:25,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:25,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:25,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-06 07:29:25,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:25,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505478737] [2022-12-06 07:29:25,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505478737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:25,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:25,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:25,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188717601] [2022-12-06 07:29:25,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:25,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:25,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:25,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:25,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:25,503 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:25,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:25,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:25,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:25,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:25,544 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:25,544 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:25,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:25,545 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:25,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:25,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:25,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:25,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:25,545 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:25,545 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:25,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:25,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:25,546 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:25,546 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:25,546 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:25,546 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:25,546 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:25,546 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:25,546 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:25,546 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:25,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:25,549 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:25,549 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:25,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:25,549 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:25,549 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:25,622 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:25,622 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:25,622 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:25,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:25,623 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:25,623 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:25,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1257 [2022-12-06 07:29:25,623 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-06 07:29:25,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:25,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1260777799, now seen corresponding path program 1 times [2022-12-06 07:29:25,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:25,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544257029] [2022-12-06 07:29:25,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:25,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:25,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-06 07:29:25,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:25,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544257029] [2022-12-06 07:29:25,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544257029] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:25,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:25,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:25,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199356568] [2022-12-06 07:29:25,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:25,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:25,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:25,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:25,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:25,694 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:25,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:25,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:25,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:25,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:25,735 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:25,735 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:25,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:25,735 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:25,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:25,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:25,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:25,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:25,736 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:25,736 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:25,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:25,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:25,737 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:25,737 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:25,737 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:25,737 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:25,737 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:25,737 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:25,737 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:25,737 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:25,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:25,739 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:25,740 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:25,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:25,740 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:25,740 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:25,814 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:25,814 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:25,814 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:25,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:25,814 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:25,815 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:25,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1258 [2022-12-06 07:29:25,815 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-06 07:29:25,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:25,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1230301606, now seen corresponding path program 1 times [2022-12-06 07:29:25,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:25,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234242257] [2022-12-06 07:29:25,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:25,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:25,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:25,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-06 07:29:25,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:25,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234242257] [2022-12-06 07:29:25,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234242257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:25,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:25,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:25,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55354861] [2022-12-06 07:29:25,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:25,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:25,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:25,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:25,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:25,876 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:25,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:25,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:25,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:25,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:25,918 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:25,918 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:25,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:25,918 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:25,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:25,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:25,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:25,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:25,919 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:25,919 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:25,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:25,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:25,920 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:25,920 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:25,920 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:25,920 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:25,920 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:25,920 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:25,920 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:25,920 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:25,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:25,922 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:25,922 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:25,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:25,923 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:25,923 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:25,997 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:25,997 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:25,997 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:25,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:25,997 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:25,997 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:25,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1259 [2022-12-06 07:29:25,998 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-06 07:29:25,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:25,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1203519497, now seen corresponding path program 1 times [2022-12-06 07:29:25,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:25,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732244985] [2022-12-06 07:29:25,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:25,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:26,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-06 07:29:26,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:26,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732244985] [2022-12-06 07:29:26,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732244985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:26,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:26,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:26,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060946357] [2022-12-06 07:29:26,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:26,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:26,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:26,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:26,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:26,059 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:26,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:26,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:26,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:26,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:26,100 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:26,100 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:26,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:26,101 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:26,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:26,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:26,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:26,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:26,101 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:26,101 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:26,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:26,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:26,102 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:26,102 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:26,102 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:26,102 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:26,102 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:26,103 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:26,103 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:26,103 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:26,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:26,105 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:26,105 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:26,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:26,105 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:26,105 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:26,178 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:26,178 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:26,178 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:26,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:26,178 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:26,178 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:26,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1260 [2022-12-06 07:29:26,179 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-06 07:29:26,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:26,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1173043304, now seen corresponding path program 1 times [2022-12-06 07:29:26,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:26,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980241201] [2022-12-06 07:29:26,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:26,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:26,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-06 07:29:26,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:26,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980241201] [2022-12-06 07:29:26,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980241201] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:26,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:26,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:26,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147350868] [2022-12-06 07:29:26,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:26,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:26,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:26,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:26,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:26,244 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:26,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:26,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:26,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:26,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:26,286 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:26,286 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:26,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:26,286 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:26,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:26,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:26,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:26,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:26,287 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:26,287 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:26,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:26,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:26,287 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:26,288 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:26,288 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:26,288 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:26,288 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:26,288 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:26,288 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:26,288 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:26,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:26,290 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:26,290 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:26,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:26,291 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:26,291 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:26,366 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:26,366 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:26,366 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:26,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:26,367 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:26,367 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:26,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1261 [2022-12-06 07:29:26,367 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-06 07:29:26,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:26,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1146261195, now seen corresponding path program 1 times [2022-12-06 07:29:26,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:26,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573815043] [2022-12-06 07:29:26,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:26,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:26,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-06 07:29:26,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:26,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573815043] [2022-12-06 07:29:26,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573815043] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:26,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:26,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:26,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556892168] [2022-12-06 07:29:26,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:26,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:26,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:26,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:26,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:26,430 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:26,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:26,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:26,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:26,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:26,470 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:26,470 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:26,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 370 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:26,471 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:26,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:26,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:26,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:26,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:26,471 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:26,472 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:26,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:26,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:26,472 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:26,472 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:26,472 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:26,472 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:26,473 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:26,473 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:26,473 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:26,473 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:26,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:26,475 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:26,475 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:26,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:26,475 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:26,475 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:26,549 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:26,550 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:26,550 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:26,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:26,550 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:26,550 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:26,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1262 [2022-12-06 07:29:26,550 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-06 07:29:26,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:26,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1115785002, now seen corresponding path program 1 times [2022-12-06 07:29:26,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:26,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238472232] [2022-12-06 07:29:26,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:26,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:26,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-06 07:29:26,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:26,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238472232] [2022-12-06 07:29:26,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238472232] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:26,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:26,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:26,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790183435] [2022-12-06 07:29:26,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:26,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:26,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:26,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:26,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:26,609 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:26,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:26,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:26,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:26,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:26,651 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:26,651 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:26,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:26,651 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:26,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:26,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:26,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:26,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:26,652 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:26,652 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:26,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:26,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:26,653 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:26,653 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:26,653 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:26,653 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:26,653 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:26,653 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:26,653 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:26,653 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:26,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:26,655 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:26,663 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:26,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:26,663 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:26,663 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:26,737 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:26,737 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:29:26,738 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:26,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:26,738 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:26,738 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:26,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1263 [2022-12-06 07:29:26,738 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-06 07:29:26,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:26,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1089002893, now seen corresponding path program 1 times [2022-12-06 07:29:26,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:26,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012376424] [2022-12-06 07:29:26,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:26,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:26,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:26,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-06 07:29:26,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:26,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012376424] [2022-12-06 07:29:26,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012376424] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:26,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:26,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:26,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518669101] [2022-12-06 07:29:26,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:26,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:26,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:26,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:26,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:26,801 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:26,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:26,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:26,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:26,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:26,843 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:26,843 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:26,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:26,843 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:26,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:26,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:26,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:26,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:26,844 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:26,844 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:26,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:26,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:26,844 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:26,844 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:26,845 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:26,845 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:26,845 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:26,845 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:26,845 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:26,845 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:26,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:26,847 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:26,847 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:26,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:26,848 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:26,848 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:26,921 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:26,922 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:26,922 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:26,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:26,922 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:26,922 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:26,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1264 [2022-12-06 07:29:26,922 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-06 07:29:26,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:26,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1058526700, now seen corresponding path program 1 times [2022-12-06 07:29:26,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:26,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782247827] [2022-12-06 07:29:26,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:26,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:26,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-06 07:29:26,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:26,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782247827] [2022-12-06 07:29:26,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782247827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:26,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:26,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:26,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922778254] [2022-12-06 07:29:26,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:26,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:26,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:26,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:26,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:26,983 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:26,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:26,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:26,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:26,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:27,019 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:27,019 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:27,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:27,020 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:27,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:27,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:27,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:27,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:27,020 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:27,020 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:27,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:27,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:27,021 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:27,021 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:27,021 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:27,021 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:27,021 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:27,022 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:27,022 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:27,022 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:27,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:27,024 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:27,024 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:27,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:27,024 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:27,024 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:27,097 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:27,097 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:27,097 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:27,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:27,097 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:27,097 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:27,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1265 [2022-12-06 07:29:27,098 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-06 07:29:27,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:27,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1031744591, now seen corresponding path program 1 times [2022-12-06 07:29:27,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:27,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558210747] [2022-12-06 07:29:27,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:27,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:27,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-06 07:29:27,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:27,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558210747] [2022-12-06 07:29:27,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558210747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:27,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:27,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:27,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252093173] [2022-12-06 07:29:27,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:27,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:27,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:27,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:27,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:27,162 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:27,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:27,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:27,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:27,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:27,198 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:27,198 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:27,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:27,198 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:27,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:27,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:27,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:27,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:27,199 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:27,199 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:27,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:27,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:27,200 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:27,200 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:27,200 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:27,200 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:27,200 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:27,200 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:27,200 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:27,200 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:27,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:27,203 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:27,203 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:27,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:27,203 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:27,203 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:27,275 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:27,276 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:27,276 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:27,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:27,276 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:27,276 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:27,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1266 [2022-12-06 07:29:27,276 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-06 07:29:27,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:27,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1001268398, now seen corresponding path program 1 times [2022-12-06 07:29:27,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:27,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440946014] [2022-12-06 07:29:27,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:27,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:27,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-06 07:29:27,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:27,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440946014] [2022-12-06 07:29:27,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440946014] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:27,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:27,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:27,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437170665] [2022-12-06 07:29:27,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:27,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:27,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:27,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:27,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:27,338 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:27,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:27,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:27,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:27,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:27,381 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:27,381 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:27,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:27,381 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:27,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:27,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:27,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:27,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:27,382 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:27,382 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:27,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:27,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:27,382 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:27,382 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:27,383 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:27,383 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:27,383 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:27,383 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:27,383 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:27,383 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:27,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:27,385 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:27,385 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:27,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:27,386 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:27,386 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:27,460 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:27,461 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:27,461 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:27,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:27,461 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:27,461 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:27,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1267 [2022-12-06 07:29:27,461 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-06 07:29:27,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:27,461 INFO L85 PathProgramCache]: Analyzing trace with hash -974486289, now seen corresponding path program 1 times [2022-12-06 07:29:27,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:27,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346494713] [2022-12-06 07:29:27,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:27,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:27,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-06 07:29:27,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:27,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346494713] [2022-12-06 07:29:27,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346494713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:27,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:27,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:27,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870121826] [2022-12-06 07:29:27,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:27,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:27,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:27,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:27,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:27,522 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:27,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:27,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:27,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:27,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:27,558 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:27,558 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:27,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:27,559 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:27,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:27,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:27,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:27,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:27,560 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:27,560 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:27,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:27,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:27,560 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:27,561 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:27,561 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:27,561 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:27,561 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:27,561 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:27,561 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:27,561 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:27,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:27,563 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:27,563 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:27,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:27,563 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:27,563 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:27,635 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:27,635 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:29:27,635 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:27,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:27,636 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:27,636 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:27,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1268 [2022-12-06 07:29:27,636 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-06 07:29:27,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:27,636 INFO L85 PathProgramCache]: Analyzing trace with hash -944010096, now seen corresponding path program 1 times [2022-12-06 07:29:27,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:27,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31441898] [2022-12-06 07:29:27,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:27,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:27,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-06 07:29:27,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:27,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31441898] [2022-12-06 07:29:27,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31441898] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:27,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:27,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:27,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014449806] [2022-12-06 07:29:27,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:27,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:27,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:27,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:27,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:27,703 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:27,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:27,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:27,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:27,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:27,739 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:27,740 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:27,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:27,740 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:27,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:27,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:27,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:27,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:27,741 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:27,741 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:27,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:27,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:27,741 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:27,741 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:27,742 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:27,742 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:27,742 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:27,742 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:27,742 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:27,742 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:27,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:27,744 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:27,744 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:27,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:27,744 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:27,744 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:27,819 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:27,820 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:27,820 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:27,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:27,820 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:27,820 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:27,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1269 [2022-12-06 07:29:27,820 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-06 07:29:27,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:27,820 INFO L85 PathProgramCache]: Analyzing trace with hash -917227987, now seen corresponding path program 1 times [2022-12-06 07:29:27,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:27,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194510494] [2022-12-06 07:29:27,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:27,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:27,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-06 07:29:27,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:27,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194510494] [2022-12-06 07:29:27,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194510494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:27,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:27,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:27,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277978598] [2022-12-06 07:29:27,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:27,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:27,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:27,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:27,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:27,883 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:27,883 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:27,883 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:27,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:27,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:27,924 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:27,924 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:27,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:27,925 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:27,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:27,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:27,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:27,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:27,925 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:27,925 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:27,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:27,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:27,926 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:27,926 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:27,926 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:27,926 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:27,926 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:27,926 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:27,926 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:27,927 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:27,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:27,929 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:27,929 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:27,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:27,929 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:27,929 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:28,002 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:28,003 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:28,003 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:28,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:28,003 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:28,003 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:28,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1270 [2022-12-06 07:29:28,003 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-06 07:29:28,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:28,004 INFO L85 PathProgramCache]: Analyzing trace with hash -886751794, now seen corresponding path program 1 times [2022-12-06 07:29:28,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:28,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265642628] [2022-12-06 07:29:28,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:28,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:28,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:28,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:28,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:28,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265642628] [2022-12-06 07:29:28,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265642628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:28,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:28,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:28,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897971474] [2022-12-06 07:29:28,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:28,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:28,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:28,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:28,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:28,065 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:28,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:28,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:28,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:28,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:28,107 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:28,107 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:28,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:28,108 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:28,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:28,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:28,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:28,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:28,108 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:28,109 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:28,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:28,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:28,109 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:28,109 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:28,109 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:28,109 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:28,110 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:28,110 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:28,110 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:28,110 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:28,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:28,112 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:28,112 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:28,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:28,112 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:28,112 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:28,186 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:28,186 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:28,186 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:28,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:28,186 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:28,187 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:28,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1271 [2022-12-06 07:29:28,187 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-06 07:29:28,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:28,187 INFO L85 PathProgramCache]: Analyzing trace with hash -859969685, now seen corresponding path program 1 times [2022-12-06 07:29:28,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:28,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930532325] [2022-12-06 07:29:28,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:28,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:28,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-06 07:29:28,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:28,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930532325] [2022-12-06 07:29:28,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930532325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:28,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:28,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:28,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931707629] [2022-12-06 07:29:28,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:28,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:28,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:28,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:28,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:28,248 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:28,248 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:28,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:28,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:28,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:28,287 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:28,287 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:28,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:28,288 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:28,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:28,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:28,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:28,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:28,288 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:28,288 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:28,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:28,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:28,289 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:28,289 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:28,289 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:28,289 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:28,289 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:28,290 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:28,290 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:28,290 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:28,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:28,292 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:28,292 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:28,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:28,292 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:28,292 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:28,366 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:28,367 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:28,367 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:28,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:28,367 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:28,367 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:28,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1272 [2022-12-06 07:29:28,367 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-06 07:29:28,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:28,367 INFO L85 PathProgramCache]: Analyzing trace with hash -829493492, now seen corresponding path program 1 times [2022-12-06 07:29:28,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:28,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319165] [2022-12-06 07:29:28,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:28,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:28,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-06 07:29:28,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:28,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319165] [2022-12-06 07:29:28,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319165] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:28,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:28,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:28,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692381156] [2022-12-06 07:29:28,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:28,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:28,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:28,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:28,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:28,428 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:28,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:28,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:28,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:28,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:28,464 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:28,464 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:28,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:28,465 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:28,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:28,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:28,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:28,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:28,465 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:28,465 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:28,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:28,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:28,466 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:28,466 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:28,466 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:28,466 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:28,466 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:28,466 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:28,467 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:28,467 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:28,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:28,469 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:28,469 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:28,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:28,469 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:28,469 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:28,543 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:28,544 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:28,544 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:28,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:28,544 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:28,544 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:28,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1273 [2022-12-06 07:29:28,544 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-06 07:29:28,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:28,544 INFO L85 PathProgramCache]: Analyzing trace with hash -802711383, now seen corresponding path program 1 times [2022-12-06 07:29:28,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:28,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245838752] [2022-12-06 07:29:28,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:28,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:28,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-06 07:29:28,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:28,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245838752] [2022-12-06 07:29:28,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245838752] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:28,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:28,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:28,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950849225] [2022-12-06 07:29:28,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:28,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:28,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:28,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:28,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:28,618 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:28,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:28,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:28,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:28,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:28,659 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:28,659 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:28,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:28,660 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:28,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:28,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:28,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:28,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:28,660 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:28,660 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:28,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:28,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:28,661 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:28,661 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:28,661 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:28,661 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:28,661 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:28,661 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:28,661 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:28,661 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:28,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:28,664 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:28,664 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:28,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:28,664 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:28,664 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:28,737 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:28,737 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:28,737 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:28,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:28,738 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:28,738 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:28,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1274 [2022-12-06 07:29:28,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-06 07:29:28,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:28,738 INFO L85 PathProgramCache]: Analyzing trace with hash -772235190, now seen corresponding path program 1 times [2022-12-06 07:29:28,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:28,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063664851] [2022-12-06 07:29:28,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:28,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:28,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-06 07:29:28,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:28,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063664851] [2022-12-06 07:29:28,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063664851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:28,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:28,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:28,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537485930] [2022-12-06 07:29:28,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:28,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:28,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:28,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:28,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:28,798 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:28,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:28,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:28,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:28,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:28,839 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:28,839 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:28,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:28,839 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:28,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:28,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:28,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:28,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:28,840 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:28,840 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:28,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:28,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:28,841 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:28,841 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:28,841 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:28,841 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:28,841 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:28,841 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:28,841 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:28,841 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:28,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:28,843 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:28,843 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:28,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:28,844 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:28,844 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:28,916 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:28,917 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:28,917 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:28,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:28,917 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:28,917 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:28,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1275 [2022-12-06 07:29:28,917 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-06 07:29:28,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:28,918 INFO L85 PathProgramCache]: Analyzing trace with hash -745453081, now seen corresponding path program 1 times [2022-12-06 07:29:28,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:28,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080271325] [2022-12-06 07:29:28,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:28,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:28,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-06 07:29:28,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:28,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080271325] [2022-12-06 07:29:28,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080271325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:28,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:28,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:28,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902272316] [2022-12-06 07:29:28,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:28,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:28,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:28,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:28,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:28,979 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:28,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:28,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:28,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:28,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:29,014 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:29,014 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:29,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:29,015 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:29,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:29,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:29,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:29,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:29,015 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:29,015 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:29,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:29,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:29,016 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:29,016 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:29,016 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:29,016 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:29,016 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:29,016 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:29,016 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:29,017 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:29,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:29,019 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:29,019 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:29,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:29,019 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:29,019 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:29,092 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:29,093 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:29,093 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:29,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:29,093 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:29,093 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:29,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1276 [2022-12-06 07:29:29,093 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-06 07:29:29,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:29,093 INFO L85 PathProgramCache]: Analyzing trace with hash -714976888, now seen corresponding path program 1 times [2022-12-06 07:29:29,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:29,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617571473] [2022-12-06 07:29:29,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:29,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:29,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-06 07:29:29,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:29,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617571473] [2022-12-06 07:29:29,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617571473] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:29,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:29,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:29,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306474428] [2022-12-06 07:29:29,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:29,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:29,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:29,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:29,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:29,152 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:29,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:29,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:29,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:29,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:29,194 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:29,195 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:29,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:29,195 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:29,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:29,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:29,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:29,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:29,196 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:29,196 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:29,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:29,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:29,196 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:29,196 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:29,196 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:29,196 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:29,197 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:29,197 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:29,197 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:29,197 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:29,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:29,199 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:29,199 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:29,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:29,199 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:29,199 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:29,272 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:29,272 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:29,272 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:29,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:29,272 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:29,272 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:29,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1277 [2022-12-06 07:29:29,273 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-06 07:29:29,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:29,273 INFO L85 PathProgramCache]: Analyzing trace with hash -688194779, now seen corresponding path program 1 times [2022-12-06 07:29:29,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:29,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924102601] [2022-12-06 07:29:29,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:29,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:29,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-06 07:29:29,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:29,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924102601] [2022-12-06 07:29:29,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924102601] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:29,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:29,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:29,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110910437] [2022-12-06 07:29:29,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:29,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:29,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:29,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:29,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:29,337 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:29,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:29,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:29,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:29,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:29,377 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:29,377 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:29,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:29,377 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:29,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:29,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:29,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:29,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:29,378 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:29,378 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:29,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:29,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:29,378 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:29,378 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:29,379 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:29,379 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:29,379 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:29,379 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:29,379 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:29,379 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:29,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:29,381 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:29,381 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:29,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:29,381 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:29,381 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:29,455 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:29,456 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:29,456 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:29,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:29,456 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:29,456 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:29,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1278 [2022-12-06 07:29:29,456 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-06 07:29:29,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:29,456 INFO L85 PathProgramCache]: Analyzing trace with hash -657718586, now seen corresponding path program 1 times [2022-12-06 07:29:29,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:29,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453343073] [2022-12-06 07:29:29,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:29,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:29,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:29,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-06 07:29:29,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:29,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453343073] [2022-12-06 07:29:29,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453343073] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:29,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:29,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:29,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405838721] [2022-12-06 07:29:29,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:29,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:29,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:29,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:29,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:29,517 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:29,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:29,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:29,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:29,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:29,585 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:29,585 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:29,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:29,586 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:29,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:29,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:29,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:29,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:29,586 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:29,587 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:29,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:29,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:29,587 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:29,587 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:29,587 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:29,587 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:29,588 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:29,588 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:29,588 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:29,588 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:29,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:29,590 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:29,590 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:29,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 118 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:29,590 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:29,590 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:29,662 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:29,662 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:29:29,663 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:29,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:29,663 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:29,663 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:29,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1279 [2022-12-06 07:29:29,663 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-06 07:29:29,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:29,663 INFO L85 PathProgramCache]: Analyzing trace with hash -630936477, now seen corresponding path program 1 times [2022-12-06 07:29:29,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:29,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11854770] [2022-12-06 07:29:29,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:29,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:29,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-06 07:29:29,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:29,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11854770] [2022-12-06 07:29:29,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11854770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:29,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:29,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:29,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813560250] [2022-12-06 07:29:29,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:29,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:29,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:29,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:29,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:29,724 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:29,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:29,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:29,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:29,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:29,760 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:29,761 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:29,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:29,761 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:29,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:29,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:29,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:29,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:29,762 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:29,762 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:29,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:29,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:29,762 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:29,762 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:29,763 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:29,763 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:29,763 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:29,763 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:29,763 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:29,763 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:29,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:29,765 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:29,765 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:29,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:29,765 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:29,766 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:29,838 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:29,839 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:29,839 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:29,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:29,839 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:29,839 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:29,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1280 [2022-12-06 07:29:29,839 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-06 07:29:29,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:29,839 INFO L85 PathProgramCache]: Analyzing trace with hash -600460284, now seen corresponding path program 1 times [2022-12-06 07:29:29,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:29,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476557781] [2022-12-06 07:29:29,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:29,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:29,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:29,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-06 07:29:29,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:29,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476557781] [2022-12-06 07:29:29,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476557781] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:29,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:29,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:29,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211799750] [2022-12-06 07:29:29,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:29,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:29,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:29,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:29,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:29,904 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:29,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:29,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:29,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:29,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:29,947 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:29,947 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:29,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:29,948 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:29,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:29,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:29,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:29,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:29,948 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:29,948 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:29,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:29,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:29,949 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:29,949 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:29,949 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:29,949 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:29,949 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:29,949 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:29,949 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:29,949 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:29,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:29,952 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:29,952 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:29,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:29,952 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:29,952 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:30,026 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:30,027 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:30,027 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:30,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:30,027 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:30,027 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:30,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1281 [2022-12-06 07:29:30,027 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-06 07:29:30,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:30,027 INFO L85 PathProgramCache]: Analyzing trace with hash -573678175, now seen corresponding path program 1 times [2022-12-06 07:29:30,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:30,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668969064] [2022-12-06 07:29:30,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:30,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:30,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:30,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-06 07:29:30,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:30,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668969064] [2022-12-06 07:29:30,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668969064] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:30,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:30,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:30,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8992866] [2022-12-06 07:29:30,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:30,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:30,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:30,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:30,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:30,089 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:30,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:30,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:30,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:30,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:30,123 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:30,124 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:30,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:30,124 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:30,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:30,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:30,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:30,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:30,125 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:30,125 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:30,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:30,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:30,125 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:30,125 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:30,126 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:30,126 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:30,126 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:30,126 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:30,126 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:30,126 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:30,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:30,128 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:30,128 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:30,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:30,129 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:30,129 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:30,202 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:30,203 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:30,203 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:30,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:30,203 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:30,203 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:30,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1282 [2022-12-06 07:29:30,203 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-06 07:29:30,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:30,204 INFO L85 PathProgramCache]: Analyzing trace with hash -543201982, now seen corresponding path program 1 times [2022-12-06 07:29:30,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:30,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189150954] [2022-12-06 07:29:30,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:30,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:30,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-06 07:29:30,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:30,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189150954] [2022-12-06 07:29:30,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189150954] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:30,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:30,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:30,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876599663] [2022-12-06 07:29:30,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:30,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:30,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:30,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:30,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:30,263 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:30,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:30,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:30,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:30,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:30,303 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:30,303 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:30,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:30,304 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:30,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:30,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:30,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:30,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:30,304 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:30,304 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:30,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:30,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:30,305 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:30,305 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:30,305 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:30,305 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:30,305 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:30,305 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:30,305 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:30,305 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:30,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:30,308 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:30,308 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:30,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:30,308 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:30,308 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:30,381 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:30,381 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:30,381 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:30,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:30,381 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:30,381 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:30,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1283 [2022-12-06 07:29:30,382 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-06 07:29:30,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:30,382 INFO L85 PathProgramCache]: Analyzing trace with hash -516419873, now seen corresponding path program 1 times [2022-12-06 07:29:30,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:30,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807512178] [2022-12-06 07:29:30,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:30,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:30,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-06 07:29:30,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:30,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807512178] [2022-12-06 07:29:30,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807512178] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:30,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:30,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:30,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167922223] [2022-12-06 07:29:30,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:30,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:30,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:30,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:30,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:30,439 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:30,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:30,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:30,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:30,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:30,477 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:30,477 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:30,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:30,477 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:30,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:30,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:30,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:30,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:30,478 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:30,478 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:30,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:30,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:30,479 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:30,479 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:30,479 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:30,479 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:30,479 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:30,479 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:30,479 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:30,479 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:30,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:30,481 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:30,481 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:30,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:30,482 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:30,482 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:30,554 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:30,555 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:30,555 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:30,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:30,555 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:30,555 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:30,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1284 [2022-12-06 07:29:30,555 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-06 07:29:30,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:30,555 INFO L85 PathProgramCache]: Analyzing trace with hash -485943680, now seen corresponding path program 1 times [2022-12-06 07:29:30,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:30,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410620535] [2022-12-06 07:29:30,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:30,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:30,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-06 07:29:30,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:30,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410620535] [2022-12-06 07:29:30,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410620535] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:30,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:30,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:30,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217854717] [2022-12-06 07:29:30,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:30,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:30,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:30,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:30,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:30,624 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:30,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:30,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:30,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:30,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:30,666 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:30,666 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:30,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:30,666 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:30,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:30,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:30,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:30,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:30,667 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:30,667 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:30,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:30,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:30,667 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:30,668 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:30,668 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:30,668 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:30,668 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:30,668 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:30,668 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:30,668 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:30,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:30,670 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:30,670 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:30,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:30,671 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:30,671 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:30,743 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:30,744 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:30,744 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:30,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:30,744 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:30,744 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:30,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1285 [2022-12-06 07:29:30,744 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-06 07:29:30,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:30,744 INFO L85 PathProgramCache]: Analyzing trace with hash -459161571, now seen corresponding path program 1 times [2022-12-06 07:29:30,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:30,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146593580] [2022-12-06 07:29:30,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:30,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:30,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-06 07:29:30,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:30,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146593580] [2022-12-06 07:29:30,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146593580] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:30,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:30,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:30,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554323198] [2022-12-06 07:29:30,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:30,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:30,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:30,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:30,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:30,806 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:30,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:30,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:30,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:30,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:30,842 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:30,842 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:30,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 353 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:30,842 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:30,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:30,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:30,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:30,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:30,843 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:30,843 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:30,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:30,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:30,843 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:30,843 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:30,844 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:30,844 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:30,844 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:30,844 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:30,844 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:30,844 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:30,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:30,846 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:30,846 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:30,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:30,846 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:30,846 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:30,919 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:30,920 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:30,920 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:30,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:30,920 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:30,920 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:30,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1286 [2022-12-06 07:29:30,920 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-06 07:29:30,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:30,920 INFO L85 PathProgramCache]: Analyzing trace with hash -428685378, now seen corresponding path program 1 times [2022-12-06 07:29:30,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:30,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192091550] [2022-12-06 07:29:30,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:30,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:30,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-06 07:29:30,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:30,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192091550] [2022-12-06 07:29:30,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192091550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:30,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:30,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:30,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329135560] [2022-12-06 07:29:30,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:30,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:30,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:30,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:30,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:30,978 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:30,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:30,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:30,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:30,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:31,020 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:31,020 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:31,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:31,020 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:31,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:31,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:31,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:31,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:31,021 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:31,021 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:31,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:31,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:31,022 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:31,022 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:31,022 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:31,022 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:31,022 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:31,022 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:31,022 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:31,022 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:31,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:31,024 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:31,024 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:31,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:31,025 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:31,025 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:31,099 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:31,099 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:31,099 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:31,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:31,099 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:31,100 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:31,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1287 [2022-12-06 07:29:31,100 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-06 07:29:31,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:31,100 INFO L85 PathProgramCache]: Analyzing trace with hash -401903269, now seen corresponding path program 1 times [2022-12-06 07:29:31,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:31,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580042211] [2022-12-06 07:29:31,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:31,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:31,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-06 07:29:31,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:31,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580042211] [2022-12-06 07:29:31,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580042211] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:31,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:31,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:31,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138857538] [2022-12-06 07:29:31,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:31,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:31,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:31,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:31,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:31,164 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:31,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:31,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:31,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:31,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:31,202 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:31,202 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:31,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 371 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:31,203 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:31,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:31,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:31,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:31,203 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:31,203 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:31,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:31,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:31,204 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:31,204 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:31,204 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:31,204 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:31,204 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:31,204 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:31,204 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:31,204 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:31,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:31,206 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:31,207 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:31,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:31,207 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:31,207 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:31,281 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:31,281 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:31,281 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:31,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:31,282 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:31,282 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:31,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1288 [2022-12-06 07:29:31,282 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-06 07:29:31,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:31,282 INFO L85 PathProgramCache]: Analyzing trace with hash -371427076, now seen corresponding path program 1 times [2022-12-06 07:29:31,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:31,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134505110] [2022-12-06 07:29:31,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:31,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:31,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-06 07:29:31,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:31,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134505110] [2022-12-06 07:29:31,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134505110] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:31,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:31,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:31,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974237796] [2022-12-06 07:29:31,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:31,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:31,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:31,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:31,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:31,347 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:31,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:31,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:31,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:31,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:31,390 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:31,390 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:31,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:31,390 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:31,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:31,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:31,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:31,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:31,391 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:31,391 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:31,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:31,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:31,392 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:31,392 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:31,392 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:31,392 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:31,392 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:31,392 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:31,392 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:31,392 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:31,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:31,394 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:31,394 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:31,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:31,395 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:31,395 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:31,468 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:31,468 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:31,468 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:31,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:31,468 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:31,469 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:31,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1289 [2022-12-06 07:29:31,469 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-06 07:29:31,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:31,469 INFO L85 PathProgramCache]: Analyzing trace with hash -344644967, now seen corresponding path program 1 times [2022-12-06 07:29:31,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:31,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174943249] [2022-12-06 07:29:31,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:31,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:31,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-06 07:29:31,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:31,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174943249] [2022-12-06 07:29:31,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174943249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:31,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:31,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:31,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596300221] [2022-12-06 07:29:31,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:31,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:31,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:31,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:31,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:31,541 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:31,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:31,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:31,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:31,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:31,577 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:31,577 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:31,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:31,578 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:31,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:31,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:31,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:31,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:31,578 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:31,578 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:31,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:31,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:31,579 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:31,579 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:31,579 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:31,579 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:31,579 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:31,579 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:31,580 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:31,580 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:31,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:31,582 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:31,582 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:31,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:31,582 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:31,582 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:31,655 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:31,656 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:31,656 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:31,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:31,656 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:31,656 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:31,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1290 [2022-12-06 07:29:31,656 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-06 07:29:31,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:31,657 INFO L85 PathProgramCache]: Analyzing trace with hash -314168774, now seen corresponding path program 1 times [2022-12-06 07:29:31,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:31,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101145179] [2022-12-06 07:29:31,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:31,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:31,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29: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-06 07:29:31,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:31,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101145179] [2022-12-06 07:29:31,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101145179] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:31,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:31,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:31,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709178793] [2022-12-06 07:29:31,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:31,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:31,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:31,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:31,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:31,715 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:31,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:31,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:31,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:31,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:31,752 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:31,752 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:31,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:31,753 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:31,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:31,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:31,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:31,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:31,753 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:31,753 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:31,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:31,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:31,754 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:31,754 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:31,754 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:31,754 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:31,754 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:31,754 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:31,754 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:31,755 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:31,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:31,757 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:31,757 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:31,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:31,757 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:31,757 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:31,832 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:31,833 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:31,833 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:31,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:31,833 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:31,833 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:31,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1291 [2022-12-06 07:29:31,833 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-06 07:29:31,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:31,833 INFO L85 PathProgramCache]: Analyzing trace with hash -287386665, now seen corresponding path program 1 times [2022-12-06 07:29:31,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:31,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026859876] [2022-12-06 07:29:31,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:31,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:31,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:31,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-06 07:29:31,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:31,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026859876] [2022-12-06 07:29:31,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026859876] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:31,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:31,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:31,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322965845] [2022-12-06 07:29:31,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:31,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:31,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:31,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:31,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:31,891 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:31,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:31,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:31,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:31,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:31,929 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:31,929 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:31,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:31,929 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:31,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:31,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:31,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:31,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:31,930 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:31,930 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:31,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:31,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:31,930 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:31,931 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:31,931 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:31,931 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:31,931 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:31,931 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:31,931 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:31,931 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:31,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:31,933 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:31,933 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:31,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:31,934 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:31,934 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:32,006 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:32,007 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:32,007 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:32,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:32,007 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:32,007 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:32,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1292 [2022-12-06 07:29:32,007 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-06 07:29:32,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:32,007 INFO L85 PathProgramCache]: Analyzing trace with hash -256910472, now seen corresponding path program 1 times [2022-12-06 07:29:32,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:32,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146585213] [2022-12-06 07:29:32,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:32,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29: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-06 07:29:32,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:32,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146585213] [2022-12-06 07:29:32,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146585213] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:32,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:32,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:32,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967544222] [2022-12-06 07:29:32,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:32,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:32,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:32,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:32,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:32,067 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:32,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:32,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:32,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:32,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:32,109 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:32,109 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:32,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:32,110 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:32,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:32,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:32,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:32,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:32,110 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:32,110 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:32,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:32,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:32,111 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:32,111 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:32,111 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:32,111 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:32,111 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:32,111 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:32,111 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:32,112 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:32,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:32,114 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:32,114 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:32,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:32,114 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:32,114 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:32,188 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:32,189 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:32,189 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:32,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:32,189 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:32,189 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:32,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1293 [2022-12-06 07:29:32,189 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-06 07:29:32,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:32,189 INFO L85 PathProgramCache]: Analyzing trace with hash -230128363, now seen corresponding path program 1 times [2022-12-06 07:29:32,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:32,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488928988] [2022-12-06 07:29:32,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:32,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:32,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-06 07:29:32,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:32,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488928988] [2022-12-06 07:29:32,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488928988] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:32,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:32,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:32,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692587427] [2022-12-06 07:29:32,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:32,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:32,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:32,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:32,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:32,250 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:32,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:32,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:32,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:32,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:32,285 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:32,286 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:32,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:32,286 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:32,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:32,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:32,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:32,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:32,286 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:32,287 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:32,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:32,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:32,287 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:32,287 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:32,287 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:32,287 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:32,287 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:32,288 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:32,288 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:32,288 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:32,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:32,290 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:32,290 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:32,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:32,290 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:32,290 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:32,363 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:32,364 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:32,364 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:32,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:32,364 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:32,364 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:32,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1294 [2022-12-06 07:29:32,364 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-06 07:29:32,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:32,364 INFO L85 PathProgramCache]: Analyzing trace with hash -199652170, now seen corresponding path program 1 times [2022-12-06 07:29:32,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:32,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443778992] [2022-12-06 07:29:32,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:32,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:32,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-06 07:29:32,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:32,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443778992] [2022-12-06 07:29:32,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443778992] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:32,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:32,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:32,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599168450] [2022-12-06 07:29:32,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:32,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:32,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:32,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:32,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:32,423 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:32,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:32,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:32,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:32,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:32,472 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:32,472 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:32,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:32,472 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:32,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:32,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:32,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:32,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:32,473 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:32,473 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:32,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:32,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:32,474 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:32,474 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:32,474 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:32,474 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:32,474 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:32,474 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:32,474 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:32,474 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:32,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:32,476 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:32,476 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:32,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:32,477 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:32,477 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:32,550 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:32,550 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:32,550 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:32,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:32,551 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:32,551 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:32,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1295 [2022-12-06 07:29:32,551 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-06 07:29:32,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:32,551 INFO L85 PathProgramCache]: Analyzing trace with hash -172870061, now seen corresponding path program 1 times [2022-12-06 07:29:32,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:32,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344924199] [2022-12-06 07:29:32,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:32,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:32,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:32,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-06 07:29:32,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:32,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344924199] [2022-12-06 07:29:32,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344924199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:32,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:32,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:32,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365705491] [2022-12-06 07:29:32,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:32,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:32,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:32,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:32,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:32,613 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:32,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:32,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:32,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:32,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:32,648 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:32,649 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:32,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:32,649 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:32,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:32,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:32,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:32,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:32,649 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:32,650 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:32,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:32,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:32,650 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:32,650 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:32,650 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:32,650 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:32,650 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:32,651 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:32,651 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:32,651 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:32,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:32,653 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:32,653 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:32,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:32,653 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:32,653 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:32,727 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:32,728 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:32,728 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:32,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:32,728 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:32,728 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:32,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1296 [2022-12-06 07:29:32,728 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-06 07:29:32,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:32,728 INFO L85 PathProgramCache]: Analyzing trace with hash -142393868, now seen corresponding path program 1 times [2022-12-06 07:29:32,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:32,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200749354] [2022-12-06 07:29:32,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:32,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:32,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-06 07:29:32,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:32,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200749354] [2022-12-06 07:29:32,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200749354] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:32,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:32,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:32,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019421095] [2022-12-06 07:29:32,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:32,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:32,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:32,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:32,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:32,787 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:32,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:32,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:32,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:32,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:32,825 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:32,825 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:32,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:32,825 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:32,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:32,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:32,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:32,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:32,826 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:32,826 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:32,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:32,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:32,827 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:32,827 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:32,827 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:32,827 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:32,827 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:32,827 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:32,827 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:32,827 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:32,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:32,829 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:32,829 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:32,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:32,830 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:32,830 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:32,904 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:32,904 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:32,905 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:32,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:32,905 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:32,905 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:32,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1297 [2022-12-06 07:29:32,905 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-06 07:29:32,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:32,905 INFO L85 PathProgramCache]: Analyzing trace with hash -115611759, now seen corresponding path program 1 times [2022-12-06 07:29:32,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:32,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898046198] [2022-12-06 07:29:32,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:32,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:32,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-06 07:29:32,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:32,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898046198] [2022-12-06 07:29:32,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898046198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:32,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:32,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:32,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112908798] [2022-12-06 07:29:32,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:32,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:32,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:32,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:32,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:32,968 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:32,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:32,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:32,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:32,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:33,010 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:33,010 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:33,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:33,011 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:33,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:33,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:33,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:33,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:33,011 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:33,011 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:33,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:33,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:33,012 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:33,012 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:33,012 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:33,012 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:33,012 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:33,012 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:33,012 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:33,012 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:33,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:33,015 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:33,015 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:33,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:33,015 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:33,015 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:33,089 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:33,089 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:33,089 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:33,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:33,090 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:33,090 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:33,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1298 [2022-12-06 07:29:33,090 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-06 07:29:33,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:33,090 INFO L85 PathProgramCache]: Analyzing trace with hash -85135566, now seen corresponding path program 1 times [2022-12-06 07:29:33,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:33,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851386985] [2022-12-06 07:29:33,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:33,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:33,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-06 07:29:33,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:33,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851386985] [2022-12-06 07:29:33,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851386985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:33,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:33,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:33,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859126320] [2022-12-06 07:29:33,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:33,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:33,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:33,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:33,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:33,154 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:33,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:33,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:33,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:33,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:33,190 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:33,190 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:33,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:33,191 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:33,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:33,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:33,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:33,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:33,191 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:33,191 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:33,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:33,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:33,192 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:33,192 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:33,192 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:33,192 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:33,192 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:33,192 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:33,192 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:33,192 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:33,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:33,194 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:33,195 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:33,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:33,195 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:33,195 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:33,271 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:33,272 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:29:33,272 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:33,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:33,272 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:33,272 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:33,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1299 [2022-12-06 07:29:33,272 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-06 07:29:33,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:33,272 INFO L85 PathProgramCache]: Analyzing trace with hash -58353457, now seen corresponding path program 1 times [2022-12-06 07:29:33,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:33,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293107055] [2022-12-06 07:29:33,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:33,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:33,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-06 07:29:33,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:33,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293107055] [2022-12-06 07:29:33,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293107055] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:33,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:33,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:33,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710090506] [2022-12-06 07:29:33,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:33,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:33,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:33,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:33,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:33,335 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:33,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:33,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:33,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:33,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:33,378 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:33,378 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:33,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:33,378 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:33,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:33,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:33,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:33,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:33,379 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:33,379 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:33,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:33,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:33,380 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:33,380 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:33,380 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:33,380 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:33,380 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:33,380 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:33,380 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:33,380 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:33,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:33,382 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:33,383 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:33,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:33,383 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:33,383 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:33,457 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:33,458 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:33,458 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:33,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:33,458 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:33,458 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:33,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1300 [2022-12-06 07:29:33,458 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-06 07:29:33,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:33,459 INFO L85 PathProgramCache]: Analyzing trace with hash -27877264, now seen corresponding path program 1 times [2022-12-06 07:29:33,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:33,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499113288] [2022-12-06 07:29:33,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:33,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29: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-06 07:29:33,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:33,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499113288] [2022-12-06 07:29:33,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499113288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:33,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:33,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:33,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901826679] [2022-12-06 07:29:33,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:33,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:33,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:33,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:33,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:33,530 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:33,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:33,530 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:33,530 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:33,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:33,569 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:33,569 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:33,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 349 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:33,569 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:33,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:33,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:33,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:33,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:33,570 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:33,570 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:33,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:33,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:33,571 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:33,571 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:33,571 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:33,571 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:33,571 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:33,571 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:33,571 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:33,571 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:33,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:33,573 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:33,573 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:33,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 121 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:33,574 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:33,574 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:33,649 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:33,649 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:33,649 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:33,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:33,649 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:33,650 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:33,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1301 [2022-12-06 07:29:33,650 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-06 07:29:33,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:33,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1095155, now seen corresponding path program 1 times [2022-12-06 07:29:33,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:33,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593953779] [2022-12-06 07:29:33,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:33,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29: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-06 07:29:33,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:33,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593953779] [2022-12-06 07:29:33,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593953779] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:33,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:33,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:33,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133887083] [2022-12-06 07:29:33,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:33,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:33,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:33,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:33,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:33,714 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:33,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:33,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:33,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:33,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:33,749 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:33,750 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:33,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:33,750 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:33,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:33,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:33,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:33,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:33,751 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:33,751 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:33,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:33,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:33,752 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:33,752 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:33,752 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:33,752 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:33,752 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:33,752 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:33,752 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:33,752 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:33,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:33,754 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:33,754 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:33,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:33,755 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:33,755 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:33,830 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:33,831 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:33,831 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:33,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:33,831 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:33,831 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:33,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1302 [2022-12-06 07:29:33,831 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-06 07:29:33,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:33,832 INFO L85 PathProgramCache]: Analyzing trace with hash 29381038, now seen corresponding path program 1 times [2022-12-06 07:29:33,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:33,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633757726] [2022-12-06 07:29:33,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:33,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:33,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:33,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-06 07:29:33,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:33,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633757726] [2022-12-06 07:29:33,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633757726] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:33,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:33,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:33,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180906525] [2022-12-06 07:29:33,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:33,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:33,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:33,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:33,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:33,892 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:33,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:33,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:33,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:33,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:33,930 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:33,930 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:33,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:33,930 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:33,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:33,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:33,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:33,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:33,931 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:33,931 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:33,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:33,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:33,932 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:33,932 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:33,932 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:33,932 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:33,932 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:33,932 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:33,932 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:33,932 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:33,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:33,934 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:33,934 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:33,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:33,935 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:33,935 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:34,010 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:34,011 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:34,011 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:34,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:34,011 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:34,011 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:34,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1303 [2022-12-06 07:29:34,011 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-06 07:29:34,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:34,011 INFO L85 PathProgramCache]: Analyzing trace with hash 56163147, now seen corresponding path program 1 times [2022-12-06 07:29:34,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:34,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143287129] [2022-12-06 07:29:34,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:34,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:34,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-06 07:29:34,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:34,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143287129] [2022-12-06 07:29:34,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143287129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:34,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:34,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:34,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845173924] [2022-12-06 07:29:34,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:34,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:34,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:34,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:34,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:34,069 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:34,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:34,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:34,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:34,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:34,108 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:34,108 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:34,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:34,108 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:34,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:34,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:34,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:34,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:34,109 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:34,109 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:34,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:34,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:34,110 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:34,110 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:34,110 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:34,110 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:34,110 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:34,110 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:34,110 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:34,110 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:34,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:34,113 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:34,113 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:34,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:34,113 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:34,113 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:34,187 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:34,188 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:34,188 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:34,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:34,188 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:34,188 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:34,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1304 [2022-12-06 07:29:34,188 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-06 07:29:34,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:34,189 INFO L85 PathProgramCache]: Analyzing trace with hash 86639340, now seen corresponding path program 1 times [2022-12-06 07:29:34,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:34,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130071051] [2022-12-06 07:29:34,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:34,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:34,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-06 07:29:34,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:34,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130071051] [2022-12-06 07:29:34,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130071051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:34,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:34,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:34,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625885182] [2022-12-06 07:29:34,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:34,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:34,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:34,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:34,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:34,251 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:34,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:34,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:34,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:34,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:34,293 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:34,293 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:34,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:34,293 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:34,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:34,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:34,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:34,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:34,294 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:34,294 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:34,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:34,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:34,295 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:34,295 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:34,295 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:34,295 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:34,295 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:34,295 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:34,295 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:34,295 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:34,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:34,297 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:34,297 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:34,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 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 116. Up to 16 conditions per place. [2022-12-06 07:29:34,298 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:34,298 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:34,373 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:34,374 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:34,374 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:34,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:34,374 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:34,374 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:34,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1305 [2022-12-06 07:29:34,374 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-06 07:29:34,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:34,374 INFO L85 PathProgramCache]: Analyzing trace with hash 113421449, now seen corresponding path program 1 times [2022-12-06 07:29:34,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:34,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791823757] [2022-12-06 07:29:34,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:34,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:34,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-06 07:29:34,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:34,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791823757] [2022-12-06 07:29:34,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791823757] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:34,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:34,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:34,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767524538] [2022-12-06 07:29:34,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:34,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:34,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:34,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:34,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:34,447 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:34,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:34,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:34,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:34,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:34,483 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:34,483 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:34,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:34,484 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:34,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:34,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:34,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:34,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:34,484 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:34,484 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:34,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:34,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:34,485 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:34,485 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:34,485 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:34,485 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:34,485 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:34,486 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:34,486 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:34,486 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:34,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:34,488 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:34,488 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:34,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:34,488 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:34,488 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:34,564 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:34,564 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:34,564 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:34,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:34,564 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:34,564 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:34,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1306 [2022-12-06 07:29:34,565 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-06 07:29:34,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:34,565 INFO L85 PathProgramCache]: Analyzing trace with hash 143897642, now seen corresponding path program 1 times [2022-12-06 07:29:34,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:34,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136602578] [2022-12-06 07:29:34,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:34,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:34,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-06 07:29:34,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:34,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136602578] [2022-12-06 07:29:34,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136602578] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:34,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:34,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:34,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65423111] [2022-12-06 07:29:34,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:34,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:34,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:34,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:34,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:34,625 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:34,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:34,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:34,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:34,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:34,662 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:34,663 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:34,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:34,663 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:34,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:34,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:34,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:34,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:34,664 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:34,664 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:34,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:34,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:34,664 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:34,664 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:34,665 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:34,665 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:34,665 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:34,665 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:34,665 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:34,665 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:34,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:34,667 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:34,667 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:34,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:34,668 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:34,668 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:34,742 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:34,743 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:34,743 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:34,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:34,743 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:34,743 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:34,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1307 [2022-12-06 07:29:34,744 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-06 07:29:34,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:34,744 INFO L85 PathProgramCache]: Analyzing trace with hash 170679751, now seen corresponding path program 1 times [2022-12-06 07:29:34,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:34,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294868538] [2022-12-06 07:29:34,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:34,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:34,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-06 07:29:34,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:34,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294868538] [2022-12-06 07:29:34,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294868538] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:34,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:34,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:34,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561154443] [2022-12-06 07:29:34,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:34,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:34,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:34,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:34,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:34,808 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:34,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:34,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:34,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:34,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:34,844 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:34,844 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:34,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:34,845 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:34,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:34,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:34,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:34,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:34,846 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:34,846 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:34,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:34,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:34,846 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:34,846 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:34,846 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:34,847 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:34,847 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:34,847 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:34,847 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:34,847 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:34,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:34,849 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:34,849 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:34,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:34,849 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:34,849 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:34,925 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:34,926 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:34,926 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:34,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:34,926 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:34,926 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:34,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1308 [2022-12-06 07:29:34,926 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-06 07:29:34,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:34,926 INFO L85 PathProgramCache]: Analyzing trace with hash 201155944, now seen corresponding path program 1 times [2022-12-06 07:29:34,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:34,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627129558] [2022-12-06 07:29:34,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:34,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:34,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:34,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:34,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:34,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627129558] [2022-12-06 07:29:34,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627129558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:34,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:34,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:34,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910005013] [2022-12-06 07:29:34,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:34,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:34,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:34,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:34,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:34,988 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:34,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:34,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:34,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:34,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:35,025 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:35,026 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:35,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:35,026 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:35,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:35,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:35,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:35,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:35,027 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:35,027 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:35,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:35,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:35,028 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:35,028 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:35,028 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:35,028 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:35,028 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:35,028 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:35,028 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:35,028 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:35,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:35,030 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:35,030 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:35,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:35,031 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:35,031 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:35,105 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:35,105 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:35,106 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:35,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:35,106 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:35,106 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:35,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1309 [2022-12-06 07:29:35,106 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-06 07:29:35,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:35,106 INFO L85 PathProgramCache]: Analyzing trace with hash 227938053, now seen corresponding path program 1 times [2022-12-06 07:29:35,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:35,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763345774] [2022-12-06 07:29:35,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:35,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:35,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-06 07:29:35,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:35,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763345774] [2022-12-06 07:29:35,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763345774] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:35,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:35,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:35,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063987015] [2022-12-06 07:29:35,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:35,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:35,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:35,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:35,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:35,170 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:35,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:35,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:35,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:35,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:35,209 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:35,209 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:35,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:35,210 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:35,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:35,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:35,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:35,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:35,210 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:35,210 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:35,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:35,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:35,211 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:35,211 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:35,211 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:35,211 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:35,211 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:35,211 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:35,211 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:35,211 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:35,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:35,214 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:35,214 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:35,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:35,214 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:35,214 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:35,290 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:35,290 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:35,290 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:35,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:35,291 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:35,291 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:35,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1310 [2022-12-06 07:29:35,291 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-06 07:29:35,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:35,291 INFO L85 PathProgramCache]: Analyzing trace with hash 258414246, now seen corresponding path program 1 times [2022-12-06 07:29:35,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:35,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966982020] [2022-12-06 07:29:35,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:35,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:35,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:35,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:35,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966982020] [2022-12-06 07:29:35,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966982020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:35,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:35,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:35,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540363218] [2022-12-06 07:29:35,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:35,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:35,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:35,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:35,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:35,353 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:35,353 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:35,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:35,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:35,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:35,405 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:35,405 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:35,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:35,406 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:35,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:35,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:35,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:35,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:35,406 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:35,406 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:35,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:35,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:35,407 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:35,407 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:35,407 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:35,407 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:35,407 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:35,408 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:35,408 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:35,408 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:35,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:35,410 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:35,410 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:35,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:35,410 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:35,410 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:35,485 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:35,485 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:35,485 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:35,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:35,485 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:35,486 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:35,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1311 [2022-12-06 07:29:35,486 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-06 07:29:35,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:35,486 INFO L85 PathProgramCache]: Analyzing trace with hash 285196355, now seen corresponding path program 1 times [2022-12-06 07:29:35,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:35,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214908424] [2022-12-06 07:29:35,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:35,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:35,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-06 07:29:35,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:35,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214908424] [2022-12-06 07:29:35,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214908424] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:35,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:35,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:35,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511735065] [2022-12-06 07:29:35,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:35,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:35,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:35,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:35,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:35,549 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:35,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:35,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:35,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:35,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:35,591 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:35,591 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:35,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:35,591 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:35,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:35,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:35,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:35,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:35,592 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:35,592 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:35,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:35,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:35,593 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:35,593 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:35,593 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:35,593 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:35,593 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:35,593 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:35,593 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:35,593 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:35,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:35,595 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:35,595 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:35,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:35,596 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:35,596 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:35,671 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:35,672 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:35,672 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:35,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:35,672 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:35,672 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:35,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1312 [2022-12-06 07:29:35,672 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-06 07:29:35,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:35,672 INFO L85 PathProgramCache]: Analyzing trace with hash 315672548, now seen corresponding path program 1 times [2022-12-06 07:29:35,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:35,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469299656] [2022-12-06 07:29:35,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:35,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:35,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-06 07:29:35,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:35,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469299656] [2022-12-06 07:29:35,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469299656] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:35,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:35,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:35,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282664721] [2022-12-06 07:29:35,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:35,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:35,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:35,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:35,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:35,733 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:35,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:35,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:35,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:35,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:35,771 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:35,771 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:35,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:35,772 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:35,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:35,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:35,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:35,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:35,772 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:35,772 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:35,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:35,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:35,773 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:35,773 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:35,773 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:35,773 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:35,773 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:35,773 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:35,773 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:35,773 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:35,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:35,776 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:35,776 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:35,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:35,776 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:35,776 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:35,852 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:35,853 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:29:35,853 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:35,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:35,853 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:35,853 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:35,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1313 [2022-12-06 07:29:35,853 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-06 07:29:35,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:35,853 INFO L85 PathProgramCache]: Analyzing trace with hash 342454657, now seen corresponding path program 1 times [2022-12-06 07:29:35,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:35,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50847640] [2022-12-06 07:29:35,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:35,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29: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-06 07:29:35,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:35,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50847640] [2022-12-06 07:29:35,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50847640] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:35,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:35,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:35,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810165119] [2022-12-06 07:29:35,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:35,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:35,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:35,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:35,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:35,928 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:35,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:35,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:35,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:35,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:35,976 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:35,976 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:35,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:35,977 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:35,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:35,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:35,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:35,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:35,977 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:35,978 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:35,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:35,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:35,978 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:35,978 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:35,978 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:35,978 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:35,979 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:35,979 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:35,979 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:35,979 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:35,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:35,981 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:35,981 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:35,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:35,981 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:35,981 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:36,055 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:36,056 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:36,056 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:36,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:36,056 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:36,056 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:36,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1314 [2022-12-06 07:29:36,056 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-06 07:29:36,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:36,056 INFO L85 PathProgramCache]: Analyzing trace with hash 372930850, now seen corresponding path program 1 times [2022-12-06 07:29:36,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:36,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128507299] [2022-12-06 07:29:36,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:36,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:36,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:36,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-06 07:29:36,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:36,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128507299] [2022-12-06 07:29:36,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128507299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:36,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:36,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:36,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512615638] [2022-12-06 07:29:36,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:36,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:36,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:36,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:36,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:36,117 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:36,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:36,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:36,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:36,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:36,154 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:36,154 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:36,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:36,154 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:36,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:36,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:36,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:36,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:36,155 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:36,155 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:36,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:36,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:36,156 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:36,156 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:36,156 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:36,156 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:36,156 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:36,156 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:36,156 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:36,156 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:36,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:36,158 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:36,159 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:36,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:36,159 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:36,159 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:36,233 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:36,234 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:36,234 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:36,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:36,234 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:36,234 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:36,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1315 [2022-12-06 07:29:36,234 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-06 07:29:36,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:36,235 INFO L85 PathProgramCache]: Analyzing trace with hash 399712959, now seen corresponding path program 1 times [2022-12-06 07:29:36,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:36,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110752994] [2022-12-06 07:29:36,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:36,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:36,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:36,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-06 07:29:36,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:36,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110752994] [2022-12-06 07:29:36,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110752994] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:36,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:36,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:36,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762722016] [2022-12-06 07:29:36,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:36,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:36,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:36,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:36,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:36,309 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:36,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:36,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:36,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:36,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:36,351 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:36,351 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:36,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:36,352 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:36,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:36,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:36,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:36,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:36,353 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:36,353 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:36,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:36,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:36,353 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:36,353 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:36,354 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:36,354 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:36,354 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:36,354 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:36,354 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:36,354 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:36,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:36,356 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:36,356 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:36,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:36,357 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:36,357 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:36,443 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:36,443 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 07:29:36,444 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:36,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:36,444 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:36,444 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:36,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1316 [2022-12-06 07:29:36,444 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-06 07:29:36,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:36,444 INFO L85 PathProgramCache]: Analyzing trace with hash 430189152, now seen corresponding path program 1 times [2022-12-06 07:29:36,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:36,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202563323] [2022-12-06 07:29:36,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:36,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:36,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-06 07:29:36,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:36,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202563323] [2022-12-06 07:29:36,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202563323] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:36,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:36,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:36,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736153195] [2022-12-06 07:29:36,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:36,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:36,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:36,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:36,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:36,506 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:36,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:36,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:36,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:36,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:36,548 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:36,548 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:36,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 354 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:36,549 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:36,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:36,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:36,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:36,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:36,549 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:36,549 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:36,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:36,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:36,550 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:36,550 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:36,550 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:36,550 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:36,550 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:36,550 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:36,550 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:36,550 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:36,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:36,553 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:36,553 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:36,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:36,553 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:36,553 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:36,629 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:36,629 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:36,629 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:36,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:36,630 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:36,630 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:36,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1317 [2022-12-06 07:29:36,630 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-06 07:29:36,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:36,630 INFO L85 PathProgramCache]: Analyzing trace with hash 456971261, now seen corresponding path program 1 times [2022-12-06 07:29:36,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:36,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969732673] [2022-12-06 07:29:36,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:36,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:36,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-06 07:29:36,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:36,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969732673] [2022-12-06 07:29:36,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969732673] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:36,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:36,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:36,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229599078] [2022-12-06 07:29:36,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:36,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:36,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:36,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:36,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:36,692 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:36,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:36,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:36,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:36,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:36,729 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:36,729 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:36,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:36,729 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:36,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:36,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:36,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:36,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:36,730 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:36,730 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:36,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:36,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:36,731 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:36,731 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:36,731 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:36,731 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:36,731 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:36,731 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:36,731 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:36,731 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:36,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:36,733 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:36,734 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:36,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:36,734 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:36,734 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:36,811 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:36,811 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:29:36,811 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:36,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:36,811 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:36,811 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:36,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1318 [2022-12-06 07:29:36,812 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-06 07:29:36,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:36,812 INFO L85 PathProgramCache]: Analyzing trace with hash 487447454, now seen corresponding path program 1 times [2022-12-06 07:29:36,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:36,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403380529] [2022-12-06 07:29:36,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:36,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:36,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-06 07:29:36,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:36,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403380529] [2022-12-06 07:29:36,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403380529] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:36,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:36,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:36,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855352617] [2022-12-06 07:29:36,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:36,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:36,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:36,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:36,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:36,872 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:36,872 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:36,872 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:36,872 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:36,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:36,915 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:36,916 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:36,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:36,916 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:36,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:36,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:36,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:36,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:36,917 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:36,917 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:36,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:36,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:36,917 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:36,917 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:36,918 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:36,918 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:36,918 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:36,918 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:36,918 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:36,918 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:36,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:36,920 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:36,920 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:36,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:36,921 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:36,921 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:36,996 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:36,997 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:36,997 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:36,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:36,997 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:36,997 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:36,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1319 [2022-12-06 07:29:36,997 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-06 07:29:36,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:36,997 INFO L85 PathProgramCache]: Analyzing trace with hash 514229563, now seen corresponding path program 1 times [2022-12-06 07:29:36,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:36,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862472984] [2022-12-06 07:29:36,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:36,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:37,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-06 07:29:37,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:37,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862472984] [2022-12-06 07:29:37,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862472984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:37,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:37,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:37,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078809764] [2022-12-06 07:29:37,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:37,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:37,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:37,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:37,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:37,067 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:37,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:37,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:37,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:37,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:37,108 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:37,108 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:37,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:37,108 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:37,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:37,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:37,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:37,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:37,109 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:37,109 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:37,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:37,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:37,110 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:37,110 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:37,110 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:37,110 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:37,110 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:37,110 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:37,110 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:37,110 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:37,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:37,112 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:37,112 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:37,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:37,113 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:37,113 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:37,187 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:37,187 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:37,187 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:37,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:37,187 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:37,188 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:37,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1320 [2022-12-06 07:29:37,188 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-06 07:29:37,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:37,188 INFO L85 PathProgramCache]: Analyzing trace with hash 544705756, now seen corresponding path program 1 times [2022-12-06 07:29:37,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:37,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889940518] [2022-12-06 07:29:37,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:37,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:37,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-06 07:29:37,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:37,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889940518] [2022-12-06 07:29:37,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889940518] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:37,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:37,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:37,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029155507] [2022-12-06 07:29:37,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:37,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:37,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:37,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:37,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:37,249 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:37,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:37,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:37,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:37,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:37,293 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:37,293 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:37,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:37,293 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:37,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:37,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:37,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:37,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:37,294 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:37,294 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:37,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:37,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:37,295 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:37,295 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:37,295 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:37,295 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:37,295 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:37,295 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:37,295 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:37,295 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:37,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:37,297 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:37,297 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:37,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:37,298 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:37,298 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:37,373 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:37,374 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:37,374 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:37,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:37,374 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:37,374 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:37,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1321 [2022-12-06 07:29:37,374 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-06 07:29:37,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:37,374 INFO L85 PathProgramCache]: Analyzing trace with hash 571487865, now seen corresponding path program 1 times [2022-12-06 07:29:37,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:37,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599786621] [2022-12-06 07:29:37,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:37,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:37,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:37,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:37,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599786621] [2022-12-06 07:29:37,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599786621] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:37,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:37,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:37,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274211219] [2022-12-06 07:29:37,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:37,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:37,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:37,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:37,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:37,447 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:37,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:37,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:37,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:37,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:37,489 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:37,489 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:37,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:37,490 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:37,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:37,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:37,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:37,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:37,490 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:37,490 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:37,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:37,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:37,491 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:37,491 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:37,491 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:37,491 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:37,491 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:37,491 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:37,491 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:37,492 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:37,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:37,494 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:37,494 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:37,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:37,494 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:37,494 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:37,570 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:37,571 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:29:37,571 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:37,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:37,571 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:37,571 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:37,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1322 [2022-12-06 07:29:37,571 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-06 07:29:37,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:37,571 INFO L85 PathProgramCache]: Analyzing trace with hash 601964058, now seen corresponding path program 1 times [2022-12-06 07:29:37,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:37,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695489945] [2022-12-06 07:29:37,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:37,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:37,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-06 07:29:37,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:37,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695489945] [2022-12-06 07:29:37,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695489945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:37,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:37,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:37,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771102441] [2022-12-06 07:29:37,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:37,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:37,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:37,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:37,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:37,630 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:37,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:37,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:37,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:37,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:37,666 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:37,666 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:37,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:37,667 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:37,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:37,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:37,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:37,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:37,667 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:37,667 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:37,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:37,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:37,668 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:37,668 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:37,668 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:37,668 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:37,668 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:37,669 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:37,669 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:37,669 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:37,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:37,671 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:37,671 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:37,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:37,671 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:37,671 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:37,745 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:37,746 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:37,746 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:37,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:37,746 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:37,746 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:37,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1323 [2022-12-06 07:29:37,746 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-06 07:29:37,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:37,746 INFO L85 PathProgramCache]: Analyzing trace with hash 628746167, now seen corresponding path program 1 times [2022-12-06 07:29:37,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:37,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749346951] [2022-12-06 07:29:37,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:37,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:37,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-06 07:29:37,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:37,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749346951] [2022-12-06 07:29:37,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749346951] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:37,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:37,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:37,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367769905] [2022-12-06 07:29:37,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:37,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:37,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:37,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:37,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:37,809 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:37,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:37,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:37,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:37,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:37,845 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:37,845 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:37,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:37,846 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:37,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:37,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:37,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:37,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:37,846 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:37,846 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:37,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:37,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:37,847 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:37,847 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:37,847 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:37,847 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:37,847 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:37,847 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:37,847 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:37,847 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:37,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:37,850 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:37,850 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:37,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:37,850 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:37,850 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:37,923 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:37,924 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:37,924 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:37,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:37,924 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:37,924 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:37,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1324 [2022-12-06 07:29:37,924 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-06 07:29:37,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:37,924 INFO L85 PathProgramCache]: Analyzing trace with hash 659222360, now seen corresponding path program 1 times [2022-12-06 07:29:37,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:37,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207724064] [2022-12-06 07:29:37,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:37,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29: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-06 07:29:37,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:37,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207724064] [2022-12-06 07:29:37,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207724064] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:37,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:37,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:37,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541891746] [2022-12-06 07:29:37,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:37,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:37,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:37,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:37,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:37,984 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:37,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:37,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:37,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:37,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:38,027 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:38,027 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:38,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:38,027 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:38,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:38,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:38,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:38,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:38,028 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:38,028 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:38,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:38,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:38,028 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:38,029 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:38,029 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:38,029 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:38,029 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:38,029 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:38,029 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:38,029 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:38,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:38,031 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:38,031 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:38,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:38,032 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:38,032 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:38,105 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:38,105 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:38,106 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:38,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:38,106 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:38,106 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:38,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1325 [2022-12-06 07:29:38,106 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-06 07:29:38,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:38,106 INFO L85 PathProgramCache]: Analyzing trace with hash 686004469, now seen corresponding path program 1 times [2022-12-06 07:29:38,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:38,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814591374] [2022-12-06 07:29:38,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:38,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:38,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-06 07:29:38,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:38,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814591374] [2022-12-06 07:29:38,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814591374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:38,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:38,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:38,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190987431] [2022-12-06 07:29:38,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:38,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:38,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:38,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:38,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:38,170 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:38,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:38,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:38,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:38,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:38,205 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:38,205 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:38,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:38,205 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:38,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:38,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:38,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:38,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:38,206 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:38,206 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:38,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:38,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:38,207 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:38,207 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:38,207 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:38,207 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:38,207 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:38,207 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:38,207 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:38,207 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:38,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:38,209 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:38,210 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:38,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:38,210 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:38,210 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:38,283 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:38,283 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:38,283 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:38,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:38,284 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:38,284 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:38,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1326 [2022-12-06 07:29:38,284 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-06 07:29:38,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:38,284 INFO L85 PathProgramCache]: Analyzing trace with hash 716480662, now seen corresponding path program 1 times [2022-12-06 07:29:38,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:38,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484932962] [2022-12-06 07:29:38,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:38,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:38,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-06 07:29:38,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:38,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484932962] [2022-12-06 07:29:38,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484932962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:38,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:38,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:38,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699211369] [2022-12-06 07:29:38,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:38,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:38,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:38,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:38,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:38,355 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:38,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:38,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:38,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:38,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:38,398 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:38,398 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:38,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:38,398 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:38,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:38,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:38,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:38,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:38,399 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:38,399 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:38,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:38,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:38,400 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:38,400 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:38,400 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:38,400 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:38,400 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:38,400 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:38,400 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:38,400 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:38,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:38,402 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:38,402 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:38,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:38,403 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:38,403 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:38,485 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:38,486 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-06 07:29:38,486 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:38,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:38,486 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:38,486 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:38,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1327 [2022-12-06 07:29:38,486 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-06 07:29:38,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:38,486 INFO L85 PathProgramCache]: Analyzing trace with hash 743262771, now seen corresponding path program 1 times [2022-12-06 07:29:38,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:38,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739710236] [2022-12-06 07:29:38,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:38,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:38,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-06 07:29:38,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:38,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739710236] [2022-12-06 07:29:38,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739710236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:38,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:38,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:38,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289954888] [2022-12-06 07:29:38,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:38,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:38,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:38,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:38,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:38,549 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:38,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:38,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:38,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:38,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:38,590 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:38,591 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:38,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:38,591 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:38,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:38,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:38,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:38,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:38,592 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:38,592 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:38,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:38,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:38,592 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:38,592 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:38,592 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:38,592 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:38,593 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:38,593 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:38,593 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:38,593 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:38,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:38,595 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:38,595 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:38,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:38,595 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:38,595 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:38,667 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:38,668 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:38,668 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:38,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:38,668 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:38,668 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:38,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1328 [2022-12-06 07:29:38,668 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-06 07:29:38,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:38,668 INFO L85 PathProgramCache]: Analyzing trace with hash 773738964, now seen corresponding path program 1 times [2022-12-06 07:29:38,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:38,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433058556] [2022-12-06 07:29:38,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:38,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:38,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-06 07:29:38,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:38,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433058556] [2022-12-06 07:29:38,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433058556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:38,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:38,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:38,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269385699] [2022-12-06 07:29:38,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:38,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:38,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:38,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:38,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:38,731 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:38,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:38,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:38,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:38,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:38,769 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:38,769 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:38,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:38,770 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:38,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:38,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:38,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:38,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:38,770 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:38,770 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:38,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:38,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:38,771 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:38,771 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:38,771 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:38,771 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:38,771 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:38,771 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:38,771 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:38,771 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:38,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:38,774 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:38,774 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:38,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:38,774 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:38,774 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:38,848 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:38,849 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:38,849 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:38,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:38,849 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:38,849 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:38,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1329 [2022-12-06 07:29:38,849 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-06 07:29:38,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:38,849 INFO L85 PathProgramCache]: Analyzing trace with hash 800521073, now seen corresponding path program 1 times [2022-12-06 07:29:38,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:38,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491509355] [2022-12-06 07:29:38,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:38,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:38,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-06 07:29:38,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:38,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491509355] [2022-12-06 07:29:38,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491509355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:38,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:38,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:38,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014905706] [2022-12-06 07:29:38,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:38,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:38,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:38,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:38,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:38,916 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:38,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:38,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:38,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:38,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:38,951 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:38,951 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:38,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:38,952 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:38,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:38,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:38,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:38,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:38,953 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:38,953 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:38,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:38,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:38,953 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:38,953 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:38,953 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:38,954 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:38,954 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:38,954 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:38,954 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:38,954 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:38,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:38,956 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:38,956 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:38,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:38,956 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:38,957 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:39,033 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:39,034 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:29:39,034 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:39,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:39,034 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:39,034 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:39,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1330 [2022-12-06 07:29:39,035 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-06 07:29:39,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:39,035 INFO L85 PathProgramCache]: Analyzing trace with hash 830997266, now seen corresponding path program 1 times [2022-12-06 07:29:39,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:39,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834166918] [2022-12-06 07:29:39,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:39,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:39,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-06 07:29:39,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:39,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834166918] [2022-12-06 07:29:39,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834166918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:39,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:39,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:39,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909084148] [2022-12-06 07:29:39,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:39,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:39,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:39,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:39,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:39,095 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:39,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:39,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:39,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:39,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:39,138 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:39,138 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:39,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:39,139 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:39,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:39,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:39,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:39,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:39,139 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:39,139 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:39,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:39,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:39,140 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:39,140 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:39,140 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:39,140 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:39,140 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:39,140 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:39,140 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:39,140 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:39,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:39,143 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:39,143 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:39,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:39,143 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:39,143 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:39,239 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:39,240 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 07:29:39,240 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:39,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:39,240 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:39,240 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:39,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1331 [2022-12-06 07:29:39,240 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-06 07:29:39,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:39,241 INFO L85 PathProgramCache]: Analyzing trace with hash 857779375, now seen corresponding path program 1 times [2022-12-06 07:29:39,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:39,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948811023] [2022-12-06 07:29:39,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:39,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:39,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-06 07:29:39,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:39,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948811023] [2022-12-06 07:29:39,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948811023] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:39,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:39,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:39,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39984398] [2022-12-06 07:29:39,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:39,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:39,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:39,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:39,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:39,324 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:39,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:39,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:39,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:39,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:39,390 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:39,390 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:39,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:39,391 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:39,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:39,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:39,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:39,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:39,392 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:39,392 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:39,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:39,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:39,392 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:39,393 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:39,393 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:39,393 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:39,393 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:39,393 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:39,393 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:39,393 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:39,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:39,396 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:39,396 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:39,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:39,397 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:39,397 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:39,490 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:39,491 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 07:29:39,491 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:39,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:39,491 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:39,491 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:39,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1332 [2022-12-06 07:29:39,491 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-06 07:29:39,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:39,492 INFO L85 PathProgramCache]: Analyzing trace with hash 888255568, now seen corresponding path program 1 times [2022-12-06 07:29:39,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:39,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712333101] [2022-12-06 07:29:39,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:39,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:39,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-06 07:29:39,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:39,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712333101] [2022-12-06 07:29:39,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712333101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:39,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:39,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:39,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750084971] [2022-12-06 07:29:39,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:39,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:39,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:39,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:39,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:39,578 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:39,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:39,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:39,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:39,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:39,638 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:39,638 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:39,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:39,639 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:39,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:39,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:39,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:39,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:39,639 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:39,639 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:39,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:39,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:39,640 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:39,640 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:39,641 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:39,641 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:39,641 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:39,641 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:39,641 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:39,641 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:39,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:39,644 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:39,644 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:39,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:39,644 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:39,644 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:39,738 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:39,739 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 07:29:39,739 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:39,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:39,739 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:39,739 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:39,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1333 [2022-12-06 07:29:39,739 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-06 07:29:39,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:39,739 INFO L85 PathProgramCache]: Analyzing trace with hash 915037677, now seen corresponding path program 1 times [2022-12-06 07:29:39,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:39,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002257165] [2022-12-06 07:29:39,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:39,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:39,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-06 07:29:39,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:39,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002257165] [2022-12-06 07:29:39,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002257165] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:39,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:39,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:39,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845124698] [2022-12-06 07:29:39,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:39,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:39,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:39,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:39,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:39,819 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:39,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:39,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:39,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:39,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:39,856 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:39,856 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:39,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:39,856 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:39,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:39,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:39,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:39,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:39,857 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:39,857 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:39,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:39,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:39,858 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:39,858 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:39,858 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:39,858 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:39,858 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:39,858 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:39,858 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:39,858 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:39,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:39,860 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:39,861 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:39,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:39,861 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:39,861 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:39,937 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:39,938 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:29:39,938 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:39,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:39,938 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:39,938 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:39,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1334 [2022-12-06 07:29:39,938 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-06 07:29:39,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:39,938 INFO L85 PathProgramCache]: Analyzing trace with hash 945513870, now seen corresponding path program 1 times [2022-12-06 07:29:39,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:39,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344500494] [2022-12-06 07:29:39,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:39,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:40,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-06 07:29:40,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:40,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344500494] [2022-12-06 07:29:40,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344500494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:40,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:40,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:40,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571013338] [2022-12-06 07:29:40,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:40,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:40,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:40,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:40,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:40,003 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:40,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:40,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:40,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:40,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:40,045 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:40,045 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:40,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:40,046 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:40,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:40,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:40,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:40,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:40,046 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:40,046 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:40,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:40,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:40,047 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:40,047 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:40,047 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:40,047 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:40,047 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:40,047 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:40,047 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:40,047 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:40,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:40,050 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:40,050 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:40,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:40,050 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:40,050 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:40,125 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:40,126 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:40,126 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:40,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:40,126 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:40,126 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:40,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1335 [2022-12-06 07:29:40,126 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-06 07:29:40,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:40,126 INFO L85 PathProgramCache]: Analyzing trace with hash 972295979, now seen corresponding path program 1 times [2022-12-06 07:29:40,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:40,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270513527] [2022-12-06 07:29:40,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:40,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:40,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-06 07:29:40,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:40,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270513527] [2022-12-06 07:29:40,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270513527] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:40,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:40,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:40,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807751583] [2022-12-06 07:29:40,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:40,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:40,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:40,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:40,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:40,190 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:40,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:40,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:40,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:40,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:40,225 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:40,225 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:40,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:40,226 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:40,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:40,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:40,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:40,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:40,226 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:40,226 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:40,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:40,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:40,227 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:40,227 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:40,227 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:40,227 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:40,227 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:40,227 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:40,228 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:40,228 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:40,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:40,230 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:40,230 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:40,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:40,230 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:40,230 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:40,303 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:40,304 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:40,304 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:40,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:40,304 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:40,304 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:40,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1336 [2022-12-06 07:29:40,304 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-06 07:29:40,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:40,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1002772172, now seen corresponding path program 1 times [2022-12-06 07:29:40,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:40,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487992957] [2022-12-06 07:29:40,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:40,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:40,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-06 07:29:40,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:40,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487992957] [2022-12-06 07:29:40,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487992957] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:40,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:40,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:40,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105658117] [2022-12-06 07:29:40,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:40,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:40,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:40,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:40,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:40,369 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:40,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:40,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:40,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:40,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:40,406 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:40,406 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:40,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:40,407 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:40,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:40,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:40,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:40,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:40,407 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:40,407 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:40,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:40,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:40,408 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:40,408 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:40,408 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:40,408 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:40,408 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:40,408 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:40,408 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:40,408 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:40,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:40,410 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:40,410 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:40,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:40,411 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:40,411 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:40,485 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:40,486 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:40,486 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:40,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:40,486 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:40,486 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:40,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1337 [2022-12-06 07:29:40,486 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-06 07:29:40,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:40,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1029554281, now seen corresponding path program 1 times [2022-12-06 07:29:40,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:40,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298952350] [2022-12-06 07:29:40,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:40,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:40,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-06 07:29:40,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:40,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298952350] [2022-12-06 07:29:40,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298952350] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:40,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:40,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:40,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540734021] [2022-12-06 07:29:40,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:40,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:40,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:40,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:40,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:40,554 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:40,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:40,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:40,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:40,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:40,589 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:40,590 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:40,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:40,590 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:40,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:40,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:40,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:40,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:40,590 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:40,591 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:40,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:40,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:40,591 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:40,591 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:40,591 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:40,591 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:40,591 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:40,592 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:40,592 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:40,592 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:40,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:40,594 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:40,594 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:40,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:40,594 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:40,594 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:40,668 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:40,668 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:40,668 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:40,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:40,669 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:40,669 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:40,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1338 [2022-12-06 07:29:40,669 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-06 07:29:40,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:40,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1060030474, now seen corresponding path program 1 times [2022-12-06 07:29:40,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:40,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481906605] [2022-12-06 07:29:40,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:40,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:40,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-06 07:29:40,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:40,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481906605] [2022-12-06 07:29:40,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481906605] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:40,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:40,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:40,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932534312] [2022-12-06 07:29:40,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:40,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:40,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:40,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:40,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:40,730 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:40,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:40,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:40,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:40,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:40,766 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:40,766 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:40,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:40,766 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:40,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:40,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:40,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:40,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:40,767 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:40,767 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:40,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:40,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:40,768 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:40,768 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:40,768 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:40,768 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:40,768 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:40,768 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:40,768 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:40,768 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:40,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:40,770 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:40,770 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:40,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:40,771 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:40,771 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:40,843 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:40,844 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:40,844 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:40,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:40,844 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:40,844 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:40,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1339 [2022-12-06 07:29:40,844 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-06 07:29:40,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:40,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1086812583, now seen corresponding path program 1 times [2022-12-06 07:29:40,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:40,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598407004] [2022-12-06 07:29:40,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:40,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:40,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-06 07:29:40,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:40,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598407004] [2022-12-06 07:29:40,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598407004] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:40,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:40,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:40,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583388897] [2022-12-06 07:29:40,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:40,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:40,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:40,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:40,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:40,903 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:40,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:40,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:40,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:40,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:40,948 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:40,948 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:40,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:40,948 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:40,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:40,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:40,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:40,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:40,949 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:40,949 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:40,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:40,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:40,950 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:40,950 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:40,950 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:40,950 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:40,950 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:40,950 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:40,950 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:40,950 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:40,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:40,952 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:40,953 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:40,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:40,953 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:40,953 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:41,027 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:41,028 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:41,028 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:41,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:41,028 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:41,028 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:41,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1340 [2022-12-06 07:29:41,028 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-06 07:29:41,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:41,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1117288776, now seen corresponding path program 1 times [2022-12-06 07:29:41,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:41,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150507962] [2022-12-06 07:29:41,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:41,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:41,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-06 07:29:41,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:41,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150507962] [2022-12-06 07:29:41,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150507962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:41,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:41,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:41,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785966513] [2022-12-06 07:29:41,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:41,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:41,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:41,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:41,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:41,088 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:41,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:41,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:41,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:41,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:41,130 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:41,130 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:41,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:41,130 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:41,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:41,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:41,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:41,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:41,131 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:41,131 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:41,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:41,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:41,131 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:41,131 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:41,132 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:41,132 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:41,132 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:41,132 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:41,132 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:41,132 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:41,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:41,134 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:41,134 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:41,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:41,134 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:41,134 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:41,208 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:41,208 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:41,208 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:41,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:41,208 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:41,208 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:41,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1341 [2022-12-06 07:29:41,209 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-06 07:29:41,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:41,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1144070885, now seen corresponding path program 1 times [2022-12-06 07:29:41,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:41,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565739430] [2022-12-06 07:29:41,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:41,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:41,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:41,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:41,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565739430] [2022-12-06 07:29:41,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565739430] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:41,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:41,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:41,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249090343] [2022-12-06 07:29:41,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:41,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:41,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:41,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:41,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:41,272 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:41,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:41,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:41,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:41,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:41,308 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:41,308 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:41,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:41,309 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:41,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:41,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:41,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:41,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:41,309 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:41,309 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:41,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:41,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:41,310 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:41,310 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:41,310 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:41,310 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:41,310 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:41,311 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:41,311 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:41,311 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:41,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:41,313 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:41,313 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:41,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:41,313 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:41,313 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:41,386 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:41,387 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:41,387 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:41,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:41,387 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:41,388 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:41,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1342 [2022-12-06 07:29:41,388 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-06 07:29:41,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:41,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1174547078, now seen corresponding path program 1 times [2022-12-06 07:29:41,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:41,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768261394] [2022-12-06 07:29:41,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:41,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:41,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-06 07:29:41,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:41,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768261394] [2022-12-06 07:29:41,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768261394] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:41,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:41,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:41,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796714190] [2022-12-06 07:29:41,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:41,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:41,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:41,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:41,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:41,459 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:41,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:41,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:41,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:41,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:41,495 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:41,495 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:41,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:41,496 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:41,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:41,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:41,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:41,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:41,496 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:41,496 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:41,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:41,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:41,497 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:41,497 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:41,497 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:41,497 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:41,497 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:41,497 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:41,497 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:41,498 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:41,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:41,500 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:41,500 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:41,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:41,500 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:41,500 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:41,574 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:41,575 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:41,575 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:41,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:41,575 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:41,575 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:41,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1343 [2022-12-06 07:29:41,575 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-06 07:29:41,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:41,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1201329187, now seen corresponding path program 1 times [2022-12-06 07:29:41,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:41,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073627760] [2022-12-06 07:29:41,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:41,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:41,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-06 07:29:41,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:41,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073627760] [2022-12-06 07:29:41,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073627760] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:41,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:41,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:41,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851017461] [2022-12-06 07:29:41,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:41,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:41,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:41,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:41,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:41,636 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:41,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:41,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:41,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:41,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:41,677 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:41,677 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:41,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:41,678 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:41,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:41,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:41,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:41,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:41,678 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:41,678 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:41,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:41,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:41,679 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:41,679 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:41,679 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:41,679 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:41,679 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:41,679 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:41,679 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:41,679 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:41,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:41,681 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:41,682 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:41,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:41,682 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:41,682 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:41,755 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:41,756 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:41,756 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:41,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:41,756 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:41,756 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:41,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1344 [2022-12-06 07:29:41,756 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-06 07:29:41,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:41,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1231805380, now seen corresponding path program 1 times [2022-12-06 07:29:41,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:41,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38222488] [2022-12-06 07:29:41,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:41,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:41,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:41,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-06 07:29:41,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:41,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38222488] [2022-12-06 07:29:41,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38222488] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:41,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:41,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:41,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393999875] [2022-12-06 07:29:41,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:41,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:41,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:41,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:41,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:41,816 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:41,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:41,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:41,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:41,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:41,858 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:41,858 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:41,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:41,858 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:41,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:41,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:41,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:41,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:41,859 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:41,859 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:41,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:41,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:41,859 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:41,859 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:41,860 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:41,860 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:41,860 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:41,860 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:41,860 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:41,860 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:41,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:41,862 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:41,862 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:41,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:41,862 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:41,862 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:41,937 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:41,937 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:41,937 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:41,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:41,937 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:41,937 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:41,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1345 [2022-12-06 07:29:41,938 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-06 07:29:41,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:41,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1258587489, now seen corresponding path program 1 times [2022-12-06 07:29:41,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:41,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795268677] [2022-12-06 07:29:41,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:41,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:42,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:42,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:42,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795268677] [2022-12-06 07:29:42,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795268677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:42,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:42,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:42,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178089494] [2022-12-06 07:29:42,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:42,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:42,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:42,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:42,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:42,003 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:42,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:42,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:42,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:42,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:42,038 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:42,038 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:42,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 372 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:42,038 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:42,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:42,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:42,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:42,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:42,039 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:42,039 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:42,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:42,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:42,039 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:42,039 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:42,040 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:42,040 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:42,040 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:42,040 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:42,040 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:42,040 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:42,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:42,042 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:42,042 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:42,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:42,042 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:42,042 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:42,115 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:42,115 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:29:42,115 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:42,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:42,115 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:42,115 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:42,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1346 [2022-12-06 07:29:42,116 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-06 07:29:42,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:42,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1289063682, now seen corresponding path program 1 times [2022-12-06 07:29:42,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:42,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439777422] [2022-12-06 07:29:42,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:42,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:42,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-06 07:29:42,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:42,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439777422] [2022-12-06 07:29:42,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439777422] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:42,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:42,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:42,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025702154] [2022-12-06 07:29:42,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:42,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:42,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:42,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:42,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:42,176 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:42,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:42,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:42,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:42,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:42,219 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:42,219 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:42,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 336 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:42,219 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:42,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:42,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:42,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:42,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:42,220 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:42,220 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:42,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:42,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:42,220 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:42,221 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:42,221 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:42,221 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:42,221 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:42,221 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:42,221 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:42,221 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:42,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:42,223 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:42,223 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:42,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:42,223 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:42,224 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:42,297 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:42,297 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:42,297 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:42,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:42,298 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:42,298 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:42,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1347 [2022-12-06 07:29:42,298 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-06 07:29:42,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:42,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1315845791, now seen corresponding path program 1 times [2022-12-06 07:29:42,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:42,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223071771] [2022-12-06 07:29:42,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:42,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:42,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-06 07:29:42,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:42,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223071771] [2022-12-06 07:29:42,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223071771] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:42,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:42,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:42,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777478759] [2022-12-06 07:29:42,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:42,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:42,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:42,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:42,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:42,372 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:42,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:42,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:42,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:42,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:42,412 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:42,412 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:42,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:42,412 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:42,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:42,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:42,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:42,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:42,413 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:42,413 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:42,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:42,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:42,414 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:42,414 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:42,414 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:42,414 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:42,414 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:42,414 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:42,414 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:42,414 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:42,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:42,416 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:42,416 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:42,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:42,417 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:42,417 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:42,491 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:42,492 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:42,492 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:42,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:42,492 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:42,492 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:42,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1348 [2022-12-06 07:29:42,492 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-06 07:29:42,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:42,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1346321984, now seen corresponding path program 1 times [2022-12-06 07:29:42,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:42,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563522715] [2022-12-06 07:29:42,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:42,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:42,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-06 07:29:42,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:42,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563522715] [2022-12-06 07:29:42,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563522715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:42,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:42,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:42,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844490754] [2022-12-06 07:29:42,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:42,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:42,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:42,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:42,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:42,557 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:42,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:42,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:42,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:42,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:42,595 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:42,595 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:42,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:42,596 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:42,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:42,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:42,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:42,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:42,596 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:42,596 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:42,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:42,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:42,597 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:42,597 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:42,597 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:42,597 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:42,597 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:42,597 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:42,598 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:42,598 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:42,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:42,600 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:42,600 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:42,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:42,600 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:42,600 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:42,675 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:42,676 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:42,676 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:42,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:42,676 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:42,676 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:42,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1349 [2022-12-06 07:29:42,676 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-06 07:29:42,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:42,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1373104093, now seen corresponding path program 1 times [2022-12-06 07:29:42,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:42,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046978471] [2022-12-06 07:29:42,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:42,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:42,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-06 07:29:42,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:42,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046978471] [2022-12-06 07:29:42,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046978471] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:42,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:42,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:42,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204059292] [2022-12-06 07:29:42,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:42,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:42,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:42,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:42,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:42,739 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:42,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:42,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:42,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:42,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:42,777 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:42,777 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:42,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:42,778 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:42,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:42,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:42,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:42,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:42,778 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:42,778 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:42,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:42,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:42,779 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:42,779 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:42,779 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:42,779 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:42,779 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:42,780 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:42,780 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:42,780 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:42,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:42,782 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:42,782 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:42,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:42,782 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:42,782 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:42,857 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:42,858 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:42,858 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:42,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:42,858 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:42,858 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:42,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1350 [2022-12-06 07:29:42,858 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-06 07:29:42,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:42,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1403580286, now seen corresponding path program 1 times [2022-12-06 07:29:42,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:42,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360134366] [2022-12-06 07:29:42,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:42,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:42,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-06 07:29:42,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:42,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360134366] [2022-12-06 07:29:42,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360134366] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:42,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:42,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:42,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46456907] [2022-12-06 07:29:42,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:42,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:42,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:42,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:42,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:42,920 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:42,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:42,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:42,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:42,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:42,964 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:42,965 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:42,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 349 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:42,965 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:42,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:42,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:42,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:42,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:42,966 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:42,966 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:42,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:42,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:42,966 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:42,967 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:42,967 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:42,967 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:42,967 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:42,967 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:42,967 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:42,967 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:42,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:42,969 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:42,969 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:42,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:42,970 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:42,970 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:43,047 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:43,047 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:29:43,047 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:43,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:43,048 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:43,048 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:43,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1351 [2022-12-06 07:29:43,048 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-06 07:29:43,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:43,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1430362395, now seen corresponding path program 1 times [2022-12-06 07:29:43,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:43,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235402491] [2022-12-06 07:29:43,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:43,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:43,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-06 07:29:43,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:43,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235402491] [2022-12-06 07:29:43,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235402491] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:43,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:43,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:43,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377079666] [2022-12-06 07:29:43,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:43,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:43,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:43,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:43,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:43,111 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:43,111 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:43,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:43,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:43,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:43,146 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:43,146 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:43,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:43,146 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:43,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:43,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:43,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:43,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:43,147 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:43,147 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:43,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:43,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:43,148 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:43,148 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:43,148 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:43,148 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:43,148 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:43,148 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:43,148 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:43,148 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:43,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:43,150 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:43,150 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:43,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:43,151 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:43,151 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:43,226 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:43,227 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:43,227 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:43,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:43,227 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:43,227 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:43,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1352 [2022-12-06 07:29:43,227 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-06 07:29:43,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:43,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1460838588, now seen corresponding path program 1 times [2022-12-06 07:29:43,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:43,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448000015] [2022-12-06 07:29:43,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:43,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:43,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-06 07:29:43,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:43,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448000015] [2022-12-06 07:29:43,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448000015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:43,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:43,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:43,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523422362] [2022-12-06 07:29:43,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:43,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:43,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:43,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:43,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:43,288 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:43,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:43,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:43,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:43,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:43,324 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:43,324 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:43,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:43,325 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:43,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:43,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:43,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:43,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:43,326 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:43,326 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:43,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:43,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:43,326 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:43,326 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:43,327 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:43,327 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:43,327 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:43,327 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:43,327 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:43,327 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:43,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:43,329 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:43,329 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:43,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:43,330 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:43,330 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:43,415 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:43,415 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 07:29:43,415 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:43,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:43,415 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:43,415 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:43,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1353 [2022-12-06 07:29:43,416 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-06 07:29:43,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:43,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1487620697, now seen corresponding path program 1 times [2022-12-06 07:29:43,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:43,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648604784] [2022-12-06 07:29:43,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:43,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:43,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-06 07:29:43,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:43,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648604784] [2022-12-06 07:29:43,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648604784] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:43,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:43,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:43,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56805026] [2022-12-06 07:29:43,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:43,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:43,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:43,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:43,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:43,481 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:43,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:43,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:43,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:43,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:43,523 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:43,523 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:43,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:43,524 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:43,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:43,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:43,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:43,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:43,524 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:43,524 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:43,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:43,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:43,525 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:43,525 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:43,525 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:43,525 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:43,525 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:43,525 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:43,525 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:43,526 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:43,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:43,528 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:43,528 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:43,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:43,528 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:43,528 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:43,603 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:43,604 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:43,604 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:43,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:43,604 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:43,604 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:43,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1354 [2022-12-06 07:29:43,604 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-06 07:29:43,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:43,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1518096890, now seen corresponding path program 1 times [2022-12-06 07:29:43,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:43,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851104134] [2022-12-06 07:29:43,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:43,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:43,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-06 07:29:43,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:43,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851104134] [2022-12-06 07:29:43,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851104134] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:43,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:43,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:43,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570687391] [2022-12-06 07:29:43,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:43,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:43,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:43,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:43,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:43,664 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:43,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:43,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:43,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:43,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:43,700 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:43,701 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:43,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:43,701 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:43,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:43,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:43,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:43,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:43,702 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:43,702 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:43,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:43,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:43,702 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:43,702 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:43,703 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:43,703 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:43,703 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:43,703 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:43,703 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:43,703 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:43,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:43,705 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:43,705 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:43,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:43,705 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:43,705 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:43,779 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:43,780 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:43,780 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:43,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:43,780 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:43,780 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:43,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1355 [2022-12-06 07:29:43,780 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-06 07:29:43,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:43,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1544878999, now seen corresponding path program 1 times [2022-12-06 07:29:43,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:43,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616001972] [2022-12-06 07:29:43,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:43,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:43,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29: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-06 07:29:43,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:43,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616001972] [2022-12-06 07:29:43,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616001972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:43,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:43,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:43,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724557341] [2022-12-06 07:29:43,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:43,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:43,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:43,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:43,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:43,843 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:43,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:43,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:43,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:43,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:43,885 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:43,885 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:43,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 374 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:43,886 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:43,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:43,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:43,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:43,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:43,886 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:43,886 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:43,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:43,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:43,887 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:43,887 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:43,887 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:43,887 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:43,887 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:43,887 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:43,888 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:43,888 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:43,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:43,890 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:43,890 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:43,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:43,890 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:43,890 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:43,965 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:43,965 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:43,965 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:43,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:43,965 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:43,965 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:43,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1356 [2022-12-06 07:29:43,966 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-06 07:29:43,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:43,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1575355192, now seen corresponding path program 1 times [2022-12-06 07:29:43,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:43,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996539555] [2022-12-06 07:29:43,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:43,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:44,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-06 07:29:44,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:44,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996539555] [2022-12-06 07:29:44,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996539555] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:44,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:44,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:44,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991912397] [2022-12-06 07:29:44,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:44,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:44,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:44,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:44,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:44,027 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:44,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:44,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:44,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:44,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:44,068 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:44,068 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:44,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:44,069 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:44,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:44,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:44,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:44,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:44,069 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:44,069 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:44,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:44,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:44,070 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:44,070 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:44,070 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:44,070 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:44,070 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:44,071 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:44,071 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:44,071 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:44,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:44,073 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:44,073 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:44,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:44,073 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:44,073 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:44,147 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:44,147 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:44,147 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:44,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:44,147 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:44,147 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:44,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1357 [2022-12-06 07:29:44,148 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-06 07:29:44,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:44,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1602137301, now seen corresponding path program 1 times [2022-12-06 07:29:44,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:44,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596081006] [2022-12-06 07:29:44,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:44,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:44,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-06 07:29:44,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:44,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596081006] [2022-12-06 07:29:44,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596081006] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:44,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:44,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:44,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193117295] [2022-12-06 07:29:44,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:44,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:44,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:44,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:44,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:44,212 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:44,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:44,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:44,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:44,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:44,249 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:44,249 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:44,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:44,249 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:44,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:44,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:44,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:44,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:44,250 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:44,250 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:44,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:44,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:44,251 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:44,251 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:44,251 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:44,251 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:44,251 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:44,251 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:44,251 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:44,251 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:44,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:44,253 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:44,253 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:44,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:44,254 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:44,254 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:44,327 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:44,328 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:44,328 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:44,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:44,328 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:44,328 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:44,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1358 [2022-12-06 07:29:44,328 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-06 07:29:44,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:44,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1632613494, now seen corresponding path program 1 times [2022-12-06 07:29:44,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:44,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523273608] [2022-12-06 07:29:44,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:44,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:44,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-06 07:29:44,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:44,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523273608] [2022-12-06 07:29:44,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523273608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:44,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:44,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:44,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191049642] [2022-12-06 07:29:44,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:44,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:44,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:44,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:44,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:44,399 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:44,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:44,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:44,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:44,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:44,436 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:44,436 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:44,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:44,437 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:44,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:44,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:44,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:44,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:44,437 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:44,437 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:44,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:44,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:44,438 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:44,438 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:44,438 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:44,438 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:44,438 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:44,438 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:44,438 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:44,439 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:44,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:44,441 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:44,441 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:44,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:44,441 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:44,441 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:44,515 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:44,516 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:44,516 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:44,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:44,516 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:44,516 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:44,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1359 [2022-12-06 07:29:44,516 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-06 07:29:44,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:44,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1659395603, now seen corresponding path program 1 times [2022-12-06 07:29:44,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:44,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40745632] [2022-12-06 07:29:44,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:44,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:44,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-06 07:29:44,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:44,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40745632] [2022-12-06 07:29:44,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40745632] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:44,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:44,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:44,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653623265] [2022-12-06 07:29:44,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:44,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:44,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:44,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:44,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:44,581 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:44,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:44,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:44,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:44,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:44,623 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:44,623 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:44,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:44,624 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:44,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:44,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:44,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:44,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:44,624 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:44,624 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:44,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:44,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:44,625 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:44,625 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:44,625 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:44,625 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:44,625 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:44,625 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:44,625 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:44,626 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:44,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:44,628 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:44,628 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:44,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:44,628 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:44,628 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:44,702 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:44,702 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:44,703 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:44,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:44,703 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:44,703 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:44,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1360 [2022-12-06 07:29:44,703 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-06 07:29:44,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:44,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1689871796, now seen corresponding path program 1 times [2022-12-06 07:29:44,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:44,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621258914] [2022-12-06 07:29:44,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:44,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29: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-06 07:29:44,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:44,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621258914] [2022-12-06 07:29:44,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621258914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:44,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:44,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:44,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41481527] [2022-12-06 07:29:44,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:44,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:44,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:44,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:44,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:44,780 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:44,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:44,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:44,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:44,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:44,827 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:44,827 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:44,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:44,828 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:44,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:44,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:44,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:44,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:44,828 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:44,828 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:44,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:44,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:44,829 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:44,829 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:44,829 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:44,829 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:44,829 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:44,829 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:44,830 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:44,830 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:44,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:44,832 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:44,832 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:44,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:44,832 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:44,832 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:44,907 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:44,908 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:44,908 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:44,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:44,908 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:44,908 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:44,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1361 [2022-12-06 07:29:44,908 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-06 07:29:44,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:44,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1716653905, now seen corresponding path program 1 times [2022-12-06 07:29:44,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:44,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50446314] [2022-12-06 07:29:44,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:44,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:44,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-06 07:29:44,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:44,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50446314] [2022-12-06 07:29:44,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50446314] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:44,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:44,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:44,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572977308] [2022-12-06 07:29:44,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:44,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:44,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:44,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:44,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:44,972 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:44,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:44,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:44,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:44,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:45,009 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:45,009 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:45,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:45,009 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:45,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:45,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:45,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:45,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:45,010 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:45,010 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:45,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:45,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:45,011 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:45,011 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:45,011 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:45,011 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:45,011 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:45,011 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:45,011 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:45,011 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:45,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:45,014 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:45,014 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:45,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:45,014 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:45,014 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:45,088 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:45,089 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:45,089 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:45,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:45,089 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:45,089 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:45,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1362 [2022-12-06 07:29:45,089 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-06 07:29:45,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:45,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1747130098, now seen corresponding path program 1 times [2022-12-06 07:29:45,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:45,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542250603] [2022-12-06 07:29:45,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:45,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:45,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:45,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:45,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542250603] [2022-12-06 07:29:45,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542250603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:45,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:45,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:45,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333223752] [2022-12-06 07:29:45,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:45,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:45,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:45,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:45,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:45,152 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:45,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:45,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:45,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:45,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:45,196 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:45,196 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:45,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:45,197 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:45,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:45,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:45,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:45,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:45,197 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:45,197 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:45,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:45,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:45,198 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:45,198 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:45,198 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:45,198 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:45,198 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:45,198 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:45,199 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:45,199 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:45,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:45,201 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:45,201 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:45,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:45,201 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:45,201 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:45,277 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:45,277 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:45,277 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:45,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:45,277 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:45,277 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:45,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1363 [2022-12-06 07:29:45,278 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-06 07:29:45,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:45,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1773912207, now seen corresponding path program 1 times [2022-12-06 07:29:45,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:45,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126305048] [2022-12-06 07:29:45,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:45,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:45,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-06 07:29:45,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:45,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126305048] [2022-12-06 07:29:45,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126305048] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:45,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:45,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:45,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024675230] [2022-12-06 07:29:45,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:45,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:45,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:45,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:45,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:45,352 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:45,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:45,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:45,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:45,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:45,388 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:45,388 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:45,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:45,388 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:45,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:45,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:45,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:45,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:45,389 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:45,389 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:45,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:45,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:45,390 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:45,390 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:45,390 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:45,390 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:45,390 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:45,390 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:45,390 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:45,390 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:45,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:45,392 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:45,393 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:45,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:45,393 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:45,393 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:45,467 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:45,467 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:45,468 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:45,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:45,468 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:45,468 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:45,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1364 [2022-12-06 07:29:45,468 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-06 07:29:45,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:45,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1804388400, now seen corresponding path program 1 times [2022-12-06 07:29:45,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:45,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859242781] [2022-12-06 07:29:45,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:45,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:45,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-06 07:29:45,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:45,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859242781] [2022-12-06 07:29:45,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859242781] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:45,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:45,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:45,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616498341] [2022-12-06 07:29:45,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:45,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:45,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:45,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:45,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:45,535 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:45,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:45,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:45,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:45,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:45,572 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:45,573 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:45,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:45,573 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:45,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:45,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:45,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:45,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:45,574 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:45,574 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:45,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:45,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:45,574 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:45,574 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:45,574 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:45,575 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:45,575 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:45,575 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:45,575 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:45,575 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:45,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:45,577 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:45,577 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:45,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 122 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:45,577 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:45,577 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:45,653 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:45,654 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:45,654 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:45,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:45,654 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:45,654 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:45,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1365 [2022-12-06 07:29:45,654 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-06 07:29:45,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:45,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1831170509, now seen corresponding path program 1 times [2022-12-06 07:29:45,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:45,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871625461] [2022-12-06 07:29:45,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:45,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:45,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-06 07:29:45,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:45,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871625461] [2022-12-06 07:29:45,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871625461] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:45,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:45,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:45,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18876059] [2022-12-06 07:29:45,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:45,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:45,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:45,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:45,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:45,718 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:45,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:45,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:45,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:45,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:45,755 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:45,755 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:45,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:45,756 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:45,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:45,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:45,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:45,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:45,757 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:45,757 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:45,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:45,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:45,757 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:45,757 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:45,757 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:45,758 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:45,758 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:45,758 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:45,758 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:45,758 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:45,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:45,760 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:45,760 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:45,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 145 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:45,760 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:45,760 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:45,834 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:45,834 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:45,834 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:45,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:45,834 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:45,834 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:45,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1366 [2022-12-06 07:29:45,835 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-06 07:29:45,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:45,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1861646702, now seen corresponding path program 1 times [2022-12-06 07:29:45,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:45,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325960278] [2022-12-06 07:29:45,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:45,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:45,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-06 07:29:45,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:45,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325960278] [2022-12-06 07:29:45,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325960278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:45,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:45,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:45,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795260310] [2022-12-06 07:29:45,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:45,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:45,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:45,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:45,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:45,894 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:45,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:45,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:45,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:45,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:45,937 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:45,937 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:45,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:45,937 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:45,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:45,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:45,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:45,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:45,938 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:45,938 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:45,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:45,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:45,939 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:45,939 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:45,939 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:45,939 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:45,939 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:45,939 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:45,939 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:45,939 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:45,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:45,941 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:45,941 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:45,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:45,942 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:45,942 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:46,015 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:46,016 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:46,016 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:46,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:46,016 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:46,016 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:46,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1367 [2022-12-06 07:29:46,016 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-06 07:29:46,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:46,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1888428811, now seen corresponding path program 1 times [2022-12-06 07:29:46,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:46,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539427569] [2022-12-06 07:29:46,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:46,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:46,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-06 07:29:46,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:46,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539427569] [2022-12-06 07:29:46,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539427569] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:46,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:46,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:46,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077800781] [2022-12-06 07:29:46,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:46,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:46,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:46,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:46,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:46,080 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:46,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:46,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:46,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:46,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:46,117 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:46,117 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:46,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 375 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:46,118 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:46,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:46,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:46,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:46,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:46,118 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:46,118 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:46,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:46,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:46,119 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:46,119 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:46,119 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:46,119 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:46,119 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:46,120 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:46,120 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:46,120 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:46,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:46,122 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:46,122 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:46,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:46,122 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:46,122 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:46,197 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:46,197 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:46,197 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:46,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:46,198 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:46,198 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:46,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1368 [2022-12-06 07:29:46,198 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-06 07:29:46,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:46,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1918905004, now seen corresponding path program 1 times [2022-12-06 07:29:46,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:46,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782766167] [2022-12-06 07:29:46,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:46,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:46,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:46,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-06 07:29:46,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:46,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782766167] [2022-12-06 07:29:46,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782766167] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:46,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:46,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:46,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569986878] [2022-12-06 07:29:46,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:46,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:46,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:46,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:46,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:46,275 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:46,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:46,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:46,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:46,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:46,313 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:46,314 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:46,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:46,314 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:46,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:46,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:46,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:46,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:46,315 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:46,315 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:46,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:46,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:46,315 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:46,315 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:46,315 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:46,316 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:46,316 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:46,316 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:46,316 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:46,316 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:46,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:46,318 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:46,318 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:46,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:46,318 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:46,318 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:46,393 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:46,394 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:46,394 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:46,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:46,394 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:46,394 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:46,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1369 [2022-12-06 07:29:46,394 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-06 07:29:46,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:46,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1945687113, now seen corresponding path program 1 times [2022-12-06 07:29:46,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:46,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525976057] [2022-12-06 07:29:46,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:46,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:46,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-06 07:29:46,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:46,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525976057] [2022-12-06 07:29:46,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525976057] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:46,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:46,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:46,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749341883] [2022-12-06 07:29:46,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:46,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:46,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:46,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:46,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:46,460 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:46,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:46,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:46,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:46,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:46,502 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:46,502 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:46,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:46,503 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:46,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:46,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:46,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:46,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:46,503 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:46,503 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:46,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:46,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:46,504 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:46,504 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:46,504 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:46,504 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:46,504 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:46,504 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:46,504 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:46,504 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:46,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:46,507 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:46,507 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:46,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:46,507 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:46,507 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:46,581 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:46,581 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:46,581 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:46,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:46,581 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:46,582 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:46,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1370 [2022-12-06 07:29:46,582 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-06 07:29:46,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:46,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1976163306, now seen corresponding path program 1 times [2022-12-06 07:29:46,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:46,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428590557] [2022-12-06 07:29:46,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:46,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:46,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:46,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-06 07:29:46,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:46,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428590557] [2022-12-06 07:29:46,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428590557] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:46,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:46,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:46,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514877924] [2022-12-06 07:29:46,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:46,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:46,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:46,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:46,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:46,646 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:46,646 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:46,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:46,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:46,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:46,684 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:46,684 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:46,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:46,685 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:46,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:46,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:46,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:46,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:46,685 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:46,685 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:46,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:46,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:46,686 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:46,686 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:46,686 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:46,686 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:46,686 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:46,687 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:46,687 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:46,687 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:46,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:46,689 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:46,689 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:46,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:46,690 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:46,690 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:46,766 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:46,766 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:29:46,766 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:46,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:46,766 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:46,766 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:46,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1371 [2022-12-06 07:29:46,767 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-06 07:29:46,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:46,767 INFO L85 PathProgramCache]: Analyzing trace with hash 2002945415, now seen corresponding path program 1 times [2022-12-06 07:29:46,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:46,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026260346] [2022-12-06 07:29:46,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:46,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:46,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-06 07:29:46,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:46,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026260346] [2022-12-06 07:29:46,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026260346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:46,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:46,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:46,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238288750] [2022-12-06 07:29:46,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:46,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:46,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:46,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:46,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:46,828 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:46,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:46,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:46,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:46,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:46,865 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:46,865 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:46,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:46,866 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:46,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:46,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:46,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:46,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:46,866 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:46,866 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:46,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:46,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:46,867 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:46,867 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:46,867 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:46,867 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:46,867 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:46,868 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:46,868 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:46,868 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:46,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:46,870 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:46,870 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:46,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:46,870 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:46,870 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:46,942 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:46,942 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:29:46,942 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:46,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:46,942 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:46,943 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:46,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1372 [2022-12-06 07:29:46,943 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-06 07:29:46,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:46,943 INFO L85 PathProgramCache]: Analyzing trace with hash 2033421608, now seen corresponding path program 1 times [2022-12-06 07:29:46,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:46,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769099346] [2022-12-06 07:29:46,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:46,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:47,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-06 07:29:47,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:47,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769099346] [2022-12-06 07:29:47,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769099346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:47,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:47,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:47,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513844517] [2022-12-06 07:29:47,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:47,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:47,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:47,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:47,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:47,007 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:47,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:47,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:47,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:47,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:47,049 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:47,049 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:47,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:47,049 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:47,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:47,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:47,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:47,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:47,050 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:47,050 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:47,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:47,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:47,051 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:47,051 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:47,051 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:47,051 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:47,051 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:47,051 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:47,051 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:47,051 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:47,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:47,053 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:47,053 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:47,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:47,054 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:47,054 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:47,127 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:47,128 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:47,128 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:47,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:47,128 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:47,128 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:47,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1373 [2022-12-06 07:29:47,128 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-06 07:29:47,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:47,128 INFO L85 PathProgramCache]: Analyzing trace with hash 2060203717, now seen corresponding path program 1 times [2022-12-06 07:29:47,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:47,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940983619] [2022-12-06 07:29:47,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:47,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:47,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-06 07:29:47,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:47,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940983619] [2022-12-06 07:29:47,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940983619] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:47,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:47,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:47,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933051067] [2022-12-06 07:29:47,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:47,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:47,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:47,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:47,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:47,194 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:47,194 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:47,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:47,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:47,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:47,235 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:47,236 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:47,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:47,236 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:47,236 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:47,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:47,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:47,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:47,237 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:47,237 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:47,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:47,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:47,237 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:47,237 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:47,238 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:47,238 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:47,238 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:47,238 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:47,238 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:47,238 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:47,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:47,240 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:47,240 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:47,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:47,241 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:47,241 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:47,321 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:47,322 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:29:47,322 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:47,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:47,322 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:47,322 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:47,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1374 [2022-12-06 07:29:47,322 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-06 07:29:47,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:47,322 INFO L85 PathProgramCache]: Analyzing trace with hash 2090679910, now seen corresponding path program 1 times [2022-12-06 07:29:47,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:47,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484916410] [2022-12-06 07:29:47,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:47,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:47,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-06 07:29:47,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:47,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484916410] [2022-12-06 07:29:47,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484916410] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:47,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:47,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:47,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198010237] [2022-12-06 07:29:47,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:47,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:47,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:47,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:47,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:47,385 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:47,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:47,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:47,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:47,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:47,427 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:47,427 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:47,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:47,428 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:47,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:47,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:47,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:47,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:47,428 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:47,428 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:47,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:47,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:47,429 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:47,429 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:47,429 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:47,429 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:47,429 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:47,429 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:47,429 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:47,430 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:47,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:47,432 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:47,432 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:47,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:47,432 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:47,432 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:47,505 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:47,506 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:47,506 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:47,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:47,506 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:47,506 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:47,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1375 [2022-12-06 07:29:47,506 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-06 07:29:47,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:47,507 INFO L85 PathProgramCache]: Analyzing trace with hash 2117462019, now seen corresponding path program 1 times [2022-12-06 07:29:47,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:47,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498375098] [2022-12-06 07:29:47,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:47,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:47,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-06 07:29:47,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:47,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498375098] [2022-12-06 07:29:47,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498375098] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:47,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:47,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:47,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119485697] [2022-12-06 07:29:47,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:47,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:47,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:47,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:47,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:47,572 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:47,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:47,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:47,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:47,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:47,606 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:47,606 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:47,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:47,607 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:47,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:47,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:47,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:47,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:47,607 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:47,607 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:47,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:47,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:47,608 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:47,608 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:47,608 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:47,608 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:47,608 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:47,608 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:47,608 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:47,608 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:47,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:47,610 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:47,611 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:47,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:47,611 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:47,611 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:47,685 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:47,685 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:47,685 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:47,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:47,685 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:47,685 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:47,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1376 [2022-12-06 07:29:47,686 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-06 07:29:47,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:47,686 INFO L85 PathProgramCache]: Analyzing trace with hash -2147029084, now seen corresponding path program 1 times [2022-12-06 07:29:47,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:47,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911843841] [2022-12-06 07:29:47,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:47,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:47,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-06 07:29:47,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:47,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911843841] [2022-12-06 07:29:47,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911843841] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:47,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:47,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:47,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795789136] [2022-12-06 07:29:47,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:47,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:47,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:47,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:47,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:47,745 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:47,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:47,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:47,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:47,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:47,788 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:47,788 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:47,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:47,789 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:47,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:47,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:47,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:47,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:47,789 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:47,789 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:47,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:47,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:47,790 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:47,790 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:47,790 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:47,790 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:47,790 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:47,790 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:47,791 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:47,791 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:47,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:47,793 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:47,793 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:47,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:47,793 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:47,793 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:47,866 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:47,867 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:47,867 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:47,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:47,867 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:47,867 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:47,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1377 [2022-12-06 07:29:47,867 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-06 07:29:47,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:47,867 INFO L85 PathProgramCache]: Analyzing trace with hash -2120246975, now seen corresponding path program 1 times [2022-12-06 07:29:47,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:47,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104079741] [2022-12-06 07:29:47,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:47,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:47,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-06 07:29:47,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:47,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104079741] [2022-12-06 07:29:47,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104079741] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:47,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:47,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:47,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906393518] [2022-12-06 07:29:47,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:47,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:47,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:47,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:47,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:47,930 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:47,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:47,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:47,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:47,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:47,971 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:47,971 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:47,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:47,971 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:47,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:47,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:47,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:47,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:47,972 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:47,972 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:47,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:47,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:47,972 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:47,972 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:47,973 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:47,973 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:47,973 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:47,973 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:47,973 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:47,973 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:47,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:47,975 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:47,975 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:47,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:47,975 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:47,975 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:48,050 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:48,051 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:48,051 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:48,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:48,051 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:48,051 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:48,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1378 [2022-12-06 07:29:48,051 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-06 07:29:48,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:48,051 INFO L85 PathProgramCache]: Analyzing trace with hash -2089770782, now seen corresponding path program 1 times [2022-12-06 07:29:48,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:48,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491122099] [2022-12-06 07:29:48,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:48,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:48,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-06 07:29:48,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:48,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491122099] [2022-12-06 07:29:48,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491122099] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:48,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:48,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:48,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579929387] [2022-12-06 07:29:48,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:48,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:48,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:48,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:48,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:48,111 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:48,111 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:48,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:48,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:48,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:48,152 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:48,152 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:48,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:48,152 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:48,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:48,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:48,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:48,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:48,153 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:48,153 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:48,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:48,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:48,153 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:48,154 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:48,154 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:48,154 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:48,154 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:48,154 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:48,154 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:48,154 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:48,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:48,156 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:48,156 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:48,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:48,156 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:48,157 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:48,229 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:48,230 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:48,230 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:48,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:48,230 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:48,230 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:48,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1379 [2022-12-06 07:29:48,230 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-06 07:29:48,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:48,230 INFO L85 PathProgramCache]: Analyzing trace with hash -2062988673, now seen corresponding path program 1 times [2022-12-06 07:29:48,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:48,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837875024] [2022-12-06 07:29:48,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:48,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:48,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-06 07:29:48,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:48,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837875024] [2022-12-06 07:29:48,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837875024] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:48,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:48,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:48,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783217797] [2022-12-06 07:29:48,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:48,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:48,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:48,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:48,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:48,302 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:48,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:48,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:48,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:48,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:48,338 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:48,339 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:48,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:48,339 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:48,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:48,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:48,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:48,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:48,340 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:48,340 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:48,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:48,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:48,340 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:48,340 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:48,341 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:48,341 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:48,341 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:48,341 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:48,341 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:48,341 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:48,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:48,343 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:48,343 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:48,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:48,343 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:48,343 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:48,417 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:48,418 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:48,418 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:48,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:48,418 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:48,418 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:48,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1380 [2022-12-06 07:29:48,418 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-06 07:29:48,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:48,418 INFO L85 PathProgramCache]: Analyzing trace with hash -2032512480, now seen corresponding path program 1 times [2022-12-06 07:29:48,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:48,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990482225] [2022-12-06 07:29:48,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:48,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:48,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:48,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:48,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990482225] [2022-12-06 07:29:48,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990482225] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:48,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:48,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:48,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636964756] [2022-12-06 07:29:48,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:48,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:48,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:48,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:48,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:48,478 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:48,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:48,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:48,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:48,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:48,519 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:48,519 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:48,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:48,519 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:48,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:48,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:48,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:48,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:48,520 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:48,520 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:48,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:48,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:48,520 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:48,521 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:48,521 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:48,521 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:48,521 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:48,521 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:48,521 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:48,521 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:48,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:48,523 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:48,523 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:48,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:48,524 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:48,524 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:48,597 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:48,598 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:48,598 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:48,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:48,598 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:48,598 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:48,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1381 [2022-12-06 07:29:48,598 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-06 07:29:48,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:48,598 INFO L85 PathProgramCache]: Analyzing trace with hash -2005730371, now seen corresponding path program 1 times [2022-12-06 07:29:48,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:48,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141212266] [2022-12-06 07:29:48,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:48,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:48,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-06 07:29:48,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:48,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141212266] [2022-12-06 07:29:48,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141212266] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:48,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:48,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:48,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751669147] [2022-12-06 07:29:48,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:48,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:48,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:48,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:48,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:48,663 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:48,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:48,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:48,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:48,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:48,704 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:48,704 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:48,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:48,704 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:48,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:48,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:48,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:48,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:48,705 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:48,705 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:48,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:48,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:48,706 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:48,706 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:48,706 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:48,706 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:48,706 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:48,706 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:48,706 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:48,706 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:48,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:48,708 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:48,708 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:48,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:48,709 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:48,709 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:48,781 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:48,782 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:48,782 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:48,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:48,782 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:48,782 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:48,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1382 [2022-12-06 07:29:48,782 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-06 07:29:48,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:48,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1975254178, now seen corresponding path program 1 times [2022-12-06 07:29:48,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:48,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872912470] [2022-12-06 07:29:48,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:48,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:48,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-06 07:29:48,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:48,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872912470] [2022-12-06 07:29:48,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872912470] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:48,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:48,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:48,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902901255] [2022-12-06 07:29:48,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:48,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:48,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:48,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:48,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:48,841 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:48,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:48,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:48,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:48,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:48,882 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:48,883 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:48,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:48,883 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:48,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:48,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:48,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:48,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:48,884 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:48,884 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:48,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:48,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:48,884 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:48,884 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:48,884 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:48,884 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:48,885 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:48,885 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:48,885 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:48,885 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:48,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:48,887 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:48,887 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:48,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:48,887 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:48,887 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:48,961 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:48,961 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:48,961 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:48,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:48,962 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:48,962 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:48,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1383 [2022-12-06 07:29:48,962 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-06 07:29:48,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:48,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1948472069, now seen corresponding path program 1 times [2022-12-06 07:29:48,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:48,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916996961] [2022-12-06 07:29:48,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:48,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:49,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-06 07:29:49,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:49,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916996961] [2022-12-06 07:29:49,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916996961] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:49,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:49,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:49,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642288016] [2022-12-06 07:29:49,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:49,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:49,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:49,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:49,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:49,025 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:49,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:49,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:49,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:49,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:49,060 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:49,060 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:49,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:49,060 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:49,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:49,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:49,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:49,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:49,061 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:49,061 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:49,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:49,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:49,062 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:49,062 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:49,062 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:49,062 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:49,062 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:49,062 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:49,062 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:49,062 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:49,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:49,064 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:49,064 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:49,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:49,065 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:49,065 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:49,137 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:49,137 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:29:49,138 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:49,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:49,138 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:49,138 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:49,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1384 [2022-12-06 07:29:49,138 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-06 07:29:49,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:49,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1917995876, now seen corresponding path program 1 times [2022-12-06 07:29:49,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:49,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297562769] [2022-12-06 07:29:49,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:49,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:49,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-06 07:29:49,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:49,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297562769] [2022-12-06 07:29:49,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297562769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:49,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:49,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:49,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624753762] [2022-12-06 07:29:49,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:49,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:49,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:49,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:49,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:49,213 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:49,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:49,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:49,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:49,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:49,255 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:49,255 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:49,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:49,256 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:49,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:49,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:49,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:49,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:49,256 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:49,256 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:49,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:49,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:49,257 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:49,257 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:49,257 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:49,257 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:49,257 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:49,258 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:49,258 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:49,258 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:49,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:49,260 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:49,260 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:49,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:49,260 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:49,260 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:49,334 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:49,335 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:49,335 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:49,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:49,335 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:49,335 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:49,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1385 [2022-12-06 07:29:49,335 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-06 07:29:49,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:49,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1891213767, now seen corresponding path program 1 times [2022-12-06 07:29:49,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:49,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038213861] [2022-12-06 07:29:49,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:49,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:49,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-06 07:29:49,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:49,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038213861] [2022-12-06 07:29:49,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038213861] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:49,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:49,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:49,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029926278] [2022-12-06 07:29:49,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:49,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:49,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:49,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:49,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:49,398 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:49,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:49,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:49,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:49,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:49,434 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:49,434 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:49,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:49,434 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:49,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:49,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:49,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:49,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:49,435 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:49,435 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:49,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:49,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:49,436 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:49,436 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:49,436 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:49,436 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:49,436 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:49,436 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:49,436 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:49,436 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:49,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:49,438 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:49,438 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:49,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:49,439 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:49,439 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:49,512 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:49,513 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:49,513 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:49,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:49,513 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:49,513 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:49,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1386 [2022-12-06 07:29:49,513 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-06 07:29:49,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:49,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1860737574, now seen corresponding path program 1 times [2022-12-06 07:29:49,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:49,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467713357] [2022-12-06 07:29:49,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:49,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:49,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29: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-06 07:29:49,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:49,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467713357] [2022-12-06 07:29:49,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467713357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:49,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:49,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:49,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269154345] [2022-12-06 07:29:49,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:49,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:49,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:49,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:49,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:49,574 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:49,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:49,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:49,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:49,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:49,610 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:49,610 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:49,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:49,611 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:49,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:49,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:49,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:49,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:49,611 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:49,611 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:49,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:49,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:49,612 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:49,612 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:49,612 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:49,612 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:49,612 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:49,613 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:49,613 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:49,613 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:49,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:49,615 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:49,615 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:49,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:49,615 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:49,615 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:49,689 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:49,690 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:49,690 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:49,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:49,690 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:49,690 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:49,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1387 [2022-12-06 07:29:49,690 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-06 07:29:49,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:49,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1833955465, now seen corresponding path program 1 times [2022-12-06 07:29:49,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:49,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503135707] [2022-12-06 07:29:49,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:49,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:49,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-06 07:29:49,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:49,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503135707] [2022-12-06 07:29:49,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503135707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:49,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:49,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:49,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055415694] [2022-12-06 07:29:49,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:49,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:49,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:49,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:49,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:49,751 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:49,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:49,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:49,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:49,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:49,792 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:49,792 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:49,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:49,793 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:49,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:49,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:49,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:49,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:49,793 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:49,793 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:49,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:49,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:49,794 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:49,794 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:49,794 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:49,794 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:49,794 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:49,794 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:49,794 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:49,794 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:49,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:49,797 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:49,797 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:49,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:49,797 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:49,797 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:49,870 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:49,871 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:49,871 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:49,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:49,871 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:49,871 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:49,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1388 [2022-12-06 07:29:49,871 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-06 07:29:49,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:49,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1803479272, now seen corresponding path program 1 times [2022-12-06 07:29:49,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:49,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035370197] [2022-12-06 07:29:49,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:49,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:49,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-06 07:29:49,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:49,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035370197] [2022-12-06 07:29:49,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035370197] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:49,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:49,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:49,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401409686] [2022-12-06 07:29:49,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:49,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:49,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:49,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:49,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:49,931 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:49,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:49,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:49,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:49,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:49,972 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:49,972 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:49,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:49,972 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:49,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:49,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:49,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:49,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:49,973 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:49,973 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:49,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:49,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:49,974 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:49,974 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:49,974 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:49,974 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:49,974 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:49,974 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:49,974 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:49,974 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:49,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:49,976 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:49,976 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:49,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:49,977 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:49,977 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:50,051 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:50,052 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:50,052 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:50,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:50,052 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:50,052 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:50,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1389 [2022-12-06 07:29:50,052 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-06 07:29:50,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:50,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1776697163, now seen corresponding path program 1 times [2022-12-06 07:29:50,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:50,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792957100] [2022-12-06 07:29:50,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:50,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:50,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-06 07:29:50,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:50,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792957100] [2022-12-06 07:29:50,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792957100] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:50,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:50,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:50,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919282590] [2022-12-06 07:29:50,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:50,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:50,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:50,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:50,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:50,124 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:50,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:50,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:50,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:50,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:50,165 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:50,166 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:50,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:50,166 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:50,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:50,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:50,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:50,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:50,167 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:50,167 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:50,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:50,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:50,167 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:50,167 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:50,167 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:50,168 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:50,168 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:50,168 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:50,168 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:50,168 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:50,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:50,170 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:50,170 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:50,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:50,170 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:50,170 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:50,243 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:50,244 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:50,244 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:50,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:50,244 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:50,244 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:50,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1390 [2022-12-06 07:29:50,244 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-06 07:29:50,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:50,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1746220970, now seen corresponding path program 1 times [2022-12-06 07:29:50,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:50,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079211412] [2022-12-06 07:29:50,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:50,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:50,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-06 07:29:50,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:50,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079211412] [2022-12-06 07:29:50,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079211412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:50,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:50,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:50,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281658660] [2022-12-06 07:29:50,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:50,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:50,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:50,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:50,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:50,304 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:50,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:50,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:50,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:50,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:50,345 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:50,345 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:50,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:50,345 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:50,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:50,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:50,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:50,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:50,346 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:50,346 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:50,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:50,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:50,346 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:50,346 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:50,347 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:50,347 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:50,347 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:50,347 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:50,347 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:50,347 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:50,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:50,349 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:50,349 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:50,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:50,349 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:50,350 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:50,424 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:50,425 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:50,425 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:50,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:50,425 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:50,425 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:50,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1391 [2022-12-06 07:29:50,425 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-06 07:29:50,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:50,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1719438861, now seen corresponding path program 1 times [2022-12-06 07:29:50,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:50,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974995960] [2022-12-06 07:29:50,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:50,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:50,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-06 07:29:50,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:50,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974995960] [2022-12-06 07:29:50,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974995960] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:50,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:50,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:50,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114185488] [2022-12-06 07:29:50,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:50,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:50,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:50,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:50,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:50,488 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:50,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:50,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:50,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:50,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:50,529 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:50,529 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:50,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:50,529 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:50,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:50,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:50,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:50,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:50,530 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:50,530 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:50,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:50,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:50,530 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:50,530 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:50,531 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:50,531 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:50,531 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:50,531 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:50,531 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:50,531 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:50,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:50,533 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:50,533 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:50,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:50,533 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:50,533 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:50,607 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:50,608 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:50,608 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:50,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:50,608 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:50,608 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:50,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1392 [2022-12-06 07:29:50,608 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-06 07:29:50,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:50,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1688962668, now seen corresponding path program 1 times [2022-12-06 07:29:50,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:50,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110914185] [2022-12-06 07:29:50,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:50,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:50,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:50,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-06 07:29:50,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:50,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110914185] [2022-12-06 07:29:50,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110914185] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:50,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:50,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:50,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227621538] [2022-12-06 07:29:50,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:50,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:50,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:50,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:50,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:50,669 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:50,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:50,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:50,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:50,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:50,706 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:50,706 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:50,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:50,706 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:50,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:50,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:50,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:50,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:50,707 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:50,707 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:50,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:50,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:50,708 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:50,708 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:50,708 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:50,708 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:50,708 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:50,708 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:50,708 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:50,708 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:50,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:50,710 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:50,710 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:50,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:50,711 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:50,711 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:50,787 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:50,787 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:50,788 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:50,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:50,788 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:50,788 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:50,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1393 [2022-12-06 07:29:50,788 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-06 07:29:50,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:50,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1662180559, now seen corresponding path program 1 times [2022-12-06 07:29:50,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:50,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384211213] [2022-12-06 07:29:50,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:50,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29: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-06 07:29:50,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:50,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384211213] [2022-12-06 07:29:50,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384211213] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:50,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:50,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:50,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33560114] [2022-12-06 07:29:50,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:50,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:50,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:50,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:50,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:50,853 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:50,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:50,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:50,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:50,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:50,894 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:50,894 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:50,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:50,894 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:50,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:50,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:50,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:50,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:50,895 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:50,895 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:50,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:50,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:50,896 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:50,896 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:50,896 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:50,896 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:50,896 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:50,896 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:50,896 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:50,896 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:50,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:50,899 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:50,899 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:50,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:50,899 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:50,899 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:50,972 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:50,973 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:50,973 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:50,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:50,973 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:50,973 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:50,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1394 [2022-12-06 07:29:50,973 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-06 07:29:50,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:50,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1631704366, now seen corresponding path program 1 times [2022-12-06 07:29:50,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:50,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107850226] [2022-12-06 07:29:50,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:50,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:51,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-06 07:29:51,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:51,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107850226] [2022-12-06 07:29:51,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107850226] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:51,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:51,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:51,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484397321] [2022-12-06 07:29:51,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:51,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:51,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:51,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:51,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:51,035 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:51,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:51,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:51,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:51,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:51,072 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:51,072 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:51,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:51,073 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:51,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:51,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:51,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:51,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:51,073 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:51,073 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:51,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:51,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:51,074 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:51,074 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:51,074 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:51,074 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:51,074 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:51,074 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:51,075 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:51,075 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:51,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:51,077 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:51,077 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:51,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:51,077 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:51,077 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:51,177 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:51,178 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-06 07:29:51,178 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:51,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:51,178 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:51,178 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:51,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1395 [2022-12-06 07:29:51,178 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-06 07:29:51,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:51,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1604922257, now seen corresponding path program 1 times [2022-12-06 07:29:51,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:51,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755449464] [2022-12-06 07:29:51,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:51,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:51,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-06 07:29:51,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:51,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755449464] [2022-12-06 07:29:51,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755449464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:51,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:51,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:51,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231396030] [2022-12-06 07:29:51,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:51,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:51,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:51,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:51,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:51,242 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:51,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:51,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:51,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:51,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:51,279 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:51,279 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:51,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:51,279 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:51,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:51,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:51,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:51,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:51,280 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:51,280 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:51,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:51,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:51,281 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:51,281 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:51,281 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:51,281 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:51,281 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:51,281 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:51,281 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:51,281 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:51,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:51,284 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:51,284 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:51,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:51,284 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:51,284 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:51,358 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:51,359 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:51,359 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:51,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:51,359 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:51,359 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:51,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1396 [2022-12-06 07:29:51,359 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-06 07:29:51,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:51,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1574446064, now seen corresponding path program 1 times [2022-12-06 07:29:51,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:51,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128382796] [2022-12-06 07:29:51,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:51,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:51,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-06 07:29:51,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:51,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128382796] [2022-12-06 07:29:51,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128382796] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:51,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:51,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:51,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104309072] [2022-12-06 07:29:51,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:51,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:51,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:51,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:51,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:51,421 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:51,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:51,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:51,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:51,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:51,464 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:51,465 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:51,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:51,465 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:51,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:51,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:51,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:51,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:51,466 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:51,466 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:51,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:51,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:51,466 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:51,466 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:51,467 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:51,467 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:51,467 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:51,467 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:51,467 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:51,467 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:51,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:51,469 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:51,469 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:51,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:51,469 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:51,470 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:51,545 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:51,545 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:51,545 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:51,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:51,545 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:51,546 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:51,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1397 [2022-12-06 07:29:51,546 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-06 07:29:51,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:51,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1547663955, now seen corresponding path program 1 times [2022-12-06 07:29:51,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:51,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547390592] [2022-12-06 07:29:51,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:51,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:51,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-06 07:29:51,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:51,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547390592] [2022-12-06 07:29:51,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547390592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:51,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:51,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:51,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434314143] [2022-12-06 07:29:51,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:51,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:51,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:51,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:51,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:51,610 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:51,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:51,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:51,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:51,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:51,651 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:51,651 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:51,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:51,652 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:51,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:51,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:51,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:51,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:51,652 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:51,652 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:51,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:51,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:51,653 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:51,653 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:51,653 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:51,653 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:51,653 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:51,653 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:51,654 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:51,654 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:51,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:51,656 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:51,656 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:51,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:51,656 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:51,656 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:51,729 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:51,730 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:51,730 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:51,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:51,730 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:51,730 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:51,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1398 [2022-12-06 07:29:51,730 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-06 07:29:51,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:51,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1517187762, now seen corresponding path program 1 times [2022-12-06 07:29:51,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:51,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519842361] [2022-12-06 07:29:51,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:51,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:51,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-06 07:29:51,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:51,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519842361] [2022-12-06 07:29:51,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519842361] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:51,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:51,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:51,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281294043] [2022-12-06 07:29:51,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:51,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:51,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:51,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:51,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:51,793 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:51,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:51,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:51,793 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:51,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:51,832 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:51,832 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:51,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:51,833 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:51,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:51,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:51,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:51,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:51,833 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:51,833 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:51,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:51,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:51,834 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:51,834 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:51,834 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:51,834 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:51,834 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:51,834 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:51,834 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:51,835 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:51,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:51,837 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:51,837 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:51,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:51,837 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:51,837 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:51,912 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:51,913 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:51,913 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:51,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:51,913 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:51,913 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:51,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1399 [2022-12-06 07:29:51,913 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-06 07:29:51,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:51,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1490405653, now seen corresponding path program 1 times [2022-12-06 07:29:51,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:51,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009378154] [2022-12-06 07:29:51,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:51,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:51,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-06 07:29:51,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:51,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009378154] [2022-12-06 07:29:51,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009378154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:51,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:51,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:51,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192271381] [2022-12-06 07:29:51,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:51,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:51,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:51,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:51,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:51,977 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:51,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:51,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:51,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:51,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:52,019 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:52,019 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:52,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:52,019 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:52,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:52,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:52,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:52,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:52,020 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:52,020 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:52,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:52,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:52,021 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:52,021 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:52,021 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:52,021 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:52,021 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:52,021 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:52,021 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:52,021 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:52,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:52,024 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:52,024 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:52,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:52,024 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:52,024 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:52,096 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:52,097 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:52,097 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:52,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:52,097 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:52,097 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:52,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1400 [2022-12-06 07:29:52,097 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-06 07:29:52,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:52,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1459929460, now seen corresponding path program 1 times [2022-12-06 07:29:52,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:52,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997523058] [2022-12-06 07:29:52,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:52,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:52,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-06 07:29:52,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:52,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997523058] [2022-12-06 07:29:52,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997523058] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:52,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:52,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:52,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529473364] [2022-12-06 07:29:52,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:52,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:52,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:52,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:52,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:52,171 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:52,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:52,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:52,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:52,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:52,213 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:52,213 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:52,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:52,213 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:52,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:52,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:52,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:52,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:52,214 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:52,214 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:52,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:52,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:52,215 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:52,215 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:52,215 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:52,215 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:52,215 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:52,215 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:52,215 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:52,215 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:52,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:52,217 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:52,218 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:52,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:52,218 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:52,218 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:52,292 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:52,292 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:52,293 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:52,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:52,293 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:52,293 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:52,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1401 [2022-12-06 07:29:52,293 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-06 07:29:52,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:52,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1433147351, now seen corresponding path program 1 times [2022-12-06 07:29:52,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:52,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745405657] [2022-12-06 07:29:52,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:52,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:52,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:52,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-06 07:29:52,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:52,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745405657] [2022-12-06 07:29:52,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745405657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:52,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:52,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:52,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074016831] [2022-12-06 07:29:52,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:52,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:52,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:52,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:52,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:52,355 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:52,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:52,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:52,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:52,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:52,391 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:52,391 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:52,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:52,392 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:52,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:52,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:52,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:52,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:52,392 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:52,392 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:52,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:52,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:52,393 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:52,393 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:52,393 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:52,393 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:52,393 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:52,393 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:52,393 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:52,393 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:52,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:52,396 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:52,396 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:52,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:52,396 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:52,396 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:52,470 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:52,471 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:52,471 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:52,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:52,471 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:52,471 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:52,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1402 [2022-12-06 07:29:52,471 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-06 07:29:52,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:52,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1402671158, now seen corresponding path program 1 times [2022-12-06 07:29:52,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:52,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76826366] [2022-12-06 07:29:52,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:52,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:52,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-06 07:29:52,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:52,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76826366] [2022-12-06 07:29:52,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76826366] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:52,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:52,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:52,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218213711] [2022-12-06 07:29:52,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:52,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:52,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:52,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:52,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:52,534 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:52,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:52,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:52,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:52,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:52,572 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:52,572 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:52,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:52,573 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:52,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:52,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:52,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:52,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:52,573 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:52,573 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:52,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:52,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:52,574 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:52,574 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:52,575 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:52,575 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:52,575 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:52,575 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:52,575 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:52,575 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:52,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:52,578 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:52,579 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:52,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:52,579 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:52,579 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:52,653 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:52,654 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:52,654 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:52,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:52,654 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:52,654 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:52,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1403 [2022-12-06 07:29:52,654 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-06 07:29:52,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:52,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1375889049, now seen corresponding path program 1 times [2022-12-06 07:29:52,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:52,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297330872] [2022-12-06 07:29:52,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:52,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:52,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-06 07:29:52,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:52,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297330872] [2022-12-06 07:29:52,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297330872] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:52,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:52,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:52,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847300977] [2022-12-06 07:29:52,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:52,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:52,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:52,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:52,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:52,719 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:52,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:52,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:52,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:52,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:52,761 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:52,762 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:52,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:52,762 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:52,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:52,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:52,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:52,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:52,763 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:52,763 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:52,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:52,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:52,763 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:52,763 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:52,764 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:52,764 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:52,764 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:52,764 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:52,764 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:52,764 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:52,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:52,766 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:52,766 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:52,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:52,766 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:52,766 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:52,839 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:52,840 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:52,840 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:52,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:52,840 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:52,840 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:52,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1404 [2022-12-06 07:29:52,840 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-06 07:29:52,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:52,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1345412856, now seen corresponding path program 1 times [2022-12-06 07:29:52,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:52,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566803946] [2022-12-06 07:29:52,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:52,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:52,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-06 07:29:52,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:52,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566803946] [2022-12-06 07:29:52,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566803946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:52,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:52,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:52,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541201251] [2022-12-06 07:29:52,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:52,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:52,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:52,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:52,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:52,901 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:52,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:52,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:52,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:52,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:52,938 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:52,938 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:52,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:52,938 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:52,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:52,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:52,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:52,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:52,939 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:52,939 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:52,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:52,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:52,939 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:52,940 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:52,940 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:52,940 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:52,940 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:52,940 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:52,940 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:52,940 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:52,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:52,942 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:52,942 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:52,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:52,942 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:52,942 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:53,017 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:53,018 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:53,018 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:53,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:53,018 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:53,018 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:53,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1405 [2022-12-06 07:29:53,018 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-06 07:29:53,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:53,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1318630747, now seen corresponding path program 1 times [2022-12-06 07:29:53,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:53,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839137033] [2022-12-06 07:29:53,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:53,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:53,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:53,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-06 07:29:53,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:53,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839137033] [2022-12-06 07:29:53,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839137033] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:53,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:53,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:53,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716091346] [2022-12-06 07:29:53,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:53,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:53,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:53,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:53,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:53,093 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:53,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:53,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:53,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:53,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:53,133 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:53,134 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:53,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:53,134 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:53,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:53,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:53,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:53,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:53,135 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:53,135 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:53,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:53,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:53,135 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:53,135 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:53,136 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:53,136 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:53,136 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:53,136 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:53,136 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:53,136 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:53,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:53,138 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:53,138 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:53,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:53,138 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:53,138 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:53,212 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:53,213 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:53,213 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:53,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:53,213 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:53,213 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:53,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1406 [2022-12-06 07:29:53,213 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-06 07:29:53,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:53,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1288154554, now seen corresponding path program 1 times [2022-12-06 07:29:53,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:53,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123232592] [2022-12-06 07:29:53,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:53,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:53,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-06 07:29:53,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:53,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123232592] [2022-12-06 07:29:53,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123232592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:53,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:53,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:53,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558065298] [2022-12-06 07:29:53,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:53,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:53,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:53,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:53,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:53,273 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:53,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:53,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:53,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:53,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:53,313 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:53,313 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:53,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:53,314 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:53,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:53,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:53,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:53,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:53,314 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:53,314 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:53,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:53,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:53,315 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:53,315 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:53,315 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:53,315 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:53,315 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:53,315 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:53,315 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:53,316 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:53,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:53,318 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:53,318 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:53,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:53,318 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:53,318 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:53,391 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:53,392 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:53,392 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:53,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:53,392 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:53,392 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:53,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1407 [2022-12-06 07:29:53,392 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-06 07:29:53,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:53,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1261372445, now seen corresponding path program 1 times [2022-12-06 07:29:53,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:53,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141827377] [2022-12-06 07:29:53,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:53,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:53,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:53,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:53,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141827377] [2022-12-06 07:29:53,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141827377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:53,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:53,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:53,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835729530] [2022-12-06 07:29:53,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:53,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:53,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:53,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:53,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:53,456 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:53,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:53,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:53,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:53,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:53,497 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:53,498 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:53,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:53,498 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:53,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:53,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:53,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:53,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:53,499 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:53,499 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:53,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:53,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:53,499 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:53,499 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:53,499 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:53,499 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:53,500 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:53,500 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:53,500 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:53,500 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:53,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:53,502 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:53,502 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:53,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:53,502 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:53,502 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:53,575 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:53,576 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:53,576 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:53,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:53,576 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:53,576 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:53,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1408 [2022-12-06 07:29:53,576 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-06 07:29:53,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:53,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1230896252, now seen corresponding path program 1 times [2022-12-06 07:29:53,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:53,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849467506] [2022-12-06 07:29:53,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:53,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:53,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:53,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-06 07:29:53,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:53,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849467506] [2022-12-06 07:29:53,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849467506] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:53,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:53,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:53,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164780630] [2022-12-06 07:29:53,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:53,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:53,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:53,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:53,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:53,636 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:53,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:53,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:53,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:53,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:53,673 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:53,673 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:53,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:53,673 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:53,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:53,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:53,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:53,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:53,674 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:53,674 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:53,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:53,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:53,675 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:53,675 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:53,675 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:53,675 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:53,675 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:53,675 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:53,675 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:53,675 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:53,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:53,677 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:53,677 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:53,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:53,678 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:53,678 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:53,751 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:53,751 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:53,751 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:53,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:53,751 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:53,751 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:53,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1409 [2022-12-06 07:29:53,752 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-06 07:29:53,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:53,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1204114143, now seen corresponding path program 1 times [2022-12-06 07:29:53,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:53,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479001419] [2022-12-06 07:29:53,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:53,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:53,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-06 07:29:53,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:53,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479001419] [2022-12-06 07:29:53,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479001419] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:53,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:53,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:53,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817338949] [2022-12-06 07:29:53,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:53,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:53,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:53,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:53,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:53,814 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:53,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:53,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:53,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:53,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:53,855 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:53,855 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:53,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:53,856 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:53,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:53,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:53,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:53,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:53,856 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:53,856 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:53,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:53,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:53,857 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:53,857 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:53,857 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:53,857 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:53,857 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:53,857 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:53,857 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:53,857 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:53,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:53,860 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:53,860 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:53,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:53,860 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:53,860 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:53,931 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:53,932 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:29:53,932 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:53,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:53,932 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:53,932 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:53,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1410 [2022-12-06 07:29:53,932 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-06 07:29:53,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:53,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1173637950, now seen corresponding path program 1 times [2022-12-06 07:29:53,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:53,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466117553] [2022-12-06 07:29:53,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:53,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:53,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:54,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:54,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:54,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466117553] [2022-12-06 07:29:54,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466117553] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:54,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:54,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:54,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671157946] [2022-12-06 07:29:54,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:54,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:54,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:54,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:54,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:54,004 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:54,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:54,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:54,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:54,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:54,039 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:54,039 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:54,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:54,039 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:54,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:54,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:54,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:54,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:54,040 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:54,040 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:54,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:54,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:54,041 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:54,041 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:54,041 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:54,041 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:54,041 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:54,041 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:54,041 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:54,041 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:54,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:54,043 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:54,043 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:54,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:54,044 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:54,044 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:54,117 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:54,118 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:54,118 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:54,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:54,118 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:54,118 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:54,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1411 [2022-12-06 07:29:54,118 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-06 07:29:54,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:54,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1146855841, now seen corresponding path program 1 times [2022-12-06 07:29:54,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:54,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030414192] [2022-12-06 07:29:54,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:54,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:54,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-06 07:29:54,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:54,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030414192] [2022-12-06 07:29:54,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030414192] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:54,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:54,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:54,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574298885] [2022-12-06 07:29:54,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:54,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:54,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:54,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:54,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:54,181 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:54,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:54,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:54,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:54,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:54,222 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:54,222 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:54,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:54,222 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:54,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:54,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:54,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:54,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:54,223 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:54,223 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:54,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:54,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:54,224 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:54,224 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:54,224 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:54,224 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:54,224 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:54,224 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:54,224 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:54,224 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:54,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:54,226 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:54,226 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:54,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:54,227 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:54,227 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:54,300 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:54,301 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:54,301 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:54,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:54,301 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:54,301 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:54,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1412 [2022-12-06 07:29:54,301 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-06 07:29:54,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:54,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1116379648, now seen corresponding path program 1 times [2022-12-06 07:29:54,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:54,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130383478] [2022-12-06 07:29:54,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:54,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:54,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-06 07:29:54,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:54,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130383478] [2022-12-06 07:29:54,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130383478] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:54,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:54,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:54,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121924130] [2022-12-06 07:29:54,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:54,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:54,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:54,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:54,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:54,364 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:54,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:54,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:54,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:54,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:54,400 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:54,400 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:54,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:54,401 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:54,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:54,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:54,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:54,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:54,401 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:54,401 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:54,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:54,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:54,402 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:54,402 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:54,402 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:54,402 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:54,402 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:54,402 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:54,403 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:54,403 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:54,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:54,405 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:54,405 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:54,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:54,405 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:54,405 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:54,478 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:54,478 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:54,478 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:54,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:54,478 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:54,479 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:54,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1413 [2022-12-06 07:29:54,479 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-06 07:29:54,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:54,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1089597539, now seen corresponding path program 1 times [2022-12-06 07:29:54,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:54,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718113279] [2022-12-06 07:29:54,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:54,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:54,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-06 07:29:54,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:54,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718113279] [2022-12-06 07:29:54,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718113279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:54,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:54,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:54,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091731407] [2022-12-06 07:29:54,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:54,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:54,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:54,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:54,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:54,542 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:54,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:54,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:54,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:54,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:54,584 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:54,584 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:54,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:54,585 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:54,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:54,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:54,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:54,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:54,585 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:54,586 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:54,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:54,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:54,586 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:54,586 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:54,586 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:54,586 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:54,586 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:54,587 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:54,587 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:54,587 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:54,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:54,589 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:54,589 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:54,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:54,589 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:54,589 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:54,662 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:54,663 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:54,663 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:54,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:54,663 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:54,663 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:54,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1414 [2022-12-06 07:29:54,663 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-06 07:29:54,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:54,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1059121346, now seen corresponding path program 1 times [2022-12-06 07:29:54,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:54,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710809090] [2022-12-06 07:29:54,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:54,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:54,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:54,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-06 07:29:54,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:54,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710809090] [2022-12-06 07:29:54,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710809090] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:54,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:54,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:54,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591814435] [2022-12-06 07:29:54,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:54,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:54,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:54,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:54,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:54,724 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:54,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:54,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:54,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:54,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:54,761 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:54,761 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:54,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:54,762 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:54,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:54,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:54,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:54,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:54,762 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:54,762 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:54,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:54,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:54,763 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:54,763 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:54,763 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:54,763 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:54,763 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:54,763 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:54,763 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:54,763 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:54,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:54,766 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:54,766 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:54,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:54,766 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:54,766 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:54,839 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:54,840 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:54,840 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:54,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:54,840 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:54,840 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:54,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1415 [2022-12-06 07:29:54,840 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-06 07:29:54,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:54,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1032339237, now seen corresponding path program 1 times [2022-12-06 07:29:54,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:54,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575954246] [2022-12-06 07:29:54,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:54,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:54,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-06 07:29:54,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:54,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575954246] [2022-12-06 07:29:54,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575954246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:54,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:54,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:54,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988592093] [2022-12-06 07:29:54,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:54,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:54,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:54,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:54,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:54,903 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:54,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:54,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:54,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:54,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:54,942 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:54,942 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:54,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:54,943 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:54,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:54,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:54,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:54,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:54,943 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:54,943 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:54,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:54,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:54,952 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:54,952 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:54,953 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:54,953 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:54,953 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:54,953 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:54,953 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:54,953 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:54,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:54,955 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:54,955 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:54,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:54,956 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:54,956 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:55,030 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:55,030 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:55,031 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:55,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:55,031 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:55,031 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:55,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1416 [2022-12-06 07:29:55,031 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-06 07:29:55,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:55,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1001863044, now seen corresponding path program 1 times [2022-12-06 07:29:55,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:55,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76638282] [2022-12-06 07:29:55,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:55,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:55,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-06 07:29:55,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:55,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76638282] [2022-12-06 07:29:55,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76638282] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:55,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:55,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:55,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115645849] [2022-12-06 07:29:55,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:55,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:55,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:55,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:55,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:55,092 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:55,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:55,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:55,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:55,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:55,134 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:55,134 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:55,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:55,135 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:55,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:55,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:55,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:55,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:55,135 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:55,135 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:55,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:55,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:55,136 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:55,136 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:55,136 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:55,136 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:55,136 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:55,137 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:55,137 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:55,137 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:55,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:55,139 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:55,139 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:55,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:55,139 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:55,139 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:55,214 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:55,215 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:55,215 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:55,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:55,215 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:55,215 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:55,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1417 [2022-12-06 07:29:55,216 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-06 07:29:55,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:55,216 INFO L85 PathProgramCache]: Analyzing trace with hash -975080935, now seen corresponding path program 1 times [2022-12-06 07:29:55,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:55,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062375110] [2022-12-06 07:29:55,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:55,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:55,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-06 07:29:55,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:55,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062375110] [2022-12-06 07:29:55,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062375110] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:55,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:55,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:55,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516890916] [2022-12-06 07:29:55,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:55,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:55,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:55,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:55,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:55,297 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:55,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:55,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:55,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:55,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:55,337 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:55,338 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:55,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:55,338 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:55,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:55,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:55,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:55,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:55,339 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:55,339 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:55,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:55,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:55,339 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:55,339 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:55,339 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:55,340 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:55,340 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:55,340 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:55,340 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:55,340 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:55,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:55,342 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:55,342 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:55,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:55,342 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:55,342 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:55,415 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:55,416 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:55,416 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:55,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:55,416 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:55,416 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:55,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1418 [2022-12-06 07:29:55,416 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-06 07:29:55,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:55,416 INFO L85 PathProgramCache]: Analyzing trace with hash -944604742, now seen corresponding path program 1 times [2022-12-06 07:29:55,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:55,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223717372] [2022-12-06 07:29:55,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:55,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:55,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-06 07:29:55,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:55,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223717372] [2022-12-06 07:29:55,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223717372] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:55,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:55,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:55,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654950395] [2022-12-06 07:29:55,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:55,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:55,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:55,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:55,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:55,477 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:55,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:55,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:55,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:55,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:55,519 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:55,520 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:55,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:55,520 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:55,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:55,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:55,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:55,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:55,521 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:55,521 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:55,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:55,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:55,521 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:55,521 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:55,521 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:55,522 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:55,522 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:55,522 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:55,522 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:55,522 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:55,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:55,524 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:55,524 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:55,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:55,524 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:55,524 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:55,597 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:55,598 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:55,598 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:55,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:55,598 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:55,598 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:55,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1419 [2022-12-06 07:29:55,598 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-06 07:29:55,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:55,599 INFO L85 PathProgramCache]: Analyzing trace with hash -917822633, now seen corresponding path program 1 times [2022-12-06 07:29:55,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:55,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937699237] [2022-12-06 07:29:55,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:55,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:55,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-06 07:29:55,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:55,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937699237] [2022-12-06 07:29:55,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937699237] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:55,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:55,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:55,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821341528] [2022-12-06 07:29:55,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:55,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:55,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:55,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:55,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:55,662 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:55,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:55,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:55,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:55,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:55,698 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:55,698 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:55,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:55,698 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:55,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:55,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:55,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:55,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:55,699 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:55,699 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:55,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:55,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:55,700 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:55,700 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:55,700 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:55,700 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:55,700 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:55,700 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:55,700 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:55,700 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:55,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:55,702 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:55,702 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:55,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:55,703 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:55,703 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:55,775 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:55,775 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:29:55,775 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:55,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:55,775 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:55,775 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:55,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1420 [2022-12-06 07:29:55,776 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-06 07:29:55,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:55,776 INFO L85 PathProgramCache]: Analyzing trace with hash -887346440, now seen corresponding path program 1 times [2022-12-06 07:29:55,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:55,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276807750] [2022-12-06 07:29:55,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:55,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:55,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-06 07:29:55,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:55,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276807750] [2022-12-06 07:29:55,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276807750] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:55,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:55,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:55,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328817722] [2022-12-06 07:29:55,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:55,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:55,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:55,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:55,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:55,839 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:55,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:55,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:55,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:55,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:55,875 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:55,875 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:55,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:55,875 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:55,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:55,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:55,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:55,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:55,876 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:55,876 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:55,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:55,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:55,876 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:55,876 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:55,877 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:55,877 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:55,877 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:55,877 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:55,877 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:55,877 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:55,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:55,879 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:55,879 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:55,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:55,879 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:55,879 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:55,953 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:55,954 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:55,954 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:55,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:55,954 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:55,954 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:55,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1421 [2022-12-06 07:29:55,954 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-06 07:29:55,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:55,954 INFO L85 PathProgramCache]: Analyzing trace with hash -860564331, now seen corresponding path program 1 times [2022-12-06 07:29:55,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:55,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074373892] [2022-12-06 07:29:55,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:55,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:56,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-06 07:29:56,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:56,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074373892] [2022-12-06 07:29:56,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074373892] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:56,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:56,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:56,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22673431] [2022-12-06 07:29:56,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:56,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:56,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:56,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:56,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:56,026 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:56,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:56,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:56,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:56,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:56,067 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:56,067 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:56,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:56,067 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:56,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:56,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:56,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:56,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:56,068 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:56,068 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:56,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:56,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:56,069 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:56,069 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:56,069 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:56,069 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:56,069 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:56,069 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:56,069 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:56,069 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:56,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:56,071 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:56,071 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:56,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:56,072 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:56,072 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:56,146 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:56,147 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:56,147 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:56,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:56,147 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:56,147 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:56,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1422 [2022-12-06 07:29:56,147 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-06 07:29:56,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:56,147 INFO L85 PathProgramCache]: Analyzing trace with hash -830088138, now seen corresponding path program 1 times [2022-12-06 07:29:56,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:56,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254085355] [2022-12-06 07:29:56,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:56,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29: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-06 07:29:56,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:56,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254085355] [2022-12-06 07:29:56,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254085355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:56,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:56,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:56,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73978330] [2022-12-06 07:29:56,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:56,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:56,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:56,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:56,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:56,212 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:56,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:56,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:56,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:56,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:56,254 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:56,254 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:56,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:56,255 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:56,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:56,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:56,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:56,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:56,255 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:56,255 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:56,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:56,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:56,256 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:56,256 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:56,256 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:56,256 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:56,256 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:56,256 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:56,256 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:56,256 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:56,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:56,258 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:56,258 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:56,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 122 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:56,259 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:56,259 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:56,332 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:56,332 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:29:56,332 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:56,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:56,332 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:56,333 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:56,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1423 [2022-12-06 07:29:56,333 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-06 07:29:56,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:56,333 INFO L85 PathProgramCache]: Analyzing trace with hash -803306029, now seen corresponding path program 1 times [2022-12-06 07:29:56,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:56,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736995816] [2022-12-06 07:29:56,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:56,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:56,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-06 07:29:56,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:56,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736995816] [2022-12-06 07:29:56,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736995816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:56,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:56,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:56,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819320938] [2022-12-06 07:29:56,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:56,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:56,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:56,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:56,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:56,395 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:56,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:56,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:56,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:56,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:56,436 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:56,436 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:56,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:56,436 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:56,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:56,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:56,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:56,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:56,437 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:56,437 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:56,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:56,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:56,438 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:56,438 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:56,438 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:56,438 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:56,438 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:56,438 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:56,438 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:56,438 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:56,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:56,440 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:56,440 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:56,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:56,441 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:56,441 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:56,515 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:56,515 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:56,515 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:56,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:56,515 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:56,515 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:56,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1424 [2022-12-06 07:29:56,516 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-06 07:29:56,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:56,516 INFO L85 PathProgramCache]: Analyzing trace with hash -772829836, now seen corresponding path program 1 times [2022-12-06 07:29:56,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:56,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328846979] [2022-12-06 07:29:56,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:56,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:56,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-06 07:29:56,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:56,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328846979] [2022-12-06 07:29:56,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328846979] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:56,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:56,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:56,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972125916] [2022-12-06 07:29:56,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:56,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:56,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:56,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:56,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:56,577 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:56,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:56,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:56,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:56,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:56,614 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:56,614 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:56,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:56,615 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:56,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:56,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:56,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:56,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:56,615 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:56,615 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:56,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:56,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:56,616 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:56,616 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:56,616 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:56,616 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:56,616 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:56,616 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:56,617 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:56,617 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:56,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:56,619 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:56,619 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:56,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:56,619 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:56,619 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:56,693 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:56,693 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:56,693 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:56,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:56,693 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:56,693 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:56,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1425 [2022-12-06 07:29:56,694 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-06 07:29:56,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:56,694 INFO L85 PathProgramCache]: Analyzing trace with hash -746047727, now seen corresponding path program 1 times [2022-12-06 07:29:56,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:56,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19072628] [2022-12-06 07:29:56,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:56,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:56,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-06 07:29:56,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:56,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19072628] [2022-12-06 07:29:56,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19072628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:56,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:56,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:56,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758518361] [2022-12-06 07:29:56,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:56,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:56,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:56,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:56,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:56,758 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:56,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:56,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:56,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:56,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:56,799 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:56,799 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:56,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:56,799 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:56,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:56,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:56,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:56,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:56,800 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:56,800 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:56,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:56,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:56,801 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:56,801 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:56,801 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:56,801 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:56,801 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:56,801 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:56,801 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:56,801 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:56,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:56,803 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:56,803 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:56,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:56,804 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:56,804 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:56,878 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:56,879 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:56,879 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:56,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:56,879 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:56,879 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:56,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1426 [2022-12-06 07:29:56,879 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-06 07:29:56,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:56,879 INFO L85 PathProgramCache]: Analyzing trace with hash -715571534, now seen corresponding path program 1 times [2022-12-06 07:29:56,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:56,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49105279] [2022-12-06 07:29:56,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:56,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:56,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:56,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-06 07:29:56,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:56,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49105279] [2022-12-06 07:29:56,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49105279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:56,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:56,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:56,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104722342] [2022-12-06 07:29:56,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:56,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:56,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:56,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:56,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:56,951 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:56,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:56,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:56,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:56,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:56,989 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:56,989 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:56,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:56,989 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:56,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:56,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:56,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:56,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:56,990 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:56,990 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:56,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:56,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:56,991 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:56,991 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:56,991 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:56,991 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:56,991 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:56,991 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:56,991 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:56,991 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:56,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:56,993 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:56,993 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:56,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:56,994 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:56,994 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:57,067 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:57,068 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:57,068 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:57,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:57,068 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:57,068 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:57,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1427 [2022-12-06 07:29:57,068 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-06 07:29:57,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:57,069 INFO L85 PathProgramCache]: Analyzing trace with hash -688789425, now seen corresponding path program 1 times [2022-12-06 07:29:57,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:57,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550508276] [2022-12-06 07:29:57,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:57,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:57,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-06 07:29:57,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:57,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550508276] [2022-12-06 07:29:57,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550508276] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:57,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:57,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:57,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368247215] [2022-12-06 07:29:57,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:57,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:57,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:57,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:57,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:57,151 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:57,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:57,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:57,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:57,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:57,188 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:57,188 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:57,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:57,189 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:57,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:57,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:57,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:57,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:57,189 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:57,189 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:57,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:57,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:57,190 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:57,190 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:57,190 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:57,190 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:57,190 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:57,190 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:57,190 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:57,191 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:57,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:57,193 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:57,193 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:57,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:57,193 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:57,193 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:57,268 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:57,269 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:57,269 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:57,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:57,269 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:57,269 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:57,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1428 [2022-12-06 07:29:57,269 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-06 07:29:57,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:57,270 INFO L85 PathProgramCache]: Analyzing trace with hash -658313232, now seen corresponding path program 1 times [2022-12-06 07:29:57,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:57,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648102978] [2022-12-06 07:29:57,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:57,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:57,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-06 07:29:57,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:57,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648102978] [2022-12-06 07:29:57,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648102978] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:57,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:57,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:57,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651674431] [2022-12-06 07:29:57,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:57,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:57,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:57,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:57,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:57,330 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:57,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:57,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:57,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:57,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:57,372 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:57,373 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:57,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:57,373 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:57,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:57,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:57,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:57,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:57,374 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:57,374 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:57,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:57,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:57,374 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:57,374 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:57,375 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:57,375 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:57,375 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:57,375 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:57,375 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:57,375 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:57,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:57,377 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:57,377 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:57,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:57,377 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:57,377 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:57,452 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:57,453 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:57,453 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:57,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:57,453 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:57,453 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:57,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1429 [2022-12-06 07:29:57,453 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-06 07:29:57,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:57,453 INFO L85 PathProgramCache]: Analyzing trace with hash -631531123, now seen corresponding path program 1 times [2022-12-06 07:29:57,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:57,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457859452] [2022-12-06 07:29:57,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:57,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29: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-06 07:29:57,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:57,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457859452] [2022-12-06 07:29:57,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457859452] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:57,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:57,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:57,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347655129] [2022-12-06 07:29:57,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:57,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:57,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:57,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:57,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:57,517 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:57,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:57,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:57,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:57,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:57,559 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:57,559 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:57,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:57,560 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:57,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:57,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:57,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:57,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:57,560 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:57,560 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:57,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:57,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:57,561 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:57,561 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:57,561 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:57,561 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:57,561 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:57,561 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:57,562 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:57,562 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:57,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:57,564 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:57,564 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:57,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:57,564 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:57,564 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:57,638 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:57,639 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:57,639 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:57,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:57,639 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:57,639 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:57,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1430 [2022-12-06 07:29:57,639 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-06 07:29:57,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:57,640 INFO L85 PathProgramCache]: Analyzing trace with hash -601054930, now seen corresponding path program 1 times [2022-12-06 07:29:57,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:57,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192065048] [2022-12-06 07:29:57,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:57,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:57,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-06 07:29:57,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:57,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192065048] [2022-12-06 07:29:57,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192065048] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:57,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:57,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:57,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804140084] [2022-12-06 07:29:57,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:57,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:57,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:57,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:57,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:57,704 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:57,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:57,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:57,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:57,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:57,762 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:57,763 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:57,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:57,763 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:57,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:57,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:57,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:57,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:57,764 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:57,764 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:57,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:57,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:57,764 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:57,764 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:57,765 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:57,765 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:57,765 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:57,765 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:57,765 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:57,765 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:57,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:57,767 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:57,767 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:57,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:57,767 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:57,767 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:57,841 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:57,842 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:29:57,842 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:57,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:57,843 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:57,843 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:57,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1431 [2022-12-06 07:29:57,843 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-06 07:29:57,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:57,843 INFO L85 PathProgramCache]: Analyzing trace with hash -574272821, now seen corresponding path program 1 times [2022-12-06 07:29:57,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:57,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293197777] [2022-12-06 07:29:57,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:57,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:57,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-06 07:29:57,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:57,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293197777] [2022-12-06 07:29:57,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293197777] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:57,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:57,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:57,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115893021] [2022-12-06 07:29:57,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:57,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:57,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:57,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:57,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:57,923 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:57,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:57,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:57,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:57,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:57,960 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:57,960 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:57,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:57,960 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:57,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:57,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:57,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:57,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:57,961 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:57,961 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:57,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:57,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:57,962 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:57,962 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:57,962 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:57,962 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:57,962 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:57,962 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:57,963 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:57,963 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:57,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:57,965 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:57,965 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:57,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:57,965 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:57,965 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:58,040 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:58,041 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:58,041 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:58,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:58,041 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:58,041 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:58,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1432 [2022-12-06 07:29:58,041 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-06 07:29:58,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:58,041 INFO L85 PathProgramCache]: Analyzing trace with hash -543796628, now seen corresponding path program 1 times [2022-12-06 07:29:58,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:58,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957646126] [2022-12-06 07:29:58,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:58,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:58,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-06 07:29:58,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:58,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957646126] [2022-12-06 07:29:58,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957646126] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:58,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:58,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:58,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727399216] [2022-12-06 07:29:58,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:58,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:58,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:58,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:58,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:58,107 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:58,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:58,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:58,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:58,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:58,149 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:58,150 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:58,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:58,150 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:58,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:58,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:58,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:58,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:58,151 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:58,151 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:58,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:58,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:58,152 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:58,152 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:58,152 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:58,152 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:58,152 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:58,152 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:58,152 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:58,152 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:58,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:58,154 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:58,154 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:58,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:58,155 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:58,155 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:58,231 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:58,232 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:29:58,232 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:58,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:58,232 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:58,232 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:58,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1433 [2022-12-06 07:29:58,232 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-06 07:29:58,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:58,232 INFO L85 PathProgramCache]: Analyzing trace with hash -517014519, now seen corresponding path program 1 times [2022-12-06 07:29:58,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:58,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493888522] [2022-12-06 07:29:58,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:58,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:58,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-06 07:29:58,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:58,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493888522] [2022-12-06 07:29:58,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493888522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:58,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:58,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:58,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873539972] [2022-12-06 07:29:58,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:58,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:58,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:58,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:58,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:58,297 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:58,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:58,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:58,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:58,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:58,339 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:58,339 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:58,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:58,340 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:58,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:58,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:58,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:58,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:58,340 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:58,340 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:58,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:58,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:58,341 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:58,341 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:58,341 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:58,341 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:58,341 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:58,341 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:58,341 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:58,341 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:58,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:58,344 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:58,344 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:58,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:58,344 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:58,344 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:58,421 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:58,422 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:29:58,422 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:58,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:58,422 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:58,422 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:58,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1434 [2022-12-06 07:29:58,422 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-06 07:29:58,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:58,422 INFO L85 PathProgramCache]: Analyzing trace with hash -486538326, now seen corresponding path program 1 times [2022-12-06 07:29:58,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:58,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459459317] [2022-12-06 07:29:58,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:58,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:58,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-06 07:29:58,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:58,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459459317] [2022-12-06 07:29:58,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459459317] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:58,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:58,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:58,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604321231] [2022-12-06 07:29:58,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:58,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:58,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:58,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:58,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:58,489 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:58,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:58,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:58,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:58,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:58,527 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:58,527 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:58,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:58,528 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:58,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:58,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:58,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:58,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:58,528 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:58,528 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:58,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:58,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:58,529 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:58,529 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:58,529 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:58,529 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:58,529 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:58,529 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:58,530 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:58,530 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:58,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:58,532 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:58,532 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:58,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:58,533 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:58,533 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:58,625 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:58,626 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 07:29:58,626 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:58,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:58,626 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:58,626 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:58,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1435 [2022-12-06 07:29:58,627 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-06 07:29:58,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:58,627 INFO L85 PathProgramCache]: Analyzing trace with hash -459756217, now seen corresponding path program 1 times [2022-12-06 07:29:58,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:58,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805900280] [2022-12-06 07:29:58,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:58,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:58,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-06 07:29:58,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:58,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805900280] [2022-12-06 07:29:58,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805900280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:58,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:58,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:58,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853013042] [2022-12-06 07:29:58,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:58,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:58,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:58,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:58,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:58,693 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:58,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:58,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:58,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:58,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:58,735 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:58,735 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:58,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:58,736 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:58,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:58,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:58,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:58,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:58,736 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:58,736 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:58,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:58,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:58,737 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:58,737 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:58,737 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:58,737 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:58,737 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:58,737 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:58,737 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:58,737 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:58,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:58,740 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:58,740 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:58,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:58,740 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:58,740 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:58,815 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:58,816 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:29:58,816 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:58,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:58,816 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:58,816 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:58,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1436 [2022-12-06 07:29:58,816 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-06 07:29:58,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:58,816 INFO L85 PathProgramCache]: Analyzing trace with hash -429280024, now seen corresponding path program 1 times [2022-12-06 07:29:58,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:58,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537170163] [2022-12-06 07:29:58,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:58,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:58,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-06 07:29:58,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:58,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537170163] [2022-12-06 07:29:58,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537170163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:58,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:58,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:58,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818436316] [2022-12-06 07:29:58,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:58,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:58,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:58,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:58,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:58,880 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:58,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:58,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:58,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:58,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:58,926 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:58,926 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:29:58,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:58,926 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:58,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:58,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:58,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:58,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:58,927 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:58,927 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:58,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:58,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:58,928 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:58,928 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:58,928 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:58,928 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:58,928 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:58,928 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:58,928 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:58,928 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:58,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:58,930 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:58,931 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:58,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:58,931 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:58,931 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:59,005 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:59,006 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:59,006 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:59,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:59,006 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:59,006 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:59,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1437 [2022-12-06 07:29:59,006 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-06 07:29:59,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:59,007 INFO L85 PathProgramCache]: Analyzing trace with hash -402497915, now seen corresponding path program 1 times [2022-12-06 07:29:59,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:59,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481811906] [2022-12-06 07:29:59,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:59,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:59,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-06 07:29:59,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:59,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481811906] [2022-12-06 07:29:59,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481811906] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:59,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:59,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:59,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338703425] [2022-12-06 07:29:59,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:59,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:59,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:59,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:59,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:59,072 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:59,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:59,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:59,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:59,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:59,114 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:59,114 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:59,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:59,114 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:59,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:59,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:59,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:59,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:59,115 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:59,115 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:59,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:59,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:59,116 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:59,116 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:59,116 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:59,116 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:59,116 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:59,116 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:59,116 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:59,116 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:59,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:59,118 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:59,118 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:59,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 144 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:59,119 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:59,119 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:59,193 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:59,194 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:59,194 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:59,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:59,194 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:59,194 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:59,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1438 [2022-12-06 07:29:59,194 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-06 07:29:59,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:59,195 INFO L85 PathProgramCache]: Analyzing trace with hash -372021722, now seen corresponding path program 1 times [2022-12-06 07:29:59,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:59,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256130713] [2022-12-06 07:29:59,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:59,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:59,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-06 07:29:59,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:59,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256130713] [2022-12-06 07:29:59,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256130713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:59,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:59,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:59,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599511081] [2022-12-06 07:29:59,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:59,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:59,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:59,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:59,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:59,254 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:59,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:59,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:59,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:59,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:59,291 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:59,292 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:59,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:59,292 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:59,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:59,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:59,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:59,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:59,293 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:59,293 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:59,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:59,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:59,293 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:59,293 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:59,294 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:59,294 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:59,294 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:59,294 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:59,294 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:59,294 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:59,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:59,296 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:59,296 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:59,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:59,297 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:59,297 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:59,371 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:59,372 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:59,372 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:59,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:59,372 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:59,372 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:59,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1439 [2022-12-06 07:29:59,372 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-06 07:29:59,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:59,372 INFO L85 PathProgramCache]: Analyzing trace with hash -345239613, now seen corresponding path program 1 times [2022-12-06 07:29:59,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:59,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178752597] [2022-12-06 07:29:59,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:59,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:59,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-06 07:29:59,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:59,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178752597] [2022-12-06 07:29:59,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178752597] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:59,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:59,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:59,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069295281] [2022-12-06 07:29:59,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:59,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:59,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:59,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:59,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:59,436 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:59,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:59,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:59,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:59,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:59,478 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:59,478 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:59,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:59,478 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:59,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:59,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:59,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:59,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:59,479 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:59,479 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:59,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:59,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:59,480 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:59,480 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:59,480 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:59,480 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:59,480 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:59,480 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:59,480 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:59,480 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:59,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:59,482 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:59,482 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:59,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:59,483 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:59,483 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:59,557 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:59,558 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:59,558 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:59,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:59,558 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:59,558 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:59,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1440 [2022-12-06 07:29:59,558 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-06 07:29:59,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:59,559 INFO L85 PathProgramCache]: Analyzing trace with hash -314763420, now seen corresponding path program 1 times [2022-12-06 07:29:59,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:59,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607754968] [2022-12-06 07:29:59,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:59,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:59,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-06 07:29:59,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:59,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607754968] [2022-12-06 07:29:59,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607754968] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:59,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:59,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:59,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958520217] [2022-12-06 07:29:59,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:59,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:59,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:59,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:59,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:59,628 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:59,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:59,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:59,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:59,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:59,671 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:29:59,672 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:29:59,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:29:59,672 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:29:59,672 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:59,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:59,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:59,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:59,673 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:59,673 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:59,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:59,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:59,673 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:59,673 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:59,673 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:59,674 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:59,674 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:59,674 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:59,674 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:59,674 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:59,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:59,676 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:29:59,676 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:29:59,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:29:59,676 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:59,676 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:29:59,751 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:59,752 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:29:59,752 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:29:59,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:59,752 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:59,752 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:59,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1441 [2022-12-06 07:29:59,752 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-06 07:29:59,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:59,752 INFO L85 PathProgramCache]: Analyzing trace with hash -287981311, now seen corresponding path program 1 times [2022-12-06 07:29:59,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:59,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284814832] [2022-12-06 07:29:59,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:59,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:59,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-06 07:29:59,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:59,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284814832] [2022-12-06 07:29:59,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284814832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:59,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:59,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:29:59,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109279300] [2022-12-06 07:29:59,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:59,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:59,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:59,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:59,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:59,816 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:29:59,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:59,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:59,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:29:59,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:59,857 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:29:59,857 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:29:59,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:29:59,858 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:29:59,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:59,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:59,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:59,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:29:59,858 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:29:59,858 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:29:59,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:29:59,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:59,859 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:59,859 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:29:59,859 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:29:59,859 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:59,859 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:59,859 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:59,859 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:59,860 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:59,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:59,862 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:29:59,862 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:29:59,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:29:59,862 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:29:59,862 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:29:59,945 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:59,946 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 07:29:59,946 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:29:59,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:59,946 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:59,946 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:59,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1442 [2022-12-06 07:29:59,946 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-06 07:29:59,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:59,947 INFO L85 PathProgramCache]: Analyzing trace with hash -257505118, now seen corresponding path program 1 times [2022-12-06 07:29:59,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:59,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809600452] [2022-12-06 07:29:59,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:59,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:00,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-06 07:30:00,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:00,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809600452] [2022-12-06 07:30:00,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809600452] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:00,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:00,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:00,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078951894] [2022-12-06 07:30:00,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:00,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:00,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:00,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:00,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:00,011 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:00,011 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:00,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:00,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:00,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:00,048 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:00,048 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:00,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:00,048 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:00,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:00,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:00,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:00,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:00,049 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:00,049 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:00,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:00,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:00,050 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:00,050 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:00,050 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:00,050 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:00,050 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:00,050 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:00,050 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:00,050 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:00,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:00,052 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:00,053 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:00,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:00,053 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:00,053 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:00,128 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:00,129 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:00,129 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:00,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:00,129 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:00,129 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:00,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1443 [2022-12-06 07:30:00,129 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-06 07:30:00,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:00,129 INFO L85 PathProgramCache]: Analyzing trace with hash -230723009, now seen corresponding path program 1 times [2022-12-06 07:30:00,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:00,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661885742] [2022-12-06 07:30:00,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:00,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:00,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:00,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:00,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661885742] [2022-12-06 07:30:00,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661885742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:00,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:00,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:00,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624943423] [2022-12-06 07:30:00,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:00,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:00,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:00,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:00,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:00,193 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:00,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:00,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:00,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:00,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:00,229 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:00,229 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:00,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:00,230 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:00,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:00,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:00,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:00,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:00,230 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:00,230 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:00,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:00,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:00,231 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:00,231 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:00,231 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:00,231 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:00,231 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:00,232 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:00,232 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:00,232 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:00,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:00,234 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:00,234 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:00,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:00,234 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:00,234 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:00,308 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:00,309 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:00,309 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:00,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:00,309 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:00,309 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:00,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1444 [2022-12-06 07:30:00,309 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-06 07:30:00,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:00,310 INFO L85 PathProgramCache]: Analyzing trace with hash -200246816, now seen corresponding path program 1 times [2022-12-06 07:30:00,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:00,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947764556] [2022-12-06 07:30:00,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:00,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:00,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-06 07:30:00,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:00,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947764556] [2022-12-06 07:30:00,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947764556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:00,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:00,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:00,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668613630] [2022-12-06 07:30:00,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:00,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:00,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:00,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:00,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:00,373 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:00,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:00,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:00,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:00,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:00,416 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:00,417 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:00,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:00,417 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:00,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:00,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:00,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:00,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:00,418 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:00,418 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:00,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:00,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:00,418 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:00,418 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:00,419 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:00,419 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:00,419 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:00,419 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:00,419 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:00,419 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:00,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:00,421 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:00,421 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:00,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:00,421 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:00,422 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:00,497 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:00,497 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:00,497 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:00,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:00,498 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:00,498 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:00,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1445 [2022-12-06 07:30:00,498 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-06 07:30:00,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:00,498 INFO L85 PathProgramCache]: Analyzing trace with hash -173464707, now seen corresponding path program 1 times [2022-12-06 07:30:00,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:00,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116756035] [2022-12-06 07:30:00,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:00,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:00,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-06 07:30:00,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:00,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116756035] [2022-12-06 07:30:00,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116756035] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:00,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:00,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:00,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239429583] [2022-12-06 07:30:00,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:00,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:00,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:00,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:00,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:00,562 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:00,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:00,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:00,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:00,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:00,604 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:00,605 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:00,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:00,605 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:00,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:00,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:00,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:00,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:00,606 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:00,606 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:00,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:00,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:00,606 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:00,606 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:00,607 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:00,607 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:00,607 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:00,607 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:00,607 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:00,607 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:00,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:00,609 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:00,609 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:00,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:00,609 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:00,610 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:00,684 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:00,684 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:00,684 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:00,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:00,684 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:00,684 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:00,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1446 [2022-12-06 07:30:00,685 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-06 07:30:00,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:00,685 INFO L85 PathProgramCache]: Analyzing trace with hash -142988514, now seen corresponding path program 1 times [2022-12-06 07:30:00,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:00,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436658832] [2022-12-06 07:30:00,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:00,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:00,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-06 07:30:00,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:00,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436658832] [2022-12-06 07:30:00,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436658832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:00,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:00,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:00,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133336704] [2022-12-06 07:30:00,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:00,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:00,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:00,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:00,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:00,745 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:00,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:00,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:00,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:00,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:00,781 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:00,782 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:00,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:00,782 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:00,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:00,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:00,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:00,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:00,783 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:00,783 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:00,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:00,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:00,783 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:00,783 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:00,784 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:00,784 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:00,784 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:00,784 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:00,784 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:00,784 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:00,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:00,786 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:00,786 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:00,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:00,786 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:00,786 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:00,861 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:00,862 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:00,862 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:00,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:00,862 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:00,862 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:00,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1447 [2022-12-06 07:30:00,862 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-06 07:30:00,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:00,863 INFO L85 PathProgramCache]: Analyzing trace with hash -116206405, now seen corresponding path program 1 times [2022-12-06 07:30:00,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:00,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501873456] [2022-12-06 07:30:00,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:00,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:00,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-06 07:30:00,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:00,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501873456] [2022-12-06 07:30:00,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501873456] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:00,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:00,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:00,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710715981] [2022-12-06 07:30:00,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:00,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:00,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:00,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:00,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:00,940 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:00,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:00,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:00,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:00,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:00,982 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:00,982 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:00,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:00,983 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:00,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:00,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:00,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:00,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:00,983 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:00,983 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:00,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:00,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:00,984 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:00,984 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:00,984 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:00,984 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:00,984 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:00,985 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:00,985 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:00,985 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:00,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:00,987 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:00,987 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:00,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:00,987 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:00,987 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:01,064 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:01,065 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:30:01,065 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:01,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:01,065 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:01,065 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:01,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1448 [2022-12-06 07:30:01,065 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-06 07:30:01,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:01,065 INFO L85 PathProgramCache]: Analyzing trace with hash -85730212, now seen corresponding path program 1 times [2022-12-06 07:30:01,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:01,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042104527] [2022-12-06 07:30:01,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:01,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:01,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-06 07:30:01,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:01,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042104527] [2022-12-06 07:30:01,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042104527] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:01,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:01,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:01,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911208289] [2022-12-06 07:30:01,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:01,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:01,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:01,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:01,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:01,128 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:01,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:01,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:01,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:01,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:01,172 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:01,172 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:01,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:01,173 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:01,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:01,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:01,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:01,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:01,173 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:01,173 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:01,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:01,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:01,174 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:01,174 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:01,174 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:01,174 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:01,174 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:01,175 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:01,175 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:01,175 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:01,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:01,177 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:01,177 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:01,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:01,177 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:01,177 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:01,252 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:01,252 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:01,252 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:01,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:01,252 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:01,252 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:01,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1449 [2022-12-06 07:30:01,253 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-06 07:30:01,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:01,253 INFO L85 PathProgramCache]: Analyzing trace with hash -58948103, now seen corresponding path program 1 times [2022-12-06 07:30:01,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:01,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370844554] [2022-12-06 07:30:01,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:01,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:01,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-06 07:30:01,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:01,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370844554] [2022-12-06 07:30:01,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370844554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:01,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:01,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:01,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364679416] [2022-12-06 07:30:01,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:01,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:01,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:01,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:01,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:01,315 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:01,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:01,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:01,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:01,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:01,351 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:01,351 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:01,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:01,352 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:01,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:01,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:01,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:01,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:01,352 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:01,352 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:01,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:01,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:01,353 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:01,353 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:01,353 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:01,353 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:01,353 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:01,354 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:01,354 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:01,354 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:01,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:01,356 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:01,356 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:01,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:01,356 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:01,356 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:01,430 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:01,431 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:01,431 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:01,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:01,431 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:01,431 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:01,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1450 [2022-12-06 07:30:01,431 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-06 07:30:01,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:01,431 INFO L85 PathProgramCache]: Analyzing trace with hash -28471910, now seen corresponding path program 1 times [2022-12-06 07:30:01,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:01,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203679509] [2022-12-06 07:30:01,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:01,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:01,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-06 07:30:01,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:01,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203679509] [2022-12-06 07:30:01,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203679509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:01,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:01,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:01,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836994300] [2022-12-06 07:30:01,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:01,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:01,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:01,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:01,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:01,495 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:01,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:01,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:01,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:01,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:01,531 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:01,531 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:01,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:01,531 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:01,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:01,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:01,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:01,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:01,532 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:01,532 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:01,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:01,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:01,533 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:01,533 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:01,533 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:01,533 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:01,533 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:01,533 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:01,533 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:01,533 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:01,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:01,535 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:01,536 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:01,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:01,536 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:01,536 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:01,610 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:01,610 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:01,611 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:01,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:01,611 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:01,611 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:01,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1451 [2022-12-06 07:30:01,611 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-06 07:30:01,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:01,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1689801, now seen corresponding path program 1 times [2022-12-06 07:30:01,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:01,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042061543] [2022-12-06 07:30:01,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:01,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30: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-06 07:30:01,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:01,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042061543] [2022-12-06 07:30:01,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042061543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:01,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:01,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:01,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181654099] [2022-12-06 07:30:01,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:01,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:01,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:01,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:01,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:01,676 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:01,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:01,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:01,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:01,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:01,717 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:01,718 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:01,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:01,718 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:01,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:01,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:01,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:01,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:01,719 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:01,719 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:01,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:01,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:01,719 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:01,719 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:01,720 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:01,720 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:01,720 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:01,720 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:01,720 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:01,720 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:01,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:01,722 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:01,722 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:01,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 144 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:01,722 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:01,722 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:01,800 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:01,800 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:30:01,800 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:01,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:01,801 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:01,801 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:01,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1452 [2022-12-06 07:30:01,801 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-06 07:30:01,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:01,801 INFO L85 PathProgramCache]: Analyzing trace with hash 28786392, now seen corresponding path program 1 times [2022-12-06 07:30:01,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:01,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476166042] [2022-12-06 07:30:01,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:01,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:01,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-06 07:30:01,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:01,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476166042] [2022-12-06 07:30:01,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476166042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:01,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:01,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:01,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987314] [2022-12-06 07:30:01,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:01,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:01,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:01,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:01,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:01,873 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:01,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:01,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:01,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:01,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:01,915 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:01,915 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:01,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:01,916 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:01,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:01,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:01,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:01,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:01,916 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:01,917 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:01,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:01,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:01,917 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:01,917 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:01,917 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:01,917 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:01,918 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:01,918 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:01,918 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:01,918 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:01,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:01,920 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:01,920 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:01,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:01,920 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:01,920 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:01,994 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:01,995 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:01,995 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:01,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:01,995 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:01,995 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:01,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1453 [2022-12-06 07:30:01,995 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-06 07:30:01,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:01,995 INFO L85 PathProgramCache]: Analyzing trace with hash 55568501, now seen corresponding path program 1 times [2022-12-06 07:30:01,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:01,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735579139] [2022-12-06 07:30:01,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:01,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:02,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:02,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:02,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735579139] [2022-12-06 07:30:02,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735579139] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:02,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:02,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:02,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084093904] [2022-12-06 07:30:02,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:02,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:02,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:02,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:02,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:02,065 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:02,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:02,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:02,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:02,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:02,107 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:02,107 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:02,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:02,108 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:02,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:02,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:02,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:02,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:02,108 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:02,108 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:02,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:02,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:02,109 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:02,109 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:02,109 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:02,109 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:02,109 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:02,109 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:02,109 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:02,109 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:02,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:02,112 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:02,112 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:02,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:02,112 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:02,112 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:02,188 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:02,189 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:30:02,189 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:02,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:02,189 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:02,189 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:02,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1454 [2022-12-06 07:30:02,189 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-06 07:30:02,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:02,190 INFO L85 PathProgramCache]: Analyzing trace with hash 86044694, now seen corresponding path program 1 times [2022-12-06 07:30:02,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:02,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816794258] [2022-12-06 07:30:02,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:02,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:02,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-06 07:30:02,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:02,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816794258] [2022-12-06 07:30:02,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816794258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:02,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:02,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:02,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176462743] [2022-12-06 07:30:02,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:02,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:02,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:02,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:02,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:02,249 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:02,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:02,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:02,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:02,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:02,285 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:02,286 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:02,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:02,286 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:02,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:02,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:02,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:02,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:02,287 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:02,287 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:02,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:02,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:02,287 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:02,287 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:02,288 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:02,288 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:02,288 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:02,288 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:02,288 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:02,288 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:02,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:02,290 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:02,290 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:02,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:02,290 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:02,290 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:02,364 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:02,365 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:02,365 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:02,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:02,365 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:02,365 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:02,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1455 [2022-12-06 07:30:02,365 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-06 07:30:02,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:02,365 INFO L85 PathProgramCache]: Analyzing trace with hash 112826803, now seen corresponding path program 1 times [2022-12-06 07:30:02,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:02,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323210934] [2022-12-06 07:30:02,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:02,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:02,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-06 07:30:02,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:02,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323210934] [2022-12-06 07:30:02,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323210934] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:02,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:02,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:02,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374945854] [2022-12-06 07:30:02,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:02,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:02,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:02,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:02,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:02,428 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:02,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:02,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:02,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:02,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:02,463 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:02,464 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:02,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:02,464 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:02,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:02,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:02,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:02,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:02,465 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:02,465 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:02,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:02,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:02,465 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:02,465 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:02,466 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:02,466 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:02,466 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:02,466 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:02,466 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:02,466 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:02,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:02,468 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:02,468 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:02,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:02,468 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:02,469 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:02,543 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:02,544 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:02,544 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:02,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:02,544 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:02,544 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:02,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1456 [2022-12-06 07:30:02,544 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-06 07:30:02,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:02,545 INFO L85 PathProgramCache]: Analyzing trace with hash 143302996, now seen corresponding path program 1 times [2022-12-06 07:30:02,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:02,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925600991] [2022-12-06 07:30:02,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:02,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:02,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-06 07:30:02,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:02,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925600991] [2022-12-06 07:30:02,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925600991] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:02,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:02,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:02,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359863562] [2022-12-06 07:30:02,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:02,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:02,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:02,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:02,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:02,604 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:02,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:02,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:02,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:02,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:02,647 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:02,647 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:02,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:02,648 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:02,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:02,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:02,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:02,648 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:02,649 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:02,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:02,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:02,649 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:02,649 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:02,649 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:02,649 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:02,650 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:02,650 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:02,650 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:02,650 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:02,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:02,652 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:02,652 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:02,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:02,652 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:02,652 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:02,726 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:02,727 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:02,727 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:02,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:02,727 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:02,727 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:02,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1457 [2022-12-06 07:30:02,727 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-06 07:30:02,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:02,727 INFO L85 PathProgramCache]: Analyzing trace with hash 170085105, now seen corresponding path program 1 times [2022-12-06 07:30:02,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:02,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290655441] [2022-12-06 07:30:02,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:02,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:02,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-06 07:30:02,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:02,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290655441] [2022-12-06 07:30:02,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290655441] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:02,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:02,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:02,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206113399] [2022-12-06 07:30:02,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:02,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:02,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:02,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:02,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:02,801 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:02,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:02,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:02,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:02,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:02,843 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:02,843 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:02,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:02,843 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:02,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:02,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:02,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:02,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:02,844 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:02,844 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:02,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:02,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:02,845 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:02,845 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:02,845 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:02,845 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:02,845 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:02,845 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:02,845 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:02,845 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:02,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:02,847 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:02,847 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:02,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:02,848 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:02,848 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:02,921 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:02,922 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:02,922 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:02,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:02,922 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:02,922 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:02,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1458 [2022-12-06 07:30:02,922 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-06 07:30:02,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:02,922 INFO L85 PathProgramCache]: Analyzing trace with hash 200561298, now seen corresponding path program 1 times [2022-12-06 07:30:02,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:02,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688029978] [2022-12-06 07:30:02,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:02,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:02,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-06 07:30:02,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:02,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688029978] [2022-12-06 07:30:02,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688029978] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:02,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:02,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:02,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158677998] [2022-12-06 07:30:02,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:02,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:02,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:02,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:02,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:02,984 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:02,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:02,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:02,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:02,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:03,025 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:03,025 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:03,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:03,026 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:03,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:03,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:03,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:03,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:03,026 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:03,026 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:03,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:03,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:03,027 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:03,027 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:03,027 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:03,027 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:03,027 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:03,028 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:03,028 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:03,028 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:03,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:03,030 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:03,030 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:03,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:03,030 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:03,030 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:03,104 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:03,105 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:03,105 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:03,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:03,105 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:03,105 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:03,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1459 [2022-12-06 07:30:03,105 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-06 07:30:03,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:03,105 INFO L85 PathProgramCache]: Analyzing trace with hash 227343407, now seen corresponding path program 1 times [2022-12-06 07:30:03,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:03,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765060561] [2022-12-06 07:30:03,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:03,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:03,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-06 07:30:03,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:03,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765060561] [2022-12-06 07:30:03,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765060561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:03,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:03,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:03,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212144714] [2022-12-06 07:30:03,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:03,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:03,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:03,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:03,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:03,168 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:03,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:03,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:03,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:03,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:03,204 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:03,204 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:03,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:03,204 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:03,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:03,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:03,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:03,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:03,205 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:03,205 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:03,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:03,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:03,205 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:03,206 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:03,206 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:03,206 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:03,206 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:03,206 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:03,206 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:03,206 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:03,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:03,208 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:03,208 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:03,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:03,209 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:03,209 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:03,281 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:03,281 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:30:03,281 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:03,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:03,282 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:03,282 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:03,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1460 [2022-12-06 07:30:03,282 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-06 07:30:03,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:03,282 INFO L85 PathProgramCache]: Analyzing trace with hash 257819600, now seen corresponding path program 1 times [2022-12-06 07:30:03,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:03,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037607378] [2022-12-06 07:30:03,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:03,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:03,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-06 07:30:03,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:03,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037607378] [2022-12-06 07:30:03,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037607378] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:03,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:03,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:03,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235869002] [2022-12-06 07:30:03,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:03,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:03,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:03,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:03,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:03,350 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:03,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:03,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:03,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:03,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:03,388 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:03,388 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:03,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:03,388 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:03,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:03,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:03,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:03,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:03,389 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:03,389 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:03,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:03,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:03,390 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:03,390 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:03,390 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:03,390 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:03,390 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:03,390 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:03,390 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:03,390 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:03,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:03,392 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:03,392 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:03,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:03,392 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:03,393 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:03,466 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:03,466 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:30:03,466 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:03,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:03,466 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:03,466 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:03,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1461 [2022-12-06 07:30:03,466 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-06 07:30:03,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:03,467 INFO L85 PathProgramCache]: Analyzing trace with hash 284601709, now seen corresponding path program 1 times [2022-12-06 07:30:03,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:03,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314941819] [2022-12-06 07:30:03,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:03,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:03,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-06 07:30:03,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:03,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314941819] [2022-12-06 07:30:03,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314941819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:03,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:03,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:03,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548272107] [2022-12-06 07:30:03,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:03,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:03,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:03,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:03,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:03,530 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:03,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:03,530 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:03,530 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:03,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:03,567 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:03,567 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:03,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:03,568 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:03,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:03,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:03,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:03,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:03,568 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:03,568 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:03,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:03,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:03,569 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:03,569 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:03,569 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:03,569 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:03,569 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:03,569 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:03,569 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:03,569 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:03,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:03,572 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:03,572 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:03,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:03,572 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:03,572 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:03,649 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:03,650 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:30:03,650 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:03,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:03,650 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:03,650 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:03,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1462 [2022-12-06 07:30:03,650 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-06 07:30:03,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:03,650 INFO L85 PathProgramCache]: Analyzing trace with hash 315077902, now seen corresponding path program 1 times [2022-12-06 07:30:03,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:03,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183418307] [2022-12-06 07:30:03,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:03,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:03,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-06 07:30:03,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:03,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183418307] [2022-12-06 07:30:03,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183418307] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:03,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:03,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:03,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385012960] [2022-12-06 07:30:03,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:03,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:03,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:03,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:03,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:03,713 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:03,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:03,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:03,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:03,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:03,755 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:03,755 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:03,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:03,756 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:03,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:03,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:03,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:03,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:03,757 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:03,757 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:03,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:03,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:03,757 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:03,757 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:03,757 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:03,758 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:03,758 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:03,758 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:03,758 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:03,758 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:03,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:03,760 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:03,760 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:03,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:03,761 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:03,761 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:03,847 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:03,848 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-06 07:30:03,848 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:03,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:03,848 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:03,848 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:03,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1463 [2022-12-06 07:30:03,849 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-06 07:30:03,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:03,849 INFO L85 PathProgramCache]: Analyzing trace with hash 341860011, now seen corresponding path program 1 times [2022-12-06 07:30:03,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:03,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143617316] [2022-12-06 07:30:03,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:03,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:03,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-06 07:30:03,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:03,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143617316] [2022-12-06 07:30:03,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143617316] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:03,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:03,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:03,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405175499] [2022-12-06 07:30:03,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:03,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:03,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:03,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:03,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:03,912 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:03,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:03,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:03,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:03,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:03,953 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:03,953 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:03,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:03,953 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:03,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:03,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:03,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:03,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:03,954 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:03,954 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:03,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:03,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:03,954 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:03,955 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:03,955 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:03,955 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:03,955 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:03,955 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:03,955 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:03,955 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:03,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:03,957 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:03,957 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:03,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:03,958 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:03,958 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:04,031 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:04,032 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:04,032 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:04,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:04,032 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:04,032 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:04,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1464 [2022-12-06 07:30:04,032 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-06 07:30:04,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:04,032 INFO L85 PathProgramCache]: Analyzing trace with hash 372336204, now seen corresponding path program 1 times [2022-12-06 07:30:04,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:04,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378067] [2022-12-06 07:30:04,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:04,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:04,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:04,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-06 07:30:04,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:04,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378067] [2022-12-06 07:30:04,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378067] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:04,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:04,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:04,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374540158] [2022-12-06 07:30:04,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:04,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:04,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:04,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:04,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:04,091 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:04,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:04,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:04,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:04,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:04,133 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:04,133 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:04,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:04,134 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:04,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:04,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:04,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:04,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:04,134 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:04,134 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:04,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:04,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:04,135 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:04,135 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:04,135 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:04,135 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:04,135 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:04,135 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:04,135 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:04,136 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:04,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:04,138 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:04,138 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:04,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:04,138 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:04,138 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:04,213 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:04,213 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:04,214 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:04,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:04,214 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:04,214 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:04,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1465 [2022-12-06 07:30:04,214 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-06 07:30:04,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:04,214 INFO L85 PathProgramCache]: Analyzing trace with hash 399118313, now seen corresponding path program 1 times [2022-12-06 07:30:04,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:04,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468787957] [2022-12-06 07:30:04,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:04,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30: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-06 07:30:04,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:04,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468787957] [2022-12-06 07:30:04,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468787957] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:04,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:04,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:04,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694457236] [2022-12-06 07:30:04,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:04,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:04,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:04,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:04,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:04,278 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:04,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:04,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:04,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:04,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:04,318 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:04,318 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:04,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:04,318 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:04,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:04,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:04,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:04,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:04,319 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:04,319 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:04,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:04,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:04,319 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:04,319 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:04,320 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:04,320 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:04,320 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:04,320 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:04,320 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:04,320 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:04,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:04,322 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:04,322 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:04,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:04,322 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:04,322 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:04,396 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:04,396 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:30:04,397 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:04,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:04,397 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:04,397 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:04,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1466 [2022-12-06 07:30:04,397 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-06 07:30:04,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:04,397 INFO L85 PathProgramCache]: Analyzing trace with hash 429594506, now seen corresponding path program 1 times [2022-12-06 07:30:04,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:04,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724845918] [2022-12-06 07:30:04,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:04,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:04,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:04,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:04,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724845918] [2022-12-06 07:30:04,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724845918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:04,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:04,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:04,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381248128] [2022-12-06 07:30:04,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:04,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:04,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:04,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:04,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:04,458 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:04,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:04,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:04,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:04,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:04,499 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:04,499 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:04,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:04,500 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:04,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:04,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:04,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:04,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:04,500 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:04,500 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:04,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:04,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:04,501 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:04,501 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:04,501 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:04,501 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:04,501 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:04,501 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:04,501 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:04,501 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:04,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:04,504 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:04,504 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:04,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:04,504 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:04,504 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:04,576 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:04,577 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:30:04,577 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:04,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:04,577 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:04,577 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:04,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1467 [2022-12-06 07:30:04,577 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-06 07:30:04,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:04,577 INFO L85 PathProgramCache]: Analyzing trace with hash 456376615, now seen corresponding path program 1 times [2022-12-06 07:30:04,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:04,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066453744] [2022-12-06 07:30:04,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:04,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:04,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-06 07:30:04,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:04,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066453744] [2022-12-06 07:30:04,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066453744] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:04,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:04,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:04,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211654891] [2022-12-06 07:30:04,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:04,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:04,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:04,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:04,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:04,641 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:04,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:04,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:04,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:04,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:04,681 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:04,681 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:04,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:04,682 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:04,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:04,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:04,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:04,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:04,682 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:04,682 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:04,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:04,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:04,683 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:04,683 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:04,683 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:04,683 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:04,683 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:04,684 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:04,684 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:04,684 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:04,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:04,686 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:04,686 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:04,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:04,686 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:04,686 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:04,758 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:04,758 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:30:04,758 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:04,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:04,758 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:04,759 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:04,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1468 [2022-12-06 07:30:04,759 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-06 07:30:04,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:04,759 INFO L85 PathProgramCache]: Analyzing trace with hash 486852808, now seen corresponding path program 1 times [2022-12-06 07:30:04,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:04,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464697367] [2022-12-06 07:30:04,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:04,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:04,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-06 07:30:04,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:04,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464697367] [2022-12-06 07:30:04,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464697367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:04,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:04,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:04,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638551697] [2022-12-06 07:30:04,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:04,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:04,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:04,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:04,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:04,828 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:04,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:04,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:04,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:04,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:04,869 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:04,869 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:04,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:04,870 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:04,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:04,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:04,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:04,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:04,870 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:04,870 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:04,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:04,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:04,871 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:04,871 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:04,871 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:04,871 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:04,871 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:04,872 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:04,872 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:04,872 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:04,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:04,874 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:04,874 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:04,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:04,874 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:04,874 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:04,947 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:04,948 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:04,948 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:04,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:04,948 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:04,948 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:04,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1469 [2022-12-06 07:30:04,948 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-06 07:30:04,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:04,948 INFO L85 PathProgramCache]: Analyzing trace with hash 513634917, now seen corresponding path program 1 times [2022-12-06 07:30:04,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:04,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265374411] [2022-12-06 07:30:04,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:04,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:05,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-06 07:30:05,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:05,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265374411] [2022-12-06 07:30:05,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265374411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:05,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:05,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:05,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636343054] [2022-12-06 07:30:05,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:05,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:05,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:05,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:05,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:05,011 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:05,011 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:05,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:05,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:05,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:05,050 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:05,050 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:05,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:05,050 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:05,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:05,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:05,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:05,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:05,051 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:05,051 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:05,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:05,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:05,051 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:05,051 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:05,052 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:05,052 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:05,052 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:05,052 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:05,052 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:05,052 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:05,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:05,054 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:05,054 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:05,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:05,054 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:05,054 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:05,141 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:05,142 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-06 07:30:05,142 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:05,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:05,142 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:05,142 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:05,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1470 [2022-12-06 07:30:05,142 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-06 07:30:05,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:05,142 INFO L85 PathProgramCache]: Analyzing trace with hash 544111110, now seen corresponding path program 1 times [2022-12-06 07:30:05,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:05,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627637722] [2022-12-06 07:30:05,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:05,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:05,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-06 07:30:05,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:05,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627637722] [2022-12-06 07:30:05,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627637722] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:05,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:05,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:05,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942310039] [2022-12-06 07:30:05,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:05,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:05,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:05,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:05,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:05,220 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:05,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:05,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:05,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:05,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:05,260 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:05,260 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:05,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:05,260 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:05,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:05,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:05,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:05,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:05,261 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:05,261 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:05,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:05,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:05,262 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:05,262 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:05,262 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:05,262 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:05,262 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:05,263 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:05,263 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:05,263 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:05,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:05,266 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:05,266 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:05,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:05,266 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:05,266 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:05,357 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:05,358 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:30:05,358 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:05,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:05,358 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:05,358 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:05,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1471 [2022-12-06 07:30:05,358 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-06 07:30:05,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:05,359 INFO L85 PathProgramCache]: Analyzing trace with hash 570893219, now seen corresponding path program 1 times [2022-12-06 07:30:05,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:05,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323516234] [2022-12-06 07:30:05,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:05,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:05,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-06 07:30:05,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:05,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323516234] [2022-12-06 07:30:05,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323516234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:05,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:05,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:05,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415768815] [2022-12-06 07:30:05,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:05,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:05,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:05,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:05,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:05,443 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:05,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:05,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:05,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:05,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:05,489 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:05,489 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:05,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:05,490 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:05,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:05,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:05,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:05,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:05,490 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:05,490 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:05,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:05,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:05,491 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:05,491 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:05,491 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:05,491 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:05,491 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:05,492 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:05,492 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:05,492 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:05,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:05,494 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:05,494 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:05,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:05,494 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:05,494 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:05,567 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:05,568 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:05,568 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:05,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:05,568 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:05,568 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:05,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1472 [2022-12-06 07:30:05,568 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-06 07:30:05,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:05,568 INFO L85 PathProgramCache]: Analyzing trace with hash 601369412, now seen corresponding path program 1 times [2022-12-06 07:30:05,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:05,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897956645] [2022-12-06 07:30:05,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:05,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:05,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-06 07:30:05,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:05,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897956645] [2022-12-06 07:30:05,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897956645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:05,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:05,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:05,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799041326] [2022-12-06 07:30:05,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:05,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:05,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:05,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:05,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:05,630 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:05,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:05,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:05,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:05,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:05,673 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:05,674 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:05,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:05,674 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:05,674 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:05,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:05,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:05,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:05,675 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:05,675 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:05,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:05,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:05,675 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:05,675 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:05,675 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:05,676 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:05,676 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:05,676 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:05,676 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:05,676 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:05,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:05,678 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:05,678 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:05,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:05,678 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:05,678 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:05,754 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:05,754 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:05,754 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:05,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:05,754 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:05,754 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:05,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1473 [2022-12-06 07:30:05,755 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-06 07:30:05,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:05,755 INFO L85 PathProgramCache]: Analyzing trace with hash 628151521, now seen corresponding path program 1 times [2022-12-06 07:30:05,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:05,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978352694] [2022-12-06 07:30:05,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:05,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:05,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-06 07:30:05,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:05,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978352694] [2022-12-06 07:30:05,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978352694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:05,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:05,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:05,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614117601] [2022-12-06 07:30:05,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:05,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:05,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:05,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:05,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:05,829 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:05,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:05,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:05,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:05,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:05,863 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:05,864 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:05,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:05,864 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:05,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:05,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:05,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:05,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:05,865 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:05,865 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:05,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:05,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:05,865 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:05,865 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:05,865 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:05,866 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:05,866 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:05,866 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:05,866 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:05,866 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:05,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:05,868 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:05,868 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:05,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 144 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:05,868 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:05,868 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:05,941 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:05,941 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:30:05,941 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:05,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:05,942 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:05,942 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:05,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1474 [2022-12-06 07:30:05,942 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-06 07:30:05,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:05,942 INFO L85 PathProgramCache]: Analyzing trace with hash 658627714, now seen corresponding path program 1 times [2022-12-06 07:30:05,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:05,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574332443] [2022-12-06 07:30:05,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:05,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:06,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:06,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:06,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574332443] [2022-12-06 07:30:06,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574332443] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:06,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:06,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:06,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374437892] [2022-12-06 07:30:06,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:06,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:06,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:06,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:06,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:06,003 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:06,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:06,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:06,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:06,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:06,040 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:06,040 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:06,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:06,040 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:06,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:06,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:06,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:06,041 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:06,041 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:06,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:06,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:06,041 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:06,041 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:06,042 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:06,042 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:06,042 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:06,042 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:06,042 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:06,042 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:06,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:06,044 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:06,044 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:06,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:06,044 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:06,044 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:06,118 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:06,118 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:30:06,119 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:06,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:06,119 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:06,119 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:06,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1475 [2022-12-06 07:30:06,119 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-06 07:30:06,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:06,119 INFO L85 PathProgramCache]: Analyzing trace with hash 685409823, now seen corresponding path program 1 times [2022-12-06 07:30:06,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:06,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730693059] [2022-12-06 07:30:06,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:06,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:06,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:06,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-06 07:30:06,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:06,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730693059] [2022-12-06 07:30:06,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730693059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:06,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:06,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:06,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271635934] [2022-12-06 07:30:06,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:06,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:06,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:06,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:06,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:06,184 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:06,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:06,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:06,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:06,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:06,224 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:06,225 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:06,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:06,225 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:06,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:06,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:06,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:06,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:06,227 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:06,227 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:06,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:06,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:06,227 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:06,227 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:06,227 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:06,228 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:06,228 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:06,228 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:06,228 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:06,228 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:06,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:06,230 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:06,230 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:06,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:06,230 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:06,230 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:06,310 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:06,310 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:30:06,310 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:06,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:06,311 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:06,311 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:06,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1476 [2022-12-06 07:30:06,311 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-06 07:30:06,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:06,311 INFO L85 PathProgramCache]: Analyzing trace with hash 715886016, now seen corresponding path program 1 times [2022-12-06 07:30:06,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:06,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729816168] [2022-12-06 07:30:06,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:06,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:06,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-06 07:30:06,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:06,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729816168] [2022-12-06 07:30:06,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729816168] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:06,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:06,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:06,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877651355] [2022-12-06 07:30:06,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:06,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:06,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:06,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:06,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:06,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:06,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:06,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:06,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:06,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:06,413 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:06,413 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:06,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:06,414 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:06,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:06,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:06,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:06,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:06,414 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:06,414 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:06,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:06,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:06,415 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:06,415 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:06,415 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:06,415 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:06,415 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:06,415 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:06,415 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:06,415 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:06,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:06,418 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:06,418 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:06,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:06,418 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:06,418 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:06,492 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:06,492 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:06,492 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:06,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:06,492 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:06,493 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:06,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1477 [2022-12-06 07:30:06,493 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-06 07:30:06,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:06,493 INFO L85 PathProgramCache]: Analyzing trace with hash 742668125, now seen corresponding path program 1 times [2022-12-06 07:30:06,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:06,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806664817] [2022-12-06 07:30:06,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:06,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:06,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-06 07:30:06,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:06,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806664817] [2022-12-06 07:30:06,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806664817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:06,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:06,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:06,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809821731] [2022-12-06 07:30:06,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:06,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:06,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:06,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:06,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:06,555 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:06,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:06,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:06,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:06,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:06,594 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:06,594 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:06,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:06,595 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:06,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:06,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:06,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:06,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:06,595 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:06,595 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:06,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:06,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:06,596 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:06,596 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:06,596 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:06,596 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:06,596 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:06,597 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:06,597 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:06,597 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:06,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:06,599 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:06,599 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:06,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:06,599 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:06,599 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:06,672 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:06,673 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:06,673 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:06,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:06,673 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:06,673 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:06,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1478 [2022-12-06 07:30:06,673 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-06 07:30:06,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:06,674 INFO L85 PathProgramCache]: Analyzing trace with hash 773144318, now seen corresponding path program 1 times [2022-12-06 07:30:06,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:06,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301871758] [2022-12-06 07:30:06,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:06,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:06,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-06 07:30:06,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:06,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301871758] [2022-12-06 07:30:06,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301871758] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:06,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:06,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:06,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154137245] [2022-12-06 07:30:06,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:06,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:06,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:06,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:06,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:06,745 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:06,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:06,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:06,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:06,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:06,787 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:06,787 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:06,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:06,787 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:06,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:06,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:06,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:06,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:06,788 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:06,788 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:06,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:06,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:06,789 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:06,789 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:06,789 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:06,789 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:06,789 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:06,789 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:06,789 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:06,789 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:06,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:06,791 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:06,791 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:06,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:06,792 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:06,792 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:06,866 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:06,866 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:06,867 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:06,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:06,867 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:06,867 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:06,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1479 [2022-12-06 07:30:06,867 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-06 07:30:06,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:06,867 INFO L85 PathProgramCache]: Analyzing trace with hash 799926427, now seen corresponding path program 1 times [2022-12-06 07:30:06,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:06,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875352080] [2022-12-06 07:30:06,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:06,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:06,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:06,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-06 07:30:06,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:06,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875352080] [2022-12-06 07:30:06,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875352080] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:06,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:06,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:06,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946097712] [2022-12-06 07:30:06,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:06,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:06,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:06,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:06,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:06,931 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:06,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:06,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:06,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:06,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:06,972 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:06,973 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:06,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 371 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:06,973 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:06,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:06,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:06,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:06,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:06,974 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:06,974 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:06,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:06,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:06,974 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:06,974 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:06,974 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:06,975 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:06,975 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:06,975 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:06,975 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:06,975 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:06,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:06,977 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:06,977 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:06,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:06,977 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:06,977 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:07,053 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:07,053 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:07,053 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:07,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:07,054 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:07,054 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:07,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1480 [2022-12-06 07:30:07,054 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-06 07:30:07,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:07,054 INFO L85 PathProgramCache]: Analyzing trace with hash 830402620, now seen corresponding path program 1 times [2022-12-06 07:30:07,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:07,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287593360] [2022-12-06 07:30:07,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:07,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:07,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-06 07:30:07,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:07,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287593360] [2022-12-06 07:30:07,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287593360] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:07,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:07,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:07,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795250818] [2022-12-06 07:30:07,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:07,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:07,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:07,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:07,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:07,114 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:07,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:07,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:07,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:07,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:07,151 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:07,151 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:07,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:07,151 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:07,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:07,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:07,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:07,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:07,152 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:07,152 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:07,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:07,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:07,152 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:07,153 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:07,153 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:07,153 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:07,153 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:07,153 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:07,153 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:07,153 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:07,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:07,155 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:07,155 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:07,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:07,155 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:07,156 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:07,232 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:07,233 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:30:07,233 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:07,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:07,233 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:07,233 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:07,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1481 [2022-12-06 07:30:07,233 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-06 07:30:07,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:07,234 INFO L85 PathProgramCache]: Analyzing trace with hash 857184729, now seen corresponding path program 1 times [2022-12-06 07:30:07,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:07,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599673651] [2022-12-06 07:30:07,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:07,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:07,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-06 07:30:07,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:07,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599673651] [2022-12-06 07:30:07,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599673651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:07,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:07,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:07,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607060394] [2022-12-06 07:30:07,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:07,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:07,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:07,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:07,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:07,297 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:07,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:07,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:07,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:07,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:07,333 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:07,333 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:07,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:07,333 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:07,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:07,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:07,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:07,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:07,334 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:07,334 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:07,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:07,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:07,334 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:07,334 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:07,335 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:07,335 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:07,335 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:07,335 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:07,335 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:07,335 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:07,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:07,337 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:07,337 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:07,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:07,337 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:07,337 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:07,410 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:07,411 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:30:07,411 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:07,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:07,411 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:07,411 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:07,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1482 [2022-12-06 07:30:07,411 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-06 07:30:07,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:07,412 INFO L85 PathProgramCache]: Analyzing trace with hash 887660922, now seen corresponding path program 1 times [2022-12-06 07:30:07,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:07,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448948632] [2022-12-06 07:30:07,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:07,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:07,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-06 07:30:07,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:07,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448948632] [2022-12-06 07:30:07,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448948632] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:07,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:07,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:07,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137715095] [2022-12-06 07:30:07,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:07,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:07,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:07,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:07,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:07,473 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:07,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:07,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:07,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:07,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:07,509 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:07,510 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:07,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:07,510 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:07,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:07,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:07,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:07,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:07,510 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:07,511 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:07,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:07,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:07,511 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:07,511 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:07,511 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:07,511 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:07,511 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:07,512 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:07,512 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:07,512 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:07,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:07,514 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:07,514 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:07,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:07,514 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:07,514 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:07,587 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:07,588 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:07,588 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:07,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:07,588 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:07,588 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:07,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1483 [2022-12-06 07:30:07,588 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-06 07:30:07,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:07,589 INFO L85 PathProgramCache]: Analyzing trace with hash 914443031, now seen corresponding path program 1 times [2022-12-06 07:30:07,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:07,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658196297] [2022-12-06 07:30:07,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:07,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:07,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:07,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:07,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658196297] [2022-12-06 07:30:07,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658196297] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:07,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:07,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:07,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336453143] [2022-12-06 07:30:07,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:07,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:07,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:07,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:07,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:07,651 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:07,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:07,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:07,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:07,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:07,702 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:07,702 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:07,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:07,702 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:07,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:07,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:07,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:07,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:07,703 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:07,703 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:07,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:07,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:07,704 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:07,704 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:07,704 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:07,704 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:07,704 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:07,704 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:07,704 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:07,704 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:07,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:07,707 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:07,708 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:07,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:07,708 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:07,708 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:07,781 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:07,782 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:07,782 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:07,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:07,782 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:07,782 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:07,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1484 [2022-12-06 07:30:07,782 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-06 07:30:07,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:07,783 INFO L85 PathProgramCache]: Analyzing trace with hash 944919224, now seen corresponding path program 1 times [2022-12-06 07:30:07,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:07,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592877193] [2022-12-06 07:30:07,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:07,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:07,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-06 07:30:07,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:07,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592877193] [2022-12-06 07:30:07,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592877193] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:07,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:07,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:07,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504939960] [2022-12-06 07:30:07,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:07,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:07,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:07,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:07,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:07,844 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:07,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:07,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:07,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:07,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:07,879 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:07,879 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:07,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:07,880 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:07,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:07,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:07,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:07,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:07,880 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:07,880 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:07,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:07,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:07,881 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:07,881 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:07,881 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:07,881 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:07,881 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:07,881 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:07,881 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:07,882 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:07,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:07,884 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:07,884 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:07,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:07,884 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:07,884 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:07,958 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:07,959 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:07,959 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:07,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:07,959 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:07,959 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:07,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1485 [2022-12-06 07:30:07,960 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-06 07:30:07,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:07,960 INFO L85 PathProgramCache]: Analyzing trace with hash 971701333, now seen corresponding path program 1 times [2022-12-06 07:30:07,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:07,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624955641] [2022-12-06 07:30:07,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:07,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:08,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-06 07:30:08,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:08,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624955641] [2022-12-06 07:30:08,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624955641] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:08,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:08,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:08,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249101965] [2022-12-06 07:30:08,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:08,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:08,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:08,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:08,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:08,043 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:08,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:08,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:08,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:08,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:08,087 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:08,087 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:08,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:08,087 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:08,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:08,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:08,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:08,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:08,088 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:08,088 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:08,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:08,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:08,089 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:08,089 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:08,089 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:08,089 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:08,089 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:08,089 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:08,089 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:08,089 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:08,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:08,091 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:08,091 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:08,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:08,092 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:08,092 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:08,165 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:08,165 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:30:08,165 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:08,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:08,165 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:08,165 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:08,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1486 [2022-12-06 07:30:08,166 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-06 07:30:08,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:08,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1002177526, now seen corresponding path program 1 times [2022-12-06 07:30:08,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:08,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664209444] [2022-12-06 07:30:08,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:08,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:08,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:08,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:08,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664209444] [2022-12-06 07:30:08,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664209444] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:08,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:08,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:08,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143388057] [2022-12-06 07:30:08,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:08,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:08,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:08,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:08,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:08,226 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:08,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:08,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:08,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:08,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:08,261 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:08,261 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:08,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:08,262 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:08,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:08,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:08,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:08,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:08,262 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:08,262 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:08,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:08,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:08,263 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:08,263 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:08,263 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:08,263 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:08,263 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:08,263 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:08,263 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:08,263 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:08,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:08,266 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:08,266 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:08,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:08,266 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:08,266 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:08,339 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:08,340 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:08,340 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:08,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:08,340 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:08,340 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:08,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1487 [2022-12-06 07:30:08,340 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-06 07:30:08,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:08,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1028959635, now seen corresponding path program 1 times [2022-12-06 07:30:08,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:08,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017102227] [2022-12-06 07:30:08,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:08,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:08,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-06 07:30:08,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:08,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017102227] [2022-12-06 07:30:08,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017102227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:08,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:08,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:08,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643766049] [2022-12-06 07:30:08,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:08,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:08,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:08,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:08,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:08,406 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:08,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:08,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:08,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:08,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:08,447 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:08,447 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:08,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:08,448 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:08,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:08,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:08,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:08,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:08,448 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:08,448 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:08,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:08,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:08,449 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:08,449 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:08,449 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:08,449 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:08,449 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:08,449 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:08,449 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:08,450 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:08,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:08,452 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:08,452 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:08,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:08,452 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:08,452 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:08,526 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:08,526 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:08,527 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:08,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:08,527 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:08,527 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:08,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1488 [2022-12-06 07:30:08,527 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-06 07:30:08,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:08,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1059435828, now seen corresponding path program 1 times [2022-12-06 07:30:08,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:08,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856474497] [2022-12-06 07:30:08,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:08,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:08,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-06 07:30:08,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:08,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856474497] [2022-12-06 07:30:08,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856474497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:08,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:08,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:08,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051055420] [2022-12-06 07:30:08,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:08,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:08,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:08,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:08,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:08,587 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:08,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:08,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:08,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:08,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:08,629 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:08,629 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:08,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:08,629 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:08,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:08,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:08,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:08,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:08,630 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:08,630 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:08,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:08,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:08,631 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:08,631 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:08,631 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:08,631 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:08,631 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:08,631 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:08,631 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:08,631 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:08,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:08,633 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:08,633 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:08,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:08,634 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:08,634 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:08,715 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:08,716 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 07:30:08,716 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:08,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:08,716 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:08,716 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:08,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1489 [2022-12-06 07:30:08,716 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-06 07:30:08,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:08,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1086217937, now seen corresponding path program 1 times [2022-12-06 07:30:08,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:08,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095560292] [2022-12-06 07:30:08,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:08,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:08,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-06 07:30:08,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:08,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095560292] [2022-12-06 07:30:08,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095560292] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:08,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:08,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:08,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496978761] [2022-12-06 07:30:08,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:08,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:08,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:08,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:08,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:08,780 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:08,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:08,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:08,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:08,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:08,822 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:08,822 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:08,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:08,823 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:08,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:08,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:08,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:08,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:08,823 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:08,823 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:08,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:08,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:08,824 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:08,824 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:08,824 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:08,824 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:08,824 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:08,824 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:08,824 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:08,824 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:08,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:08,826 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:08,826 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:08,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:08,827 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:08,827 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:08,900 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:08,901 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:08,901 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:08,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:08,901 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:08,901 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:08,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1490 [2022-12-06 07:30:08,901 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-06 07:30:08,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:08,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1116694130, now seen corresponding path program 1 times [2022-12-06 07:30:08,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:08,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625093259] [2022-12-06 07:30:08,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:08,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:08,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-06 07:30:08,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:08,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625093259] [2022-12-06 07:30:08,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625093259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:08,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:08,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:08,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478814082] [2022-12-06 07:30:08,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:08,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:08,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:08,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:08,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:08,965 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:08,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:08,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:08,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:08,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:09,001 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:09,001 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:09,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:09,002 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:09,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:09,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:09,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:09,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:09,002 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:09,002 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:09,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:09,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:09,003 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:09,003 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:09,003 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:09,003 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:09,003 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:09,003 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:09,004 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:09,004 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:09,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:09,006 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:09,006 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:09,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:09,006 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:09,006 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:09,079 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:09,080 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:09,080 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:09,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:09,080 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:09,080 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:09,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1491 [2022-12-06 07:30:09,080 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-06 07:30:09,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:09,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1143476239, now seen corresponding path program 1 times [2022-12-06 07:30:09,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:09,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830371248] [2022-12-06 07:30:09,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:09,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:09,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:09,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-06 07:30:09,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:09,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830371248] [2022-12-06 07:30:09,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830371248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:09,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:09,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:09,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704003159] [2022-12-06 07:30:09,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:09,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:09,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:09,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:09,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:09,143 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:09,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:09,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:09,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:09,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:09,186 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:09,186 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:09,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:09,186 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:09,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:09,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:09,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:09,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:09,187 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:09,187 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:09,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:09,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:09,188 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:09,188 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:09,188 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:09,188 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:09,188 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:09,188 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:09,188 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:09,188 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:09,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:09,190 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:09,190 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:09,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:09,191 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:09,191 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:09,264 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:09,265 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:09,265 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:09,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:09,265 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:09,265 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:09,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1492 [2022-12-06 07:30:09,265 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-06 07:30:09,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:09,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1173952432, now seen corresponding path program 1 times [2022-12-06 07:30:09,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:09,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887422610] [2022-12-06 07:30:09,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:09,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:09,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:09,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-06 07:30:09,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:09,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887422610] [2022-12-06 07:30:09,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887422610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:09,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:09,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:09,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265351844] [2022-12-06 07:30:09,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:09,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:09,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:09,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:09,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:09,325 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:09,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:09,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:09,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:09,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:09,367 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:09,367 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:09,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 350 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:09,367 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:09,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:09,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:09,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:09,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:09,368 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:09,368 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:09,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:09,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:09,369 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:09,369 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:09,369 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:09,369 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:09,369 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:09,369 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:09,369 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:09,369 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:09,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:09,372 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:09,372 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:09,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:09,372 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:09,372 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:09,448 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:09,448 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:09,449 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:09,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:09,449 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:09,449 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:09,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1493 [2022-12-06 07:30:09,449 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-06 07:30:09,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:09,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1200734541, now seen corresponding path program 1 times [2022-12-06 07:30:09,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:09,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145236800] [2022-12-06 07:30:09,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:09,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:09,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-06 07:30:09,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:09,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145236800] [2022-12-06 07:30:09,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145236800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:09,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:09,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:09,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808572363] [2022-12-06 07:30:09,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:09,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:09,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:09,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:09,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:09,515 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:09,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:09,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:09,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:09,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:09,555 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:09,555 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:09,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:09,556 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:09,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:09,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:09,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:09,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:09,556 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:09,556 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:09,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:09,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:09,557 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:09,557 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:09,557 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:09,557 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:09,557 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:09,557 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:09,558 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:09,558 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:09,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:09,560 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:09,560 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:09,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:09,560 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:09,560 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:09,633 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:09,634 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:09,634 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:09,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:09,634 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:09,634 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:09,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1494 [2022-12-06 07:30:09,634 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-06 07:30:09,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:09,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1231210734, now seen corresponding path program 1 times [2022-12-06 07:30:09,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:09,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796752259] [2022-12-06 07:30:09,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:09,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:09,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-06 07:30:09,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:09,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796752259] [2022-12-06 07:30:09,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796752259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:09,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:09,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:09,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793567951] [2022-12-06 07:30:09,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:09,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:09,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:09,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:09,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:09,704 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:09,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:09,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:09,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:09,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:09,746 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:09,746 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:09,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:09,747 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:09,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:09,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:09,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:09,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:09,747 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:09,747 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:09,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:09,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:09,748 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:09,748 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:09,748 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:09,748 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:09,748 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:09,748 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:09,748 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:09,749 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:09,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:09,751 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:09,751 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:09,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:09,751 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:09,751 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:09,825 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:09,826 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:09,826 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:09,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:09,826 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:09,826 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:09,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1495 [2022-12-06 07:30:09,826 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-06 07:30:09,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:09,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1257992843, now seen corresponding path program 1 times [2022-12-06 07:30:09,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:09,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897512912] [2022-12-06 07:30:09,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:09,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:09,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:09,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-06 07:30:09,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:09,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897512912] [2022-12-06 07:30:09,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897512912] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:09,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:09,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:09,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747879497] [2022-12-06 07:30:09,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:09,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:09,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:09,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:09,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:09,889 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:09,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:09,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:09,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:09,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:09,930 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:09,930 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:09,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:09,930 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:09,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:09,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:09,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:09,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:09,931 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:09,931 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:09,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:09,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:09,932 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:09,932 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:09,932 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:09,932 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:09,932 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:09,932 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:09,932 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:09,932 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:09,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:09,934 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:09,934 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:09,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 146 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:09,935 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:09,935 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:10,007 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:10,008 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:30:10,008 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:10,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:10,008 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:10,008 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:10,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1496 [2022-12-06 07:30:10,008 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-06 07:30:10,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:10,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1288469036, now seen corresponding path program 1 times [2022-12-06 07:30:10,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:10,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106029926] [2022-12-06 07:30:10,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:10,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:10,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-06 07:30:10,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:10,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106029926] [2022-12-06 07:30:10,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106029926] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:10,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:10,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:10,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034846656] [2022-12-06 07:30:10,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:10,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:10,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:10,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:10,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:10,069 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:10,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:10,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:10,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:10,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:10,104 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:10,105 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:10,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:10,105 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:10,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:10,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:10,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:10,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:10,106 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:10,106 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:10,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:10,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:10,106 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:10,106 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:10,106 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:10,107 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:10,107 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:10,107 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:10,107 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:10,107 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:10,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:10,109 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:10,109 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:10,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:10,109 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:10,109 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:10,184 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:10,184 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:10,184 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:10,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:10,184 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:10,184 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:10,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1497 [2022-12-06 07:30:10,185 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-06 07:30:10,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:10,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1315251145, now seen corresponding path program 1 times [2022-12-06 07:30:10,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:10,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233746717] [2022-12-06 07:30:10,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:10,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:10,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-06 07:30:10,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:10,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233746717] [2022-12-06 07:30:10,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233746717] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:10,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:10,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:10,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031387610] [2022-12-06 07:30:10,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:10,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:10,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:10,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:10,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:10,249 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:10,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:10,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:10,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:10,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:10,284 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:10,284 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:10,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:10,285 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:10,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:10,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:10,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:10,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:10,285 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:10,285 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:10,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:10,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:10,286 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:10,286 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:10,286 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:10,286 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:10,286 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:10,286 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:10,286 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:10,287 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:10,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:10,289 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:10,289 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:10,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:10,289 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:10,289 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:10,362 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:10,363 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:10,363 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:10,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:10,363 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:10,363 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:10,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1498 [2022-12-06 07:30:10,363 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-06 07:30:10,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:10,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1345727338, now seen corresponding path program 1 times [2022-12-06 07:30:10,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:10,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838236972] [2022-12-06 07:30:10,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:10,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:10,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-06 07:30:10,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:10,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838236972] [2022-12-06 07:30:10,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838236972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:10,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:10,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:10,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379087416] [2022-12-06 07:30:10,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:10,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:10,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:10,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:10,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:10,423 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:10,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:10,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:10,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:10,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:10,465 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:10,465 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:10,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:10,466 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:10,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:10,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:10,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:10,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:10,467 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:10,467 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:10,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:10,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:10,468 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:10,468 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:10,468 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:10,468 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:10,468 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:10,468 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:10,468 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:10,468 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:10,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:10,470 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:10,470 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:10,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 116 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:10,471 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:10,471 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:10,546 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:10,546 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:10,546 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:10,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:10,547 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:10,547 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:10,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1499 [2022-12-06 07:30:10,547 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-06 07:30:10,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:10,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1372509447, now seen corresponding path program 1 times [2022-12-06 07:30:10,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:10,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196021816] [2022-12-06 07:30:10,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:10,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:10,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-06 07:30:10,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:10,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196021816] [2022-12-06 07:30:10,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196021816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:10,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:10,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:10,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040077742] [2022-12-06 07:30:10,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:10,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:10,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:10,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:10,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:10,621 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:10,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:10,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:10,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:10,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:10,656 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:10,656 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:10,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 371 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:10,657 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:10,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:10,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:10,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:10,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:10,657 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:10,657 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:10,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:10,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:10,658 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:10,658 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:10,658 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:10,658 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:10,658 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:10,658 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:10,658 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:10,659 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:10,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:10,661 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:10,661 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:10,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:10,661 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:10,661 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:10,733 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:10,734 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:30:10,734 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:10,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:10,734 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:10,734 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:10,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1500 [2022-12-06 07:30:10,734 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-06 07:30:10,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:10,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1402985640, now seen corresponding path program 1 times [2022-12-06 07:30:10,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:10,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628550428] [2022-12-06 07:30:10,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:10,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:10,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-06 07:30:10,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:10,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628550428] [2022-12-06 07:30:10,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628550428] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:10,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:10,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:10,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218266583] [2022-12-06 07:30:10,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:10,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:10,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:10,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:10,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:10,796 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:10,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:10,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:10,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:10,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:10,833 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:10,833 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:10,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:10,834 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:10,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:10,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:10,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:10,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:10,834 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:10,834 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:10,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:10,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:10,835 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:10,835 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:10,835 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:10,835 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:10,835 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:10,835 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:10,835 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:10,835 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:10,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:10,838 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:10,838 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:10,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:10,838 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:10,838 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:10,913 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:10,914 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:10,914 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:10,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:10,914 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:10,914 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:10,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1501 [2022-12-06 07:30:10,914 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-06 07:30:10,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:10,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1429767749, now seen corresponding path program 1 times [2022-12-06 07:30:10,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:10,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286083891] [2022-12-06 07:30:10,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:10,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:10,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-06 07:30:10,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:10,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286083891] [2022-12-06 07:30:10,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286083891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:10,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:10,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:10,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614146475] [2022-12-06 07:30:10,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:10,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:10,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:10,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:10,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:10,981 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:10,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:10,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:10,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:10,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:11,017 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:11,017 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:11,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:11,017 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:11,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:11,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:11,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:11,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:11,018 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:11,018 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:11,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:11,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:11,019 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:11,019 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:11,019 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:11,019 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:11,019 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:11,019 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:11,019 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:11,019 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:11,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:11,021 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:11,021 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:11,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:11,022 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:11,022 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:11,095 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:11,095 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:30:11,095 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:11,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:11,095 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:11,095 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:11,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1502 [2022-12-06 07:30:11,095 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-06 07:30:11,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:11,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1460243942, now seen corresponding path program 1 times [2022-12-06 07:30:11,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:11,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382529969] [2022-12-06 07:30:11,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:11,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:11,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-06 07:30:11,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:11,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382529969] [2022-12-06 07:30:11,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382529969] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:11,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:11,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:11,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321638334] [2022-12-06 07:30:11,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:11,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:11,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:11,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:11,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:11,157 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:11,157 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:11,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:11,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:11,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:11,195 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:11,195 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:11,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 349 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:11,196 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:11,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:11,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:11,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:11,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:11,196 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:11,196 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:11,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:11,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:11,197 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:11,197 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:11,197 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:11,197 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:11,197 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:11,197 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:11,197 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:11,197 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:11,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:11,199 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:11,200 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:11,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:11,200 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:11,200 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:11,274 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:11,275 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:11,275 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:11,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:11,275 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:11,275 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:11,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1503 [2022-12-06 07:30:11,275 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-06 07:30:11,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:11,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1487026051, now seen corresponding path program 1 times [2022-12-06 07:30:11,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:11,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342996052] [2022-12-06 07:30:11,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:11,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:11,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-06 07:30:11,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:11,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342996052] [2022-12-06 07:30:11,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342996052] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:11,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:11,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:11,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798621742] [2022-12-06 07:30:11,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:11,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:11,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:11,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:11,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:11,339 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:11,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:11,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:11,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:11,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:11,382 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:11,382 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:11,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:11,382 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:11,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:11,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:11,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:11,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:11,383 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:11,383 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:11,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:11,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:11,384 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:11,384 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:11,384 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:11,384 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:11,384 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:11,384 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:11,384 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:11,384 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:11,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:11,386 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:11,387 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:11,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 145 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:11,387 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:11,387 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:11,461 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:11,462 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:11,462 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:11,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:11,462 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:11,462 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:11,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1504 [2022-12-06 07:30:11,462 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-06 07:30:11,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:11,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1517502244, now seen corresponding path program 1 times [2022-12-06 07:30:11,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:11,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176772401] [2022-12-06 07:30:11,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:11,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:11,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-06 07:30:11,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:11,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176772401] [2022-12-06 07:30:11,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176772401] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:11,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:11,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:11,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707431080] [2022-12-06 07:30:11,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:11,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:11,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:11,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:11,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:11,534 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:11,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:11,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:11,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:11,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:11,577 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:11,577 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:11,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:11,578 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:11,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:11,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:11,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:11,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:11,578 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:11,578 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:11,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:11,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:11,579 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:11,579 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:11,579 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:11,579 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:11,579 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:11,579 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:11,579 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:11,579 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:11,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:11,581 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:11,581 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:11,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:11,582 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:11,582 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:11,654 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:11,655 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:30:11,655 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:11,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:11,655 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:11,655 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:11,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1505 [2022-12-06 07:30:11,655 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-06 07:30:11,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:11,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1544284353, now seen corresponding path program 1 times [2022-12-06 07:30:11,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:11,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934545411] [2022-12-06 07:30:11,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:11,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:11,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-06 07:30:11,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:11,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934545411] [2022-12-06 07:30:11,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934545411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:11,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:11,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:11,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123750286] [2022-12-06 07:30:11,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:11,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:11,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:11,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:11,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:11,717 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:11,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:11,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:11,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:11,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:11,751 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:11,751 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:11,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:11,752 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:11,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:11,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:11,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:11,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:11,752 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:11,752 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:11,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:11,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:11,753 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:11,753 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:11,753 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:11,753 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:11,753 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:11,753 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:11,754 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:11,754 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:11,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:11,756 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:11,756 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:11,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:11,756 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:11,756 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:11,828 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:11,828 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:30:11,828 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:11,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:11,828 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:11,828 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:11,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1506 [2022-12-06 07:30:11,829 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-06 07:30:11,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:11,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1574760546, now seen corresponding path program 1 times [2022-12-06 07:30:11,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:11,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462089711] [2022-12-06 07:30:11,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:11,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:11,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:11,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-06 07:30:11,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:11,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462089711] [2022-12-06 07:30:11,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462089711] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:11,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:11,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:11,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259345774] [2022-12-06 07:30:11,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:11,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:11,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:11,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:11,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:11,888 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:11,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:11,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:11,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:11,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:11,928 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:11,929 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:11,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:11,929 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:11,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:11,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:11,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:11,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:11,929 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:11,930 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:11,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:11,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:11,930 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:11,930 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:11,930 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:11,930 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:11,930 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:11,931 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:11,931 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:11,931 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:11,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:11,933 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:11,933 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:11,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:11,933 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:11,933 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:12,005 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:12,006 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:30:12,006 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:12,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:12,006 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:12,006 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:12,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1507 [2022-12-06 07:30:12,007 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-06 07:30:12,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:12,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1601542655, now seen corresponding path program 1 times [2022-12-06 07:30:12,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:12,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967749115] [2022-12-06 07:30:12,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:12,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:12,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:12,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-06 07:30:12,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:12,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967749115] [2022-12-06 07:30:12,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967749115] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:12,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:12,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:12,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842891594] [2022-12-06 07:30:12,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:12,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:12,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:12,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:12,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:12,071 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:12,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:12,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:12,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:12,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:12,107 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:12,107 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:12,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:12,107 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:12,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:12,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:12,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:12,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:12,108 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:12,108 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:12,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:12,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:12,109 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:12,109 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:12,109 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:12,109 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:12,109 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:12,109 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:12,109 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:12,109 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:12,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:12,111 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:12,111 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:12,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:12,112 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:12,112 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:12,184 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:12,185 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:30:12,185 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:12,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:12,185 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:12,185 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:12,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1508 [2022-12-06 07:30:12,185 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-06 07:30:12,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:12,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1632018848, now seen corresponding path program 1 times [2022-12-06 07:30:12,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:12,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759789193] [2022-12-06 07:30:12,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:12,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:12,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-06 07:30:12,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:12,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759789193] [2022-12-06 07:30:12,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759789193] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:12,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:12,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:12,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777312741] [2022-12-06 07:30:12,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:12,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:12,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:12,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:12,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:12,246 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:12,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:12,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:12,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:12,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:12,291 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:12,291 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:12,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:12,292 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:12,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:12,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:12,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:12,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:12,292 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:12,292 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:12,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:12,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:12,293 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:12,293 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:12,293 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:12,293 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:12,293 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:12,294 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:12,294 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:12,294 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:12,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:12,296 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:12,296 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:12,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:12,296 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:12,296 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:12,369 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:12,370 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:12,370 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:12,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:12,370 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:12,370 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:12,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1509 [2022-12-06 07:30:12,370 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-06 07:30:12,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:12,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1658800957, now seen corresponding path program 1 times [2022-12-06 07:30:12,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:12,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166596837] [2022-12-06 07:30:12,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:12,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:12,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-06 07:30:12,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:12,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166596837] [2022-12-06 07:30:12,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166596837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:12,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:12,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:12,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307588025] [2022-12-06 07:30:12,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:12,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:12,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:12,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:12,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:12,445 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:12,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:12,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:12,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:12,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:12,481 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:12,481 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:12,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:12,481 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:12,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:12,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:12,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:12,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:12,482 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:12,482 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:12,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:12,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:12,482 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:12,483 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:12,483 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:12,483 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:12,483 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:12,483 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:12,483 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:12,483 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:12,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:12,485 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:12,485 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:12,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:12,486 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:12,486 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:12,559 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:12,559 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:30:12,559 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:12,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:12,559 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:12,559 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:12,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1510 [2022-12-06 07:30:12,560 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-06 07:30:12,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:12,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1689277150, now seen corresponding path program 1 times [2022-12-06 07:30:12,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:12,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464981299] [2022-12-06 07:30:12,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:12,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:12,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:12,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:12,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464981299] [2022-12-06 07:30:12,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464981299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:12,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:12,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:12,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065921454] [2022-12-06 07:30:12,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:12,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:12,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:12,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:12,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:12,620 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:12,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:12,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:12,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:12,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:12,662 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:12,662 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:12,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:12,662 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:12,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:12,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:12,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:12,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:12,663 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:12,663 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:12,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:12,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:12,663 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:12,663 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:12,664 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:12,664 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:12,664 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:12,664 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:12,664 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:12,664 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:12,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:12,666 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:12,666 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:12,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:12,666 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:12,666 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:12,740 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:12,741 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:12,741 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:12,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:12,741 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:12,741 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:12,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1511 [2022-12-06 07:30:12,741 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-06 07:30:12,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:12,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1716059259, now seen corresponding path program 1 times [2022-12-06 07:30:12,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:12,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514722059] [2022-12-06 07:30:12,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:12,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:12,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-06 07:30:12,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:12,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514722059] [2022-12-06 07:30:12,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514722059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:12,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:12,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:12,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680721948] [2022-12-06 07:30:12,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:12,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:12,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:12,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:12,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:12,804 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:12,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:12,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:12,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:12,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:12,843 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:12,843 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:12,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:12,843 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:12,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:12,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:12,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:12,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:12,844 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:12,844 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:12,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:12,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:12,845 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:12,845 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:12,845 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:12,845 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:12,845 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:12,845 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:12,845 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:12,845 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:12,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:12,847 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:12,847 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:12,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:12,848 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:12,848 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:12,920 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:12,921 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:30:12,921 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:12,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:12,921 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:12,921 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:12,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1512 [2022-12-06 07:30:12,922 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-06 07:30:12,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:12,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1746535452, now seen corresponding path program 1 times [2022-12-06 07:30:12,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:12,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266225063] [2022-12-06 07:30:12,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:12,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30: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-06 07:30:12,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:12,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266225063] [2022-12-06 07:30:12,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266225063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:12,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:12,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:12,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363811181] [2022-12-06 07:30:12,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:12,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:12,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:12,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:12,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:12,983 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:12,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:12,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:12,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:12,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:13,018 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:13,018 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:13,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:13,019 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:13,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:13,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:13,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:13,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:13,019 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:13,019 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:13,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:13,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:13,020 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:13,020 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:13,020 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:13,020 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:13,020 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:13,020 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:13,020 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:13,021 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:13,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:13,023 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:13,023 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:13,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:13,023 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:13,023 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:13,097 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:13,097 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:13,097 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:13,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:13,097 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:13,098 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:13,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1513 [2022-12-06 07:30:13,098 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-06 07:30:13,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:13,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1773317561, now seen corresponding path program 1 times [2022-12-06 07:30:13,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:13,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713601570] [2022-12-06 07:30:13,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:13,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:13,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-06 07:30:13,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:13,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713601570] [2022-12-06 07:30:13,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713601570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:13,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:13,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:13,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754600439] [2022-12-06 07:30:13,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:13,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:13,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:13,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:13,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:13,160 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:13,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:13,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:13,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:13,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:13,199 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:13,199 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:13,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:13,199 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:13,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:13,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:13,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:13,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:13,200 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:13,200 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:13,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:13,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:13,201 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:13,201 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:13,201 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:13,201 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:13,201 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:13,201 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:13,201 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:13,201 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:13,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:13,203 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:13,203 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:13,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:13,204 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:13,204 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:13,278 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:13,278 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:13,278 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:13,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:13,279 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:13,279 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:13,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1514 [2022-12-06 07:30:13,279 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-06 07:30:13,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:13,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1803793754, now seen corresponding path program 1 times [2022-12-06 07:30:13,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:13,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323775884] [2022-12-06 07:30:13,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:13,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:13,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-06 07:30:13,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:13,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323775884] [2022-12-06 07:30:13,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323775884] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:13,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:13,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:13,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341784475] [2022-12-06 07:30:13,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:13,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:13,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:13,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:13,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:13,343 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:13,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:13,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:13,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:13,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:13,385 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:13,385 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:13,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:13,385 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:13,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:13,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:13,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:13,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:13,386 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:13,386 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:13,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:13,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:13,386 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:13,387 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:13,387 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:13,387 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:13,387 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:13,387 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:13,387 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:13,387 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:13,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:13,389 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:13,389 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:13,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:13,397 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:13,397 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:13,470 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:13,470 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 07:30:13,471 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:13,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:13,471 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:13,471 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:13,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1515 [2022-12-06 07:30:13,471 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-06 07:30:13,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:13,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1830575863, now seen corresponding path program 1 times [2022-12-06 07:30:13,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:13,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258403557] [2022-12-06 07:30:13,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:13,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:13,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-06 07:30:13,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:13,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258403557] [2022-12-06 07:30:13,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258403557] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:13,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:13,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:13,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778461493] [2022-12-06 07:30:13,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:13,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:13,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:13,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:13,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:13,535 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:13,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:13,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:13,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:13,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:13,571 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:13,571 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:13,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:13,572 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:13,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:13,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:13,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:13,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:13,572 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:13,572 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:13,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:13,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:13,573 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:13,573 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:13,573 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:13,573 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:13,573 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:13,574 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:13,574 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:13,574 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:13,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:13,576 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:13,576 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:13,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:13,576 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:13,576 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:13,649 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:13,650 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:13,650 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:13,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:13,650 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:13,650 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:13,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1516 [2022-12-06 07:30:13,650 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-06 07:30:13,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:13,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1861052056, now seen corresponding path program 1 times [2022-12-06 07:30:13,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:13,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492267] [2022-12-06 07:30:13,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:13,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:13,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-06 07:30:13,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:13,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492267] [2022-12-06 07:30:13,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492267] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:13,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:13,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:13,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137873469] [2022-12-06 07:30:13,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:13,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:13,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:13,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:13,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:13,720 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:13,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:13,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:13,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:13,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:13,762 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:13,762 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:13,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:13,762 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:13,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:13,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:13,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:13,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:13,763 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:13,763 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:13,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:13,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:13,764 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:13,764 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:13,764 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:13,764 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:13,764 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:13,764 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:13,764 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:13,764 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:13,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:13,767 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:13,767 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:13,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:13,767 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:13,767 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:13,841 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:13,842 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:13,842 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:13,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:13,842 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:13,842 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:13,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1517 [2022-12-06 07:30:13,842 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-06 07:30:13,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:13,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1887834165, now seen corresponding path program 1 times [2022-12-06 07:30:13,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:13,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317069933] [2022-12-06 07:30:13,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:13,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:13,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-06 07:30:13,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:13,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317069933] [2022-12-06 07:30:13,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317069933] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:13,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:13,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:13,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131580063] [2022-12-06 07:30:13,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:13,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:13,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:13,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:13,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:13,905 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:13,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:13,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:13,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:13,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:13,946 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:13,946 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:13,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:13,946 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:13,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:13,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:13,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:13,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:13,947 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:13,947 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:13,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:13,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:13,947 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:13,947 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:13,948 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:13,948 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:13,948 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:13,948 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:13,948 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:13,948 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:13,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:13,950 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:13,950 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:13,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:13,950 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:13,950 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:14,023 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:14,024 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:30:14,024 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:14,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:14,024 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:14,024 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:14,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1518 [2022-12-06 07:30:14,024 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-06 07:30:14,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:14,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1918310358, now seen corresponding path program 1 times [2022-12-06 07:30:14,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:14,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123408419] [2022-12-06 07:30:14,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:14,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:14,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:14,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-06 07:30:14,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:14,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123408419] [2022-12-06 07:30:14,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123408419] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:14,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:14,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:14,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450169130] [2022-12-06 07:30:14,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:14,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:14,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:14,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:14,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:14,086 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:14,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:14,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:14,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:14,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:14,126 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:14,126 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:14,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:14,127 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:14,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:14,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:14,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:14,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:14,127 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:14,127 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:14,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:14,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:14,128 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:14,128 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:14,128 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:14,128 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:14,128 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:14,128 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:14,128 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:14,128 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:14,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:14,131 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:14,131 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:14,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:14,131 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:14,131 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:14,205 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:14,206 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:14,206 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:14,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:14,206 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:14,206 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:14,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1519 [2022-12-06 07:30:14,206 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-06 07:30:14,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:14,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1945092467, now seen corresponding path program 1 times [2022-12-06 07:30:14,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:14,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918552879] [2022-12-06 07:30:14,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:14,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:14,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-06 07:30:14,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:14,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918552879] [2022-12-06 07:30:14,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918552879] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:14,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:14,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:14,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962928321] [2022-12-06 07:30:14,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:14,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:14,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:14,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:14,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:14,269 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:14,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:14,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:14,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:14,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:14,305 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:14,305 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:14,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:14,305 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:14,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:14,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:14,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:14,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:14,306 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:14,306 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:14,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:14,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:14,306 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:14,306 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:14,307 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:14,307 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:14,307 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:14,307 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:14,307 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:14,307 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:14,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:14,309 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:14,309 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:14,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:14,309 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:14,309 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:14,382 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:14,383 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:30:14,383 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:14,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:14,383 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:14,383 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:14,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1520 [2022-12-06 07:30:14,383 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-06 07:30:14,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:14,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1975568660, now seen corresponding path program 1 times [2022-12-06 07:30:14,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:14,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807645206] [2022-12-06 07:30:14,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:14,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:14,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:14,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:14,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807645206] [2022-12-06 07:30:14,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807645206] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:14,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:14,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:14,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749734506] [2022-12-06 07:30:14,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:14,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:14,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:14,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:14,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:14,451 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:14,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:14,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:14,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:14,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:14,487 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:14,487 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:14,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:14,488 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:14,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:14,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:14,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:14,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:14,488 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:14,488 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:14,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:14,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:14,489 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:14,489 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:14,489 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:14,489 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:14,489 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:14,489 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:14,489 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:14,489 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:14,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:14,492 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:14,492 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:14,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:14,492 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:14,492 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:14,565 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:14,565 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:30:14,565 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:14,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:14,565 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:14,566 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:14,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1521 [2022-12-06 07:30:14,566 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-06 07:30:14,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:14,566 INFO L85 PathProgramCache]: Analyzing trace with hash 2002350769, now seen corresponding path program 1 times [2022-12-06 07:30:14,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:14,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358022899] [2022-12-06 07:30:14,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:14,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:14,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-06 07:30:14,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:14,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358022899] [2022-12-06 07:30:14,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358022899] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:14,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:14,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:14,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898310269] [2022-12-06 07:30:14,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:14,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:14,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:14,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:14,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:14,629 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:14,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:14,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:14,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:14,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:14,664 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:14,664 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:14,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:14,665 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:14,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:14,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:14,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:14,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:14,665 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:14,665 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:14,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:14,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:14,666 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:14,666 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:14,666 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:14,666 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:14,666 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:14,666 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:14,666 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:14,666 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:14,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:14,669 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:14,669 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:14,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:14,669 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:14,669 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:14,740 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:14,740 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:30:14,740 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:14,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:14,741 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:14,741 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:14,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1522 [2022-12-06 07:30:14,741 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-06 07:30:14,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:14,741 INFO L85 PathProgramCache]: Analyzing trace with hash 2032826962, now seen corresponding path program 1 times [2022-12-06 07:30:14,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:14,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775466833] [2022-12-06 07:30:14,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:14,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:14,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-06 07:30:14,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:14,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775466833] [2022-12-06 07:30:14,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775466833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:14,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:14,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:14,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830270775] [2022-12-06 07:30:14,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:14,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:14,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:14,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:14,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:14,805 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:14,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:14,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:14,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:14,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:14,847 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:14,847 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:14,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 336 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:14,848 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:14,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:14,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:14,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:14,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:14,848 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:14,848 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:14,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:14,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:14,849 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:14,849 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:14,849 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:14,849 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:14,849 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:14,849 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:14,849 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:14,849 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:14,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:14,852 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:14,852 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:14,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:14,852 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:14,852 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:14,923 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:14,924 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:30:14,924 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:14,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:14,924 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:14,924 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:14,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1523 [2022-12-06 07:30:14,925 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-06 07:30:14,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:14,925 INFO L85 PathProgramCache]: Analyzing trace with hash 2059609071, now seen corresponding path program 1 times [2022-12-06 07:30:14,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:14,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793839353] [2022-12-06 07:30:14,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:14,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:14,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-06 07:30:14,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:14,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793839353] [2022-12-06 07:30:14,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793839353] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:14,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:14,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:14,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590372812] [2022-12-06 07:30:14,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:14,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:14,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:14,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:14,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:14,993 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:14,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:14,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:14,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:14,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:15,027 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:15,027 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:15,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:15,028 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:15,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:15,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:15,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:15,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:15,028 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:15,028 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:15,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:15,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:15,029 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:15,029 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:15,029 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:15,029 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:15,029 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:15,029 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:15,029 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:15,029 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:15,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:15,031 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:15,032 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:15,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:15,032 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:15,032 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:15,105 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:15,106 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:15,106 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:15,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:15,106 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:15,106 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:15,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1524 [2022-12-06 07:30:15,107 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-06 07:30:15,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:15,107 INFO L85 PathProgramCache]: Analyzing trace with hash 2090085264, now seen corresponding path program 1 times [2022-12-06 07:30:15,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:15,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397764419] [2022-12-06 07:30:15,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:15,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:15,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-06 07:30:15,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:15,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397764419] [2022-12-06 07:30:15,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397764419] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:15,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:15,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:15,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024807660] [2022-12-06 07:30:15,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:15,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:15,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:15,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:15,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:15,170 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:15,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:15,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:15,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:15,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:15,205 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:15,205 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:15,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:15,206 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:15,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:15,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:15,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:15,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:15,206 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:15,206 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:15,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:15,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:15,207 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:15,207 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:15,207 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:15,207 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:15,207 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:15,207 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:15,207 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:15,207 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:15,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:15,209 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:15,209 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:15,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:15,210 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:15,210 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:15,282 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:15,283 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:30:15,283 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:15,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:15,283 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:15,283 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:15,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1525 [2022-12-06 07:30:15,283 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-06 07:30:15,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:15,283 INFO L85 PathProgramCache]: Analyzing trace with hash 2116867373, now seen corresponding path program 1 times [2022-12-06 07:30:15,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:15,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370095902] [2022-12-06 07:30:15,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:15,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:15,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-06 07:30:15,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:15,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370095902] [2022-12-06 07:30:15,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370095902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:15,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:15,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:15,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498083261] [2022-12-06 07:30:15,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:15,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:15,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:15,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:15,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:15,360 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:15,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:15,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:15,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:15,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:15,402 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:15,402 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:15,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:15,403 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:15,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:15,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:15,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:15,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:15,403 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:15,403 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:15,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:15,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:15,404 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:15,404 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:15,404 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:15,404 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:15,404 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:15,405 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:15,405 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:15,405 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:15,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:15,407 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:15,407 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:15,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:15,407 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:15,407 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:15,481 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:15,482 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:15,482 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:15,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:15,482 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:15,482 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:15,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1526 [2022-12-06 07:30:15,482 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-06 07:30:15,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:15,483 INFO L85 PathProgramCache]: Analyzing trace with hash 2147343566, now seen corresponding path program 1 times [2022-12-06 07:30:15,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:15,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358042384] [2022-12-06 07:30:15,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:15,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:15,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:15,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:15,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358042384] [2022-12-06 07:30:15,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358042384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:15,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:15,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:15,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113946013] [2022-12-06 07:30:15,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:15,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:15,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:15,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:15,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:15,552 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:15,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:15,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:15,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:15,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:15,607 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:15,607 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:15,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 349 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:15,608 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:15,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:15,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:15,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:15,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:15,608 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:15,608 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:15,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:15,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:15,609 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:15,609 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:15,609 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:15,609 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:15,609 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:15,610 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:15,610 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:15,610 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:15,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:15,612 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:15,612 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:15,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:15,612 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:15,612 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:15,686 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:15,687 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:15,687 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:15,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:15,687 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:15,687 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:15,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1527 [2022-12-06 07:30:15,687 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-06 07:30:15,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:15,688 INFO L85 PathProgramCache]: Analyzing trace with hash -2120841621, now seen corresponding path program 1 times [2022-12-06 07:30:15,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:15,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394080792] [2022-12-06 07:30:15,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:15,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:15,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-06 07:30:15,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:15,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394080792] [2022-12-06 07:30:15,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394080792] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:15,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:15,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:15,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598444522] [2022-12-06 07:30:15,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:15,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:15,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:15,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:15,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:15,763 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:15,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:15,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:15,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:15,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:15,800 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:15,800 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:15,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:15,800 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:15,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:15,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:15,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:15,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:15,801 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:15,801 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:15,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:15,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:15,802 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:15,802 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:15,802 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:15,802 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:15,802 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:15,802 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:15,802 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:15,802 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:15,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:15,804 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:15,804 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:15,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:15,805 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:15,805 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:15,879 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:15,880 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:15,880 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:15,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:15,880 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:15,880 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:15,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1528 [2022-12-06 07:30:15,880 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-06 07:30:15,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:15,880 INFO L85 PathProgramCache]: Analyzing trace with hash -2090365428, now seen corresponding path program 1 times [2022-12-06 07:30:15,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:15,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550385006] [2022-12-06 07:30:15,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:15,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:15,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-06 07:30:15,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:15,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550385006] [2022-12-06 07:30:15,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550385006] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:15,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:15,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:15,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128930633] [2022-12-06 07:30:15,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:15,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:15,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:15,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:15,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:15,943 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:15,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:15,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:15,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:15,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:15,986 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:15,987 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:15,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:15,987 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:15,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:15,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:15,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:15,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:15,988 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:15,988 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:15,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:15,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:15,988 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:15,988 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:15,989 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:15,989 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:15,989 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:15,989 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:15,989 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:15,989 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:15,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:15,991 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:15,991 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:15,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:15,991 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:15,991 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:16,067 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:16,068 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:16,068 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:16,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:16,068 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:16,068 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:16,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1529 [2022-12-06 07:30:16,068 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-06 07:30:16,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:16,068 INFO L85 PathProgramCache]: Analyzing trace with hash -2063583319, now seen corresponding path program 1 times [2022-12-06 07:30:16,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:16,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558165463] [2022-12-06 07:30:16,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:16,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30: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-06 07:30:16,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:16,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558165463] [2022-12-06 07:30:16,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558165463] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:16,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:16,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:16,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139465237] [2022-12-06 07:30:16,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:16,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:16,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:16,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:16,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:16,131 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:16,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:16,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:16,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:16,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:16,166 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:16,166 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:16,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 371 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:16,166 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:16,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:16,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:16,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:16,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:16,167 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:16,167 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:16,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:16,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:16,168 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:16,168 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:16,168 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:16,168 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:16,168 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:16,168 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:16,168 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:16,168 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:16,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:16,170 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:16,170 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:16,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:16,171 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:16,171 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:16,243 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:16,244 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:30:16,244 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:16,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:16,244 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:16,244 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:16,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1530 [2022-12-06 07:30:16,244 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-06 07:30:16,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:16,245 INFO L85 PathProgramCache]: Analyzing trace with hash -2033107126, now seen corresponding path program 1 times [2022-12-06 07:30:16,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:16,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337853784] [2022-12-06 07:30:16,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:16,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:16,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-06 07:30:16,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:16,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337853784] [2022-12-06 07:30:16,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337853784] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:16,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:16,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:16,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841518996] [2022-12-06 07:30:16,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:16,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:16,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:16,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:16,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:16,317 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:16,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:16,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:16,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:16,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:16,359 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:16,359 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:16,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:16,359 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:16,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:16,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:16,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:16,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:16,360 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:16,360 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:16,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:16,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:16,361 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:16,361 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:16,361 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:16,361 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:16,361 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:16,361 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:16,361 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:16,361 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:16,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:16,364 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:16,364 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:16,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:16,364 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:16,364 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:16,436 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:16,437 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:30:16,437 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:16,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:16,437 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:16,437 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:16,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1531 [2022-12-06 07:30:16,438 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-06 07:30:16,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:16,438 INFO L85 PathProgramCache]: Analyzing trace with hash -2006325017, now seen corresponding path program 1 times [2022-12-06 07:30:16,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:16,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451316765] [2022-12-06 07:30:16,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:16,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:16,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-06 07:30:16,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:16,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451316765] [2022-12-06 07:30:16,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451316765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:16,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:16,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:16,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297427487] [2022-12-06 07:30:16,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:16,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:16,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:16,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:16,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:16,502 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:16,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:16,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:16,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:16,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:16,555 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:16,555 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:16,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:16,555 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:16,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:16,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:16,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:16,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:16,556 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:16,556 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:16,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:16,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:16,557 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:16,557 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:16,557 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:16,557 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:16,557 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:16,557 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:16,557 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:16,557 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:16,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:16,559 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:16,559 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:16,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:16,560 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:16,560 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:16,634 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:16,635 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:16,635 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:16,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:16,635 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:16,635 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:16,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1532 [2022-12-06 07:30:16,635 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-06 07:30:16,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:16,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1975848824, now seen corresponding path program 1 times [2022-12-06 07:30:16,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:16,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675192929] [2022-12-06 07:30:16,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:16,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:16,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-06 07:30:16,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:16,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675192929] [2022-12-06 07:30:16,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675192929] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:16,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:16,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:16,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102948120] [2022-12-06 07:30:16,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:16,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:16,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:16,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:16,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:16,696 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:16,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:16,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:16,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:16,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:16,740 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:16,740 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:16,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:16,740 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:16,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:16,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:16,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:16,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:16,741 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:16,741 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:16,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:16,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:16,741 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:16,742 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:16,742 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:16,742 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:16,742 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:16,742 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:16,742 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:16,742 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:16,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:16,744 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:16,744 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:16,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:16,745 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:16,745 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:16,818 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:16,819 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:16,819 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:16,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:16,819 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:16,819 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:16,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1533 [2022-12-06 07:30:16,819 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-06 07:30:16,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:16,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1949066715, now seen corresponding path program 1 times [2022-12-06 07:30:16,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:16,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12719654] [2022-12-06 07:30:16,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:16,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:16,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:16,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:16,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12719654] [2022-12-06 07:30:16,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12719654] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:16,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:16,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:16,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130914056] [2022-12-06 07:30:16,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:16,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:16,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:16,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:16,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:16,892 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:16,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:16,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:16,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:16,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:16,932 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:16,932 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:16,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:16,933 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:16,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:16,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:16,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:16,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:16,933 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:16,933 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:16,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:16,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:16,934 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:16,934 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:16,934 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:16,934 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:16,934 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:16,934 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:16,935 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:16,935 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:16,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:16,937 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:16,937 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:16,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:16,937 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:16,937 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:17,011 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:17,012 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:17,012 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:17,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:17,012 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:17,012 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:17,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1534 [2022-12-06 07:30:17,012 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-06 07:30:17,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:17,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1918590522, now seen corresponding path program 1 times [2022-12-06 07:30:17,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:17,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493987086] [2022-12-06 07:30:17,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:17,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:17,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-06 07:30:17,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:17,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493987086] [2022-12-06 07:30:17,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493987086] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:17,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:17,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:17,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421917528] [2022-12-06 07:30:17,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:17,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:17,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:17,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:17,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:17,074 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:17,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:17,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:17,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:17,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:17,140 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:17,140 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:17,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:17,141 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:17,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:17,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:17,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:17,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:17,142 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:17,142 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:17,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:17,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:17,143 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:17,143 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:17,143 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:17,143 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:17,143 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:17,143 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:17,143 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:17,143 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:17,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:17,146 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:17,147 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:17,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:17,147 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:17,147 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:17,236 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:17,237 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 07:30:17,237 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:17,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:17,237 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:17,237 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:17,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1535 [2022-12-06 07:30:17,237 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-06 07:30:17,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:17,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1891808413, now seen corresponding path program 1 times [2022-12-06 07:30:17,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:17,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041389265] [2022-12-06 07:30:17,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:17,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:17,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:17,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:17,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041389265] [2022-12-06 07:30:17,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041389265] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:17,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:17,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:17,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456856690] [2022-12-06 07:30:17,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:17,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:17,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:17,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:17,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:17,349 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:17,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:17,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:17,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:17,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:17,401 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:17,401 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:17,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:17,402 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:17,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:17,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:17,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:17,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:17,403 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:17,403 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:17,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:17,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:17,404 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:17,404 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:17,405 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:17,405 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:17,405 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:17,405 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:17,405 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:17,405 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:17,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:17,408 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:17,409 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:17,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:17,409 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:17,409 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:17,488 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:17,489 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:30:17,489 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:17,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:17,489 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:17,489 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:17,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1536 [2022-12-06 07:30:17,489 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-06 07:30:17,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:17,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1861332220, now seen corresponding path program 1 times [2022-12-06 07:30:17,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:17,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587914121] [2022-12-06 07:30:17,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:17,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30: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-06 07:30:17,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:17,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587914121] [2022-12-06 07:30:17,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587914121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:17,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:17,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:17,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492204706] [2022-12-06 07:30:17,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:17,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:17,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:17,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:17,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:17,556 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:17,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:17,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:17,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:17,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:17,598 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:17,599 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:17,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:17,599 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:17,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:17,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:17,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:17,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:17,600 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:17,600 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:17,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:17,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:17,601 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:17,601 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:17,601 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:17,601 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:17,601 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:17,601 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:17,601 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:17,601 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:17,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:17,603 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:17,603 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:17,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 118 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:17,604 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:17,604 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:17,676 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:17,677 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:30:17,677 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:17,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:17,677 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:17,677 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:17,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1537 [2022-12-06 07:30:17,677 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-06 07:30:17,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:17,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1834550111, now seen corresponding path program 1 times [2022-12-06 07:30:17,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:17,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29504360] [2022-12-06 07:30:17,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:17,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:17,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:17,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-06 07:30:17,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:17,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29504360] [2022-12-06 07:30:17,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29504360] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:17,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:17,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:17,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986716375] [2022-12-06 07:30:17,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:17,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:17,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:17,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:17,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:17,740 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:17,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:17,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:17,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:17,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:17,777 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:17,777 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:17,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 356 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:17,777 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:17,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:17,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:17,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:17,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:17,778 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:17,778 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:17,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:17,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:17,779 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:17,779 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:17,779 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:17,779 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:17,779 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:17,779 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:17,779 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:17,779 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:17,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:17,781 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:17,781 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:17,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:17,782 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:17,782 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:17,855 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:17,856 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:17,856 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:17,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:17,856 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:17,856 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:17,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1538 [2022-12-06 07:30:17,856 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-06 07:30:17,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:17,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1804073918, now seen corresponding path program 1 times [2022-12-06 07:30:17,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:17,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465976999] [2022-12-06 07:30:17,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:17,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:17,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-06 07:30:17,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:17,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465976999] [2022-12-06 07:30:17,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465976999] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:17,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:17,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:17,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130802279] [2022-12-06 07:30:17,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:17,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:17,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:17,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:17,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:17,917 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:17,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:17,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:17,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:17,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:17,953 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:17,953 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:17,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:17,953 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:17,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:17,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:17,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:17,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:17,954 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:17,954 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:17,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:17,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:17,955 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:17,955 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:17,955 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:17,955 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:17,955 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:17,955 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:17,955 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:17,955 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:17,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:17,957 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:17,957 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:17,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 116 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:17,958 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:17,958 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:18,032 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:18,033 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:18,033 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:18,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:18,033 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:18,033 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:18,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1539 [2022-12-06 07:30:18,033 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-06 07:30:18,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:18,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1777291809, now seen corresponding path program 1 times [2022-12-06 07:30:18,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:18,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264361568] [2022-12-06 07:30:18,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:18,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:18,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:18,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-06 07:30:18,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:18,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264361568] [2022-12-06 07:30:18,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264361568] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:18,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:18,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:18,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315099610] [2022-12-06 07:30:18,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:18,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:18,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:18,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:18,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:18,093 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:18,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:18,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:18,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:18,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:18,136 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:18,136 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:18,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:18,137 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:18,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:18,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:18,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:18,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:18,137 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:18,138 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:18,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:18,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:18,138 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:18,138 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:18,138 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:18,139 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:18,139 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:18,139 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:18,139 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:18,139 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:18,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:18,141 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:18,141 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:18,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:18,141 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:18,141 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:18,218 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:18,219 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:30:18,219 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:18,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:18,219 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:18,219 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:18,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1540 [2022-12-06 07:30:18,219 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-06 07:30:18,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:18,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1746815616, now seen corresponding path program 1 times [2022-12-06 07:30:18,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:18,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679264914] [2022-12-06 07:30:18,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:18,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30: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-06 07:30:18,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:18,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679264914] [2022-12-06 07:30:18,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679264914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:18,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:18,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:18,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727780734] [2022-12-06 07:30:18,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:18,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:18,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:18,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:18,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:18,300 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:18,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:18,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:18,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:18,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:18,374 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:18,375 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:18,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:18,375 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:18,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:18,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:18,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:18,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:18,376 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:18,376 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:18,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:18,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:18,376 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:18,377 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:18,377 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:18,377 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:18,377 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:18,377 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:18,377 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:18,377 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:18,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:18,379 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:18,379 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:18,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:18,380 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:18,380 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:18,455 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:18,456 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:18,456 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:18,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:18,456 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:18,456 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:18,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1541 [2022-12-06 07:30:18,456 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-06 07:30:18,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:18,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1720033507, now seen corresponding path program 1 times [2022-12-06 07:30:18,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:18,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418896015] [2022-12-06 07:30:18,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:18,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:18,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-06 07:30:18,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:18,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418896015] [2022-12-06 07:30:18,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418896015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:18,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:18,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:18,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591569282] [2022-12-06 07:30:18,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:18,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:18,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:18,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:18,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:18,522 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:18,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:18,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:18,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:18,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:18,556 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:18,556 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:18,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:18,556 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:18,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:18,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:18,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:18,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:18,557 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:18,557 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:18,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:18,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:18,558 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:18,558 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:18,558 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:18,558 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:18,558 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:18,558 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:18,558 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:18,558 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:18,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:18,560 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:18,560 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:18,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:18,561 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:18,561 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:18,634 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:18,635 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:18,635 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:18,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:18,635 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:18,635 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:18,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1542 [2022-12-06 07:30:18,635 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-06 07:30:18,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:18,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1689557314, now seen corresponding path program 1 times [2022-12-06 07:30:18,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:18,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55092776] [2022-12-06 07:30:18,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:18,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:18,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-06 07:30:18,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:18,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55092776] [2022-12-06 07:30:18,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55092776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:18,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:18,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:18,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703421427] [2022-12-06 07:30:18,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:18,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:18,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:18,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:18,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:18,700 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:18,700 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:18,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:18,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:18,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:18,736 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:18,736 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:18,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:18,737 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:18,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:18,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:18,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:18,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:18,737 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:18,737 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:18,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:18,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:18,738 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:18,738 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:18,738 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:18,738 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:18,738 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:18,738 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:18,738 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:18,739 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:18,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:18,741 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:18,741 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:18,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:18,741 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:18,741 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:18,815 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:18,816 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:18,816 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:18,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:18,816 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:18,816 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:18,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1543 [2022-12-06 07:30:18,816 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-06 07:30:18,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:18,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1662775205, now seen corresponding path program 1 times [2022-12-06 07:30:18,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:18,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882773184] [2022-12-06 07:30:18,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:18,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:18,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-06 07:30:18,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:18,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882773184] [2022-12-06 07:30:18,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882773184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:18,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:18,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:18,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869575215] [2022-12-06 07:30:18,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:18,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:18,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:18,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:18,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:18,879 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:18,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:18,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:18,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:18,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:18,915 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:18,915 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:18,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:18,915 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:18,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:18,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:18,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:18,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:18,916 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:18,916 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:18,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:18,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:18,917 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:18,917 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:18,917 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:18,917 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:18,917 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:18,917 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:18,917 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:18,917 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:18,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:18,919 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:18,919 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:18,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:18,920 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:18,920 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:18,993 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:18,994 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:18,994 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:18,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:18,994 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:18,994 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:18,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1544 [2022-12-06 07:30:18,994 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-06 07:30:18,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:18,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1632299012, now seen corresponding path program 1 times [2022-12-06 07:30:18,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:18,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885962809] [2022-12-06 07:30:18,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:18,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:19,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-06 07:30:19,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:19,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885962809] [2022-12-06 07:30:19,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885962809] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:19,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:19,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:19,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42001622] [2022-12-06 07:30:19,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:19,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:19,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:19,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:19,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:19,056 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:19,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:19,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:19,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:19,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:19,092 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:19,092 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:19,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:19,093 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:19,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:19,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:19,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:19,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:19,093 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:19,093 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:19,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:19,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:19,094 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:19,094 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:19,094 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:19,094 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:19,094 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:19,094 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:19,094 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:19,095 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:19,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:19,097 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:19,097 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:19,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:19,097 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:19,097 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:19,172 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:19,173 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:19,173 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:19,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:19,173 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:19,173 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:19,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1545 [2022-12-06 07:30:19,173 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-06 07:30:19,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:19,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1605516903, now seen corresponding path program 1 times [2022-12-06 07:30:19,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:19,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300759812] [2022-12-06 07:30:19,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:19,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:19,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-06 07:30:19,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:19,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300759812] [2022-12-06 07:30:19,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300759812] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:19,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:19,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:19,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940240905] [2022-12-06 07:30:19,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:19,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:19,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:19,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:19,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:19,242 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:19,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:19,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:19,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:19,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:19,284 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:19,284 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:19,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:19,285 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:19,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:19,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:19,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:19,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:19,285 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:19,285 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:19,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:19,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:19,286 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:19,286 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:19,286 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:19,286 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:19,286 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:19,286 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:19,287 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:19,287 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:19,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:19,289 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:19,289 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:19,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:19,289 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:19,289 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:19,376 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:19,377 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-06 07:30:19,377 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:19,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:19,377 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:19,377 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:19,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1546 [2022-12-06 07:30:19,377 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-06 07:30:19,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:19,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1575040710, now seen corresponding path program 1 times [2022-12-06 07:30:19,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:19,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780434352] [2022-12-06 07:30:19,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:19,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:19,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-06 07:30:19,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:19,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780434352] [2022-12-06 07:30:19,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780434352] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:19,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:19,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:19,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456849892] [2022-12-06 07:30:19,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:19,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:19,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:19,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:19,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:19,439 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:19,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:19,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:19,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:19,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:19,475 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:19,475 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:19,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:19,476 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:19,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:19,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:19,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:19,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:19,476 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:19,476 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:19,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:19,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:19,477 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:19,477 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:19,477 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:19,477 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:19,477 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:19,477 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:19,477 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:19,477 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:19,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:19,480 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:19,480 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:19,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:19,480 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:19,480 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:19,554 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:19,554 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:19,554 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:19,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:19,554 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:19,554 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:19,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1547 [2022-12-06 07:30:19,555 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-06 07:30:19,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:19,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1548258601, now seen corresponding path program 1 times [2022-12-06 07:30:19,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:19,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515030492] [2022-12-06 07:30:19,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:19,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:19,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-06 07:30:19,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:19,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515030492] [2022-12-06 07:30:19,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515030492] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:19,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:19,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:19,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704644505] [2022-12-06 07:30:19,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:19,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:19,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:19,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:19,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:19,618 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:19,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:19,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:19,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:19,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:19,654 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:19,654 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:19,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:19,655 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:19,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:19,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:19,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:19,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:19,655 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:19,655 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:19,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:19,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:19,656 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:19,656 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:19,656 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:19,656 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:19,656 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:19,656 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:19,656 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:19,656 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:19,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:19,658 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:19,659 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:19,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:19,659 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:19,659 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:19,734 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:19,735 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:19,735 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:19,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:19,735 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:19,735 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:19,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1548 [2022-12-06 07:30:19,735 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-06 07:30:19,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:19,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1517782408, now seen corresponding path program 1 times [2022-12-06 07:30:19,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:19,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289580387] [2022-12-06 07:30:19,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:19,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:19,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-06 07:30:19,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:19,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289580387] [2022-12-06 07:30:19,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289580387] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:19,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:19,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:19,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197994135] [2022-12-06 07:30:19,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:19,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:19,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:19,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:19,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:19,800 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:19,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:19,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:19,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:19,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:19,842 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:19,843 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:19,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:19,843 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:19,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:19,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:19,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:19,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:19,847 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:19,848 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:19,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:19,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:19,849 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:19,849 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:19,849 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:19,849 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:19,849 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:19,849 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:19,849 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:19,849 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:19,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:19,853 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:19,853 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:19,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:19,853 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:19,853 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:19,945 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:19,946 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 07:30:19,946 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:19,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:19,946 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:19,946 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:19,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1549 [2022-12-06 07:30:19,946 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-06 07:30:19,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:19,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1491000299, now seen corresponding path program 1 times [2022-12-06 07:30:19,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:19,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147143224] [2022-12-06 07:30:19,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:19,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:20,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-06 07:30:20,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:20,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147143224] [2022-12-06 07:30:20,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147143224] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:20,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:20,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:20,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40987529] [2022-12-06 07:30:20,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:20,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:20,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:20,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:20,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:20,031 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:20,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:20,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:20,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:20,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:20,084 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:20,084 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:20,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:20,085 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:20,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:20,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:20,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:20,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:20,086 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:20,086 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:20,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:20,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:20,087 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:20,087 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:20,087 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:20,087 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:20,087 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:20,088 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:20,088 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:20,088 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:20,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:20,091 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:20,091 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:20,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:20,091 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:20,091 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:20,168 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:20,168 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:30:20,168 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:20,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:20,169 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:20,169 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:20,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1550 [2022-12-06 07:30:20,169 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-06 07:30:20,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:20,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1460524106, now seen corresponding path program 1 times [2022-12-06 07:30:20,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:20,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366020554] [2022-12-06 07:30:20,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:20,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:20,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-06 07:30:20,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:20,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366020554] [2022-12-06 07:30:20,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366020554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:20,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:20,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:20,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993743203] [2022-12-06 07:30:20,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:20,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:20,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:20,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:20,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:20,229 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:20,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:20,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:20,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:20,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:20,270 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:20,270 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:20,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:20,271 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:20,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:20,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:20,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:20,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:20,272 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:20,272 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:20,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:20,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:20,272 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:20,272 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:20,272 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:20,273 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:20,273 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:20,273 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:20,273 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:20,273 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:20,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:20,275 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:20,275 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:20,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:20,275 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:20,275 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:20,350 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:20,351 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:20,351 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:20,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:20,351 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:20,351 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:20,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1551 [2022-12-06 07:30:20,351 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-06 07:30:20,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:20,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1433741997, now seen corresponding path program 1 times [2022-12-06 07:30:20,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:20,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370735303] [2022-12-06 07:30:20,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:20,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:20,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:20,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:20,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370735303] [2022-12-06 07:30:20,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370735303] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:20,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:20,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:20,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016360517] [2022-12-06 07:30:20,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:20,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:20,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:20,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:20,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:20,426 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:20,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:20,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:20,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:20,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:20,467 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:20,467 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:20,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:20,468 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:20,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:20,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:20,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:20,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:20,468 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:20,468 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:20,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:20,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:20,469 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:20,469 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:20,469 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:20,469 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:20,469 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:20,470 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:20,470 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:20,470 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:20,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:20,472 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:20,472 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:20,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:20,472 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:20,472 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:20,546 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:20,547 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:20,547 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:20,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:20,547 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:20,547 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:20,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1552 [2022-12-06 07:30:20,547 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-06 07:30:20,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:20,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1403265804, now seen corresponding path program 1 times [2022-12-06 07:30:20,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:20,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673017060] [2022-12-06 07:30:20,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:20,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:20,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-06 07:30:20,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:20,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673017060] [2022-12-06 07:30:20,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673017060] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:20,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:20,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:20,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688123314] [2022-12-06 07:30:20,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:20,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:20,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:20,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:20,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:20,609 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:20,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:20,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:20,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:20,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:20,652 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:20,652 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:20,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:20,653 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:20,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:20,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:20,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:20,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:20,653 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:20,653 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:20,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:20,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:20,654 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:20,654 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:20,654 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:20,654 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:20,654 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:20,655 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:20,655 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:20,655 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:20,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:20,657 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:20,657 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:20,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:20,657 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:20,657 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:20,734 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:20,735 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:30:20,735 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:20,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:20,735 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:20,735 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:20,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1553 [2022-12-06 07:30:20,735 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-06 07:30:20,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:20,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1376483695, now seen corresponding path program 1 times [2022-12-06 07:30:20,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:20,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734522183] [2022-12-06 07:30:20,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:20,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:20,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-06 07:30:20,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:20,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734522183] [2022-12-06 07:30:20,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734522183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:20,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:20,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:20,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325016097] [2022-12-06 07:30:20,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:20,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:20,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:20,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:20,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:20,801 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:20,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:20,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:20,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:20,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:20,836 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:20,836 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:20,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:20,837 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:20,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:20,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:20,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:20,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:20,837 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:20,837 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:20,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:20,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:20,838 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:20,838 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:20,838 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:20,838 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:20,838 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:20,839 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:20,839 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:20,839 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:20,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:20,841 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:20,841 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:20,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:20,841 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:20,841 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:20,916 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:20,917 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:20,917 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:20,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:20,917 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:20,917 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:20,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1554 [2022-12-06 07:30:20,917 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-06 07:30:20,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:20,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1346007502, now seen corresponding path program 1 times [2022-12-06 07:30:20,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:20,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896570609] [2022-12-06 07:30:20,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:20,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30: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-06 07:30:20,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:20,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896570609] [2022-12-06 07:30:20,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896570609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:20,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:20,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:20,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725390414] [2022-12-06 07:30:20,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:20,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:20,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:20,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:20,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:20,982 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:20,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:20,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:20,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:20,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:21,023 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:21,024 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:21,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:21,024 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:21,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:21,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:21,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:21,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:21,025 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:21,025 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:21,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:21,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:21,025 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:21,025 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:21,025 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:21,025 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:21,026 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:21,026 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:21,026 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:21,026 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:21,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:21,028 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:21,028 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:21,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:21,028 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:21,028 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:21,103 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:21,103 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:21,103 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:21,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:21,103 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:21,104 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:21,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1555 [2022-12-06 07:30:21,104 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-06 07:30:21,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:21,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1319225393, now seen corresponding path program 1 times [2022-12-06 07:30:21,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:21,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303457671] [2022-12-06 07:30:21,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:21,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:21,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:21,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:21,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:21,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303457671] [2022-12-06 07:30:21,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303457671] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:21,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:21,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:21,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143614085] [2022-12-06 07:30:21,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:21,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:21,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:21,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:21,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:21,181 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:21,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:21,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:21,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:21,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:21,217 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:21,217 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:21,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:21,218 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:21,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:21,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:21,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:21,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:21,218 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:21,218 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:21,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:21,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:21,219 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:21,219 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:21,219 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:21,219 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:21,219 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:21,220 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:21,220 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:21,220 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:21,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:21,222 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:21,222 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:21,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:21,222 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:21,222 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:21,296 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:21,297 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:21,297 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:21,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:21,297 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:21,297 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:21,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1556 [2022-12-06 07:30:21,297 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-06 07:30:21,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:21,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1288749200, now seen corresponding path program 1 times [2022-12-06 07:30:21,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:21,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486067876] [2022-12-06 07:30:21,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:21,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:21,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-06 07:30:21,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:21,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486067876] [2022-12-06 07:30:21,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486067876] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:21,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:21,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:21,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129109410] [2022-12-06 07:30:21,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:21,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:21,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:21,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:21,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:21,372 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:21,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:21,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:21,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:21,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:21,409 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:21,409 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:21,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:21,410 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:21,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:21,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:21,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:21,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:21,411 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:21,411 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:21,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:21,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:21,411 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:21,411 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:21,412 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:21,412 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:21,412 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:21,412 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:21,412 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:21,412 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:21,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:21,414 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:21,414 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:21,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:21,414 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:21,414 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:21,489 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:21,490 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:21,490 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:21,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:21,490 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:21,490 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:21,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1557 [2022-12-06 07:30:21,490 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-06 07:30:21,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:21,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1261967091, now seen corresponding path program 1 times [2022-12-06 07:30:21,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:21,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640501683] [2022-12-06 07:30:21,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:21,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:21,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-06 07:30:21,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:21,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640501683] [2022-12-06 07:30:21,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640501683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:21,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:21,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:21,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044348464] [2022-12-06 07:30:21,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:21,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:21,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:21,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:21,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:21,562 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:21,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:21,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:21,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:21,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:21,605 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:21,605 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:21,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:21,605 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:21,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:21,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:21,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:21,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:21,606 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:21,606 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:21,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:21,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:21,607 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:21,607 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:21,607 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:21,607 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:21,607 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:21,607 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:21,607 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:21,607 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:21,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:21,609 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:21,609 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:21,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:21,610 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:21,610 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:21,684 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:21,684 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:21,684 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:21,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:21,684 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:21,684 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:21,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1558 [2022-12-06 07:30:21,685 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-06 07:30:21,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:21,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1231490898, now seen corresponding path program 1 times [2022-12-06 07:30:21,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:21,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952052035] [2022-12-06 07:30:21,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:21,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:21,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-06 07:30:21,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:21,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952052035] [2022-12-06 07:30:21,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952052035] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:21,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:21,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:21,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536655849] [2022-12-06 07:30:21,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:21,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:21,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:21,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:21,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:21,747 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:21,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:21,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:21,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:21,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:21,789 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:21,789 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:21,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:21,790 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:21,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:21,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:21,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:21,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:21,790 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:21,790 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:21,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:21,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:21,791 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:21,791 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:21,791 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:21,791 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:21,791 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:21,792 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:21,792 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:21,792 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:21,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:21,794 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:21,794 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:21,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:21,794 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:21,794 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:21,870 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:21,871 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:30:21,871 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:21,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:21,871 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:21,871 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:21,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1559 [2022-12-06 07:30:21,871 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-06 07:30:21,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:21,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1204708789, now seen corresponding path program 1 times [2022-12-06 07:30:21,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:21,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595664243] [2022-12-06 07:30:21,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:21,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:21,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-06 07:30:21,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:21,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595664243] [2022-12-06 07:30:21,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595664243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:21,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:21,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:21,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436111695] [2022-12-06 07:30:21,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:21,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:21,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:21,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:21,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:21,935 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:21,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:21,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:21,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:21,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:21,971 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:21,972 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:21,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:21,972 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:21,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:21,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:21,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:21,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:21,973 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:21,973 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:21,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:21,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:21,973 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:21,973 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:21,974 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:21,974 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:21,974 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:21,974 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:21,974 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:21,974 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:21,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:21,976 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:21,976 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:21,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:21,976 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:21,976 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:22,050 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:22,051 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:22,051 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:22,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:22,051 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:22,051 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:22,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1560 [2022-12-06 07:30:22,051 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-06 07:30:22,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:22,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1174232596, now seen corresponding path program 1 times [2022-12-06 07:30:22,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:22,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707722582] [2022-12-06 07:30:22,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:22,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:22,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-06 07:30:22,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:22,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707722582] [2022-12-06 07:30:22,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707722582] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:22,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:22,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:22,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795649098] [2022-12-06 07:30:22,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:22,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:22,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:22,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:22,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:22,112 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:22,112 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:22,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:22,112 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:22,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:22,149 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:22,150 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:22,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:22,150 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:22,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:22,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:22,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:22,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:22,151 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:22,151 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:22,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:22,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:22,151 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:22,152 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:22,152 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:22,152 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:22,152 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:22,152 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:22,152 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:22,152 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:22,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:22,154 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:22,154 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:22,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:22,155 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:22,155 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:22,230 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:22,231 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:22,231 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:22,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:22,231 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:22,231 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:22,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1561 [2022-12-06 07:30:22,231 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-06 07:30:22,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:22,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1147450487, now seen corresponding path program 1 times [2022-12-06 07:30:22,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:22,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935037352] [2022-12-06 07:30:22,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:22,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:22,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-06 07:30:22,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:22,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935037352] [2022-12-06 07:30:22,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935037352] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:22,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:22,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:22,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017331130] [2022-12-06 07:30:22,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:22,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:22,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:22,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:22,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:22,307 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:22,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:22,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:22,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:22,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:22,343 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:22,343 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:22,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:22,344 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:22,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:22,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:22,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:22,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:22,344 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:22,344 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:22,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:22,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:22,345 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:22,345 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:22,345 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:22,345 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:22,345 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:22,345 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:22,345 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:22,346 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:22,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:22,348 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:22,348 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:22,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:22,348 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:22,348 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:22,423 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:22,423 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:22,423 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:22,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:22,423 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:22,424 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:22,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1562 [2022-12-06 07:30:22,424 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-06 07:30:22,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:22,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1116974294, now seen corresponding path program 1 times [2022-12-06 07:30:22,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:22,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446885512] [2022-12-06 07:30:22,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:22,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:22,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-06 07:30:22,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:22,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446885512] [2022-12-06 07:30:22,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446885512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:22,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:22,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:22,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667900747] [2022-12-06 07:30:22,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:22,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:22,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:22,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:22,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:22,487 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:22,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:22,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:22,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:22,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:22,534 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:22,534 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:22,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:22,535 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:22,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:22,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:22,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:22,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:22,535 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:22,535 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:22,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:22,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:22,536 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:22,536 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:22,536 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:22,536 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:22,537 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:22,537 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:22,537 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:22,537 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:22,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:22,539 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:22,539 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:22,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:22,539 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:22,539 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:22,615 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:22,616 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:30:22,616 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:22,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:22,616 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:22,616 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:22,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1563 [2022-12-06 07:30:22,616 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-06 07:30:22,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:22,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1090192185, now seen corresponding path program 1 times [2022-12-06 07:30:22,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:22,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056217717] [2022-12-06 07:30:22,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:22,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:22,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-06 07:30:22,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:22,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056217717] [2022-12-06 07:30:22,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056217717] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:22,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:22,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:22,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249341910] [2022-12-06 07:30:22,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:22,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:22,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:22,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:22,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:22,679 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:22,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:22,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:22,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:22,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:22,723 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:22,723 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:22,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:22,724 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:22,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:22,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:22,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:22,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:22,725 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:22,725 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:22,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:22,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:22,725 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:22,725 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:22,726 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:22,726 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:22,726 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:22,726 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:22,726 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:22,726 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:22,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:22,728 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:22,728 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:22,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:22,728 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:22,729 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:22,805 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:22,806 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:30:22,806 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:22,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:22,806 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:22,806 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:22,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1564 [2022-12-06 07:30:22,806 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-06 07:30:22,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:22,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1059715992, now seen corresponding path program 1 times [2022-12-06 07:30:22,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:22,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095854338] [2022-12-06 07:30:22,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:22,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:22,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30: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-06 07:30:22,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:22,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095854338] [2022-12-06 07:30:22,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095854338] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:22,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:22,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:22,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582892922] [2022-12-06 07:30:22,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:22,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:22,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:22,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:22,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:22,867 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:22,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:22,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:22,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:22,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:22,908 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:22,908 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:22,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:22,909 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:22,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:22,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:22,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:22,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:22,909 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:22,909 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:22,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:22,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:22,910 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:22,910 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:22,910 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:22,910 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:22,910 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:22,910 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:22,911 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:22,911 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:22,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:22,913 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:22,913 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:22,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:22,913 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:22,913 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:22,988 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:22,989 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:22,989 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:22,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:22,989 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:22,989 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:22,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1565 [2022-12-06 07:30:22,989 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-06 07:30:22,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:22,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1032933883, now seen corresponding path program 1 times [2022-12-06 07:30:22,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:22,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915121908] [2022-12-06 07:30:22,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:22,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:23,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-06 07:30:23,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:23,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915121908] [2022-12-06 07:30:23,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915121908] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:23,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:23,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:23,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869813659] [2022-12-06 07:30:23,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:23,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:23,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:23,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:23,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:23,053 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:23,053 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:23,053 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:23,053 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:23,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:23,094 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:23,095 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:23,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:23,095 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:23,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:23,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:23,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:23,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:23,096 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:23,096 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:23,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:23,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:23,096 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:23,096 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:23,097 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:23,097 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:23,097 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:23,097 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:23,097 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:23,097 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:23,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:23,099 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:23,099 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:23,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:23,099 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:23,100 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:23,175 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:23,176 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:23,176 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:23,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:23,176 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:23,176 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:23,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1566 [2022-12-06 07:30:23,176 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-06 07:30:23,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:23,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1002457690, now seen corresponding path program 1 times [2022-12-06 07:30:23,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:23,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182943001] [2022-12-06 07:30:23,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:23,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:23,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-06 07:30:23,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:23,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182943001] [2022-12-06 07:30:23,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182943001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:23,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:23,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:23,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320152399] [2022-12-06 07:30:23,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:23,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:23,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:23,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:23,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:23,249 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:23,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:23,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:23,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:23,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:23,286 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:23,286 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:23,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:23,287 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:23,287 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:23,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:23,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:23,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:23,287 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:23,287 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:23,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:23,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:23,288 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:23,288 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:23,288 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:23,288 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:23,288 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:23,289 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:23,289 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:23,289 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:23,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:23,291 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:23,291 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:23,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:23,291 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:23,291 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:23,365 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:23,366 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:23,366 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:23,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:23,366 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:23,366 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:23,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1567 [2022-12-06 07:30:23,366 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-06 07:30:23,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:23,366 INFO L85 PathProgramCache]: Analyzing trace with hash -975675581, now seen corresponding path program 1 times [2022-12-06 07:30:23,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:23,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354114889] [2022-12-06 07:30:23,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:23,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:23,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-06 07:30:23,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:23,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354114889] [2022-12-06 07:30:23,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354114889] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:23,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:23,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:23,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453410021] [2022-12-06 07:30:23,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:23,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:23,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:23,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:23,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:23,432 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:23,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:23,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:23,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:23,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:23,474 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:23,474 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:23,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:23,475 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:23,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:23,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:23,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:23,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:23,475 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:23,475 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:23,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:23,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:23,476 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:23,476 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:23,476 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:23,476 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:23,476 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:23,476 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:23,476 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:23,476 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:23,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:23,478 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:23,479 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:23,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:23,479 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:23,479 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:23,555 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:23,556 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:30:23,556 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:23,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:23,556 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:23,556 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:23,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1568 [2022-12-06 07:30:23,556 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-06 07:30:23,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:23,556 INFO L85 PathProgramCache]: Analyzing trace with hash -945199388, now seen corresponding path program 1 times [2022-12-06 07:30:23,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:23,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848601972] [2022-12-06 07:30:23,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:23,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:23,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-06 07:30:23,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:23,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848601972] [2022-12-06 07:30:23,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848601972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:23,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:23,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:23,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929643848] [2022-12-06 07:30:23,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:23,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:23,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:23,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:23,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:23,618 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:23,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:23,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:23,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:23,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:23,663 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:23,664 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:23,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 350 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:23,664 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:23,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:23,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:23,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:23,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:23,665 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:23,665 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:23,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:23,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:23,666 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:23,666 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:23,666 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:23,666 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:23,666 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:23,666 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:23,666 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:23,666 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:23,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:23,669 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:23,669 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:23,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:23,669 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:23,669 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:23,748 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:23,749 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 07:30:23,749 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:23,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:23,749 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:23,749 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:23,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1569 [2022-12-06 07:30:23,749 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-06 07:30:23,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:23,749 INFO L85 PathProgramCache]: Analyzing trace with hash -918417279, now seen corresponding path program 1 times [2022-12-06 07:30:23,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:23,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232981592] [2022-12-06 07:30:23,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:23,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:23,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:23,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:23,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232981592] [2022-12-06 07:30:23,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232981592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:23,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:23,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:23,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808058998] [2022-12-06 07:30:23,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:23,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:23,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:23,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:23,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:23,825 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:23,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:23,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:23,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:23,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:23,862 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:23,862 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:23,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:23,863 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:23,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:23,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:23,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:23,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:23,863 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:23,863 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:23,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:23,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:23,864 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:23,864 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:23,864 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:23,864 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:23,864 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:23,865 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:23,865 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:23,865 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:23,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:23,867 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:23,867 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:23,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 147 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:23,867 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:23,867 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:23,941 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:23,942 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:23,942 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:23,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:23,942 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:23,942 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:23,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1570 [2022-12-06 07:30:23,942 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-06 07:30:23,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:23,942 INFO L85 PathProgramCache]: Analyzing trace with hash -887941086, now seen corresponding path program 1 times [2022-12-06 07:30:23,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:23,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077336195] [2022-12-06 07:30:23,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:23,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:24,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-06 07:30:24,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:24,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077336195] [2022-12-06 07:30:24,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077336195] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:24,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:24,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:24,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813475937] [2022-12-06 07:30:24,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:24,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:24,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:24,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:24,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:24,007 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:24,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:24,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:24,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:24,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:24,048 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:24,049 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:24,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:24,049 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:24,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:24,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:24,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:24,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:24,050 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:24,050 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:24,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:24,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:24,051 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:24,051 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:24,051 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:24,051 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:24,051 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:24,051 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:24,051 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:24,051 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:24,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:24,053 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:24,054 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:24,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:24,054 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:24,054 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:24,128 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:24,129 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:24,129 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:24,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:24,129 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:24,129 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:24,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1571 [2022-12-06 07:30:24,129 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-06 07:30:24,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:24,129 INFO L85 PathProgramCache]: Analyzing trace with hash -861158977, now seen corresponding path program 1 times [2022-12-06 07:30:24,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:24,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685250482] [2022-12-06 07:30:24,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:24,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:24,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30: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-06 07:30:24,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:24,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685250482] [2022-12-06 07:30:24,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685250482] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:24,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:24,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:24,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811825320] [2022-12-06 07:30:24,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:24,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:24,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:24,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:24,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:24,196 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:24,196 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:24,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:24,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:24,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:24,244 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:24,244 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:24,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:24,245 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:24,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:24,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:24,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:24,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:24,245 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:24,245 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:24,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:24,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:24,246 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:24,246 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:24,246 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:24,246 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:24,246 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:24,246 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:24,246 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:24,246 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:24,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:24,249 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:24,249 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:24,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:24,249 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:24,249 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:24,323 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:24,324 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:24,324 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:24,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:24,324 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:24,324 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:24,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1572 [2022-12-06 07:30:24,325 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-06 07:30:24,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:24,325 INFO L85 PathProgramCache]: Analyzing trace with hash -830682784, now seen corresponding path program 1 times [2022-12-06 07:30:24,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:24,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813165611] [2022-12-06 07:30:24,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:24,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:24,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-06 07:30:24,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:24,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813165611] [2022-12-06 07:30:24,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813165611] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:24,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:24,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:24,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847542819] [2022-12-06 07:30:24,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:24,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:24,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:24,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:24,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:24,388 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:24,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:24,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:24,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:24,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:24,432 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:24,432 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:24,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:24,433 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:24,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:24,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:24,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:24,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:24,434 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:24,434 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:24,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:24,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:24,434 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:24,434 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:24,434 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:24,435 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:24,435 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:24,435 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:24,435 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:24,435 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:24,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:24,437 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:24,437 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:24,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:24,437 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:24,437 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:24,510 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:24,511 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:30:24,511 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:24,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:24,511 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:24,511 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:24,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1573 [2022-12-06 07:30:24,511 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-06 07:30:24,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:24,511 INFO L85 PathProgramCache]: Analyzing trace with hash -803900675, now seen corresponding path program 1 times [2022-12-06 07:30:24,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:24,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033814872] [2022-12-06 07:30:24,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:24,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:24,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-06 07:30:24,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:24,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033814872] [2022-12-06 07:30:24,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033814872] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:24,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:24,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:24,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629633954] [2022-12-06 07:30:24,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:24,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:24,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:24,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:24,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:24,577 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:24,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:24,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:24,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:24,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:24,619 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:24,619 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:24,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:24,619 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:24,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:24,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:24,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:24,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:24,620 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:24,620 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:24,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:24,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:24,621 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:24,621 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:24,621 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:24,621 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:24,621 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:24,621 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:24,621 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:24,621 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:24,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:24,623 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:24,623 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:24,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:24,624 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:24,624 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:24,698 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:24,699 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:24,699 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:24,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:24,699 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:24,699 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:24,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1574 [2022-12-06 07:30:24,699 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-06 07:30:24,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:24,699 INFO L85 PathProgramCache]: Analyzing trace with hash -773424482, now seen corresponding path program 1 times [2022-12-06 07:30:24,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:24,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738492559] [2022-12-06 07:30:24,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:24,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:24,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-06 07:30:24,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:24,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738492559] [2022-12-06 07:30:24,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738492559] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:24,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:24,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:24,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586653641] [2022-12-06 07:30:24,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:24,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:24,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:24,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:24,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:24,760 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:24,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:24,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:24,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:24,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:24,804 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:24,804 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:24,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:24,804 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:24,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:24,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:24,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:24,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:24,805 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:24,805 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:24,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:24,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:24,806 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:24,806 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:24,806 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:24,806 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:24,806 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:24,806 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:24,806 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:24,806 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:24,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:24,808 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:24,808 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:24,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:24,809 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:24,809 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:24,883 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:24,884 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:24,884 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:24,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:24,884 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:24,884 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:24,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1575 [2022-12-06 07:30:24,884 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-06 07:30:24,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:24,884 INFO L85 PathProgramCache]: Analyzing trace with hash -746642373, now seen corresponding path program 1 times [2022-12-06 07:30:24,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:24,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174119199] [2022-12-06 07:30:24,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:24,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:24,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-06 07:30:24,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:24,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174119199] [2022-12-06 07:30:24,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174119199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:24,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:24,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:24,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919388484] [2022-12-06 07:30:24,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:24,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:24,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:24,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:24,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:24,949 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:24,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:24,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:24,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:24,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:24,989 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:24,989 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:24,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:24,990 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:24,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:24,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:24,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:24,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:24,991 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:24,991 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:24,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:24,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:24,991 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:24,991 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:24,992 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:24,992 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:24,992 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:24,992 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:24,992 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:24,992 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:24,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:24,994 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:24,994 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:24,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:24,995 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:24,995 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:25,071 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:25,072 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:30:25,072 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:25,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:25,072 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:25,072 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:25,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1576 [2022-12-06 07:30:25,072 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-06 07:30:25,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:25,073 INFO L85 PathProgramCache]: Analyzing trace with hash -716166180, now seen corresponding path program 1 times [2022-12-06 07:30:25,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:25,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65485244] [2022-12-06 07:30:25,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:25,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:25,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:25,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-06 07:30:25,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:25,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65485244] [2022-12-06 07:30:25,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65485244] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:25,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:25,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:25,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357048554] [2022-12-06 07:30:25,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:25,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:25,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:25,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:25,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:25,135 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:25,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:25,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:25,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:25,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:25,178 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:25,178 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:25,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:25,179 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:25,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:25,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:25,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:25,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:25,179 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:25,179 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:25,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:25,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:25,180 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:25,180 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:25,181 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:25,181 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:25,181 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:25,181 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:25,181 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:25,181 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:25,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:25,183 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:25,183 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:25,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:25,183 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:25,184 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:25,267 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:25,268 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 07:30:25,268 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:25,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:25,268 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:25,268 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:25,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1577 [2022-12-06 07:30:25,269 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-06 07:30:25,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:25,269 INFO L85 PathProgramCache]: Analyzing trace with hash -689384071, now seen corresponding path program 1 times [2022-12-06 07:30:25,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:25,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445816524] [2022-12-06 07:30:25,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:25,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:25,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-06 07:30:25,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:25,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445816524] [2022-12-06 07:30:25,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445816524] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:25,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:25,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:25,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853501207] [2022-12-06 07:30:25,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:25,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:25,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:25,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:25,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:25,339 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:25,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:25,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:25,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:25,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:25,375 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:25,376 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:25,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:25,376 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:25,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:25,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:25,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:25,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:25,377 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:25,377 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:25,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:25,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:25,377 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:25,378 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:25,378 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:25,378 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:25,378 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:25,378 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:25,378 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:25,378 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:25,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:25,380 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:25,380 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:25,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:25,381 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:25,381 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:25,456 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:25,456 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:25,456 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:25,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:25,456 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:25,456 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:25,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1578 [2022-12-06 07:30:25,457 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-06 07:30:25,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:25,457 INFO L85 PathProgramCache]: Analyzing trace with hash -658907878, now seen corresponding path program 1 times [2022-12-06 07:30:25,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:25,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522985382] [2022-12-06 07:30:25,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:25,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:25,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-06 07:30:25,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:25,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522985382] [2022-12-06 07:30:25,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522985382] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:25,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:25,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:25,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869103174] [2022-12-06 07:30:25,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:25,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:25,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:25,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:25,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:25,519 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:25,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:25,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:25,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:25,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:25,562 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:25,562 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:25,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:25,563 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:25,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:25,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:25,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:25,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:25,563 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:25,563 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:25,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:25,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:25,564 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:25,564 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:25,564 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:25,564 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:25,564 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:25,565 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:25,565 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:25,565 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:25,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:25,567 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:25,567 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:25,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:25,567 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:25,567 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:25,644 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:25,645 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:30:25,645 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:25,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:25,645 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:25,645 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:25,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1579 [2022-12-06 07:30:25,645 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-06 07:30:25,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:25,645 INFO L85 PathProgramCache]: Analyzing trace with hash -632125769, now seen corresponding path program 1 times [2022-12-06 07:30:25,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:25,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823160176] [2022-12-06 07:30:25,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:25,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:25,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:25,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:25,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823160176] [2022-12-06 07:30:25,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823160176] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:25,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:25,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:25,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60705490] [2022-12-06 07:30:25,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:25,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:25,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:25,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:25,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:25,712 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:25,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:25,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:25,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:25,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:25,754 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:25,754 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:25,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:25,754 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:25,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:25,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:25,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:25,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:25,755 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:25,755 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:25,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:25,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:25,756 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:25,756 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:25,756 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:25,756 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:25,756 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:25,756 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:25,756 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:25,756 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:25,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:25,758 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:25,759 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:25,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:25,759 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:25,759 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:25,834 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:25,835 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:25,835 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:25,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:25,835 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:25,835 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:25,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1580 [2022-12-06 07:30:25,835 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-06 07:30:25,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:25,836 INFO L85 PathProgramCache]: Analyzing trace with hash -601649576, now seen corresponding path program 1 times [2022-12-06 07:30:25,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:25,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890535418] [2022-12-06 07:30:25,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:25,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:25,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:25,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-06 07:30:25,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:25,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890535418] [2022-12-06 07:30:25,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890535418] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:25,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:25,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:25,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529710595] [2022-12-06 07:30:25,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:25,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:25,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:25,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:25,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:25,898 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:25,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:25,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:25,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:25,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:25,935 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:25,935 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:25,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:25,936 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:25,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:25,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:25,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:25,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:25,936 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:25,936 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:25,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:25,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:25,937 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:25,937 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:25,937 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:25,937 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:25,937 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:25,938 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:25,938 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:25,938 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:25,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:25,940 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:25,940 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:25,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:25,940 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:25,940 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:26,016 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:26,017 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:30:26,017 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:26,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:26,017 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:26,017 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:26,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1581 [2022-12-06 07:30:26,017 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-06 07:30:26,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:26,017 INFO L85 PathProgramCache]: Analyzing trace with hash -574867467, now seen corresponding path program 1 times [2022-12-06 07:30:26,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:26,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909830401] [2022-12-06 07:30:26,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:26,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:26,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-06 07:30:26,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:26,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909830401] [2022-12-06 07:30:26,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909830401] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:26,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:26,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:26,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366931758] [2022-12-06 07:30:26,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:26,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:26,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:26,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:26,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:26,085 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:26,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:26,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:26,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:26,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:26,128 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:26,128 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:26,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:26,129 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:26,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:26,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:26,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:26,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:26,129 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:26,129 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:26,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:26,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:26,130 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:26,130 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:26,130 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:26,130 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:26,130 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:26,130 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:26,130 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:26,130 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:26,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:26,133 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:26,133 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:26,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:26,133 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:26,133 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:26,212 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:26,213 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 07:30:26,213 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:26,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:26,213 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:26,213 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:26,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1582 [2022-12-06 07:30:26,213 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-06 07:30:26,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:26,213 INFO L85 PathProgramCache]: Analyzing trace with hash -544391274, now seen corresponding path program 1 times [2022-12-06 07:30:26,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:26,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804719750] [2022-12-06 07:30:26,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:26,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:26,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:26,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:26,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804719750] [2022-12-06 07:30:26,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804719750] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:26,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:26,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:26,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034732829] [2022-12-06 07:30:26,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:26,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:26,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:26,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:26,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:26,280 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:26,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:26,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:26,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:26,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:26,316 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:26,316 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:26,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:26,317 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:26,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:26,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:26,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:26,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:26,317 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:26,318 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:26,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:26,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:26,318 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:26,318 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:26,318 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:26,318 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:26,318 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:26,319 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:26,319 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:26,319 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:26,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:26,321 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:26,321 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:26,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:26,321 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:26,321 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:26,405 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:26,405 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 07:30:26,405 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:26,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:26,405 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:26,406 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:26,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1583 [2022-12-06 07:30:26,406 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-06 07:30:26,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:26,406 INFO L85 PathProgramCache]: Analyzing trace with hash -517609165, now seen corresponding path program 1 times [2022-12-06 07:30:26,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:26,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636181836] [2022-12-06 07:30:26,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:26,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:26,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-06 07:30:26,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:26,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636181836] [2022-12-06 07:30:26,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636181836] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:26,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:26,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:26,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144748410] [2022-12-06 07:30:26,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:26,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:26,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:26,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:26,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:26,469 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:26,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:26,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:26,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:26,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:26,506 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:26,506 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:26,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:26,506 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:26,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:26,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:26,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:26,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:26,507 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:26,507 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:26,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:26,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:26,508 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:26,508 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:26,508 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:26,508 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:26,508 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:26,508 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:26,508 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:26,508 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:26,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:26,511 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:26,511 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:26,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:26,511 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:26,511 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:26,586 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:26,587 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:26,587 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:26,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:26,587 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:26,587 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:26,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1584 [2022-12-06 07:30:26,587 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-06 07:30:26,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:26,587 INFO L85 PathProgramCache]: Analyzing trace with hash -487132972, now seen corresponding path program 1 times [2022-12-06 07:30:26,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:26,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346549234] [2022-12-06 07:30:26,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:26,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:26,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-06 07:30:26,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:26,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346549234] [2022-12-06 07:30:26,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346549234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:26,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:26,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:26,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123879134] [2022-12-06 07:30:26,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:26,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:26,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:26,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:26,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:26,656 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:26,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:26,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:26,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:26,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:26,699 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:26,700 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:26,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:26,700 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:26,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:26,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:26,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:26,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:26,701 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:26,701 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:26,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:26,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:26,701 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:26,701 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:26,701 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:26,702 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:26,702 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:26,702 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:26,702 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:26,702 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:26,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:26,704 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:26,704 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:26,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:26,704 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:26,704 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:26,778 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:26,779 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:26,779 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:26,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:26,779 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:26,779 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:26,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1585 [2022-12-06 07:30:26,779 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-06 07:30:26,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:26,780 INFO L85 PathProgramCache]: Analyzing trace with hash -460350863, now seen corresponding path program 1 times [2022-12-06 07:30:26,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:26,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755751307] [2022-12-06 07:30:26,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:26,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:26,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-06 07:30:26,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:26,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755751307] [2022-12-06 07:30:26,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755751307] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:26,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:26,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:26,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391883454] [2022-12-06 07:30:26,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:26,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:26,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:26,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:26,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:26,842 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:26,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:26,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:26,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:26,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:26,877 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:26,877 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:26,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:26,877 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:26,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:26,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:26,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:26,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:26,878 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:26,878 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:26,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:26,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:26,879 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:26,879 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:26,879 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:26,879 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:26,879 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:26,879 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:26,879 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:26,879 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:26,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:26,881 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:26,881 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:26,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:26,882 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:26,882 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:26,957 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:26,958 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:26,958 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:26,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:26,958 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:26,958 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:26,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1586 [2022-12-06 07:30:26,958 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-06 07:30:26,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:26,958 INFO L85 PathProgramCache]: Analyzing trace with hash -429874670, now seen corresponding path program 1 times [2022-12-06 07:30:26,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:26,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89398073] [2022-12-06 07:30:26,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:26,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:27,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-06 07:30:27,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:27,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89398073] [2022-12-06 07:30:27,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89398073] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:27,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:27,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:27,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398623027] [2022-12-06 07:30:27,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:27,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:27,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:27,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:27,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:27,019 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:27,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:27,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:27,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:27,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:27,062 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:27,062 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:27,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:27,062 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:27,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:27,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:27,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:27,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:27,063 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:27,063 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:27,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:27,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:27,064 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:27,064 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:27,064 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:27,064 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:27,064 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:27,064 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:27,064 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:27,064 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:27,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:27,066 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:27,066 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:27,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:27,067 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:27,067 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:27,142 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:27,143 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:27,143 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:27,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:27,143 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:27,143 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:27,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1587 [2022-12-06 07:30:27,143 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-06 07:30:27,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:27,143 INFO L85 PathProgramCache]: Analyzing trace with hash -403092561, now seen corresponding path program 1 times [2022-12-06 07:30:27,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:27,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993359137] [2022-12-06 07:30:27,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:27,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:27,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-06 07:30:27,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:27,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993359137] [2022-12-06 07:30:27,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993359137] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:27,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:27,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:27,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632063513] [2022-12-06 07:30:27,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:27,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:27,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:27,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:27,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:27,217 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:27,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:27,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:27,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:27,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:27,254 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:27,254 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:27,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:27,255 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:27,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:27,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:27,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:27,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:27,255 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:27,255 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:27,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:27,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:27,256 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:27,256 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:27,256 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:27,256 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:27,256 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:27,256 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:27,256 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:27,256 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:27,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:27,259 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:27,259 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:27,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:27,259 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:27,259 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:27,336 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:27,336 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:30:27,337 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:27,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:27,337 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:27,337 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:27,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1588 [2022-12-06 07:30:27,337 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-06 07:30:27,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:27,337 INFO L85 PathProgramCache]: Analyzing trace with hash -372616368, now seen corresponding path program 1 times [2022-12-06 07:30:27,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:27,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849342722] [2022-12-06 07:30:27,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:27,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:27,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-06 07:30:27,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:27,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849342722] [2022-12-06 07:30:27,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849342722] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:27,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:27,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:27,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605477757] [2022-12-06 07:30:27,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:27,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:27,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:27,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:27,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:27,417 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:27,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:27,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:27,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:27,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:27,461 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:27,461 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:27,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:27,462 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:27,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:27,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:27,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:27,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:27,463 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:27,463 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:27,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:27,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:27,464 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:27,464 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:27,464 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:27,464 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:27,464 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:27,464 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:27,464 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:27,464 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:27,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:27,467 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:27,467 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:27,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:27,468 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:27,468 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:27,563 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:27,564 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 07:30:27,564 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:27,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:27,564 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:27,564 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:27,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1589 [2022-12-06 07:30:27,564 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-06 07:30:27,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:27,564 INFO L85 PathProgramCache]: Analyzing trace with hash -345834259, now seen corresponding path program 1 times [2022-12-06 07:30:27,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:27,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975457346] [2022-12-06 07:30:27,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:27,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:27,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-06 07:30:27,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:27,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975457346] [2022-12-06 07:30:27,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975457346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:27,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:27,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:27,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447870314] [2022-12-06 07:30:27,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:27,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:27,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:27,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:27,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:27,648 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:27,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:27,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:27,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:27,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:27,690 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:27,690 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:27,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:27,691 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:27,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:27,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:27,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:27,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:27,691 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:27,691 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:27,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:27,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:27,692 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:27,692 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:27,692 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:27,692 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:27,692 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:27,693 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:27,693 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:27,693 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:27,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:27,695 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:27,695 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:27,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:27,695 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:27,695 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:27,770 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:27,770 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:27,770 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:27,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:27,771 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:27,771 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:27,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1590 [2022-12-06 07:30:27,771 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-06 07:30:27,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:27,771 INFO L85 PathProgramCache]: Analyzing trace with hash -315358066, now seen corresponding path program 1 times [2022-12-06 07:30:27,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:27,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786009409] [2022-12-06 07:30:27,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:27,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:27,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:27,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-06 07:30:27,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:27,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786009409] [2022-12-06 07:30:27,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786009409] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:27,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:27,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:27,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83884918] [2022-12-06 07:30:27,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:27,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:27,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:27,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:27,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:27,832 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:27,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:27,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:27,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:27,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:27,868 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:27,869 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:27,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:27,869 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:27,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:27,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:27,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:27,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:27,870 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:27,870 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:27,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:27,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:27,870 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:27,870 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:27,870 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:27,871 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:27,871 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:27,871 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:27,871 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:27,871 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:27,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:27,873 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:27,873 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:27,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:27,873 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:27,873 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:27,947 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:27,948 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:27,948 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:27,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:27,948 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:27,948 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:27,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1591 [2022-12-06 07:30:27,948 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-06 07:30:27,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:27,948 INFO L85 PathProgramCache]: Analyzing trace with hash -288575957, now seen corresponding path program 1 times [2022-12-06 07:30:27,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:27,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085892972] [2022-12-06 07:30:27,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:27,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:28,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-06 07:30:28,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:28,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085892972] [2022-12-06 07:30:28,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085892972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:28,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:28,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:28,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750860626] [2022-12-06 07:30:28,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:28,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:28,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:28,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:28,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:28,012 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:28,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:28,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:28,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:28,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:28,048 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:28,048 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:28,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:28,049 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:28,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:28,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:28,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:28,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:28,049 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:28,049 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:28,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:28,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:28,050 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:28,050 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:28,050 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:28,050 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:28,050 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:28,050 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:28,050 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:28,050 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:28,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:28,053 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:28,053 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:28,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:28,053 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:28,053 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:28,128 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:28,128 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:28,128 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:28,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:28,128 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:28,128 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:28,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1592 [2022-12-06 07:30:28,129 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-06 07:30:28,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:28,129 INFO L85 PathProgramCache]: Analyzing trace with hash -258099764, now seen corresponding path program 1 times [2022-12-06 07:30:28,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:28,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251838657] [2022-12-06 07:30:28,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:28,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:28,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-06 07:30:28,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:28,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251838657] [2022-12-06 07:30:28,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251838657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:28,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:28,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:28,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514505064] [2022-12-06 07:30:28,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:28,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:28,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:28,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:28,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:28,204 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:28,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:28,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:28,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:28,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:28,247 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:28,247 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:28,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:28,248 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:28,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:28,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:28,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:28,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:28,248 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:28,248 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:28,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:28,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:28,249 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:28,249 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:28,249 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:28,249 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:28,249 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:28,249 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:28,249 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:28,250 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:28,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:28,252 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:28,252 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:28,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:28,252 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:28,252 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:28,326 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:28,326 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:28,326 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:28,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:28,327 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:28,327 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:28,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1593 [2022-12-06 07:30:28,327 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-06 07:30:28,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:28,327 INFO L85 PathProgramCache]: Analyzing trace with hash -231317655, now seen corresponding path program 1 times [2022-12-06 07:30:28,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:28,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824738166] [2022-12-06 07:30:28,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:28,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:28,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-06 07:30:28,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:28,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824738166] [2022-12-06 07:30:28,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824738166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:28,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:28,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:28,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439040671] [2022-12-06 07:30:28,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:28,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:28,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:28,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:28,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:28,393 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:28,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:28,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:28,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:28,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:28,429 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:28,429 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:28,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:28,429 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:28,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:28,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:28,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:28,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:28,430 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:28,430 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:28,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:28,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:28,431 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:28,431 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:28,431 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:28,431 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:28,431 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:28,431 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:28,431 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:28,431 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:28,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:28,433 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:28,434 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:28,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:28,434 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:28,434 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:28,507 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:28,508 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:28,508 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:28,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:28,508 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:28,508 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:28,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1594 [2022-12-06 07:30:28,508 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-06 07:30:28,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:28,508 INFO L85 PathProgramCache]: Analyzing trace with hash -200841462, now seen corresponding path program 1 times [2022-12-06 07:30:28,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:28,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204728682] [2022-12-06 07:30:28,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:28,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:28,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-06 07:30:28,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:28,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204728682] [2022-12-06 07:30:28,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204728682] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:28,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:28,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:28,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394556271] [2022-12-06 07:30:28,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:28,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:28,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:28,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:28,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:28,570 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:28,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:28,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:28,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:28,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:28,606 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:28,607 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:28,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:28,607 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:28,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:28,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:28,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:28,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:28,608 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:28,608 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:28,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:28,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:28,608 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:28,608 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:28,609 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:28,609 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:28,609 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:28,609 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:28,609 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:28,609 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:28,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:28,611 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:28,611 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:28,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:28,612 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:28,612 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:28,687 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:28,687 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:28,688 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:28,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:28,688 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:28,688 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:28,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1595 [2022-12-06 07:30:28,688 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-06 07:30:28,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:28,688 INFO L85 PathProgramCache]: Analyzing trace with hash -174059353, now seen corresponding path program 1 times [2022-12-06 07:30:28,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:28,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688605602] [2022-12-06 07:30:28,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:28,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:28,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-06 07:30:28,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:28,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688605602] [2022-12-06 07:30:28,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688605602] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:28,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:28,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:28,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748899506] [2022-12-06 07:30:28,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:28,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:28,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:28,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:28,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:28,752 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:28,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:28,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:28,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:28,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:28,794 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:28,794 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:28,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:28,795 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:28,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:28,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:28,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:28,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:28,795 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:28,795 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:28,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:28,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:28,796 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:28,796 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:28,796 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:28,796 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:28,796 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:28,796 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:28,796 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:28,796 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:28,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:28,799 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:28,799 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:28,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:28,799 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:28,799 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:28,872 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:28,873 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:28,873 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:28,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:28,873 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:28,873 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:28,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1596 [2022-12-06 07:30:28,873 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-06 07:30:28,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:28,873 INFO L85 PathProgramCache]: Analyzing trace with hash -143583160, now seen corresponding path program 1 times [2022-12-06 07:30:28,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:28,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194992794] [2022-12-06 07:30:28,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:28,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30: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-06 07:30:28,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:28,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194992794] [2022-12-06 07:30:28,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194992794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:28,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:28,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:28,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153153535] [2022-12-06 07:30:28,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:28,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:28,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:28,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:28,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:28,935 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:28,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:28,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:28,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:28,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:28,979 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:28,979 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:28,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:28,980 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:28,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:28,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:28,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:28,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:28,980 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:28,980 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:28,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:28,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:28,981 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:28,981 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:28,981 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:28,981 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:28,981 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:28,981 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:28,981 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:28,982 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:28,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:28,984 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:28,984 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:28,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:28,984 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:28,984 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:29,058 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:29,059 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:29,059 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:29,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:29,059 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:29,059 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:29,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1597 [2022-12-06 07:30:29,059 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-06 07:30:29,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:29,060 INFO L85 PathProgramCache]: Analyzing trace with hash -116801051, now seen corresponding path program 1 times [2022-12-06 07:30:29,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:29,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118134987] [2022-12-06 07:30:29,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:29,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:29,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-06 07:30:29,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:29,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118134987] [2022-12-06 07:30:29,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118134987] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:29,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:29,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:29,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070029042] [2022-12-06 07:30:29,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:29,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:29,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:29,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:29,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:29,136 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:29,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:29,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:29,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:29,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:29,178 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:29,178 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:29,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:29,179 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:29,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:29,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:29,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:29,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:29,180 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:29,180 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:29,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:29,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:29,180 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:29,180 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:29,181 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:29,181 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:29,181 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:29,181 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:29,181 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:29,181 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:29,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:29,183 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:29,183 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:29,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:29,184 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:29,184 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:29,280 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:29,281 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 07:30:29,281 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:29,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:29,282 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:29,282 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:29,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1598 [2022-12-06 07:30:29,282 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-06 07:30:29,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:29,282 INFO L85 PathProgramCache]: Analyzing trace with hash -86324858, now seen corresponding path program 1 times [2022-12-06 07:30:29,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:29,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445408274] [2022-12-06 07:30:29,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:29,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:29,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:29,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-06 07:30:29,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:29,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445408274] [2022-12-06 07:30:29,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445408274] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:29,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:29,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:29,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395046896] [2022-12-06 07:30:29,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:29,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:29,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:29,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:29,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:29,365 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:29,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:29,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:29,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:29,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:29,404 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:29,405 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:29,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:29,405 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:29,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:29,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:29,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:29,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:29,406 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:29,406 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:29,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:29,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:29,406 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:29,407 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:29,407 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:29,407 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:29,407 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:29,407 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:29,407 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:29,407 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:29,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:29,409 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:29,409 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:29,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:29,410 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:29,410 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:29,483 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:29,483 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:30:29,483 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:29,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:29,483 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:29,484 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:29,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1599 [2022-12-06 07:30:29,484 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-06 07:30:29,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:29,484 INFO L85 PathProgramCache]: Analyzing trace with hash -59542749, now seen corresponding path program 1 times [2022-12-06 07:30:29,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:29,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484959242] [2022-12-06 07:30:29,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:29,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:29,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:29,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:29,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484959242] [2022-12-06 07:30:29,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484959242] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:29,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:29,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:29,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237594021] [2022-12-06 07:30:29,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:29,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:29,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:29,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:29,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:29,547 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:29,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:29,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:29,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:29,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:29,581 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:29,581 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:29,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:29,582 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:29,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:29,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:29,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:29,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:29,582 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:29,583 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:29,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:29,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:29,583 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:29,583 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:29,583 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:29,583 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:29,584 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:29,584 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:29,584 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:29,584 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:29,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:29,586 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:29,586 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:29,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:29,586 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:29,586 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:29,660 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:29,661 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:29,661 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:29,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:29,661 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:29,661 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:29,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1600 [2022-12-06 07:30:29,661 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-06 07:30:29,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:29,661 INFO L85 PathProgramCache]: Analyzing trace with hash -29066556, now seen corresponding path program 1 times [2022-12-06 07:30:29,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:29,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992950071] [2022-12-06 07:30:29,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:29,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:29,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-06 07:30:29,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:29,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992950071] [2022-12-06 07:30:29,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992950071] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:29,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:29,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:29,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790386663] [2022-12-06 07:30:29,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:29,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:29,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:29,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:29,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:29,722 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:29,722 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:29,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:29,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:29,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:29,764 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:29,764 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:29,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:29,764 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:29,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:29,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:29,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:29,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:29,765 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:29,765 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:29,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:29,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:29,766 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:29,766 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:29,766 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:29,766 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:29,766 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:29,766 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:29,766 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:29,766 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:29,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:29,768 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:29,768 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:29,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:29,769 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:29,769 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:29,842 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:29,843 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:29,843 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:29,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:29,843 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:29,843 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:29,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1601 [2022-12-06 07:30:29,843 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-06 07:30:29,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:29,843 INFO L85 PathProgramCache]: Analyzing trace with hash -2284447, now seen corresponding path program 1 times [2022-12-06 07:30:29,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:29,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558780680] [2022-12-06 07:30:29,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:29,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:29,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-06 07:30:29,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:29,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558780680] [2022-12-06 07:30:29,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558780680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:29,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:29,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:29,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107344803] [2022-12-06 07:30:29,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:29,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:29,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:29,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:29,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:29,907 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:29,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:29,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:29,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:29,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:29,943 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:29,943 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:29,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:29,944 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:29,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:29,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:29,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:29,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:29,944 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:29,944 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:29,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:29,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:29,945 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:29,945 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:29,945 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:29,945 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:29,945 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:29,945 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:29,945 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:29,946 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:29,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:29,948 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:29,948 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:29,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:29,948 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:29,948 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:30,022 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:30,023 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:30,023 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:30,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:30,023 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:30,023 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:30,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1602 [2022-12-06 07:30:30,023 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-06 07:30:30,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:30,024 INFO L85 PathProgramCache]: Analyzing trace with hash 28191746, now seen corresponding path program 1 times [2022-12-06 07:30:30,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:30,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097213340] [2022-12-06 07:30:30,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:30,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:30,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-06 07:30:30,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:30,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097213340] [2022-12-06 07:30:30,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097213340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:30,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:30,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:30,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997273300] [2022-12-06 07:30:30,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:30,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:30,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:30,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:30,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:30,099 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:30,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:30,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:30,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:30,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:30,137 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:30,137 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:30,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:30,138 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:30,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:30,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:30,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:30,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:30,138 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:30,138 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:30,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:30,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:30,139 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:30,139 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:30,139 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:30,139 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:30,139 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:30,139 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:30,140 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:30,140 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:30,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:30,142 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:30,142 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:30,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:30,142 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:30,142 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:30,218 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:30,218 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:30,218 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:30,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:30,219 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:30,219 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:30,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1603 [2022-12-06 07:30:30,219 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-06 07:30:30,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:30,219 INFO L85 PathProgramCache]: Analyzing trace with hash 54973855, now seen corresponding path program 1 times [2022-12-06 07:30:30,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:30,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616696328] [2022-12-06 07:30:30,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:30,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:30,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-06 07:30:30,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:30,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616696328] [2022-12-06 07:30:30,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616696328] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:30,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:30,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:30,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228233826] [2022-12-06 07:30:30,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:30,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:30,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:30,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:30,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:30,284 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:30,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:30,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:30,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:30,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:30,320 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:30,321 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:30,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:30,321 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:30,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:30,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:30,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:30,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:30,322 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:30,322 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:30,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:30,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:30,323 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:30,323 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:30,323 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:30,323 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:30,323 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:30,323 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:30,323 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:30,323 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:30,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:30,326 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:30,326 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:30,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:30,326 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:30,326 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:30,400 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:30,401 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:30,401 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:30,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:30,401 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:30,401 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:30,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1604 [2022-12-06 07:30:30,402 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-06 07:30:30,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:30,402 INFO L85 PathProgramCache]: Analyzing trace with hash 85450048, now seen corresponding path program 1 times [2022-12-06 07:30:30,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:30,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280619676] [2022-12-06 07:30:30,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:30,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30: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-06 07:30:30,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:30,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280619676] [2022-12-06 07:30:30,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280619676] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:30,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:30,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:30,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846489187] [2022-12-06 07:30:30,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:30,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:30,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:30,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:30,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:30,463 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:30,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:30,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:30,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:30,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:30,504 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:30,504 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:30,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:30,505 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:30,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:30,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:30,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:30,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:30,506 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:30,506 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:30,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:30,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:30,506 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:30,506 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:30,507 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:30,507 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:30,507 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:30,507 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:30,507 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:30,507 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:30,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:30,509 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:30,509 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:30,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:30,509 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:30,509 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:30,584 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:30,585 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:30,585 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:30,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:30,585 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:30,585 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:30,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1605 [2022-12-06 07:30:30,585 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-06 07:30:30,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:30,585 INFO L85 PathProgramCache]: Analyzing trace with hash 112232157, now seen corresponding path program 1 times [2022-12-06 07:30:30,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:30,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447996997] [2022-12-06 07:30:30,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:30,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:30,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-06 07:30:30,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:30,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447996997] [2022-12-06 07:30:30,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447996997] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:30,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:30,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:30,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694665411] [2022-12-06 07:30:30,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:30,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:30,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:30,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:30,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:30,656 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:30,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:30,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:30,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:30,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:30,698 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:30,698 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:30,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:30,698 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:30,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:30,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:30,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:30,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:30,699 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:30,699 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:30,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:30,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:30,700 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:30,700 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:30,700 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:30,700 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:30,700 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:30,700 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:30,700 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:30,700 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:30,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:30,703 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:30,703 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:30,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:30,703 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:30,703 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:30,778 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:30,779 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:30,779 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:30,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:30,779 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:30,779 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:30,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1606 [2022-12-06 07:30:30,779 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-06 07:30:30,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:30,779 INFO L85 PathProgramCache]: Analyzing trace with hash 142708350, now seen corresponding path program 1 times [2022-12-06 07:30:30,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:30,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962496751] [2022-12-06 07:30:30,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:30,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:30,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-06 07:30:30,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:30,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962496751] [2022-12-06 07:30:30,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962496751] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:30,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:30,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:30,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889948576] [2022-12-06 07:30:30,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:30,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:30,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:30,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:30,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:30,842 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:30,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:30,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:30,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:30,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:30,886 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:30,886 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:30,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:30,887 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:30,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:30,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:30,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:30,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:30,887 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:30,888 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:30,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:30,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:30,888 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:30,888 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:30,888 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:30,888 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:30,888 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:30,889 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:30,889 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:30,889 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:30,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:30,891 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:30,891 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:30,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:30,891 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:30,891 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:30,971 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:30,971 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 07:30:30,971 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:30,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:30,972 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:30,972 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:30,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1607 [2022-12-06 07:30:30,972 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-06 07:30:30,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:30,972 INFO L85 PathProgramCache]: Analyzing trace with hash 169490459, now seen corresponding path program 1 times [2022-12-06 07:30:30,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:30,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96150140] [2022-12-06 07:30:30,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:30,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:30,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:31,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-06 07:30:31,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:31,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96150140] [2022-12-06 07:30:31,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96150140] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:31,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:31,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:31,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579378372] [2022-12-06 07:30:31,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:31,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:31,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:31,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:31,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:31,036 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:31,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:31,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:31,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:31,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:31,088 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:31,088 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:31,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:31,089 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:31,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:31,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:31,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:31,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:31,089 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:31,089 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:31,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:31,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:31,090 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:31,090 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:31,091 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:31,091 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:31,091 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:31,091 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:31,091 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:31,091 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:31,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:31,094 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:31,094 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:31,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:31,095 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:31,095 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:31,172 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:31,173 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:30:31,173 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:31,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:31,173 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:31,173 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:31,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1608 [2022-12-06 07:30:31,173 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-06 07:30:31,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:31,173 INFO L85 PathProgramCache]: Analyzing trace with hash 199966652, now seen corresponding path program 1 times [2022-12-06 07:30:31,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:31,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381823680] [2022-12-06 07:30:31,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:31,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:31,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-06 07:30:31,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:31,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381823680] [2022-12-06 07:30:31,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381823680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:31,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:31,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:31,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093489686] [2022-12-06 07:30:31,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:31,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:31,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:31,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:31,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:31,233 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:31,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:31,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:31,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:31,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:31,270 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:31,270 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:31,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:31,270 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:31,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:31,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:31,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:31,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:31,271 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:31,271 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:31,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:31,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:31,272 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:31,272 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:31,272 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:31,272 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:31,272 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:31,272 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:31,272 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:31,272 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:31,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:31,274 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:31,274 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:31,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:31,274 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:31,275 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:31,349 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:31,349 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:31,350 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:31,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:31,350 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:31,350 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:31,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1609 [2022-12-06 07:30:31,350 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-06 07:30:31,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:31,350 INFO L85 PathProgramCache]: Analyzing trace with hash 226748761, now seen corresponding path program 1 times [2022-12-06 07:30:31,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:31,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173213712] [2022-12-06 07:30:31,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:31,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:31,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-06 07:30:31,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:31,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173213712] [2022-12-06 07:30:31,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173213712] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:31,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:31,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:31,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881010408] [2022-12-06 07:30:31,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:31,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:31,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:31,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:31,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:31,430 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:31,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:31,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:31,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:31,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:31,472 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:31,472 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:31,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:31,473 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:31,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:31,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:31,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:31,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:31,474 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:31,474 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:31,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:31,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:31,475 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:31,475 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:31,475 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:31,475 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:31,475 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:31,475 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:31,475 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:31,475 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:31,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:31,478 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:31,478 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:31,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:31,479 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:31,479 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:31,556 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:31,556 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:30:31,556 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:31,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:31,556 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:31,557 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:31,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1610 [2022-12-06 07:30:31,557 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-06 07:30:31,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:31,557 INFO L85 PathProgramCache]: Analyzing trace with hash 257224954, now seen corresponding path program 1 times [2022-12-06 07:30:31,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:31,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223982116] [2022-12-06 07:30:31,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:31,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:31,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-06 07:30:31,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:31,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223982116] [2022-12-06 07:30:31,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223982116] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:31,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:31,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:31,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290143615] [2022-12-06 07:30:31,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:31,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:31,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:31,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:31,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:31,618 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:31,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:31,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:31,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:31,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:31,659 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:31,660 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:31,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:31,660 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:31,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:31,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:31,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:31,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:31,660 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:31,660 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:31,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:31,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:31,661 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:31,661 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:31,661 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:31,661 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:31,661 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:31,662 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:31,662 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:31,662 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:31,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:31,664 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:31,664 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:31,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:31,664 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:31,664 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:31,742 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:31,742 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:30:31,742 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:31,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:31,743 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:31,743 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:31,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1611 [2022-12-06 07:30:31,743 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-06 07:30:31,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:31,743 INFO L85 PathProgramCache]: Analyzing trace with hash 284007063, now seen corresponding path program 1 times [2022-12-06 07:30:31,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:31,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841288330] [2022-12-06 07:30:31,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:31,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:31,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-06 07:30:31,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:31,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841288330] [2022-12-06 07:30:31,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841288330] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:31,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:31,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:31,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144959937] [2022-12-06 07:30:31,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:31,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:31,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:31,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:31,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:31,808 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:31,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:31,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:31,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:31,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:31,849 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:31,849 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:31,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:31,850 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:31,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:31,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:31,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:31,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:31,850 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:31,850 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:31,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:31,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:31,851 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:31,851 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:31,851 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:31,851 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:31,851 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:31,851 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:31,851 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:31,851 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:31,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:31,853 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:31,854 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:31,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:31,854 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:31,854 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:31,927 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:31,928 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:31,928 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:31,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:31,928 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:31,928 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:31,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1612 [2022-12-06 07:30:31,928 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-06 07:30:31,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:31,928 INFO L85 PathProgramCache]: Analyzing trace with hash 314483256, now seen corresponding path program 1 times [2022-12-06 07:30:31,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:31,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80848391] [2022-12-06 07:30:31,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:31,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:31,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:32,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-06 07:30:32,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:32,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80848391] [2022-12-06 07:30:32,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80848391] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:32,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:32,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:32,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897677774] [2022-12-06 07:30:32,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:32,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:32,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:32,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:32,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:32,002 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:32,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:32,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:32,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:32,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:32,039 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:32,039 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:32,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:32,039 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:32,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:32,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:32,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:32,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:32,040 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:32,040 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:32,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:32,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:32,041 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:32,041 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:32,041 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:32,041 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:32,041 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:32,041 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:32,041 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:32,041 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:32,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:32,043 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:32,043 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:32,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:32,044 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:32,044 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:32,127 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:32,127 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-06 07:30:32,127 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:32,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:32,128 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:32,128 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:32,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1613 [2022-12-06 07:30:32,128 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-06 07:30:32,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:32,128 INFO L85 PathProgramCache]: Analyzing trace with hash 341265365, now seen corresponding path program 1 times [2022-12-06 07:30:32,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:32,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961847550] [2022-12-06 07:30:32,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:32,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:32,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-06 07:30:32,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:32,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961847550] [2022-12-06 07:30:32,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961847550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:32,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:32,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:32,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797939683] [2022-12-06 07:30:32,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:32,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:32,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:32,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:32,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:32,192 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:32,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:32,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:32,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:32,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:32,228 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:32,228 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:32,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:32,229 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:32,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:32,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:32,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:32,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:32,229 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:32,229 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:32,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:32,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:32,230 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:32,230 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:32,230 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:32,230 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:32,230 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:32,230 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:32,230 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:32,230 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:32,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:32,232 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:32,233 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:32,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:32,233 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:32,233 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:32,310 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:32,310 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:30:32,310 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:32,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:32,311 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:32,311 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:32,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1614 [2022-12-06 07:30:32,311 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-06 07:30:32,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:32,311 INFO L85 PathProgramCache]: Analyzing trace with hash 371741558, now seen corresponding path program 1 times [2022-12-06 07:30:32,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:32,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105443291] [2022-12-06 07:30:32,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:32,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:32,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-06 07:30:32,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:32,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105443291] [2022-12-06 07:30:32,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105443291] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:32,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:32,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:32,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760244493] [2022-12-06 07:30:32,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:32,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:32,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:32,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:32,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:32,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:32,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:32,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:32,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:32,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:32,408 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:32,408 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:32,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:32,408 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:32,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:32,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:32,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:32,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:32,409 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:32,409 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:32,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:32,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:32,410 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:32,410 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:32,410 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:32,410 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:32,410 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:32,410 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:32,410 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:32,410 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:32,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:32,412 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:32,412 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:32,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:32,413 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:32,413 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:32,486 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:32,487 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:32,487 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:32,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:32,487 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:32,487 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:32,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1615 [2022-12-06 07:30:32,487 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-06 07:30:32,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:32,487 INFO L85 PathProgramCache]: Analyzing trace with hash 398523667, now seen corresponding path program 1 times [2022-12-06 07:30:32,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:32,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138513337] [2022-12-06 07:30:32,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:32,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:32,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-06 07:30:32,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:32,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138513337] [2022-12-06 07:30:32,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138513337] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:32,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:32,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:32,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490685871] [2022-12-06 07:30:32,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:32,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:32,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:32,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:32,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:32,561 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:32,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:32,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:32,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:32,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:32,603 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:32,603 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:32,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:32,603 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:32,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:32,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:32,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:32,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:32,604 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:32,604 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:32,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:32,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:32,605 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:32,605 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:32,605 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:32,605 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:32,605 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:32,605 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:32,605 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:32,605 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:32,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:32,608 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:32,608 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:32,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:32,608 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:32,608 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:32,682 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:32,683 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:32,683 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:32,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:32,683 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:32,683 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:32,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1616 [2022-12-06 07:30:32,683 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-06 07:30:32,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:32,683 INFO L85 PathProgramCache]: Analyzing trace with hash 428999860, now seen corresponding path program 1 times [2022-12-06 07:30:32,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:32,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121963193] [2022-12-06 07:30:32,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:32,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:32,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-06 07:30:32,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:32,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121963193] [2022-12-06 07:30:32,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121963193] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:32,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:32,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:32,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799124038] [2022-12-06 07:30:32,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:32,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:32,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:32,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:32,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:32,743 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:32,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:32,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:32,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:32,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:32,780 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:32,780 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:32,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:32,781 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:32,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:32,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:32,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:32,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:32,781 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:32,781 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:32,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:32,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:32,782 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:32,782 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:32,782 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:32,782 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:32,782 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:32,782 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:32,782 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:32,782 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:32,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:32,785 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:32,785 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:32,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:32,785 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:32,785 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:32,858 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:32,859 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:32,859 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:32,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:32,859 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:32,859 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:32,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1617 [2022-12-06 07:30:32,859 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-06 07:30:32,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:32,860 INFO L85 PathProgramCache]: Analyzing trace with hash 455781969, now seen corresponding path program 1 times [2022-12-06 07:30:32,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:32,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051173512] [2022-12-06 07:30:32,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:32,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:32,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-06 07:30:32,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:32,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051173512] [2022-12-06 07:30:32,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051173512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:32,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:32,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:32,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944628314] [2022-12-06 07:30:32,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:32,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:32,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:32,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:32,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:32,925 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:32,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:32,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:32,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:32,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:32,961 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:32,961 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:32,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:32,961 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:32,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:32,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:32,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:32,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:32,962 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:32,962 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:32,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:32,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:32,963 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:32,963 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:32,963 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:32,963 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:32,963 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:32,963 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:32,963 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:32,963 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:32,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:32,965 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:32,965 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:32,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:32,966 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:32,966 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:33,039 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:33,040 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:33,040 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:33,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:33,040 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:33,040 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:33,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1618 [2022-12-06 07:30:33,040 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-06 07:30:33,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:33,040 INFO L85 PathProgramCache]: Analyzing trace with hash 486258162, now seen corresponding path program 1 times [2022-12-06 07:30:33,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:33,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60374324] [2022-12-06 07:30:33,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:33,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:33,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-06 07:30:33,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:33,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60374324] [2022-12-06 07:30:33,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60374324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:33,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:33,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:33,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921299474] [2022-12-06 07:30:33,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:33,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:33,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:33,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:33,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:33,106 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:33,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:33,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:33,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:33,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:33,149 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:33,149 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:33,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:33,149 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:33,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:33,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:33,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:33,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:33,150 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:33,150 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:33,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:33,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:33,151 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:33,151 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:33,151 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:33,151 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:33,151 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:33,151 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:33,151 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:33,151 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:33,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:33,153 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:33,153 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:33,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:33,154 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:33,154 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:33,227 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:33,227 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:30:33,227 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:33,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:33,227 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:33,228 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:33,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1619 [2022-12-06 07:30:33,228 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-06 07:30:33,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:33,228 INFO L85 PathProgramCache]: Analyzing trace with hash 513040271, now seen corresponding path program 1 times [2022-12-06 07:30:33,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:33,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904905995] [2022-12-06 07:30:33,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:33,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:33,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:33,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-06 07:30:33,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:33,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904905995] [2022-12-06 07:30:33,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904905995] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:33,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:33,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:33,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247236130] [2022-12-06 07:30:33,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:33,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:33,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:33,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:33,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:33,291 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:33,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:33,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:33,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:33,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:33,332 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:33,332 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:33,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:33,332 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:33,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:33,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:33,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:33,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:33,333 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:33,333 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:33,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:33,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:33,334 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:33,334 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:33,334 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:33,334 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:33,334 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:33,334 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:33,334 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:33,334 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:33,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:33,336 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:33,336 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:33,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:33,337 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:33,337 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:33,409 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:33,410 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:30:33,410 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:33,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:33,410 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:33,410 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:33,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1620 [2022-12-06 07:30:33,410 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-06 07:30:33,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:33,411 INFO L85 PathProgramCache]: Analyzing trace with hash 543516464, now seen corresponding path program 1 times [2022-12-06 07:30:33,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:33,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966247365] [2022-12-06 07:30:33,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:33,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:33,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-06 07:30:33,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:33,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966247365] [2022-12-06 07:30:33,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966247365] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:33,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:33,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:33,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242460059] [2022-12-06 07:30:33,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:33,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:33,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:33,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:33,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:33,474 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:33,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:33,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:33,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:33,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:33,510 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:33,510 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:33,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:33,511 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:33,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:33,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:33,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:33,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:33,511 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:33,511 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:33,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:33,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:33,512 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:33,512 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:33,512 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:33,512 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:33,512 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:33,512 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:33,512 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:33,512 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:33,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:33,515 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:33,515 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:33,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:33,515 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:33,515 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:33,589 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:33,590 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:33,590 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:33,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:33,590 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:33,590 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:33,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1621 [2022-12-06 07:30:33,590 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-06 07:30:33,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:33,590 INFO L85 PathProgramCache]: Analyzing trace with hash 570298573, now seen corresponding path program 1 times [2022-12-06 07:30:33,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:33,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993284936] [2022-12-06 07:30:33,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:33,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:33,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-06 07:30:33,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:33,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993284936] [2022-12-06 07:30:33,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993284936] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:33,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:33,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:33,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781241002] [2022-12-06 07:30:33,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:33,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:33,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:33,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:33,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:33,653 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:33,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:33,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:33,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:33,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:33,695 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:33,695 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:33,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:33,695 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:33,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:33,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:33,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:33,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:33,696 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:33,696 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:33,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:33,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:33,697 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:33,697 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:33,697 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:33,697 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:33,697 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:33,697 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:33,697 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:33,697 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:33,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:33,699 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:33,699 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:33,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:33,700 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:33,700 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:33,774 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:33,774 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:33,774 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:33,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:33,774 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:33,775 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:33,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1622 [2022-12-06 07:30:33,775 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-06 07:30:33,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:33,775 INFO L85 PathProgramCache]: Analyzing trace with hash 600774766, now seen corresponding path program 1 times [2022-12-06 07:30:33,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:33,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083173678] [2022-12-06 07:30:33,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:33,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:33,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30: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-06 07:30:33,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:33,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083173678] [2022-12-06 07:30:33,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083173678] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:33,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:33,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:33,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244390405] [2022-12-06 07:30:33,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:33,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:33,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:33,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:33,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:33,838 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:33,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:33,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:33,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:33,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:33,879 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:33,880 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:33,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:33,880 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:33,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:33,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:33,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:33,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:33,881 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:33,881 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:33,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:33,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:33,881 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:33,881 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:33,881 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:33,882 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:33,882 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:33,882 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:33,882 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:33,882 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:33,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:33,884 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:33,884 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:33,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:33,884 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:33,884 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:33,957 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:33,958 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:30:33,958 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:33,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:33,958 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:33,958 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:33,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1623 [2022-12-06 07:30:33,958 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-06 07:30:33,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:33,958 INFO L85 PathProgramCache]: Analyzing trace with hash 627556875, now seen corresponding path program 1 times [2022-12-06 07:30:33,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:33,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972018680] [2022-12-06 07:30:33,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:33,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:33,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:34,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-06 07:30:34,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:34,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972018680] [2022-12-06 07:30:34,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972018680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:34,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:34,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:34,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042690010] [2022-12-06 07:30:34,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:34,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:34,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:34,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:34,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:34,033 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:34,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:34,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:34,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:34,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:34,069 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:34,069 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:34,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:34,070 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:34,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:34,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:34,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:34,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:34,070 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:34,070 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:34,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:34,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:34,071 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:34,071 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:34,071 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:34,071 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:34,071 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:34,072 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:34,072 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:34,072 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:34,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:34,074 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:34,074 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:34,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:34,074 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:34,074 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:34,147 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:34,148 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:34,148 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:34,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:34,148 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:34,148 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:34,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1624 [2022-12-06 07:30:34,148 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-06 07:30:34,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:34,149 INFO L85 PathProgramCache]: Analyzing trace with hash 658033068, now seen corresponding path program 1 times [2022-12-06 07:30:34,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:34,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439896808] [2022-12-06 07:30:34,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:34,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:34,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-06 07:30:34,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:34,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439896808] [2022-12-06 07:30:34,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439896808] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:34,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:34,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:34,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576029460] [2022-12-06 07:30:34,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:34,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:34,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:34,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:34,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:34,209 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:34,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:34,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:34,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:34,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:34,245 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:34,246 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:34,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:34,246 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:34,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:34,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:34,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:34,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:34,247 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:34,247 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:34,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:34,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:34,247 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:34,247 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:34,247 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:34,247 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:34,248 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:34,248 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:34,248 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:34,248 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:34,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:34,250 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:34,250 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:34,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:34,250 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:34,250 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:34,324 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:34,324 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:34,324 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:34,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:34,324 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:34,325 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:34,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1625 [2022-12-06 07:30:34,325 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-06 07:30:34,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:34,325 INFO L85 PathProgramCache]: Analyzing trace with hash 684815177, now seen corresponding path program 1 times [2022-12-06 07:30:34,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:34,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529537433] [2022-12-06 07:30:34,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:34,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:34,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-06 07:30:34,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:34,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529537433] [2022-12-06 07:30:34,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529537433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:34,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:34,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:34,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753987069] [2022-12-06 07:30:34,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:34,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:34,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:34,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:34,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:34,389 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:34,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:34,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:34,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:34,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:34,430 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:34,430 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:34,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:34,431 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:34,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:34,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:34,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:34,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:34,431 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:34,431 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:34,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:34,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:34,432 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:34,432 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:34,432 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:34,432 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:34,432 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:34,432 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:34,432 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:34,432 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:34,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:34,434 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:34,435 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:34,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:34,435 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:34,435 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:34,507 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:34,508 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:30:34,508 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:34,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:34,508 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:34,508 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:34,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1626 [2022-12-06 07:30:34,508 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-06 07:30:34,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:34,508 INFO L85 PathProgramCache]: Analyzing trace with hash 715291370, now seen corresponding path program 1 times [2022-12-06 07:30:34,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:34,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026534404] [2022-12-06 07:30:34,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:34,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:34,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:34,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-06 07:30:34,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:34,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026534404] [2022-12-06 07:30:34,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026534404] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:34,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:34,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:34,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955811250] [2022-12-06 07:30:34,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:34,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:34,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:34,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:34,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:34,569 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:34,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:34,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:34,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:34,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:34,605 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:34,605 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:34,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:34,606 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:34,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:34,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:34,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:34,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:34,606 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:34,606 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:34,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:34,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:34,607 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:34,607 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:34,607 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:34,607 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:34,607 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:34,607 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:34,607 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:34,607 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:34,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:34,610 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:34,610 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:34,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:34,610 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:34,610 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:34,685 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:34,686 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:34,686 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:34,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:34,686 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:34,686 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:34,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1627 [2022-12-06 07:30:34,686 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-06 07:30:34,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:34,686 INFO L85 PathProgramCache]: Analyzing trace with hash 742073479, now seen corresponding path program 1 times [2022-12-06 07:30:34,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:34,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278977133] [2022-12-06 07:30:34,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:34,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:34,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-06 07:30:34,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:34,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278977133] [2022-12-06 07:30:34,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278977133] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:34,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:34,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:34,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436109875] [2022-12-06 07:30:34,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:34,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:34,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:34,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:34,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:34,750 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:34,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:34,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:34,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:34,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:34,786 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:34,786 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:34,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:34,787 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:34,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:34,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:34,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:34,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:34,787 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:34,787 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:34,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:34,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:34,788 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:34,788 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:34,788 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:34,788 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:34,788 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:34,788 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:34,788 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:34,788 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:34,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:34,790 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:34,791 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:34,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:34,791 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:34,791 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:34,865 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:34,865 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:34,865 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:34,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:34,865 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:34,866 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:34,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1628 [2022-12-06 07:30:34,866 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-06 07:30:34,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:34,866 INFO L85 PathProgramCache]: Analyzing trace with hash 772549672, now seen corresponding path program 1 times [2022-12-06 07:30:34,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:34,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701632280] [2022-12-06 07:30:34,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:34,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:34,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-06 07:30:34,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:34,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701632280] [2022-12-06 07:30:34,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701632280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:34,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:34,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:34,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717703894] [2022-12-06 07:30:34,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:34,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:34,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:34,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:34,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:34,938 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:34,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:34,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:34,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:34,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:34,980 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:34,980 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:34,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:34,981 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:34,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:34,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:34,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:34,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:34,981 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:34,981 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:34,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:34,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:34,982 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:34,982 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:34,982 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:34,982 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:34,982 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:34,983 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:34,983 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:34,983 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:34,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:34,985 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:34,985 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:34,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:34,985 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:34,985 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:35,060 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:35,060 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:35,060 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:35,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:35,061 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:35,061 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:35,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1629 [2022-12-06 07:30:35,061 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-06 07:30:35,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:35,061 INFO L85 PathProgramCache]: Analyzing trace with hash 799331781, now seen corresponding path program 1 times [2022-12-06 07:30:35,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:35,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865734703] [2022-12-06 07:30:35,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:35,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:35,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:35,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-06 07:30:35,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:35,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865734703] [2022-12-06 07:30:35,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865734703] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:35,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:35,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:35,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737485178] [2022-12-06 07:30:35,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:35,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:35,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:35,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:35,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:35,124 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:35,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:35,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:35,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:35,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:35,163 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:35,163 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:35,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:35,164 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:35,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:35,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:35,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:35,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:35,164 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:35,164 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:35,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:35,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:35,165 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:35,165 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:35,165 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:35,165 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:35,165 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:35,165 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:35,165 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:35,165 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:35,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:35,168 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:35,168 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:35,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:35,168 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:35,168 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:35,241 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:35,241 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:30:35,241 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:35,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:35,242 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:35,242 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:35,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1630 [2022-12-06 07:30:35,242 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-06 07:30:35,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:35,242 INFO L85 PathProgramCache]: Analyzing trace with hash 829807974, now seen corresponding path program 1 times [2022-12-06 07:30:35,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:35,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664190551] [2022-12-06 07:30:35,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:35,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:35,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-06 07:30:35,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:35,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664190551] [2022-12-06 07:30:35,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664190551] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:35,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:35,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:35,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444207695] [2022-12-06 07:30:35,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:35,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:35,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:35,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:35,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:35,304 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:35,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:35,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:35,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:35,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:35,345 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:35,346 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:35,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:35,346 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:35,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:35,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:35,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:35,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:35,346 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:35,347 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:35,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:35,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:35,347 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:35,347 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:35,347 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:35,347 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:35,347 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:35,348 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:35,348 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:35,348 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:35,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:35,350 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:35,350 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:35,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:35,350 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:35,350 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:35,425 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:35,426 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:35,426 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:35,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:35,426 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:35,426 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:35,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1631 [2022-12-06 07:30:35,426 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-06 07:30:35,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:35,427 INFO L85 PathProgramCache]: Analyzing trace with hash 856590083, now seen corresponding path program 1 times [2022-12-06 07:30:35,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:35,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911704780] [2022-12-06 07:30:35,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:35,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:35,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:35,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:35,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911704780] [2022-12-06 07:30:35,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911704780] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:35,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:35,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:35,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149989207] [2022-12-06 07:30:35,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:35,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:35,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:35,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:35,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:35,491 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:35,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:35,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:35,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:35,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:35,527 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:35,527 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:35,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:35,528 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:35,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:35,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:35,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:35,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:35,528 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:35,528 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:35,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:35,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:35,529 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:35,529 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:35,529 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:35,529 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:35,529 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:35,529 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:35,529 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:35,530 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:35,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:35,532 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:35,532 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:35,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:35,532 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:35,532 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:35,606 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:35,607 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:35,607 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:35,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:35,607 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:35,607 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:35,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1632 [2022-12-06 07:30:35,608 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-06 07:30:35,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:35,608 INFO L85 PathProgramCache]: Analyzing trace with hash 887066276, now seen corresponding path program 1 times [2022-12-06 07:30:35,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:35,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584956616] [2022-12-06 07:30:35,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:35,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:35,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:35,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:35,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584956616] [2022-12-06 07:30:35,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584956616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:35,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:35,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:35,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503006544] [2022-12-06 07:30:35,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:35,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:35,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:35,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:35,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:35,669 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:35,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:35,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:35,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:35,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:35,711 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:35,712 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:35,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:35,712 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:35,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:35,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:35,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:35,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:35,713 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:35,713 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:35,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:35,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:35,713 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:35,713 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:35,713 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:35,714 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:35,714 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:35,714 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:35,714 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:35,714 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:35,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:35,716 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:35,716 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:35,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:35,716 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:35,716 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:35,793 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:35,794 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:30:35,794 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:35,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:35,794 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:35,794 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:35,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1633 [2022-12-06 07:30:35,794 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-06 07:30:35,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:35,794 INFO L85 PathProgramCache]: Analyzing trace with hash 913848385, now seen corresponding path program 1 times [2022-12-06 07:30:35,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:35,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733376042] [2022-12-06 07:30:35,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:35,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:35,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-06 07:30:35,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:35,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733376042] [2022-12-06 07:30:35,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733376042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:35,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:35,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:35,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127304493] [2022-12-06 07:30:35,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:35,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:35,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:35,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:35,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:35,870 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:35,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:35,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:35,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:35,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:35,905 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:35,905 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:35,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:35,906 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:35,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:35,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:35,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:35,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:35,906 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:35,906 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:35,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:35,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:35,907 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:35,907 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:35,907 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:35,907 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:35,907 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:35,907 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:35,907 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:35,907 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:35,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:35,910 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:35,910 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:35,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:35,910 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:35,910 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:35,986 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:35,986 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:35,986 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:35,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:35,987 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:35,987 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:35,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1634 [2022-12-06 07:30:35,987 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-06 07:30:35,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:35,987 INFO L85 PathProgramCache]: Analyzing trace with hash 944324578, now seen corresponding path program 1 times [2022-12-06 07:30:35,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:35,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612576779] [2022-12-06 07:30:35,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:35,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:36,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-06 07:30:36,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:36,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612576779] [2022-12-06 07:30:36,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612576779] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:36,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:36,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:36,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296244041] [2022-12-06 07:30:36,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:36,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:36,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:36,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:36,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:36,049 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:36,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:36,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:36,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:36,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:36,092 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:36,092 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:36,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:36,093 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:36,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:36,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:36,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:36,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:36,093 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:36,093 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:36,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:36,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:36,094 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:36,094 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:36,094 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:36,094 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:36,094 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:36,094 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:36,094 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:36,094 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:36,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:36,097 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:36,097 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:36,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:36,097 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:36,097 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:36,172 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:36,173 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:36,173 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:36,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:36,174 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:36,174 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:36,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1635 [2022-12-06 07:30:36,174 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-06 07:30:36,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:36,174 INFO L85 PathProgramCache]: Analyzing trace with hash 971106687, now seen corresponding path program 1 times [2022-12-06 07:30:36,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:36,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17809844] [2022-12-06 07:30:36,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:36,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:36,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-06 07:30:36,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:36,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17809844] [2022-12-06 07:30:36,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17809844] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:36,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:36,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:36,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762421881] [2022-12-06 07:30:36,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:36,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:36,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:36,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:36,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:36,255 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:36,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:36,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:36,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:36,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:36,296 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:36,297 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:36,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 371 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:36,297 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:36,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:36,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:36,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:36,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:36,298 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:36,298 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:36,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:36,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:36,299 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:36,299 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:36,299 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:36,299 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:36,299 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:36,299 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:36,300 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:36,300 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:36,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:36,302 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:36,302 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:36,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:36,303 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:36,303 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:36,393 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:36,394 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 07:30:36,394 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:36,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:36,394 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:36,395 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:36,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1636 [2022-12-06 07:30:36,395 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-06 07:30:36,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:36,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1001582880, now seen corresponding path program 1 times [2022-12-06 07:30:36,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:36,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832356619] [2022-12-06 07:30:36,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:36,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:36,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-06 07:30:36,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:36,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832356619] [2022-12-06 07:30:36,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832356619] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:36,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:36,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:36,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602364895] [2022-12-06 07:30:36,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:36,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:36,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:36,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:36,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:36,521 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:36,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:36,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:36,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:36,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:36,575 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:36,575 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:36,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:36,576 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:36,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:36,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:36,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:36,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:36,577 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:36,577 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:36,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:36,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:36,577 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:36,578 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:36,578 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:36,578 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:36,578 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:36,578 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:36,578 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:36,578 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:36,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:36,581 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:36,581 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:36,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:36,581 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:36,582 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:36,671 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:36,672 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 07:30:36,672 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:36,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:36,672 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:36,672 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:36,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1637 [2022-12-06 07:30:36,672 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-06 07:30:36,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:36,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1028364989, now seen corresponding path program 1 times [2022-12-06 07:30:36,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:36,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232229271] [2022-12-06 07:30:36,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:36,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:36,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-06 07:30:36,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:36,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232229271] [2022-12-06 07:30:36,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232229271] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:36,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:36,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:36,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702622083] [2022-12-06 07:30:36,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:36,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:36,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:36,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:36,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:36,749 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:36,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:36,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:36,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:36,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:36,785 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:36,785 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:36,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:36,786 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:36,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:36,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:36,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:36,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:36,786 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:36,787 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:36,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:36,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:36,787 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:36,787 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:36,787 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:36,788 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:36,788 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:36,788 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:36,788 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:36,788 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:36,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:36,790 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:36,790 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:36,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:36,790 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:36,790 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:36,865 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:36,866 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:36,866 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:36,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:36,866 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:36,866 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:36,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1638 [2022-12-06 07:30:36,866 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-06 07:30:36,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:36,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1058841182, now seen corresponding path program 1 times [2022-12-06 07:30:36,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:36,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366384675] [2022-12-06 07:30:36,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:36,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:36,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-06 07:30:36,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:36,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366384675] [2022-12-06 07:30:36,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366384675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:36,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:36,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:36,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016966451] [2022-12-06 07:30:36,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:36,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:36,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:36,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:36,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:36,940 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:36,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:36,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:36,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:36,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:36,983 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:36,983 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:36,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:36,984 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:36,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:36,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:36,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:36,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:36,984 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:36,984 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:36,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:36,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:36,985 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:36,985 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:36,985 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:36,985 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:36,985 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:36,985 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:36,985 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:36,985 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:36,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:36,988 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:36,988 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:36,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:36,988 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:36,988 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:37,064 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:37,065 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:30:37,065 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:37,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:37,065 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:37,065 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:37,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1639 [2022-12-06 07:30:37,065 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-06 07:30:37,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:37,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1085623291, now seen corresponding path program 1 times [2022-12-06 07:30:37,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:37,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054020721] [2022-12-06 07:30:37,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:37,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:37,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-06 07:30:37,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:37,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054020721] [2022-12-06 07:30:37,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054020721] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:37,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:37,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:37,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086670059] [2022-12-06 07:30:37,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:37,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:37,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:37,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:37,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:37,130 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:37,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:37,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:37,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:37,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:37,165 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:37,165 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:37,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:37,166 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:37,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:37,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:37,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:37,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:37,167 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:37,167 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:37,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:37,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:37,167 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:37,167 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:37,168 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:37,168 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:37,168 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:37,168 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:37,168 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:37,168 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:37,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:37,170 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:37,170 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:37,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:37,171 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:37,171 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:37,247 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:37,248 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:30:37,248 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:37,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:37,248 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:37,248 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:37,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1640 [2022-12-06 07:30:37,248 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-06 07:30:37,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:37,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1116099484, now seen corresponding path program 1 times [2022-12-06 07:30:37,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:37,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856840084] [2022-12-06 07:30:37,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:37,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:37,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-06 07:30:37,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:37,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856840084] [2022-12-06 07:30:37,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856840084] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:37,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:37,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:37,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435248392] [2022-12-06 07:30:37,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:37,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:37,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:37,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:37,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:37,310 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:37,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:37,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:37,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:37,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:37,346 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:37,346 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:37,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:37,347 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:37,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:37,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:37,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:37,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:37,347 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:37,348 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:37,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:37,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:37,348 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:37,348 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:37,348 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:37,348 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:37,348 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:37,349 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:37,349 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:37,349 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:37,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:37,351 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:37,351 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:37,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:37,351 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:37,351 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:37,425 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:37,426 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:37,426 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:37,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:37,426 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:37,426 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:37,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1641 [2022-12-06 07:30:37,426 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-06 07:30:37,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:37,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1142881593, now seen corresponding path program 1 times [2022-12-06 07:30:37,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:37,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917622535] [2022-12-06 07:30:37,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:37,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:37,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:37,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:37,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917622535] [2022-12-06 07:30:37,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917622535] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:37,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:37,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:37,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994682639] [2022-12-06 07:30:37,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:37,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:37,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:37,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:37,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:37,491 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:37,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:37,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:37,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:37,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:37,527 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:37,528 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:37,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:37,528 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:37,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:37,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:37,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:37,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:37,529 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:37,529 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:37,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:37,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:37,529 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:37,529 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:37,530 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:37,530 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:37,530 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:37,530 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:37,530 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:37,530 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:37,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:37,532 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:37,532 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:37,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:37,533 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:37,533 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:37,609 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:37,609 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:37,610 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:37,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:37,610 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:37,610 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:37,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1642 [2022-12-06 07:30:37,610 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-06 07:30:37,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:37,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1173357786, now seen corresponding path program 1 times [2022-12-06 07:30:37,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:37,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337035153] [2022-12-06 07:30:37,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:37,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:37,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-06 07:30:37,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:37,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337035153] [2022-12-06 07:30:37,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337035153] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:37,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:37,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:37,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444677912] [2022-12-06 07:30:37,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:37,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:37,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:37,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:37,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:37,674 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:37,674 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:37,674 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:37,674 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:37,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:37,717 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:37,717 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:37,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:37,717 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:37,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:37,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:37,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:37,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:37,718 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:37,718 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:37,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:37,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:37,719 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:37,719 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:37,719 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:37,719 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:37,719 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:37,719 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:37,719 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:37,719 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:37,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:37,721 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:37,721 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:37,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:37,722 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:37,722 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:37,798 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:37,799 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:30:37,799 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:37,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:37,799 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:37,799 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:37,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1643 [2022-12-06 07:30:37,799 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-06 07:30:37,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:37,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1200139895, now seen corresponding path program 1 times [2022-12-06 07:30:37,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:37,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2366137] [2022-12-06 07:30:37,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:37,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:37,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:37,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:37,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2366137] [2022-12-06 07:30:37,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2366137] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:37,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:37,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:37,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025860147] [2022-12-06 07:30:37,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:37,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:37,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:37,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:37,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:37,875 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:37,875 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:37,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:37,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:37,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:37,912 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:37,912 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:37,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:37,913 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:37,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:37,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:37,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:37,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:37,913 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:37,913 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:37,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:37,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:37,914 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:37,914 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:37,914 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:37,914 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:37,914 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:37,914 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:37,914 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:37,914 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:37,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:37,917 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:37,917 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:37,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:37,917 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:37,917 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:37,989 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:37,989 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:30:37,989 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:37,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:37,989 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:37,990 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:37,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1644 [2022-12-06 07:30:37,990 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-06 07:30:37,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:37,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1230616088, now seen corresponding path program 1 times [2022-12-06 07:30:37,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:37,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865785101] [2022-12-06 07:30:37,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:37,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:38,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:38,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:38,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865785101] [2022-12-06 07:30:38,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865785101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:38,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:38,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:38,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766494444] [2022-12-06 07:30:38,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:38,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:38,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:38,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:38,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:38,051 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:38,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:38,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:38,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:38,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:38,088 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:38,088 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:38,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:38,088 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:38,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:38,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:38,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:38,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:38,089 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:38,089 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:38,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:38,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:38,090 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:38,090 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:38,090 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:38,090 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:38,090 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:38,090 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:38,090 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:38,090 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:38,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:38,092 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:38,092 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:38,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:38,093 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:38,093 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:38,165 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:38,166 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:30:38,166 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:38,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:38,166 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:38,166 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:38,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1645 [2022-12-06 07:30:38,166 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-06 07:30:38,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:38,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1257398197, now seen corresponding path program 1 times [2022-12-06 07:30:38,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:38,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901568918] [2022-12-06 07:30:38,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:38,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:38,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:38,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:38,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901568918] [2022-12-06 07:30:38,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901568918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:38,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:38,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:38,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856363405] [2022-12-06 07:30:38,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:38,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:38,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:38,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:38,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:38,230 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:38,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:38,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:38,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:38,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:38,271 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:38,271 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:38,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:38,271 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:38,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:38,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:38,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:38,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:38,272 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:38,272 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:38,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:38,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:38,272 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:38,272 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:38,272 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:38,273 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:38,273 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:38,273 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:38,273 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:38,273 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:38,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:38,275 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:38,275 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:38,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 144 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:38,275 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:38,275 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:38,350 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:38,351 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:38,351 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:38,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:38,351 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:38,351 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:38,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1646 [2022-12-06 07:30:38,351 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-06 07:30:38,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:38,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1287874390, now seen corresponding path program 1 times [2022-12-06 07:30:38,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:38,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658167441] [2022-12-06 07:30:38,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:38,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:38,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-06 07:30:38,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:38,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658167441] [2022-12-06 07:30:38,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658167441] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:38,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:38,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:38,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715163918] [2022-12-06 07:30:38,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:38,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:38,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:38,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:38,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:38,415 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:38,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:38,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:38,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:38,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:38,452 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:38,452 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:38,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:38,452 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:38,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:38,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:38,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:38,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:38,453 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:38,453 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:38,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:38,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:38,454 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:38,454 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:38,454 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:38,454 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:38,454 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:38,454 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:38,454 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:38,454 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:38,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:38,456 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:38,456 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:38,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:38,457 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:38,457 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:38,532 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:38,533 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:38,533 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:38,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:38,533 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:38,533 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:38,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1647 [2022-12-06 07:30:38,533 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-06 07:30:38,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:38,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1314656499, now seen corresponding path program 1 times [2022-12-06 07:30:38,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:38,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969705608] [2022-12-06 07:30:38,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:38,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:38,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-06 07:30:38,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:38,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969705608] [2022-12-06 07:30:38,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969705608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:38,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:38,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:38,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663433039] [2022-12-06 07:30:38,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:38,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:38,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:38,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:38,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:38,598 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:38,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:38,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:38,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:38,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:38,634 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:38,634 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:38,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:38,635 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:38,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:38,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:38,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:38,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:38,635 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:38,635 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:38,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:38,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:38,636 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:38,636 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:38,636 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:38,636 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:38,636 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:38,637 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:38,637 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:38,637 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:38,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:38,639 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:38,639 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:38,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:38,639 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:38,639 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:38,713 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:38,714 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:38,714 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:38,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:38,714 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:38,714 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:38,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1648 [2022-12-06 07:30:38,714 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-06 07:30:38,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:38,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1345132692, now seen corresponding path program 1 times [2022-12-06 07:30:38,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:38,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643302565] [2022-12-06 07:30:38,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:38,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:38,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-06 07:30:38,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:38,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643302565] [2022-12-06 07:30:38,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643302565] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:38,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:38,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:38,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098078103] [2022-12-06 07:30:38,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:38,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:38,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:38,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:38,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:38,779 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:38,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:38,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:38,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:38,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:38,829 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:38,829 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:38,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:38,830 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:38,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:38,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:38,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:38,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:38,831 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:38,831 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:38,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:38,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:38,831 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:38,831 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:38,831 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:38,832 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:38,832 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:38,832 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:38,832 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:38,832 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:38,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:38,834 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:38,834 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:38,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:38,834 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:38,834 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:38,910 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:38,911 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:38,911 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:38,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:38,911 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:38,911 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:38,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1649 [2022-12-06 07:30:38,911 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-06 07:30:38,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:38,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1371914801, now seen corresponding path program 1 times [2022-12-06 07:30:38,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:38,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733583277] [2022-12-06 07:30:38,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:38,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:38,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-06 07:30:38,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:38,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733583277] [2022-12-06 07:30:38,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733583277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:38,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:38,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:38,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835357094] [2022-12-06 07:30:38,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:38,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:38,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:38,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:38,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:38,976 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:38,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:38,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:38,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:38,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:39,018 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:39,018 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:39,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 356 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:39,018 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:39,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:39,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:39,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:39,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:39,019 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:39,019 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:39,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:39,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:39,020 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:39,020 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:39,020 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:39,020 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:39,020 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:39,020 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:39,020 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:39,020 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:39,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:39,022 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:39,023 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:39,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:39,023 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:39,023 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:39,097 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:39,098 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:39,098 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:39,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:39,098 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:39,098 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:39,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1650 [2022-12-06 07:30:39,098 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-06 07:30:39,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:39,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1402390994, now seen corresponding path program 1 times [2022-12-06 07:30:39,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:39,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116706290] [2022-12-06 07:30:39,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:39,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:39,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-06 07:30:39,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:39,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116706290] [2022-12-06 07:30:39,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116706290] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:39,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:39,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:39,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088557483] [2022-12-06 07:30:39,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:39,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:39,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:39,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:39,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:39,160 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:39,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:39,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:39,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:39,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:39,196 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:39,197 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:39,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:39,197 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:39,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:39,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:39,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:39,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:39,198 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:39,198 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:39,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:39,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:39,198 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:39,198 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:39,199 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:39,199 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:39,199 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:39,199 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:39,199 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:39,199 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:39,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:39,201 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:39,201 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:39,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:39,201 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:39,201 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:39,275 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:39,275 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:30:39,276 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:39,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:39,276 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:39,276 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:39,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1651 [2022-12-06 07:30:39,276 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-06 07:30:39,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:39,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1429173103, now seen corresponding path program 1 times [2022-12-06 07:30:39,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:39,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661422694] [2022-12-06 07:30:39,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:39,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:39,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-06 07:30:39,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:39,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661422694] [2022-12-06 07:30:39,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661422694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:39,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:39,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:39,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749974459] [2022-12-06 07:30:39,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:39,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:39,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:39,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:39,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:39,341 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:39,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:39,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:39,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:39,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:39,380 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:39,380 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:39,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:39,380 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:39,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:39,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:39,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:39,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:39,381 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:39,381 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:39,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:39,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:39,382 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:39,382 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:39,382 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:39,382 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:39,382 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:39,382 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:39,382 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:39,382 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:39,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:39,384 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:39,384 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:39,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:39,385 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:39,385 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:39,458 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:39,459 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:39,459 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:39,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:39,459 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:39,459 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:39,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1652 [2022-12-06 07:30:39,459 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-06 07:30:39,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:39,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1459649296, now seen corresponding path program 1 times [2022-12-06 07:30:39,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:39,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22747243] [2022-12-06 07:30:39,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:39,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:39,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:39,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-06 07:30:39,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:39,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22747243] [2022-12-06 07:30:39,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22747243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:39,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:39,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:39,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883534477] [2022-12-06 07:30:39,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:39,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:39,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:39,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:39,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:39,521 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:39,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:39,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:39,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:39,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:39,558 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:39,558 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:39,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:39,559 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:39,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:39,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:39,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:39,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:39,559 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:39,559 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:39,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:39,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:39,560 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:39,560 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:39,560 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:39,560 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:39,560 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:39,560 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:39,560 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:39,560 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:39,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:39,563 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:39,563 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:39,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:39,563 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:39,563 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:39,639 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:39,639 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:39,639 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:39,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:39,640 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:39,640 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:39,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1653 [2022-12-06 07:30:39,640 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-06 07:30:39,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:39,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1486431405, now seen corresponding path program 1 times [2022-12-06 07:30:39,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:39,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097412126] [2022-12-06 07:30:39,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:39,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:39,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:39,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-06 07:30:39,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:39,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097412126] [2022-12-06 07:30:39,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097412126] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:39,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:39,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:39,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399546776] [2022-12-06 07:30:39,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:39,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:39,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:39,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:39,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:39,704 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:39,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:39,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:39,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:39,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:39,745 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:39,746 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:39,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:39,746 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:39,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:39,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:39,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:39,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:39,747 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:39,747 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:39,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:39,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:39,756 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:39,756 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:39,756 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:39,756 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:39,756 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:39,756 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:39,756 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:39,757 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:39,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:39,759 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:39,759 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:39,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:39,759 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:39,759 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:39,832 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:39,833 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:39,833 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:39,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:39,833 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:39,833 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:39,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1654 [2022-12-06 07:30:39,833 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-06 07:30:39,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:39,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1516907598, now seen corresponding path program 1 times [2022-12-06 07:30:39,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:39,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443484231] [2022-12-06 07:30:39,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:39,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:39,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-06 07:30:39,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:39,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443484231] [2022-12-06 07:30:39,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443484231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:39,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:39,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:39,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270516003] [2022-12-06 07:30:39,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:39,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:39,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:39,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:39,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:39,897 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:39,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:39,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:39,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:39,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:39,938 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:39,938 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:39,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:39,938 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:39,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:39,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:39,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:39,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:39,939 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:39,939 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:39,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:39,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:39,939 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:39,940 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:39,940 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:39,940 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:39,940 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:39,940 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:39,940 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:39,940 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:39,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:39,942 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:39,942 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:39,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:39,942 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:39,942 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:40,016 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:40,017 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:40,017 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:40,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:40,017 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:40,017 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:40,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1655 [2022-12-06 07:30:40,017 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-06 07:30:40,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:40,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1543689707, now seen corresponding path program 1 times [2022-12-06 07:30:40,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:40,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406557852] [2022-12-06 07:30:40,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:40,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:40,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-06 07:30:40,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:40,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406557852] [2022-12-06 07:30:40,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406557852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:40,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:40,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:40,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551354220] [2022-12-06 07:30:40,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:40,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:40,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:40,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:40,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:40,089 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:40,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:40,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:40,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:40,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:40,137 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:40,138 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:40,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:40,138 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:40,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:40,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:40,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:40,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:40,139 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:40,139 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:40,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:40,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:40,140 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:40,140 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:40,140 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:40,140 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:40,140 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:40,141 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:40,141 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:40,141 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:40,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:40,144 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:40,144 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:40,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:40,144 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:40,144 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:40,238 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:40,239 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 07:30:40,239 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:40,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:40,239 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:40,239 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:40,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1656 [2022-12-06 07:30:40,239 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-06 07:30:40,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:40,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1574165900, now seen corresponding path program 1 times [2022-12-06 07:30:40,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:40,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586437716] [2022-12-06 07:30:40,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:40,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:40,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-06 07:30:40,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:40,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586437716] [2022-12-06 07:30:40,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586437716] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:40,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:40,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:40,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957633723] [2022-12-06 07:30:40,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:40,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:40,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:40,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:40,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:40,318 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:40,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:40,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:40,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:40,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:40,366 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:40,367 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:40,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:40,367 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:40,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:40,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:40,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:40,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:40,368 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:40,368 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:40,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:40,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:40,368 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:40,368 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:40,368 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:40,369 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:40,369 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:40,369 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:40,369 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:40,369 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:40,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:40,371 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:40,371 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:40,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:40,371 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:40,371 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:40,444 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:40,445 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:30:40,445 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:40,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:40,445 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:40,445 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:40,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1657 [2022-12-06 07:30:40,445 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-06 07:30:40,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:40,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1600948009, now seen corresponding path program 1 times [2022-12-06 07:30:40,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:40,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728547270] [2022-12-06 07:30:40,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:40,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:40,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-06 07:30:40,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:40,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728547270] [2022-12-06 07:30:40,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728547270] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:40,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:40,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:40,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623380968] [2022-12-06 07:30:40,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:40,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:40,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:40,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:40,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:40,512 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:40,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:40,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:40,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:40,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:40,546 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:40,546 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:40,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:40,547 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:40,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:40,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:40,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:40,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:40,547 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:40,547 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:40,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:40,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:40,548 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:40,548 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:40,548 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:40,548 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:40,548 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:40,548 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:40,548 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:40,548 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:40,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:40,550 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:40,550 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:40,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:40,551 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:40,551 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:40,625 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:40,626 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:40,626 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:40,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:40,626 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:40,626 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:40,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1658 [2022-12-06 07:30:40,627 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-06 07:30:40,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:40,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1631424202, now seen corresponding path program 1 times [2022-12-06 07:30:40,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:40,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239563299] [2022-12-06 07:30:40,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:40,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:40,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:40,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-06 07:30:40,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:40,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239563299] [2022-12-06 07:30:40,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239563299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:40,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:40,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:40,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667207095] [2022-12-06 07:30:40,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:40,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:40,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:40,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:40,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:40,687 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:40,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:40,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:40,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:40,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:40,729 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:40,729 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:40,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:40,729 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:40,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:40,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:40,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:40,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:40,730 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:40,730 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:40,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:40,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:40,730 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:40,731 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:40,731 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:40,731 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:40,731 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:40,731 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:40,731 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:40,731 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:40,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:40,733 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:40,733 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:40,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:40,733 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:40,733 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:40,815 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:40,816 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 07:30:40,816 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:40,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:40,816 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:40,816 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:40,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1659 [2022-12-06 07:30:40,816 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-06 07:30:40,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:40,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1658206311, now seen corresponding path program 1 times [2022-12-06 07:30:40,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:40,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37555288] [2022-12-06 07:30:40,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:40,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:40,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-06 07:30:40,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:40,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37555288] [2022-12-06 07:30:40,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37555288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:40,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:40,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:40,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908112986] [2022-12-06 07:30:40,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:40,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:40,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:40,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:40,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:40,880 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:40,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:40,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:40,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:40,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:40,914 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:40,914 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:40,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:40,915 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:40,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:40,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:40,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:40,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:40,915 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:40,915 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:40,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:40,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:40,916 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:40,916 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:40,916 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:40,916 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:40,916 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:40,917 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:40,917 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:40,917 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:40,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:40,919 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:40,919 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:40,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:40,919 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:40,919 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:40,997 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:40,998 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:30:40,998 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:40,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:40,998 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:40,998 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:40,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1660 [2022-12-06 07:30:40,998 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-06 07:30:40,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:40,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1688682504, now seen corresponding path program 1 times [2022-12-06 07:30:40,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:40,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130204992] [2022-12-06 07:30:40,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:40,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:41,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-06 07:30:41,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:41,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130204992] [2022-12-06 07:30:41,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130204992] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:41,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:41,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:41,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799715590] [2022-12-06 07:30:41,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:41,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:41,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:41,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:41,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:41,058 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:41,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:41,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:41,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:41,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:41,100 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:41,100 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:41,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:41,101 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:41,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:41,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:41,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:41,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:41,101 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:41,101 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:41,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:41,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:41,102 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:41,102 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:41,102 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:41,102 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:41,102 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:41,102 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:41,102 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:41,102 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:41,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:41,105 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:41,105 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:41,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:41,105 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:41,105 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:41,178 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:41,179 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:41,179 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:41,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:41,179 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:41,179 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:41,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1661 [2022-12-06 07:30:41,179 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-06 07:30:41,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:41,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1715464613, now seen corresponding path program 1 times [2022-12-06 07:30:41,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:41,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206138040] [2022-12-06 07:30:41,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:41,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:41,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:41,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:41,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206138040] [2022-12-06 07:30:41,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206138040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:41,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:41,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:41,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624701103] [2022-12-06 07:30:41,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:41,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:41,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:41,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:41,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:41,243 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:41,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:41,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:41,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:41,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:41,279 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:41,279 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:41,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:41,279 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:41,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:41,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:41,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:41,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:41,280 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:41,280 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:41,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:41,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:41,281 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:41,281 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:41,281 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:41,281 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:41,281 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:41,281 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:41,281 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:41,281 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:41,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:41,283 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:41,283 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:41,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:41,284 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:41,284 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:41,358 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:41,359 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:41,359 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:41,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:41,359 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:41,359 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:41,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1662 [2022-12-06 07:30:41,359 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-06 07:30:41,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:41,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1745940806, now seen corresponding path program 1 times [2022-12-06 07:30:41,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:41,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513676239] [2022-12-06 07:30:41,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:41,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:41,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:41,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-06 07:30:41,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:41,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513676239] [2022-12-06 07:30:41,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513676239] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:41,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:41,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:41,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968399151] [2022-12-06 07:30:41,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:41,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:41,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:41,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:41,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:41,420 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:41,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:41,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:41,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:41,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:41,462 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:41,462 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:41,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:41,462 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:41,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:41,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:41,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:41,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:41,463 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:41,463 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:41,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:41,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:41,464 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:41,464 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:41,464 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:41,464 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:41,464 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:41,464 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:41,464 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:41,464 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:41,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:41,466 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:41,467 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:41,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:41,467 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:41,467 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:41,540 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:41,541 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:41,541 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:41,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:41,541 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:41,541 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:41,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1663 [2022-12-06 07:30:41,541 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-06 07:30:41,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:41,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1772722915, now seen corresponding path program 1 times [2022-12-06 07:30:41,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:41,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124286647] [2022-12-06 07:30:41,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:41,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:41,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-06 07:30:41,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:41,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124286647] [2022-12-06 07:30:41,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124286647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:41,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:41,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:41,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907651408] [2022-12-06 07:30:41,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:41,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:41,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:41,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:41,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:41,604 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:41,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:41,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:41,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:41,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:41,638 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:41,638 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:41,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:41,639 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:41,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:41,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:41,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:41,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:41,639 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:41,640 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:41,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:41,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:41,640 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:41,640 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:41,640 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:41,640 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:41,641 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:41,641 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:41,641 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:41,641 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:41,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:41,643 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:41,643 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:41,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:41,643 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:41,643 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:41,718 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:41,718 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:41,718 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:41,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:41,718 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:41,719 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:41,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1664 [2022-12-06 07:30:41,719 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-06 07:30:41,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:41,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1803199108, now seen corresponding path program 1 times [2022-12-06 07:30:41,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:41,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664914324] [2022-12-06 07:30:41,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:41,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:41,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:41,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:41,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664914324] [2022-12-06 07:30:41,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664914324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:41,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:41,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:41,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376804770] [2022-12-06 07:30:41,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:41,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:41,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:41,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:41,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:41,786 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:41,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:41,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:41,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:41,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:41,828 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:41,828 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:41,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:41,828 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:41,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:41,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:41,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:41,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:41,829 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:41,829 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:41,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:41,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:41,829 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:41,830 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:41,830 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:41,830 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:41,830 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:41,830 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:41,830 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:41,830 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:41,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:41,832 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:41,832 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:41,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:41,833 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:41,833 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:41,905 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:41,905 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:30:41,905 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:41,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:41,905 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:41,906 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:41,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1665 [2022-12-06 07:30:41,906 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-06 07:30:41,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:41,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1829981217, now seen corresponding path program 1 times [2022-12-06 07:30:41,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:41,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117164481] [2022-12-06 07:30:41,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:41,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:41,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-06 07:30:41,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:41,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117164481] [2022-12-06 07:30:41,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117164481] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:41,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:41,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:41,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796626454] [2022-12-06 07:30:41,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:41,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:41,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:41,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:41,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:41,970 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:41,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:41,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:41,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:41,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:42,006 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:42,006 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:42,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:42,006 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:42,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:42,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:42,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:42,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:42,007 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:42,007 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:42,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:42,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:42,008 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:42,008 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:42,008 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:42,008 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:42,008 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:42,008 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:42,008 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:42,008 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:42,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:42,010 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:42,010 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:42,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:42,011 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:42,011 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:42,085 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:42,086 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:42,086 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:42,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:42,086 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:42,086 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:42,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1666 [2022-12-06 07:30:42,086 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-06 07:30:42,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:42,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1860457410, now seen corresponding path program 1 times [2022-12-06 07:30:42,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:42,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403789076] [2022-12-06 07:30:42,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:42,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:42,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-06 07:30:42,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:42,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403789076] [2022-12-06 07:30:42,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403789076] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:42,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:42,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:42,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098047370] [2022-12-06 07:30:42,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:42,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:42,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:42,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:42,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:42,153 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:42,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:42,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:42,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:42,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:42,189 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:42,189 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:42,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:42,189 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:42,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:42,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:42,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:42,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:42,190 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:42,190 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:42,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:42,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:42,191 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:42,191 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:42,191 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:42,191 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:42,191 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:42,191 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:42,191 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:42,191 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:42,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:42,193 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:42,194 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:42,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:42,194 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:42,194 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:42,267 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:42,268 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:42,268 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:42,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:42,268 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:42,268 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:42,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1667 [2022-12-06 07:30:42,268 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-06 07:30:42,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:42,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1887239519, now seen corresponding path program 1 times [2022-12-06 07:30:42,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:42,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067485570] [2022-12-06 07:30:42,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:42,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:42,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30: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-06 07:30:42,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:42,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067485570] [2022-12-06 07:30:42,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067485570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:42,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:42,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:42,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152193214] [2022-12-06 07:30:42,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:42,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:42,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:42,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:42,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:42,338 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:42,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:42,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:42,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:42,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:42,379 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:42,380 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:42,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:42,380 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:42,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:42,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:42,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:42,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:42,381 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:42,381 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:42,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:42,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:42,381 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:42,381 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:42,381 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:42,382 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:42,382 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:42,382 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:42,382 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:42,382 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:42,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:42,384 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:42,384 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:42,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:42,384 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:42,384 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:42,459 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:42,459 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:42,459 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:42,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:42,459 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:42,459 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:42,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1668 [2022-12-06 07:30:42,460 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-06 07:30:42,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:42,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1917715712, now seen corresponding path program 1 times [2022-12-06 07:30:42,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:42,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576378050] [2022-12-06 07:30:42,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:42,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:42,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-06 07:30:42,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:42,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576378050] [2022-12-06 07:30:42,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576378050] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:42,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:42,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:42,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354821696] [2022-12-06 07:30:42,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:42,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:42,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:42,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:42,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:42,520 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:42,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:42,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:42,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:42,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:42,557 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:42,557 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:42,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:42,557 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:42,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:42,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:42,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:42,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:42,558 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:42,558 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:42,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:42,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:42,558 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:42,558 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:42,559 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:42,559 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:42,559 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:42,559 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:42,559 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:42,559 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:42,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:42,561 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:42,561 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:42,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:42,561 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:42,561 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:42,636 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:42,636 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:42,636 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:42,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:42,637 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:42,637 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:42,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1669 [2022-12-06 07:30:42,637 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-06 07:30:42,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:42,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1944497821, now seen corresponding path program 1 times [2022-12-06 07:30:42,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:42,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388232284] [2022-12-06 07:30:42,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:42,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:42,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-06 07:30:42,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:42,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388232284] [2022-12-06 07:30:42,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388232284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:42,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:42,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:42,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191288439] [2022-12-06 07:30:42,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:42,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:42,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:42,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:42,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:42,711 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:42,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:42,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:42,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:42,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:42,752 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:42,753 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:42,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:42,753 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:42,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:42,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:42,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:42,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:42,754 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:42,754 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:42,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:42,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:42,754 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:42,754 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:42,755 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:42,755 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:42,755 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:42,755 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:42,755 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:42,755 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:42,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:42,757 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:42,757 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:42,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 146 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:42,757 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:42,758 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:42,831 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:42,832 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:42,832 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:42,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:42,832 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:42,832 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:42,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1670 [2022-12-06 07:30:42,832 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-06 07:30:42,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:42,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1974974014, now seen corresponding path program 1 times [2022-12-06 07:30:42,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:42,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51493962] [2022-12-06 07:30:42,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:42,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:42,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-06 07:30:42,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:42,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51493962] [2022-12-06 07:30:42,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51493962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:42,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:42,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:42,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839362923] [2022-12-06 07:30:42,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:42,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:42,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:42,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:42,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:42,895 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:42,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:42,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:42,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:42,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:42,931 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:42,932 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:42,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:42,932 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:42,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:42,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:42,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:42,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:42,933 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:42,933 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:42,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:42,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:42,933 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:42,933 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:42,934 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:42,934 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:42,934 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:42,934 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:42,934 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:42,934 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:42,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:42,936 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:42,936 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:42,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:42,936 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:42,936 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:43,013 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:43,013 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:43,013 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:43,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:43,014 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:43,014 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:43,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1671 [2022-12-06 07:30:43,014 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-06 07:30:43,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:43,014 INFO L85 PathProgramCache]: Analyzing trace with hash 2001756123, now seen corresponding path program 1 times [2022-12-06 07:30:43,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:43,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083408714] [2022-12-06 07:30:43,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:43,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:43,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-06 07:30:43,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:43,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083408714] [2022-12-06 07:30:43,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083408714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:43,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:43,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:43,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280942610] [2022-12-06 07:30:43,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:43,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:43,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:43,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:43,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:43,080 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:43,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:43,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:43,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:43,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:43,136 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:43,137 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:43,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:43,137 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:43,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:43,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:43,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:43,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:43,138 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:43,138 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:43,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:43,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:43,138 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:43,139 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:43,139 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:43,139 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:43,139 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:43,139 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:43,139 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:43,139 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:43,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:43,141 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:43,141 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:43,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:43,142 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:43,142 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:43,215 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:43,216 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:43,216 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:43,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:43,216 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:43,216 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:43,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1672 [2022-12-06 07:30:43,216 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-06 07:30:43,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:43,216 INFO L85 PathProgramCache]: Analyzing trace with hash 2032232316, now seen corresponding path program 1 times [2022-12-06 07:30:43,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:43,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254362010] [2022-12-06 07:30:43,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:43,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:43,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-06 07:30:43,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:43,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254362010] [2022-12-06 07:30:43,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254362010] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:43,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:43,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:43,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108646718] [2022-12-06 07:30:43,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:43,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:43,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:43,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:43,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:43,286 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:43,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:43,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:43,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:43,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:43,322 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:43,322 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:43,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:43,322 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:43,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:43,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:43,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:43,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:43,323 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:43,323 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:43,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:43,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:43,324 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:43,324 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:43,324 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:43,324 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:43,324 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:43,324 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:43,324 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:43,324 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:43,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:43,326 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:43,326 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:43,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 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 116. Up to 16 conditions per place. [2022-12-06 07:30:43,327 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:43,327 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:43,401 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:43,402 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:43,402 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:43,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:43,402 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:43,402 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:43,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1673 [2022-12-06 07:30:43,402 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-06 07:30:43,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:43,402 INFO L85 PathProgramCache]: Analyzing trace with hash 2059014425, now seen corresponding path program 1 times [2022-12-06 07:30:43,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:43,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325289873] [2022-12-06 07:30:43,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:43,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:43,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-06 07:30:43,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:43,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325289873] [2022-12-06 07:30:43,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325289873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:43,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:43,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:43,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679279102] [2022-12-06 07:30:43,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:43,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:43,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:43,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:43,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:43,469 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:43,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:43,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:43,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:43,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:43,506 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:43,507 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:43,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:43,507 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:43,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:43,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:43,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:43,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:43,508 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:43,508 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:43,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:43,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:43,508 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:43,509 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:43,509 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:43,509 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:43,509 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:43,509 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:43,509 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:43,509 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:43,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:43,511 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:43,511 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:43,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:43,512 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:43,512 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:43,587 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:43,588 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:43,588 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:43,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:43,588 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:43,588 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:43,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1674 [2022-12-06 07:30:43,588 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-06 07:30:43,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:43,588 INFO L85 PathProgramCache]: Analyzing trace with hash 2089490618, now seen corresponding path program 1 times [2022-12-06 07:30:43,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:43,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597138699] [2022-12-06 07:30:43,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:43,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:43,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-06 07:30:43,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:43,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597138699] [2022-12-06 07:30:43,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597138699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:43,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:43,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:43,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019514622] [2022-12-06 07:30:43,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:43,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:43,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:43,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:43,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:43,667 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:43,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:43,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:43,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:43,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:43,709 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:43,709 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:43,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:43,710 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:43,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:43,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:43,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:43,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:43,710 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:43,710 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:43,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:43,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:43,711 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:43,711 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:43,711 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:43,711 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:43,711 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:43,712 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:43,712 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:43,712 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:43,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:43,714 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:43,714 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:43,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:43,714 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:43,714 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:43,789 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:43,789 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:43,790 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:43,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:43,790 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:43,790 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:43,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1675 [2022-12-06 07:30:43,790 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-06 07:30:43,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:43,790 INFO L85 PathProgramCache]: Analyzing trace with hash 2116272727, now seen corresponding path program 1 times [2022-12-06 07:30:43,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:43,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340191380] [2022-12-06 07:30:43,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:43,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:43,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-06 07:30:43,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:43,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340191380] [2022-12-06 07:30:43,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340191380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:43,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:43,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:43,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624084380] [2022-12-06 07:30:43,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:43,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:43,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:43,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:43,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:43,855 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:43,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:43,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:43,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:43,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:43,891 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:43,891 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:43,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:43,891 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:43,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:43,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:43,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:43,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:43,892 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:43,892 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:43,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:43,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:43,892 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:43,892 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:43,893 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:43,893 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:43,893 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:43,893 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:43,893 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:43,893 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:43,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:43,895 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:43,895 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:43,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:43,895 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:43,895 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:43,976 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:43,977 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:30:43,977 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:43,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:43,977 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:43,977 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:43,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1676 [2022-12-06 07:30:43,977 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-06 07:30:43,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:43,977 INFO L85 PathProgramCache]: Analyzing trace with hash 2146748920, now seen corresponding path program 1 times [2022-12-06 07:30:43,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:43,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726730691] [2022-12-06 07:30:43,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:43,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:44,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-06 07:30:44,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:44,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726730691] [2022-12-06 07:30:44,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726730691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:44,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:44,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:44,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395307557] [2022-12-06 07:30:44,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:44,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:44,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:44,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:44,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:44,041 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:44,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:44,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:44,042 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:44,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:44,080 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:44,080 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:44,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:44,081 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:44,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:44,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:44,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:44,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:44,081 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:44,081 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:44,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:44,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:44,082 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:44,082 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:44,082 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:44,082 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:44,082 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:44,082 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:44,082 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:44,082 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:44,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:44,085 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:44,085 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:44,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:44,085 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:44,085 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:44,159 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:44,159 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:44,159 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:44,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:44,159 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:44,160 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:44,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1677 [2022-12-06 07:30:44,160 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-06 07:30:44,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:44,160 INFO L85 PathProgramCache]: Analyzing trace with hash -2121436267, now seen corresponding path program 1 times [2022-12-06 07:30:44,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:44,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383742559] [2022-12-06 07:30:44,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:44,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:44,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-06 07:30:44,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:44,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383742559] [2022-12-06 07:30:44,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383742559] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:44,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:44,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:44,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956027362] [2022-12-06 07:30:44,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:44,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:44,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:44,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:44,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:44,225 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:44,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:44,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:44,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:44,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:44,264 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:44,264 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:44,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:44,264 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:44,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:44,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:44,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:44,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:44,265 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:44,265 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:44,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:44,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:44,265 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:44,265 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:44,266 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:44,266 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:44,266 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:44,266 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:44,266 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:44,266 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:44,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:44,268 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:44,268 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:44,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:44,268 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:44,269 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:44,343 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:44,343 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:44,343 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:44,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:44,343 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:44,344 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:44,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1678 [2022-12-06 07:30:44,344 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-06 07:30:44,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:44,344 INFO L85 PathProgramCache]: Analyzing trace with hash -2090960074, now seen corresponding path program 1 times [2022-12-06 07:30:44,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:44,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128253342] [2022-12-06 07:30:44,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:44,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:44,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-06 07:30:44,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:44,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128253342] [2022-12-06 07:30:44,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128253342] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:44,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:44,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:44,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834353721] [2022-12-06 07:30:44,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:44,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:44,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:44,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:44,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:44,405 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:44,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:44,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:44,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:44,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:44,448 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:44,448 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:44,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:44,448 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:44,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:44,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:44,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:44,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:44,449 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:44,449 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:44,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:44,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:44,449 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:44,450 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:44,450 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:44,450 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:44,450 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:44,450 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:44,450 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:44,450 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:44,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:44,452 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:44,452 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:44,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:44,452 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:44,453 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:44,526 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:44,527 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:44,527 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:44,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:44,527 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:44,527 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:44,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1679 [2022-12-06 07:30:44,527 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-06 07:30:44,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:44,527 INFO L85 PathProgramCache]: Analyzing trace with hash -2064177965, now seen corresponding path program 1 times [2022-12-06 07:30:44,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:44,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241379997] [2022-12-06 07:30:44,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:44,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:44,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-06 07:30:44,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:44,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241379997] [2022-12-06 07:30:44,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241379997] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:44,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:44,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:44,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141529172] [2022-12-06 07:30:44,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:44,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:44,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:44,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:44,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:44,607 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:44,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:44,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:44,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:44,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:44,648 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:44,648 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:44,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:44,649 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:44,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:44,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:44,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:44,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:44,649 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:44,649 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:44,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:44,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:44,650 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:44,650 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:44,650 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:44,650 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:44,650 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:44,650 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:44,650 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:44,651 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:44,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:44,653 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:44,653 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:44,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:44,653 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:44,653 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:44,728 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:44,729 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:44,729 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:44,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:44,729 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:44,729 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:44,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1680 [2022-12-06 07:30:44,729 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-06 07:30:44,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:44,729 INFO L85 PathProgramCache]: Analyzing trace with hash -2033701772, now seen corresponding path program 1 times [2022-12-06 07:30:44,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:44,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077553346] [2022-12-06 07:30:44,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:44,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:44,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-06 07:30:44,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:44,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077553346] [2022-12-06 07:30:44,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077553346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:44,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:44,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:44,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279732242] [2022-12-06 07:30:44,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:44,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:44,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:44,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:44,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:44,791 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:44,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:44,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:44,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:44,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:44,828 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:44,829 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:44,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:44,829 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:44,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:44,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:44,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:44,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:44,830 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:44,830 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:44,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:44,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:44,830 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:44,831 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:44,831 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:44,831 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:44,831 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:44,831 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:44,831 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:44,831 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:44,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:44,833 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:44,833 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:44,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:44,834 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:44,834 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:44,910 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:44,911 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:30:44,911 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:44,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:44,911 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:44,911 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:44,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1681 [2022-12-06 07:30:44,911 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-06 07:30:44,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:44,911 INFO L85 PathProgramCache]: Analyzing trace with hash -2006919663, now seen corresponding path program 1 times [2022-12-06 07:30:44,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:44,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091476014] [2022-12-06 07:30:44,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:44,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:44,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-06 07:30:44,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:44,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091476014] [2022-12-06 07:30:44,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091476014] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:44,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:44,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:44,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722100776] [2022-12-06 07:30:44,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:44,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:44,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:44,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:44,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:44,979 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:44,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:44,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:44,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:44,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:45,021 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:45,022 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:45,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:45,022 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:45,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:45,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:45,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:45,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:45,023 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:45,023 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:45,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:45,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:45,024 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:45,024 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:45,024 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:45,024 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:45,024 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:45,024 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:45,024 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:45,024 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:45,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:45,026 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:45,026 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:45,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:45,027 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:45,027 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:45,102 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:45,103 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:45,103 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:45,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:45,103 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:45,103 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:45,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1682 [2022-12-06 07:30:45,103 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-06 07:30:45,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:45,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1976443470, now seen corresponding path program 1 times [2022-12-06 07:30:45,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:45,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572923284] [2022-12-06 07:30:45,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:45,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:45,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:45,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:45,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572923284] [2022-12-06 07:30:45,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572923284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:45,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:45,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:45,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039667190] [2022-12-06 07:30:45,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:45,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:45,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:45,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:45,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:45,167 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:45,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:45,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:45,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:45,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:45,203 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:45,203 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:45,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:45,204 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:45,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:45,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:45,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:45,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:45,205 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:45,205 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:45,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:45,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:45,206 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:45,206 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:45,206 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:45,206 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:45,206 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:45,206 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:45,206 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:45,206 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:45,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:45,209 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:45,209 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:45,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:45,209 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:45,209 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:45,286 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:45,287 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:30:45,287 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:45,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:45,287 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:45,287 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:45,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1683 [2022-12-06 07:30:45,287 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-06 07:30:45,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:45,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1949661361, now seen corresponding path program 1 times [2022-12-06 07:30:45,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:45,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112462018] [2022-12-06 07:30:45,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:45,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:45,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-06 07:30:45,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:45,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112462018] [2022-12-06 07:30:45,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112462018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:45,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:45,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:45,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636898603] [2022-12-06 07:30:45,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:45,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:45,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:45,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:45,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:45,356 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:45,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:45,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:45,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:45,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:45,395 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:45,395 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:45,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:45,395 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:45,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:45,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:45,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:45,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:45,396 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:45,396 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:45,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:45,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:45,397 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:45,397 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:45,397 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:45,397 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:45,397 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:45,397 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:45,397 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:45,397 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:45,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:45,399 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:45,399 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:45,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:45,400 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:45,400 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:45,473 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:45,474 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:45,474 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:45,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:45,474 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:45,474 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:45,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1684 [2022-12-06 07:30:45,474 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-06 07:30:45,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:45,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1919185168, now seen corresponding path program 1 times [2022-12-06 07:30:45,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:45,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875895558] [2022-12-06 07:30:45,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:45,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:45,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-06 07:30:45,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:45,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875895558] [2022-12-06 07:30:45,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875895558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:45,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:45,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:45,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781202539] [2022-12-06 07:30:45,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:45,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:45,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:45,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:45,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:45,550 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:45,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:45,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:45,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:45,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:45,586 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:45,586 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:45,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:45,587 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:45,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:45,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:45,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:45,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:45,587 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:45,587 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:45,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:45,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:45,588 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:45,588 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:45,588 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:45,588 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:45,588 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:45,588 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:45,588 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:45,588 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:45,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:45,591 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:45,591 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:45,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:45,591 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:45,591 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:45,664 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:45,665 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:45,665 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:45,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:45,665 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:45,665 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:45,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1685 [2022-12-06 07:30:45,665 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-06 07:30:45,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:45,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1892403059, now seen corresponding path program 1 times [2022-12-06 07:30:45,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:45,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449390424] [2022-12-06 07:30:45,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:45,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:45,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-06 07:30:45,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:45,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449390424] [2022-12-06 07:30:45,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449390424] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:45,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:45,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:45,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210862946] [2022-12-06 07:30:45,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:45,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:45,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:45,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:45,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:45,731 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:45,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:45,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:45,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:45,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:45,773 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:45,773 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:45,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 370 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:45,774 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:45,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:45,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:45,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:45,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:45,775 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:45,775 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:45,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:45,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:45,775 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:45,775 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:45,775 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:45,776 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:45,776 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:45,776 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:45,776 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:45,776 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:45,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:45,778 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:45,778 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:45,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:45,778 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:45,778 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:45,854 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:45,855 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:45,855 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:45,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:45,855 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:45,855 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:45,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1686 [2022-12-06 07:30:45,855 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-06 07:30:45,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:45,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1861926866, now seen corresponding path program 1 times [2022-12-06 07:30:45,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:45,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422809423] [2022-12-06 07:30:45,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:45,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:45,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-06 07:30:45,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:45,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422809423] [2022-12-06 07:30:45,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422809423] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:45,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:45,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:45,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585681288] [2022-12-06 07:30:45,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:45,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:45,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:45,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:45,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:45,917 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:45,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:45,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:45,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:45,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:45,958 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:45,958 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:45,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:45,959 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:45,959 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:45,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:45,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:45,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:45,959 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:45,959 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:45,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:45,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:45,960 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:45,960 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:45,960 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:45,960 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:45,960 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:45,960 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:45,961 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:45,961 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:45,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:45,963 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:45,963 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:45,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 118 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:45,963 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:45,963 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:46,037 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:46,038 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:46,038 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:46,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:46,038 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:46,038 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:46,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1687 [2022-12-06 07:30:46,038 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-06 07:30:46,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:46,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1835144757, now seen corresponding path program 1 times [2022-12-06 07:30:46,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:46,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937016441] [2022-12-06 07:30:46,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:46,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:46,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-06 07:30:46,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:46,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937016441] [2022-12-06 07:30:46,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937016441] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:46,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:46,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:46,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411680019] [2022-12-06 07:30:46,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:46,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:46,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:46,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:46,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:46,104 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:46,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:46,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:46,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:46,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:46,140 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:46,140 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:46,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:46,141 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:46,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:46,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:46,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:46,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:46,142 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:46,142 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:46,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:46,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:46,142 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:46,142 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:46,143 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:46,143 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:46,143 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:46,143 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:46,143 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:46,143 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:46,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:46,145 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:46,145 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:46,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:46,146 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:46,146 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:46,221 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:46,221 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:46,221 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:46,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:46,222 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:46,222 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:46,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1688 [2022-12-06 07:30:46,222 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-06 07:30:46,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:46,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1804668564, now seen corresponding path program 1 times [2022-12-06 07:30:46,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:46,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432603233] [2022-12-06 07:30:46,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:46,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:46,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:46,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:46,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432603233] [2022-12-06 07:30:46,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432603233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:46,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:46,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:46,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055169260] [2022-12-06 07:30:46,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:46,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:46,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:46,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:46,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:46,287 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:46,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:46,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:46,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:46,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:46,324 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:46,324 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:46,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:46,324 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:46,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:46,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:46,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:46,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:46,325 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:46,325 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:46,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:46,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:46,326 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:46,326 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:46,326 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:46,326 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:46,326 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:46,326 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:46,326 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:46,326 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:46,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:46,328 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:46,328 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:46,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:46,329 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:46,329 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:46,404 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:46,404 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:46,404 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:46,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:46,404 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:46,404 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:46,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1689 [2022-12-06 07:30:46,405 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-06 07:30:46,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:46,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1777886455, now seen corresponding path program 1 times [2022-12-06 07:30:46,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:46,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998751690] [2022-12-06 07:30:46,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:46,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:46,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-06 07:30:46,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:46,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998751690] [2022-12-06 07:30:46,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998751690] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:46,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:46,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:46,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418331832] [2022-12-06 07:30:46,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:46,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:46,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:46,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:46,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:46,483 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:46,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:46,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:46,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:46,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:46,519 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:46,519 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:46,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:46,520 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:46,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:46,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:46,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:46,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:46,520 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:46,520 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:46,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:46,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:46,521 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:46,521 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:46,521 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:46,521 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:46,521 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:46,521 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:46,521 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:46,521 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:46,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:46,524 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:46,524 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:46,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:46,524 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:46,524 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:46,598 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:46,599 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:46,599 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:46,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:46,599 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:46,599 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:46,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1690 [2022-12-06 07:30:46,600 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-06 07:30:46,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:46,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1747410262, now seen corresponding path program 1 times [2022-12-06 07:30:46,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:46,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283962270] [2022-12-06 07:30:46,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:46,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:46,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30: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-06 07:30:46,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:46,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283962270] [2022-12-06 07:30:46,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283962270] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:46,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:46,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:46,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533341917] [2022-12-06 07:30:46,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:46,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:46,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:46,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:46,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:46,664 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:46,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:46,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:46,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:46,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:46,706 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:46,706 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:46,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:46,706 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:46,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:46,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:46,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:46,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:46,707 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:46,707 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:46,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:46,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:46,708 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:46,708 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:46,708 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:46,708 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:46,708 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:46,708 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:46,708 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:46,708 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:46,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:46,710 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:46,710 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:46,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:46,711 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:46,711 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:46,785 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:46,785 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:46,786 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:46,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:46,786 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:46,786 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:46,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1691 [2022-12-06 07:30:46,786 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-06 07:30:46,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:46,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1720628153, now seen corresponding path program 1 times [2022-12-06 07:30:46,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:46,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356377657] [2022-12-06 07:30:46,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:46,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:46,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:46,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-06 07:30:46,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:46,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356377657] [2022-12-06 07:30:46,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356377657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:46,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:46,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:46,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980103146] [2022-12-06 07:30:46,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:46,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:46,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:46,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:46,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:46,850 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:46,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:46,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:46,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:46,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:46,886 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:46,886 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:46,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:46,887 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:46,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:46,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:46,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:46,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:46,888 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:46,888 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:46,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:46,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:46,888 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:46,888 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:46,888 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:46,888 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:46,889 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:46,889 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:46,889 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:46,889 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:46,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:46,891 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:46,891 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:46,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:46,891 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:46,891 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:46,965 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:46,966 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:46,966 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:46,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:46,966 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:46,966 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:46,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1692 [2022-12-06 07:30:46,966 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-06 07:30:46,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:46,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1690151960, now seen corresponding path program 1 times [2022-12-06 07:30:46,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:46,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655789230] [2022-12-06 07:30:46,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:46,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:46,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:47,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-06 07:30:47,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:47,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655789230] [2022-12-06 07:30:47,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655789230] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:47,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:47,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:47,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523550544] [2022-12-06 07:30:47,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:47,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:47,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:47,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:47,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:47,030 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:47,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:47,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:47,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:47,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:47,073 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:47,073 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:47,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:47,074 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:47,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:47,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:47,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:47,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:47,074 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:47,074 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:47,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:47,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:47,075 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:47,075 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:47,075 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:47,075 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:47,075 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:47,076 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:47,076 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:47,076 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:47,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:47,078 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:47,078 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:47,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:47,078 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:47,078 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:47,153 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:47,154 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:47,154 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:47,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:47,154 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:47,154 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:47,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1693 [2022-12-06 07:30:47,154 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-06 07:30:47,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:47,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1663369851, now seen corresponding path program 1 times [2022-12-06 07:30:47,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:47,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919085298] [2022-12-06 07:30:47,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:47,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:47,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-06 07:30:47,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:47,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919085298] [2022-12-06 07:30:47,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919085298] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:47,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:47,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:47,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157044036] [2022-12-06 07:30:47,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:47,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:47,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:47,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:47,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:47,219 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:47,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:47,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:47,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:47,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:47,257 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:47,257 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:47,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:47,258 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:47,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:47,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:47,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:47,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:47,258 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:47,258 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:47,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:47,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:47,259 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:47,259 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:47,259 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:47,259 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:47,259 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:47,260 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:47,260 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:47,260 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:47,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:47,262 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:47,262 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:47,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:47,262 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:47,262 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:47,336 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:47,337 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:47,337 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:47,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:47,337 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:47,337 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:47,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1694 [2022-12-06 07:30:47,338 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-06 07:30:47,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:47,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1632893658, now seen corresponding path program 1 times [2022-12-06 07:30:47,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:47,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130909077] [2022-12-06 07:30:47,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:47,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:47,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-06 07:30:47,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:47,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130909077] [2022-12-06 07:30:47,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130909077] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:47,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:47,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:47,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731466348] [2022-12-06 07:30:47,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:47,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:47,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:47,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:47,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:47,414 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:47,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:47,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:47,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:47,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:47,457 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:47,457 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:47,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:47,458 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:47,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:47,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:47,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:47,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:47,458 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:47,458 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:47,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:47,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:47,459 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:47,459 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:47,459 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:47,459 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:47,459 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:47,460 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:47,460 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:47,460 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:47,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:47,462 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:47,462 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:47,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:47,462 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:47,462 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:47,538 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:47,539 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:30:47,539 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:47,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:47,539 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:47,539 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:47,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1695 [2022-12-06 07:30:47,539 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-06 07:30:47,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:47,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1606111549, now seen corresponding path program 1 times [2022-12-06 07:30:47,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:47,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198014859] [2022-12-06 07:30:47,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:47,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:47,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-06 07:30:47,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:47,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198014859] [2022-12-06 07:30:47,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198014859] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:47,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:47,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:47,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383498197] [2022-12-06 07:30:47,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:47,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:47,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:47,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:47,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:47,603 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:47,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:47,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:47,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:47,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:47,644 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:47,644 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:47,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:47,645 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:47,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:47,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:47,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:47,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:47,645 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:47,645 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:47,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:47,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:47,646 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:47,646 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:47,646 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:47,646 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:47,646 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:47,647 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:47,647 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:47,647 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:47,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:47,649 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:47,649 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:47,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:47,649 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:47,649 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:47,725 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:47,726 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:30:47,726 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:47,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:47,726 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:47,726 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:47,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1696 [2022-12-06 07:30:47,727 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-06 07:30:47,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:47,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1575635356, now seen corresponding path program 1 times [2022-12-06 07:30:47,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:47,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735813567] [2022-12-06 07:30:47,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:47,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:47,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:47,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-06 07:30:47,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:47,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735813567] [2022-12-06 07:30:47,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735813567] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:47,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:47,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:47,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947864203] [2022-12-06 07:30:47,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:47,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:47,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:47,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:47,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:47,788 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:47,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:47,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:47,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:47,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:47,830 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:47,830 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:47,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:47,830 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:47,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:47,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:47,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:47,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:47,831 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:47,831 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:47,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:47,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:47,832 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:47,832 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:47,832 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:47,832 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:47,832 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:47,832 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:47,832 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:47,832 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:47,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:47,834 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:47,834 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:47,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:47,835 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:47,835 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:47,908 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:47,909 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:47,909 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:47,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:47,909 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:47,909 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:47,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1697 [2022-12-06 07:30:47,910 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-06 07:30:47,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:47,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1548853247, now seen corresponding path program 1 times [2022-12-06 07:30:47,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:47,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143705011] [2022-12-06 07:30:47,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:47,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:47,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-06 07:30:47,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:47,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143705011] [2022-12-06 07:30:47,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143705011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:47,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:47,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:47,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754106429] [2022-12-06 07:30:47,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:47,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:47,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:47,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:47,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:47,975 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:47,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:47,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:47,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:47,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:48,016 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:48,016 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:48,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:48,017 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:48,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:48,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:48,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:48,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:48,017 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:48,017 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:48,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:48,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:48,018 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:48,018 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:48,018 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:48,018 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:48,018 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:48,018 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:48,018 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:48,018 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:48,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:48,021 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:48,021 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:48,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:48,021 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:48,021 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:48,096 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:48,097 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:48,097 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:48,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:48,097 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:48,097 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:48,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1698 [2022-12-06 07:30:48,097 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-06 07:30:48,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:48,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1518377054, now seen corresponding path program 1 times [2022-12-06 07:30:48,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:48,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216354721] [2022-12-06 07:30:48,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:48,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:48,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-06 07:30:48,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:48,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216354721] [2022-12-06 07:30:48,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216354721] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:48,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:48,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:48,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325943312] [2022-12-06 07:30:48,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:48,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:48,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:48,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:48,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:48,161 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:48,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:48,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:48,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:48,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:48,204 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:48,204 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:48,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:48,205 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:48,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:48,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:48,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:48,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:48,205 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:48,205 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:48,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:48,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:48,206 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:48,206 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:48,206 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:48,206 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:48,206 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:48,206 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:48,206 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:48,206 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:48,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:48,209 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:48,209 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:48,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:48,209 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:48,209 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:48,324 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:48,325 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-06 07:30:48,325 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:48,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:48,325 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:48,325 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:48,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1699 [2022-12-06 07:30:48,325 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-06 07:30:48,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:48,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1491594945, now seen corresponding path program 1 times [2022-12-06 07:30:48,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:48,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598068134] [2022-12-06 07:30:48,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:48,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:48,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-06 07:30:48,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:48,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598068134] [2022-12-06 07:30:48,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598068134] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:48,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:48,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:48,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526789519] [2022-12-06 07:30:48,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:48,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:48,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:48,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:48,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:48,400 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:48,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:48,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:48,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:48,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:48,441 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:48,441 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:48,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:48,442 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:48,442 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:48,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:48,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:48,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:48,442 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:48,442 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:48,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:48,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:48,443 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:48,443 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:48,443 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:48,443 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:48,443 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:48,443 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:48,443 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:48,443 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:48,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:48,446 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:48,446 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:48,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:48,446 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:48,446 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:48,519 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:48,520 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:48,520 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:48,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:48,520 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:48,520 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:48,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1700 [2022-12-06 07:30:48,520 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-06 07:30:48,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:48,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1461118752, now seen corresponding path program 1 times [2022-12-06 07:30:48,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:48,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103700467] [2022-12-06 07:30:48,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:48,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:48,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-06 07:30:48,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:48,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103700467] [2022-12-06 07:30:48,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103700467] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:48,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:48,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:48,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678802405] [2022-12-06 07:30:48,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:48,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:48,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:48,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:48,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:48,580 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:48,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:48,580 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:48,580 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:48,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:48,616 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:48,616 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:48,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:48,616 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:48,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:48,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:48,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:48,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:48,617 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:48,617 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:48,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:48,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:48,618 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:48,618 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:48,618 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:48,618 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:48,618 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:48,618 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:48,618 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:48,618 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:48,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:48,620 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:48,620 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:48,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:48,621 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:48,621 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:48,694 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:48,695 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:48,695 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:48,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:48,695 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:48,695 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:48,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1701 [2022-12-06 07:30:48,695 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-06 07:30:48,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:48,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1434336643, now seen corresponding path program 1 times [2022-12-06 07:30:48,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:48,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287169244] [2022-12-06 07:30:48,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:48,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:48,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-06 07:30:48,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:48,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287169244] [2022-12-06 07:30:48,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287169244] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:48,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:48,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:48,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259125892] [2022-12-06 07:30:48,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:48,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:48,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:48,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:48,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:48,761 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:48,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:48,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:48,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:48,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:48,802 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:48,802 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:48,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 353 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:48,803 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:48,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:48,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:48,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:48,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:48,803 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:48,803 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:48,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:48,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:48,804 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:48,804 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:48,804 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:48,804 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:48,804 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:48,804 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:48,805 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:48,805 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:48,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:48,807 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:48,807 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:48,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:48,807 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:48,807 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:48,880 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:48,881 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:48,881 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:48,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:48,881 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:48,881 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:48,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1702 [2022-12-06 07:30:48,882 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-06 07:30:48,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:48,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1403860450, now seen corresponding path program 1 times [2022-12-06 07:30:48,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:48,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204551208] [2022-12-06 07:30:48,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:48,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:48,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-06 07:30:48,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:48,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204551208] [2022-12-06 07:30:48,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204551208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:48,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:48,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:48,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320238170] [2022-12-06 07:30:48,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:48,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:48,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:48,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:48,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:48,944 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:48,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:48,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:48,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:48,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:48,979 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:48,979 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:48,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:48,980 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:48,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:48,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:48,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:48,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:48,981 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:48,981 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:48,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:48,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:48,982 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:48,982 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:48,982 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:48,982 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:48,982 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:48,982 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:48,982 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:48,982 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:48,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:48,985 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:48,985 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:48,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:48,986 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:48,986 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:49,060 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:49,061 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:49,061 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:49,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:49,061 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:49,061 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:49,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1703 [2022-12-06 07:30:49,062 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-06 07:30:49,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:49,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1377078341, now seen corresponding path program 1 times [2022-12-06 07:30:49,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:49,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238828523] [2022-12-06 07:30:49,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:49,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:49,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-06 07:30:49,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:49,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238828523] [2022-12-06 07:30:49,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238828523] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:49,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:49,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:49,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949165746] [2022-12-06 07:30:49,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:49,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:49,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:49,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:49,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:49,126 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:49,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:49,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:49,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:49,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:49,167 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:49,168 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:49,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:49,168 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:49,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:49,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:49,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:49,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:49,169 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:49,169 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:49,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:49,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:49,169 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:49,169 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:49,170 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:49,170 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:49,170 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:49,170 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:49,170 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:49,170 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:49,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:49,172 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:49,172 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:49,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:49,173 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:49,173 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:49,247 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:49,248 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:49,248 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:49,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:49,248 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:49,248 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:49,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1704 [2022-12-06 07:30:49,248 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-06 07:30:49,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:49,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1346602148, now seen corresponding path program 1 times [2022-12-06 07:30:49,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:49,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368918504] [2022-12-06 07:30:49,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:49,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:49,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:49,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-06 07:30:49,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:49,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368918504] [2022-12-06 07:30:49,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368918504] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:49,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:49,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:49,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386635104] [2022-12-06 07:30:49,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:49,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:49,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:49,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:49,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:49,311 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:49,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:49,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:49,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:49,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:49,347 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:49,348 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:49,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:49,348 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:49,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:49,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:49,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:49,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:49,359 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:49,359 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:49,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:49,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:49,359 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:49,359 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:49,360 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:49,360 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:49,360 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:49,360 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:49,360 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:49,360 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:49,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:49,362 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:49,362 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:49,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:49,363 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:49,363 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:49,438 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:49,439 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:49,439 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:49,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:49,439 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:49,439 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:49,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1705 [2022-12-06 07:30:49,440 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-06 07:30:49,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:49,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1319820039, now seen corresponding path program 1 times [2022-12-06 07:30:49,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:49,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715307668] [2022-12-06 07:30:49,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:49,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:49,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-06 07:30:49,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:49,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715307668] [2022-12-06 07:30:49,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715307668] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:49,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:49,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:49,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486652236] [2022-12-06 07:30:49,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:49,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:49,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:49,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:49,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:49,504 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:49,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:49,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:49,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:49,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:49,543 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:49,543 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:49,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:49,544 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:49,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:49,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:49,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:49,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:49,544 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:49,544 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:49,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:49,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:49,545 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:49,545 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:49,545 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:49,545 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:49,545 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:49,545 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:49,545 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:49,545 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:49,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:49,548 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:49,548 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:49,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:49,548 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:49,548 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:49,622 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:49,622 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:49,622 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:49,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:49,622 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:49,623 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:49,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1706 [2022-12-06 07:30:49,623 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-06 07:30:49,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:49,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1289343846, now seen corresponding path program 1 times [2022-12-06 07:30:49,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:49,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466341395] [2022-12-06 07:30:49,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:49,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:49,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-06 07:30:49,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:49,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466341395] [2022-12-06 07:30:49,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466341395] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:49,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:49,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:49,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747485974] [2022-12-06 07:30:49,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:49,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:49,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:49,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:49,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:49,686 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:49,686 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:49,686 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:49,686 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:49,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:49,728 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:49,728 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:49,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:49,729 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:49,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:49,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:49,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:49,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:49,729 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:49,729 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:49,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:49,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:49,730 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:49,730 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:49,730 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:49,730 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:49,730 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:49,730 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:49,730 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:49,731 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:49,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:49,733 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:49,733 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:49,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:49,733 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:49,733 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:49,809 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:49,810 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:30:49,810 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:49,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:49,810 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:49,810 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:49,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1707 [2022-12-06 07:30:49,810 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-06 07:30:49,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:49,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1262561737, now seen corresponding path program 1 times [2022-12-06 07:30:49,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:49,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645689050] [2022-12-06 07:30:49,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:49,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:49,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-06 07:30:49,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:49,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645689050] [2022-12-06 07:30:49,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645689050] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:49,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:49,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:49,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851673996] [2022-12-06 07:30:49,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:49,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:49,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:49,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:49,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:49,888 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:49,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:49,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:49,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:49,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:49,925 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:49,925 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:49,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:49,926 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:49,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:49,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:49,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:49,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:49,926 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:49,926 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:49,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:49,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:49,927 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:49,927 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:49,927 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:49,927 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:49,928 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:49,928 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:49,928 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:49,928 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:49,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:49,930 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:49,930 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:49,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:49,930 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:49,930 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:50,005 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:50,006 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:50,006 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:50,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:50,006 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:50,006 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:50,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1708 [2022-12-06 07:30:50,006 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-06 07:30:50,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:50,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1232085544, now seen corresponding path program 1 times [2022-12-06 07:30:50,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:50,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688504701] [2022-12-06 07:30:50,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:50,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:50,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-06 07:30:50,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:50,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688504701] [2022-12-06 07:30:50,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688504701] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:50,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:50,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:50,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031409558] [2022-12-06 07:30:50,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:50,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:50,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:50,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:50,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:50,076 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:50,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:50,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:50,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:50,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:50,119 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:50,119 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:50,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:50,120 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:50,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:50,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:50,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:50,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:50,120 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:50,120 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:50,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:50,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:50,121 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:50,121 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:50,121 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:50,121 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:50,121 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:50,121 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:50,121 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:50,122 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:50,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:50,124 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:50,124 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:50,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:50,124 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:50,124 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:50,198 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:50,199 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:50,199 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:50,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:50,199 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:50,199 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:50,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1709 [2022-12-06 07:30:50,199 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-06 07:30:50,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:50,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1205303435, now seen corresponding path program 1 times [2022-12-06 07:30:50,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:50,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691481658] [2022-12-06 07:30:50,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:50,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:50,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-06 07:30:50,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:50,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691481658] [2022-12-06 07:30:50,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691481658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:50,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:50,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:50,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971074049] [2022-12-06 07:30:50,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:50,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:50,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:50,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:50,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:50,263 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:50,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:50,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:50,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:50,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:50,297 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:50,298 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:50,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 372 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:50,298 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:50,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:50,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:50,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:50,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:50,299 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:50,299 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:50,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:50,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:50,299 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:50,299 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:50,300 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:50,300 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:50,300 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:50,300 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:50,300 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:50,300 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:50,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:50,302 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:50,302 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:50,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:50,302 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:50,302 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:50,387 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:50,388 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 07:30:50,388 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:50,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:50,388 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:50,388 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:50,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1710 [2022-12-06 07:30:50,388 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-06 07:30:50,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:50,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1174827242, now seen corresponding path program 1 times [2022-12-06 07:30:50,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:50,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935419049] [2022-12-06 07:30:50,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:50,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:50,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-06 07:30:50,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:50,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935419049] [2022-12-06 07:30:50,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935419049] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:50,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:50,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:50,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164037707] [2022-12-06 07:30:50,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:50,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:50,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:50,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:50,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:50,450 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:50,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:50,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:50,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:50,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:50,492 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:50,492 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:50,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:50,493 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:50,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:50,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:50,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:50,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:50,493 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:50,493 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:50,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:50,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:50,494 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:50,494 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:50,494 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:50,494 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:50,494 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:50,495 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:50,495 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:50,495 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:50,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:50,497 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:50,497 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:50,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:50,497 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:50,497 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:50,573 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:50,573 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:50,573 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:50,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:50,573 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:50,574 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:50,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1711 [2022-12-06 07:30:50,574 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-06 07:30:50,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:50,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1148045133, now seen corresponding path program 1 times [2022-12-06 07:30:50,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:50,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393628032] [2022-12-06 07:30:50,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:50,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:50,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:50,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:50,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393628032] [2022-12-06 07:30:50,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393628032] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:50,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:50,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:50,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484002757] [2022-12-06 07:30:50,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:50,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:50,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:50,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:50,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:50,639 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:50,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:50,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:50,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:50,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:50,676 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:50,676 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:50,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:50,677 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:50,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:50,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:50,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:50,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:50,677 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:50,677 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:50,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:50,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:50,678 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:50,678 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:50,678 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:50,678 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:50,678 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:50,679 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:50,679 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:50,679 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:50,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:50,681 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:50,681 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:50,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:50,681 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:50,681 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:50,761 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:50,762 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:30:50,762 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:50,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:50,762 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:50,762 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:50,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1712 [2022-12-06 07:30:50,762 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-06 07:30:50,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:50,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1117568940, now seen corresponding path program 1 times [2022-12-06 07:30:50,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:50,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471703454] [2022-12-06 07:30:50,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:50,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:50,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:50,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:50,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471703454] [2022-12-06 07:30:50,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471703454] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:50,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:50,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:50,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750754234] [2022-12-06 07:30:50,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:50,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:50,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:50,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:50,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:50,825 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:50,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:50,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:50,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:50,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:50,866 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:50,867 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:50,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:50,867 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:50,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:50,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:50,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:50,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:50,868 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:50,868 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:50,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:50,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:50,868 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:50,869 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:50,869 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:50,869 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:50,869 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:50,869 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:50,869 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:50,869 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:50,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:50,871 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:50,871 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:50,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:50,872 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:50,872 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:50,957 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:50,958 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 07:30:50,958 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:50,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:50,958 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:50,958 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:50,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1713 [2022-12-06 07:30:50,958 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-06 07:30:50,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:50,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1090786831, now seen corresponding path program 1 times [2022-12-06 07:30:50,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:50,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080641863] [2022-12-06 07:30:50,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:50,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:51,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-06 07:30:51,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:51,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080641863] [2022-12-06 07:30:51,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080641863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:51,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:51,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:51,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088447462] [2022-12-06 07:30:51,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:51,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:51,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:51,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:51,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:51,023 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:51,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:51,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:51,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:51,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:51,065 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:51,065 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:51,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:51,065 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:51,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:51,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:51,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:51,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:51,066 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:51,066 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:51,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:51,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:51,067 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:51,067 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:51,067 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:51,067 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:51,067 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:51,067 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:51,067 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:51,067 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:51,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:51,069 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:51,069 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:51,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:51,070 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:51,070 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:51,144 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:51,144 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:51,144 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:51,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:51,145 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:51,145 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:51,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1714 [2022-12-06 07:30:51,145 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-06 07:30:51,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:51,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1060310638, now seen corresponding path program 1 times [2022-12-06 07:30:51,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:51,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964065513] [2022-12-06 07:30:51,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:51,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:51,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:51,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-06 07:30:51,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:51,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964065513] [2022-12-06 07:30:51,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964065513] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:51,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:51,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:51,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706708275] [2022-12-06 07:30:51,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:51,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:51,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:51,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:51,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:51,207 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:51,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:51,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:51,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:51,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:51,244 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:51,244 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:51,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:51,244 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:51,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:51,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:51,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:51,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:51,245 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:51,245 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:51,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:51,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:51,246 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:51,246 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:51,246 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:51,246 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:51,246 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:51,246 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:51,246 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:51,246 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:51,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:51,249 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:51,249 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:51,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:51,249 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:51,249 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:51,327 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:51,328 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:30:51,328 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:51,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:51,328 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:51,328 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:51,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1715 [2022-12-06 07:30:51,329 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-06 07:30:51,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:51,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1033528529, now seen corresponding path program 1 times [2022-12-06 07:30:51,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:51,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141727947] [2022-12-06 07:30:51,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:51,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:51,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-06 07:30:51,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:51,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141727947] [2022-12-06 07:30:51,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141727947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:51,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:51,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:51,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255690617] [2022-12-06 07:30:51,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:51,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:51,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:51,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:51,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:51,402 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:51,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:51,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:51,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:51,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:51,443 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:51,443 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:51,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:51,443 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:51,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:51,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:51,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:51,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:51,444 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:51,444 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:51,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:51,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:51,445 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:51,445 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:51,445 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:51,445 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:51,445 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:51,445 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:51,445 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:51,445 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:51,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:51,447 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:51,447 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:51,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:51,448 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:51,448 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:51,522 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:51,523 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:51,523 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:51,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:51,523 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:51,523 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:51,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1716 [2022-12-06 07:30:51,523 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-06 07:30:51,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:51,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1003052336, now seen corresponding path program 1 times [2022-12-06 07:30:51,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:51,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240985421] [2022-12-06 07:30:51,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:51,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:51,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-06 07:30:51,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:51,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240985421] [2022-12-06 07:30:51,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240985421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:51,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:51,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:51,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980443662] [2022-12-06 07:30:51,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:51,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:51,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:51,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:51,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:51,587 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:51,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:51,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:51,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:51,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:51,630 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:51,630 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:51,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:51,631 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:51,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:51,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:51,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:51,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:51,631 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:51,631 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:51,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:51,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:51,632 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:51,632 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:51,632 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:51,632 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:51,632 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:51,633 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:51,633 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:51,633 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:51,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:51,635 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:51,635 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:51,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:51,635 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:51,636 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:51,710 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:51,711 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:51,711 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:51,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:51,711 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:51,711 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:51,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1717 [2022-12-06 07:30:51,711 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-06 07:30:51,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:51,711 INFO L85 PathProgramCache]: Analyzing trace with hash -976270227, now seen corresponding path program 1 times [2022-12-06 07:30:51,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:51,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20926633] [2022-12-06 07:30:51,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:51,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:51,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-06 07:30:51,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:51,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20926633] [2022-12-06 07:30:51,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20926633] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:51,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:51,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:51,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4045272] [2022-12-06 07:30:51,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:51,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:51,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:51,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:51,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:51,777 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:51,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:51,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:51,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:51,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:51,818 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:51,818 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:51,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:51,819 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:51,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:51,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:51,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:51,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:51,819 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:51,819 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:51,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:51,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:51,820 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:51,820 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:51,820 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:51,820 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:51,820 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:51,820 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:51,820 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:51,821 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:51,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:51,823 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:51,823 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:51,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:51,823 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:51,823 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:51,898 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:51,899 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:51,899 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:51,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:51,899 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:51,899 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:51,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1718 [2022-12-06 07:30:51,900 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-06 07:30:51,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:51,900 INFO L85 PathProgramCache]: Analyzing trace with hash -945794034, now seen corresponding path program 1 times [2022-12-06 07:30:51,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:51,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760729923] [2022-12-06 07:30:51,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:51,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:51,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-06 07:30:51,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:51,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760729923] [2022-12-06 07:30:51,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760729923] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:51,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:51,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:51,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423990358] [2022-12-06 07:30:51,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:51,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:51,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:51,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:51,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:51,965 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:51,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:51,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:51,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:51,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:52,003 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:52,003 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:52,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:52,003 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:52,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:52,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:52,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:52,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:52,004 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:52,004 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:52,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:52,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:52,005 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:52,005 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:52,005 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:52,005 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:52,005 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:52,005 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:52,005 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:52,005 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:52,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:52,007 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:52,008 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:52,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:52,008 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:52,008 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:52,083 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:52,084 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:52,084 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:52,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:52,084 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:52,084 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:52,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1719 [2022-12-06 07:30:52,084 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-06 07:30:52,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:52,084 INFO L85 PathProgramCache]: Analyzing trace with hash -919011925, now seen corresponding path program 1 times [2022-12-06 07:30:52,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:52,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405455884] [2022-12-06 07:30:52,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:52,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:52,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-06 07:30:52,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:52,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405455884] [2022-12-06 07:30:52,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405455884] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:52,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:52,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:52,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723237437] [2022-12-06 07:30:52,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:52,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:52,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:52,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:52,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:52,157 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:52,157 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:52,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:52,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:52,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:52,193 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:52,194 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:52,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:52,194 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:52,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:52,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:52,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:52,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:52,195 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:52,195 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:52,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:52,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:52,195 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:52,195 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:52,196 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:52,196 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:52,196 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:52,196 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:52,196 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:52,196 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:52,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:52,198 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:52,198 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:52,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:52,198 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:52,198 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:52,273 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:52,274 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:52,274 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:52,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:52,274 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:52,274 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:52,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1720 [2022-12-06 07:30:52,274 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-06 07:30:52,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:52,274 INFO L85 PathProgramCache]: Analyzing trace with hash -888535732, now seen corresponding path program 1 times [2022-12-06 07:30:52,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:52,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711530582] [2022-12-06 07:30:52,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:52,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:52,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-06 07:30:52,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:52,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711530582] [2022-12-06 07:30:52,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711530582] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:52,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:52,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:52,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503570085] [2022-12-06 07:30:52,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:52,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:52,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:52,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:52,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:52,347 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:52,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:52,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:52,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:52,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:52,384 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:52,384 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:52,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:52,385 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:52,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:52,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:52,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:52,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:52,385 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:52,385 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:52,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:52,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:52,386 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:52,386 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:52,386 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:52,386 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:52,386 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:52,386 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:52,386 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:52,387 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:52,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:52,389 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:52,389 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:52,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:52,389 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:52,389 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:52,464 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:52,465 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:52,465 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:52,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:52,465 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:52,465 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:52,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1721 [2022-12-06 07:30:52,465 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-06 07:30:52,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:52,465 INFO L85 PathProgramCache]: Analyzing trace with hash -861753623, now seen corresponding path program 1 times [2022-12-06 07:30:52,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:52,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718883806] [2022-12-06 07:30:52,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:52,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:52,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-06 07:30:52,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:52,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718883806] [2022-12-06 07:30:52,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718883806] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:52,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:52,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:52,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751029737] [2022-12-06 07:30:52,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:52,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:52,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:52,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:52,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:52,532 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:52,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:52,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:52,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:52,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:52,574 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:52,574 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:52,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:52,575 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:52,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:52,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:52,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:52,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:52,575 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:52,575 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:52,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:52,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:52,576 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:52,576 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:52,576 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:52,576 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:52,576 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:52,577 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:52,577 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:52,577 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:52,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:52,579 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:52,579 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:52,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:52,579 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:52,579 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:52,661 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:52,662 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-06 07:30:52,662 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:52,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:52,662 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:52,662 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:52,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1722 [2022-12-06 07:30:52,662 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-06 07:30:52,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:52,662 INFO L85 PathProgramCache]: Analyzing trace with hash -831277430, now seen corresponding path program 1 times [2022-12-06 07:30:52,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:52,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667146323] [2022-12-06 07:30:52,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:52,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:52,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-06 07:30:52,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:52,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667146323] [2022-12-06 07:30:52,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667146323] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:52,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:52,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:52,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384870562] [2022-12-06 07:30:52,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:52,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:52,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:52,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:52,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:52,724 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:52,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:52,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:52,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:52,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:52,765 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:52,765 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:52,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:52,766 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:52,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:52,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:52,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:52,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:52,766 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:52,766 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:52,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:52,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:52,767 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:52,767 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:52,767 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:52,767 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:52,768 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:52,768 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:52,768 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:52,768 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:52,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:52,770 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:52,770 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:52,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:52,770 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:52,770 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:52,845 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:52,845 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:52,845 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:52,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:52,846 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:52,846 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:52,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1723 [2022-12-06 07:30:52,846 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-06 07:30:52,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:52,846 INFO L85 PathProgramCache]: Analyzing trace with hash -804495321, now seen corresponding path program 1 times [2022-12-06 07:30:52,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:52,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859960195] [2022-12-06 07:30:52,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:52,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:52,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-06 07:30:52,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:52,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859960195] [2022-12-06 07:30:52,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859960195] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:52,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:52,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:52,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291421147] [2022-12-06 07:30:52,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:52,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:52,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:52,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:52,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:52,910 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:52,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:52,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:52,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:52,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:52,946 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:52,947 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:52,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:52,947 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:52,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:52,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:52,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:52,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:52,948 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:52,948 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:52,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:52,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:52,948 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:52,949 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:52,949 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:52,949 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:52,949 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:52,949 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:52,949 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:52,949 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:52,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:52,951 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:52,951 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:52,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:52,952 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:52,952 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:53,026 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:53,026 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:53,026 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:53,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:53,027 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:53,027 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:53,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1724 [2022-12-06 07:30:53,027 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-06 07:30:53,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:53,027 INFO L85 PathProgramCache]: Analyzing trace with hash -774019128, now seen corresponding path program 1 times [2022-12-06 07:30:53,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:53,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633985146] [2022-12-06 07:30:53,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:53,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:53,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-06 07:30:53,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:53,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633985146] [2022-12-06 07:30:53,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633985146] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:53,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:53,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:53,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368060340] [2022-12-06 07:30:53,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:53,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:53,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:53,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:53,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:53,088 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:53,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:53,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:53,088 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:53,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:53,125 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:53,125 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:53,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:53,126 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:53,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:53,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:53,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:53,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:53,126 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:53,126 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:53,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:53,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:53,127 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:53,127 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:53,127 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:53,127 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:53,127 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:53,127 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:53,127 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:53,127 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:53,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:53,130 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:53,130 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:53,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:53,130 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:53,130 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:53,216 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:53,217 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-06 07:30:53,217 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:53,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:53,217 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:53,217 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:53,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1725 [2022-12-06 07:30:53,217 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-06 07:30:53,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:53,217 INFO L85 PathProgramCache]: Analyzing trace with hash -747237019, now seen corresponding path program 1 times [2022-12-06 07:30:53,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:53,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290990645] [2022-12-06 07:30:53,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:53,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:53,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-06 07:30:53,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:53,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290990645] [2022-12-06 07:30:53,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290990645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:53,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:53,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:53,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914196578] [2022-12-06 07:30:53,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:53,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:53,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:53,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:53,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:53,297 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:53,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:53,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:53,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:53,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:53,339 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:53,339 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:53,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:53,340 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:53,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:53,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:53,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:53,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:53,340 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:53,340 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:53,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:53,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:53,341 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:53,341 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:53,341 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:53,341 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:53,342 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:53,342 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:53,342 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:53,342 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:53,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:53,344 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:53,344 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:53,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:53,344 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:53,344 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:53,420 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:53,421 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:30:53,421 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:53,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:53,421 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:53,421 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:53,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1726 [2022-12-06 07:30:53,422 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-06 07:30:53,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:53,422 INFO L85 PathProgramCache]: Analyzing trace with hash -716760826, now seen corresponding path program 1 times [2022-12-06 07:30:53,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:53,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522174507] [2022-12-06 07:30:53,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:53,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:53,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:53,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:53,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522174507] [2022-12-06 07:30:53,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522174507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:53,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:53,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:53,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658601831] [2022-12-06 07:30:53,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:53,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:53,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:53,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:53,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:53,498 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:53,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:53,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:53,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:53,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:53,536 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:53,536 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:53,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:53,536 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:53,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:53,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:53,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:53,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:53,537 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:53,537 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:53,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:53,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:53,538 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:53,538 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:53,538 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:53,538 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:53,538 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:53,538 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:53,538 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:53,538 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:53,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:53,541 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:53,541 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:53,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:53,541 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:53,541 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:53,636 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:53,637 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 07:30:53,637 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:53,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:53,637 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:53,637 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:53,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1727 [2022-12-06 07:30:53,637 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-06 07:30:53,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:53,638 INFO L85 PathProgramCache]: Analyzing trace with hash -689978717, now seen corresponding path program 1 times [2022-12-06 07:30:53,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:53,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235125028] [2022-12-06 07:30:53,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:53,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:53,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-06 07:30:53,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:53,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235125028] [2022-12-06 07:30:53,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235125028] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:53,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:53,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:53,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078101797] [2022-12-06 07:30:53,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:53,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:53,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:53,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:53,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:53,724 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:53,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:53,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:53,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:53,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:53,777 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:53,777 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:53,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:53,778 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:53,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:53,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:53,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:53,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:53,779 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:53,779 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:53,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:53,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:53,780 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:53,780 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:53,780 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:53,780 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:53,780 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:53,780 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:53,780 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:53,780 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:53,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:53,783 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:53,783 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:53,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:53,784 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:53,784 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:53,876 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:53,877 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 07:30:53,877 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:53,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:53,877 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:53,877 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:53,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1728 [2022-12-06 07:30:53,877 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-06 07:30:53,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:53,877 INFO L85 PathProgramCache]: Analyzing trace with hash -659502524, now seen corresponding path program 1 times [2022-12-06 07:30:53,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:53,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636397017] [2022-12-06 07:30:53,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:53,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:53,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-06 07:30:53,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:53,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636397017] [2022-12-06 07:30:53,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636397017] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:53,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:53,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:53,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157320590] [2022-12-06 07:30:53,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:53,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:53,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:53,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:53,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:53,959 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:53,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:53,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:53,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:53,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:54,008 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:54,009 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:54,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:54,009 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:54,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:54,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:54,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:54,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:54,010 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:54,010 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:54,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:54,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:54,011 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:54,011 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:54,011 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:54,011 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:54,011 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:54,011 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:54,011 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:54,011 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:54,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:54,014 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:54,014 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:54,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:54,014 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:54,014 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:54,091 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:54,092 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:30:54,092 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:54,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:54,092 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:54,092 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:54,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1729 [2022-12-06 07:30:54,093 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-06 07:30:54,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:54,093 INFO L85 PathProgramCache]: Analyzing trace with hash -632720415, now seen corresponding path program 1 times [2022-12-06 07:30:54,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:54,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843047523] [2022-12-06 07:30:54,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:54,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:54,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-06 07:30:54,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:54,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843047523] [2022-12-06 07:30:54,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843047523] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:54,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:54,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:54,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577950466] [2022-12-06 07:30:54,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:54,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:54,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:54,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:54,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:54,159 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:54,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:54,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:54,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:54,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:54,199 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:54,199 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:54,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:54,200 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:54,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:54,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:54,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:54,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:54,200 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:54,201 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:54,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:54,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:54,201 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:54,201 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:54,201 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:54,201 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:54,202 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:54,202 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:54,202 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:54,202 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:54,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:54,204 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:54,204 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:54,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:54,204 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:54,204 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:54,278 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:54,279 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:54,279 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:54,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:54,279 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:54,279 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:54,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1730 [2022-12-06 07:30:54,280 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-06 07:30:54,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:54,280 INFO L85 PathProgramCache]: Analyzing trace with hash -602244222, now seen corresponding path program 1 times [2022-12-06 07:30:54,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:54,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221599393] [2022-12-06 07:30:54,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:54,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:54,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-06 07:30:54,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:54,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221599393] [2022-12-06 07:30:54,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221599393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:54,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:54,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:54,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563888280] [2022-12-06 07:30:54,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:54,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:54,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:54,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:54,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:54,357 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:54,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:54,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:54,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:54,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:54,396 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:54,396 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:54,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:54,397 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:54,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:54,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:54,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:54,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:54,398 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:54,398 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:54,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:54,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:54,398 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:54,398 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:54,399 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:54,399 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:54,399 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:54,399 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:54,399 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:54,399 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:54,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:54,402 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:54,402 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:54,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:54,402 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:54,402 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:54,480 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:54,481 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:30:54,481 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:54,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:54,481 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:54,481 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:54,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1731 [2022-12-06 07:30:54,481 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-06 07:30:54,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:54,482 INFO L85 PathProgramCache]: Analyzing trace with hash -575462113, now seen corresponding path program 1 times [2022-12-06 07:30:54,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:54,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317092165] [2022-12-06 07:30:54,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:54,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:54,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-06 07:30:54,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:54,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317092165] [2022-12-06 07:30:54,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317092165] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:54,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:54,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:54,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621403331] [2022-12-06 07:30:54,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:54,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:54,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:54,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:54,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:54,555 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:54,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:54,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:54,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:54,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:54,602 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:54,603 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:54,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:54,603 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:54,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:54,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:54,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:54,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:54,604 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:54,604 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:54,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:54,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:54,605 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:54,605 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:54,605 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:54,605 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:54,605 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:54,605 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:54,605 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:54,606 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:54,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:54,608 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:54,608 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:54,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:54,609 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:54,609 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:54,688 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:54,689 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:30:54,689 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:54,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:54,689 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:54,689 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:54,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1732 [2022-12-06 07:30:54,689 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-06 07:30:54,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:54,689 INFO L85 PathProgramCache]: Analyzing trace with hash -544985920, now seen corresponding path program 1 times [2022-12-06 07:30:54,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:54,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584790050] [2022-12-06 07:30:54,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:54,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:54,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-06 07:30:54,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:54,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584790050] [2022-12-06 07:30:54,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584790050] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:54,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:54,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:54,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524529311] [2022-12-06 07:30:54,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:54,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:54,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:54,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:54,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:54,752 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:54,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:54,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:54,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:54,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:54,795 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:54,795 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:54,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:54,796 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:54,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:54,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:54,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:54,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:54,796 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:54,796 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:54,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:54,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:54,797 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:54,797 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:54,797 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:54,797 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:54,797 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:54,797 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:54,797 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:54,797 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:54,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:54,800 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:54,800 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:54,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:54,800 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:54,800 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:54,875 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:54,876 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:54,876 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:54,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:54,876 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:54,876 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:54,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1733 [2022-12-06 07:30:54,876 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-06 07:30:54,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:54,876 INFO L85 PathProgramCache]: Analyzing trace with hash -518203811, now seen corresponding path program 1 times [2022-12-06 07:30:54,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:54,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452591113] [2022-12-06 07:30:54,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:54,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:54,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-06 07:30:54,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:54,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452591113] [2022-12-06 07:30:54,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452591113] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:54,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:54,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:54,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677365154] [2022-12-06 07:30:54,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:54,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:54,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:54,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:54,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:54,942 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:54,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:54,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:54,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:54,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:54,978 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:54,978 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:54,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:54,979 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:54,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:54,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:54,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:54,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:54,979 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:54,979 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:54,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:54,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:54,980 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:54,980 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:54,980 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:54,980 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:54,980 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:54,980 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:54,980 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:54,980 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:54,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:54,983 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:54,983 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:54,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:54,983 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:54,983 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:55,063 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:55,064 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:30:55,064 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:55,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:55,064 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:55,064 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:55,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1734 [2022-12-06 07:30:55,065 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-06 07:30:55,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:55,065 INFO L85 PathProgramCache]: Analyzing trace with hash -487727618, now seen corresponding path program 1 times [2022-12-06 07:30:55,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:55,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606364342] [2022-12-06 07:30:55,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:55,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:55,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:55,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-06 07:30:55,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:55,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606364342] [2022-12-06 07:30:55,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606364342] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:55,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:55,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:55,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278542209] [2022-12-06 07:30:55,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:55,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:55,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:55,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:55,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:55,128 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:55,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:55,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:55,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:55,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:55,171 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:55,171 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:55,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:55,172 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:55,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:55,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:55,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:55,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:55,172 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:55,172 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:55,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:55,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:55,173 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:55,173 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:55,173 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:55,173 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:55,173 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:55,173 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:55,173 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:55,173 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:55,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:55,176 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:55,176 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:55,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:55,176 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:55,176 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:55,252 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:55,252 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:55,253 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:55,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:55,253 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:55,253 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:55,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1735 [2022-12-06 07:30:55,253 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-06 07:30:55,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:55,253 INFO L85 PathProgramCache]: Analyzing trace with hash -460945509, now seen corresponding path program 1 times [2022-12-06 07:30:55,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:55,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122625587] [2022-12-06 07:30:55,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:55,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:55,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-06 07:30:55,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:55,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122625587] [2022-12-06 07:30:55,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122625587] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:55,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:55,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:55,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863640014] [2022-12-06 07:30:55,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:55,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:55,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:55,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:55,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:55,319 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:55,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:55,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:55,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:55,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:55,354 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:55,354 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:55,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 372 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:55,355 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:55,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:55,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:55,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:55,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:55,355 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:55,355 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:55,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:55,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:55,356 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:55,356 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:55,356 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:55,356 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:55,356 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:55,356 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:55,356 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:55,356 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:55,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:55,359 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:55,359 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:55,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:55,359 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:55,359 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:55,433 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:55,434 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:55,434 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:55,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:55,434 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:55,434 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:55,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1736 [2022-12-06 07:30:55,434 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-06 07:30:55,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:55,434 INFO L85 PathProgramCache]: Analyzing trace with hash -430469316, now seen corresponding path program 1 times [2022-12-06 07:30:55,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:55,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979195638] [2022-12-06 07:30:55,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:55,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:55,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-06 07:30:55,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:55,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979195638] [2022-12-06 07:30:55,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979195638] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:55,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:55,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:55,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114569061] [2022-12-06 07:30:55,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:55,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:55,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:55,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:55,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:55,515 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:55,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:55,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:55,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:55,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:55,564 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:55,564 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:55,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:55,565 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:55,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:55,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:55,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:55,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:55,565 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:55,565 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:55,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:55,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:55,566 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:55,566 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:55,567 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:55,567 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:55,567 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:55,567 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:55,567 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:55,567 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:55,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:55,570 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:55,570 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:55,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:55,570 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:55,571 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:55,664 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:55,665 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 07:30:55,665 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:55,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:55,666 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:55,666 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:55,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1737 [2022-12-06 07:30:55,666 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-06 07:30:55,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:55,666 INFO L85 PathProgramCache]: Analyzing trace with hash -403687207, now seen corresponding path program 1 times [2022-12-06 07:30:55,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:55,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198599198] [2022-12-06 07:30:55,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:55,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:55,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-06 07:30:55,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:55,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198599198] [2022-12-06 07:30:55,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198599198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:55,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:55,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:55,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807817034] [2022-12-06 07:30:55,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:55,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:55,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:55,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:55,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:55,752 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:55,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:55,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:55,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:55,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:55,799 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:55,800 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:55,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:55,800 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:55,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:55,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:55,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:55,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:55,801 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:55,801 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:55,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:55,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:55,802 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:55,802 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:55,802 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:55,803 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:55,803 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:55,803 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:55,803 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:55,803 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:55,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:55,806 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:55,806 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:55,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:55,806 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:55,806 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:55,898 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:55,899 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:30:55,899 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:55,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:55,899 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:55,899 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:55,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1738 [2022-12-06 07:30:55,900 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-06 07:30:55,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:55,900 INFO L85 PathProgramCache]: Analyzing trace with hash -373211014, now seen corresponding path program 1 times [2022-12-06 07:30:55,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:55,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180827708] [2022-12-06 07:30:55,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:55,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:55,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-06 07:30:55,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:55,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180827708] [2022-12-06 07:30:55,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180827708] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:55,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:55,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:55,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730852146] [2022-12-06 07:30:55,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:55,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:55,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:55,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:55,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:55,978 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:55,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:55,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:55,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:55,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:56,021 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:56,021 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:56,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:56,022 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:56,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:56,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:56,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:56,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:56,022 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:56,022 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:56,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:56,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:56,023 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:56,023 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:56,023 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:56,023 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:56,023 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:56,023 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:56,023 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:56,024 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:56,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:56,026 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:56,026 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:56,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:56,026 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:56,026 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:56,101 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:56,101 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:56,101 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:56,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:56,102 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:56,102 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:56,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1739 [2022-12-06 07:30:56,102 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-06 07:30:56,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:56,102 INFO L85 PathProgramCache]: Analyzing trace with hash -346428905, now seen corresponding path program 1 times [2022-12-06 07:30:56,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:56,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123262454] [2022-12-06 07:30:56,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:56,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:56,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-06 07:30:56,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:56,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123262454] [2022-12-06 07:30:56,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123262454] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:56,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:56,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:56,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112721789] [2022-12-06 07:30:56,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:56,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:56,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:56,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:56,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:56,167 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:56,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:56,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:56,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:56,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:56,206 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:56,206 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:56,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:56,207 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:56,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:56,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:56,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:56,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:56,207 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:56,207 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:56,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:56,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:56,208 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:56,208 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:56,208 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:56,208 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:56,208 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:56,209 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:56,209 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:56,209 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:56,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:56,211 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:56,211 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:56,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:56,211 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:56,211 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:56,286 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:56,287 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:56,287 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:56,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:56,287 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:56,287 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:56,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1740 [2022-12-06 07:30:56,287 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-06 07:30:56,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:56,288 INFO L85 PathProgramCache]: Analyzing trace with hash -315952712, now seen corresponding path program 1 times [2022-12-06 07:30:56,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:56,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498880251] [2022-12-06 07:30:56,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:56,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:56,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-06 07:30:56,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:56,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498880251] [2022-12-06 07:30:56,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498880251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:56,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:56,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:56,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914580411] [2022-12-06 07:30:56,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:56,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:56,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:56,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:56,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:56,349 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:56,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:56,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:56,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:56,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:56,391 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:56,391 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:56,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:56,392 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:56,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:56,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:56,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:56,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:56,392 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:56,392 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:56,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:56,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:56,393 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:56,393 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:56,393 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:56,393 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:56,393 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:56,393 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:56,394 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:56,394 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:56,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:56,396 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:56,396 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:56,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:56,396 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:56,396 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:56,470 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:56,471 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:56,471 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:56,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:56,471 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:56,471 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:56,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1741 [2022-12-06 07:30:56,471 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-06 07:30:56,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:56,472 INFO L85 PathProgramCache]: Analyzing trace with hash -289170603, now seen corresponding path program 1 times [2022-12-06 07:30:56,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:56,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423697639] [2022-12-06 07:30:56,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:56,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:56,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-06 07:30:56,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:56,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423697639] [2022-12-06 07:30:56,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423697639] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:56,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:56,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:56,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457746553] [2022-12-06 07:30:56,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:56,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:56,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:56,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:56,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:56,536 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:56,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:56,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:56,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:56,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:56,577 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:56,577 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:56,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 355 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:56,577 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:56,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:56,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:56,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:56,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:56,578 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:56,578 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:56,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:56,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:56,579 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:56,579 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:56,579 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:56,579 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:56,579 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:56,579 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:56,579 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:56,579 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:56,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:56,581 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:56,581 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:56,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:56,582 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:56,582 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:56,656 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:56,657 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:56,657 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:56,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:56,657 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:56,657 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:56,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1742 [2022-12-06 07:30:56,657 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-06 07:30:56,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:56,657 INFO L85 PathProgramCache]: Analyzing trace with hash -258694410, now seen corresponding path program 1 times [2022-12-06 07:30:56,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:56,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957716586] [2022-12-06 07:30:56,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:56,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:56,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-06 07:30:56,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:56,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957716586] [2022-12-06 07:30:56,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957716586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:56,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:56,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:56,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716898207] [2022-12-06 07:30:56,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:56,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:56,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:56,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:56,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:56,756 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:56,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:56,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:56,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:56,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:56,799 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:56,800 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:56,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:56,800 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:56,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:56,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:56,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:56,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:56,801 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:56,801 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:56,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:56,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:56,802 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:56,802 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:56,803 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:56,803 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:56,803 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:56,803 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:56,803 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:56,803 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:56,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:56,806 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:56,806 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:56,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:56,806 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:56,807 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:56,896 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:56,897 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 07:30:56,897 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:56,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:56,897 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:56,898 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:56,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1743 [2022-12-06 07:30:56,898 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-06 07:30:56,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:56,898 INFO L85 PathProgramCache]: Analyzing trace with hash -231912301, now seen corresponding path program 1 times [2022-12-06 07:30:56,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:56,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707670026] [2022-12-06 07:30:56,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:56,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:56,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-06 07:30:56,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:56,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707670026] [2022-12-06 07:30:56,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707670026] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:56,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:56,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:56,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16659533] [2022-12-06 07:30:56,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:56,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:56,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:56,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:56,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:56,986 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:56,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:56,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:56,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:56,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:57,042 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:57,042 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:57,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:57,043 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:57,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:57,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:57,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:57,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:57,043 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:57,043 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:57,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:57,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:57,044 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:57,044 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:57,045 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:57,045 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:57,045 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:57,045 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:57,045 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:57,045 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:57,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:57,048 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:57,048 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:57,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:57,049 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:57,049 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:57,121 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:57,122 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:30:57,122 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:57,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:57,122 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:57,122 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:57,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1744 [2022-12-06 07:30:57,122 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-06 07:30:57,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:57,122 INFO L85 PathProgramCache]: Analyzing trace with hash -201436108, now seen corresponding path program 1 times [2022-12-06 07:30:57,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:57,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000518692] [2022-12-06 07:30:57,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:57,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:57,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-06 07:30:57,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:57,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000518692] [2022-12-06 07:30:57,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000518692] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:57,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:57,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:57,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86594430] [2022-12-06 07:30:57,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:57,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:57,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:57,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:57,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:57,184 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:57,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:57,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:57,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:57,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:57,221 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:57,221 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:57,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:57,221 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:57,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:57,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:57,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:57,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:57,222 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:57,222 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:57,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:57,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:57,223 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:57,223 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:57,223 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:57,223 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:57,223 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:57,223 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:57,223 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:57,223 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:57,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:57,225 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:57,225 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:57,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:57,226 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:57,226 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:57,301 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:57,301 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:57,301 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:57,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:57,301 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:57,302 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:57,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1745 [2022-12-06 07:30:57,302 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-06 07:30:57,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:57,302 INFO L85 PathProgramCache]: Analyzing trace with hash -174653999, now seen corresponding path program 1 times [2022-12-06 07:30:57,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:57,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384721459] [2022-12-06 07:30:57,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:57,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:57,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-06 07:30:57,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:57,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384721459] [2022-12-06 07:30:57,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384721459] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:57,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:57,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:57,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572452553] [2022-12-06 07:30:57,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:57,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:57,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:57,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:57,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:57,366 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:57,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:57,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:57,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:57,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:57,402 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:57,402 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:57,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:57,403 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:57,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:57,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:57,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:57,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:57,403 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:57,403 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:57,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:57,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:57,404 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:57,404 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:57,404 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:57,404 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:57,404 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:57,404 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:57,404 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:57,404 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:57,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:57,407 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:57,407 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:57,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:57,407 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:57,407 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:57,482 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:57,483 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:57,483 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:57,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:57,483 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:57,483 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:57,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1746 [2022-12-06 07:30:57,483 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-06 07:30:57,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:57,483 INFO L85 PathProgramCache]: Analyzing trace with hash -144177806, now seen corresponding path program 1 times [2022-12-06 07:30:57,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:57,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55800622] [2022-12-06 07:30:57,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:57,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:57,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-06 07:30:57,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:57,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55800622] [2022-12-06 07:30:57,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55800622] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:57,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:57,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:57,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330721942] [2022-12-06 07:30:57,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:57,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:57,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:57,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:57,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:57,550 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:57,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:57,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:57,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:57,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:57,586 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:57,587 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:57,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:57,587 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:57,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:57,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:57,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:57,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:57,588 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:57,588 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:57,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:57,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:57,588 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:57,588 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:57,589 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:57,589 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:57,589 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:57,589 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:57,589 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:57,589 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:57,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:57,591 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:57,591 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:57,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:57,591 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:57,591 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:57,666 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:57,667 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:57,667 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:57,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:57,667 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:57,667 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:57,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1747 [2022-12-06 07:30:57,667 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-06 07:30:57,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:57,667 INFO L85 PathProgramCache]: Analyzing trace with hash -117395697, now seen corresponding path program 1 times [2022-12-06 07:30:57,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:57,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961879040] [2022-12-06 07:30:57,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:57,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:57,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:57,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:57,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:57,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961879040] [2022-12-06 07:30:57,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961879040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:57,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:57,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:57,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994968200] [2022-12-06 07:30:57,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:57,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:57,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:57,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:57,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:57,735 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:57,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:57,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:57,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:57,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:57,772 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:57,772 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:57,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:57,772 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:57,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:57,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:57,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:57,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:57,773 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:57,773 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:57,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:57,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:57,774 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:57,774 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:57,774 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:57,774 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:57,774 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:57,774 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:57,774 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:57,774 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:57,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:57,777 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:57,777 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:57,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:57,777 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:57,777 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:57,853 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:57,854 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:30:57,854 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:57,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:57,854 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:57,854 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:57,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1748 [2022-12-06 07:30:57,854 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-06 07:30:57,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:57,854 INFO L85 PathProgramCache]: Analyzing trace with hash -86919504, now seen corresponding path program 1 times [2022-12-06 07:30:57,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:57,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976873717] [2022-12-06 07:30:57,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:57,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30: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-06 07:30:57,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:57,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976873717] [2022-12-06 07:30:57,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976873717] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:57,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:57,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:57,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514082607] [2022-12-06 07:30:57,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:57,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:57,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:57,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:57,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:57,935 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:57,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:57,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:57,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:57,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:57,979 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:57,979 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:57,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:57,980 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:57,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:57,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:57,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:57,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:57,980 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:57,980 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:57,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:57,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:57,981 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:57,981 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:57,981 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:57,981 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:57,981 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:57,981 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:57,981 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:57,981 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:57,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:57,984 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:57,984 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:57,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:57,984 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:57,984 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:58,059 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:58,060 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:58,060 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:58,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:58,060 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:58,060 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:58,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1749 [2022-12-06 07:30:58,060 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-06 07:30:58,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:58,060 INFO L85 PathProgramCache]: Analyzing trace with hash -60137395, now seen corresponding path program 1 times [2022-12-06 07:30:58,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:58,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511670835] [2022-12-06 07:30:58,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:58,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:58,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-06 07:30:58,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:58,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511670835] [2022-12-06 07:30:58,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511670835] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:58,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:58,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:58,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091070030] [2022-12-06 07:30:58,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:58,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:58,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:58,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:58,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:58,131 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:58,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:58,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:58,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:58,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:58,174 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:58,175 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:58,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:58,175 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:58,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:58,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:58,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:58,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:58,176 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:58,176 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:58,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:58,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:58,176 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:58,177 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:58,177 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:58,177 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:58,177 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:58,177 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:58,177 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:58,177 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:58,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:58,179 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:58,179 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:58,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:58,180 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:58,180 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:58,255 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:58,255 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:58,256 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:58,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:58,256 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:58,256 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:58,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1750 [2022-12-06 07:30:58,256 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-06 07:30:58,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:58,256 INFO L85 PathProgramCache]: Analyzing trace with hash -29661202, now seen corresponding path program 1 times [2022-12-06 07:30:58,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:58,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133768048] [2022-12-06 07:30:58,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:58,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:58,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:58,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-06 07:30:58,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:58,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133768048] [2022-12-06 07:30:58,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133768048] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:58,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:58,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:58,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280201668] [2022-12-06 07:30:58,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:58,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:58,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:58,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:58,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:58,318 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:58,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:58,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:58,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:58,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:58,361 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:58,361 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:58,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:58,362 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:58,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:58,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:58,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:58,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:58,362 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:58,362 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:58,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:58,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:58,363 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:58,363 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:58,363 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:58,363 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:58,364 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:58,364 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:58,364 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:58,364 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:58,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:58,366 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:58,366 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:58,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:58,367 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:58,367 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:58,444 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:58,445 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:30:58,445 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:58,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:58,445 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:58,445 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:58,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1751 [2022-12-06 07:30:58,445 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-06 07:30:58,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:58,445 INFO L85 PathProgramCache]: Analyzing trace with hash -2879093, now seen corresponding path program 1 times [2022-12-06 07:30:58,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:58,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158804409] [2022-12-06 07:30:58,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:58,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:58,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-06 07:30:58,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:58,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158804409] [2022-12-06 07:30:58,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158804409] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:58,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:58,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:58,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764264126] [2022-12-06 07:30:58,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:58,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:58,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:58,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:58,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:58,507 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:58,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:58,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:58,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:58,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:58,550 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:58,550 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:58,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:58,551 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:58,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:58,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:58,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:58,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:58,551 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:58,551 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:58,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:58,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:58,552 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:58,552 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:58,552 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:58,552 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:58,552 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:58,552 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:58,552 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:58,553 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:58,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:58,555 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:58,555 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:58,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:58,555 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:58,555 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:58,655 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:58,656 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-06 07:30:58,656 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:58,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:58,656 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:58,656 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:58,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1752 [2022-12-06 07:30:58,656 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-06 07:30:58,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:58,656 INFO L85 PathProgramCache]: Analyzing trace with hash 27597100, now seen corresponding path program 1 times [2022-12-06 07:30:58,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:58,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931189422] [2022-12-06 07:30:58,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:58,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:58,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-06 07:30:58,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:58,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931189422] [2022-12-06 07:30:58,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931189422] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:58,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:58,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:58,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074249769] [2022-12-06 07:30:58,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:58,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:58,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:58,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:58,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:58,717 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:58,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:58,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:58,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:58,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:58,755 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:58,755 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:58,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:58,755 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:58,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:58,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:58,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:58,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:58,756 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:58,756 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:58,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:58,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:58,757 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:58,757 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:58,757 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:58,757 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:58,757 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:58,757 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:58,757 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:58,757 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:58,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:58,759 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:58,759 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:58,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:58,760 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:58,760 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:58,834 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:58,835 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:58,835 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:58,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:58,835 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:58,835 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:58,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1753 [2022-12-06 07:30:58,836 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-06 07:30:58,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:58,836 INFO L85 PathProgramCache]: Analyzing trace with hash 54379209, now seen corresponding path program 1 times [2022-12-06 07:30:58,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:58,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118059571] [2022-12-06 07:30:58,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:58,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:58,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-06 07:30:58,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:58,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118059571] [2022-12-06 07:30:58,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118059571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:58,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:58,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:58,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259497963] [2022-12-06 07:30:58,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:58,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:58,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:58,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:58,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:58,908 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:58,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:58,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:58,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:58,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:58,944 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:58,944 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:58,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:58,945 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:58,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:58,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:58,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:58,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:58,945 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:58,945 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:58,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:58,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:58,946 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:58,946 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:58,946 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:58,946 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:58,946 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:58,946 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:58,947 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:58,947 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:58,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:58,949 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:58,949 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:58,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:58,949 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:58,949 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:59,024 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:59,025 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:59,025 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:59,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:59,025 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:59,025 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:59,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1754 [2022-12-06 07:30:59,025 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-06 07:30:59,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:59,026 INFO L85 PathProgramCache]: Analyzing trace with hash 84855402, now seen corresponding path program 1 times [2022-12-06 07:30:59,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:59,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35118618] [2022-12-06 07:30:59,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:59,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:59,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-06 07:30:59,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:59,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35118618] [2022-12-06 07:30:59,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35118618] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:59,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:59,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:59,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163349759] [2022-12-06 07:30:59,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:59,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:59,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:59,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:59,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:59,113 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:59,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:59,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:59,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:59,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:59,150 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:59,150 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:59,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:59,151 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:59,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:59,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:59,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:59,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:59,151 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:59,151 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:59,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:59,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:59,152 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:59,152 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:59,152 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:59,152 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:59,152 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:59,152 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:59,152 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:59,152 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:59,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:59,155 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:59,155 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:59,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:59,155 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:59,155 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:59,231 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:59,231 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:59,231 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:59,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:59,232 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:59,232 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:59,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1755 [2022-12-06 07:30:59,232 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-06 07:30:59,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:59,232 INFO L85 PathProgramCache]: Analyzing trace with hash 111637511, now seen corresponding path program 1 times [2022-12-06 07:30:59,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:59,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63012946] [2022-12-06 07:30:59,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:59,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:59,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-06 07:30:59,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:59,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63012946] [2022-12-06 07:30:59,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63012946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:59,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:59,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:59,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118586930] [2022-12-06 07:30:59,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:59,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:59,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:59,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:59,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:59,296 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:59,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:59,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:59,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:59,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:59,338 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:59,338 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:59,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:59,338 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:59,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:59,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:59,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:59,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:59,339 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:59,339 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:59,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:59,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:59,340 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:59,340 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:59,340 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:59,340 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:59,340 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:59,340 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:59,340 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:59,340 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:59,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:59,342 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:59,342 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:59,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:59,343 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:59,343 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:59,417 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:59,418 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:59,418 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:59,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:59,418 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:59,418 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:59,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1756 [2022-12-06 07:30:59,418 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-06 07:30:59,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:59,418 INFO L85 PathProgramCache]: Analyzing trace with hash 142113704, now seen corresponding path program 1 times [2022-12-06 07:30:59,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:59,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905740156] [2022-12-06 07:30:59,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:59,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:59,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-06 07:30:59,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:59,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905740156] [2022-12-06 07:30:59,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905740156] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:59,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:59,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:59,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668669231] [2022-12-06 07:30:59,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:59,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:59,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:59,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:59,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:59,481 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:59,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:59,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:59,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:59,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:59,517 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:59,518 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:30:59,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:59,518 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:59,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:59,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:59,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:59,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:59,519 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:59,519 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:59,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:59,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:59,519 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:59,519 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:59,520 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:59,520 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:59,520 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:59,520 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:59,520 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:59,520 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:59,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:59,522 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:59,522 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:59,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:59,522 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:59,522 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:59,597 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:59,598 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:30:59,598 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:59,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:59,598 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:59,598 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:59,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1757 [2022-12-06 07:30:59,598 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-06 07:30:59,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:59,598 INFO L85 PathProgramCache]: Analyzing trace with hash 168895813, now seen corresponding path program 1 times [2022-12-06 07:30:59,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:59,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904143127] [2022-12-06 07:30:59,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:59,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:59,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-06 07:30:59,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:59,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904143127] [2022-12-06 07:30:59,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904143127] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:59,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:59,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:59,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454899594] [2022-12-06 07:30:59,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:59,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:59,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:59,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:59,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:59,665 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:59,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:59,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:59,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:59,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:59,701 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:30:59,701 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:30:59,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:30:59,702 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:30:59,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:59,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:59,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:59,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:59,702 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:59,702 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:59,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:59,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:59,703 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:59,703 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:59,703 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:59,703 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:59,703 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:59,703 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:59,704 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:59,704 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:59,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:59,706 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:30:59,706 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:30:59,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:30:59,706 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:59,706 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:30:59,781 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:59,782 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:30:59,782 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:30:59,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:59,782 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:59,782 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:59,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1758 [2022-12-06 07:30:59,783 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-06 07:30:59,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:59,783 INFO L85 PathProgramCache]: Analyzing trace with hash 199372006, now seen corresponding path program 1 times [2022-12-06 07:30:59,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:59,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703461494] [2022-12-06 07:30:59,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:59,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:59,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-06 07:30:59,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:59,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703461494] [2022-12-06 07:30:59,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703461494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:59,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:59,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:30:59,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402305577] [2022-12-06 07:30:59,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:59,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:59,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:59,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:59,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:59,846 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:30:59,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:59,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:59,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:30:59,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:59,883 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:30:59,883 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:30:59,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:30:59,883 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:30:59,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:59,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:59,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:59,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:30:59,884 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:30:59,884 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:30:59,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:30:59,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:59,885 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:59,885 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:30:59,885 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:30:59,885 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:59,885 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:59,885 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:59,885 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:59,885 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:59,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:59,888 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:30:59,888 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:30:59,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:30:59,888 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:30:59,888 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:30:59,964 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:59,965 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:30:59,965 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:30:59,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:59,965 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:59,965 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:59,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1759 [2022-12-06 07:30:59,965 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-06 07:30:59,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:59,965 INFO L85 PathProgramCache]: Analyzing trace with hash 226154115, now seen corresponding path program 1 times [2022-12-06 07:30:59,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:59,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946501396] [2022-12-06 07:30:59,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:59,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:00,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-06 07:31:00,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:00,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946501396] [2022-12-06 07:31:00,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946501396] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:00,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:00,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:00,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488826705] [2022-12-06 07:31:00,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:00,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:00,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:00,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:00,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:00,034 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:00,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:00,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:00,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:00,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:00,076 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:00,077 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:00,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:00,077 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:00,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:00,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:00,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:00,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:00,078 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:00,078 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:00,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:00,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:00,079 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:00,079 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:00,079 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:00,079 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:00,079 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:00,079 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:00,079 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:00,079 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:00,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:00,081 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:00,081 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:00,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:00,082 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:00,082 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:00,157 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:00,158 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:00,158 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:00,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:00,158 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:00,158 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:00,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1760 [2022-12-06 07:31:00,158 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-06 07:31:00,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:00,159 INFO L85 PathProgramCache]: Analyzing trace with hash 256630308, now seen corresponding path program 1 times [2022-12-06 07:31:00,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:00,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235635633] [2022-12-06 07:31:00,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:00,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:00,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:00,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-06 07:31:00,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:00,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235635633] [2022-12-06 07:31:00,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235635633] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:00,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:00,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:00,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801959065] [2022-12-06 07:31:00,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:00,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:00,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:00,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:00,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:00,234 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:00,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:00,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:00,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:00,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:00,276 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:00,276 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:00,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:00,277 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:00,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:00,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:00,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:00,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:00,277 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:00,277 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:00,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:00,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:00,278 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:00,278 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:00,278 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:00,278 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:00,278 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:00,279 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:00,279 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:00,279 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:00,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:00,281 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:00,281 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:00,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:00,281 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:00,281 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:00,355 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:00,356 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:00,356 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:00,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:00,356 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:00,356 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:00,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1761 [2022-12-06 07:31:00,356 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-06 07:31:00,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:00,356 INFO L85 PathProgramCache]: Analyzing trace with hash 283412417, now seen corresponding path program 1 times [2022-12-06 07:31:00,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:00,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304343323] [2022-12-06 07:31:00,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:00,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:00,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-06 07:31:00,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:00,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304343323] [2022-12-06 07:31:00,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304343323] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:00,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:00,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:00,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768335134] [2022-12-06 07:31:00,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:00,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:00,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:00,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:00,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:00,421 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:00,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:00,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:00,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:00,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:00,457 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:00,458 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:00,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:00,458 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:00,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:00,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:00,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:00,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:00,459 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:00,459 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:00,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:00,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:00,459 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:00,459 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:00,460 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:00,460 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:00,460 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:00,460 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:00,460 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:00,460 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:00,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:00,462 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:00,462 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:00,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:00,462 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:00,462 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:00,537 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:00,537 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:00,538 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:00,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:00,538 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:00,538 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:00,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1762 [2022-12-06 07:31:00,538 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-06 07:31:00,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:00,538 INFO L85 PathProgramCache]: Analyzing trace with hash 313888610, now seen corresponding path program 1 times [2022-12-06 07:31:00,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:00,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493302718] [2022-12-06 07:31:00,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:00,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31: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-06 07:31:00,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:00,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493302718] [2022-12-06 07:31:00,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493302718] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:00,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:00,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:00,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952355561] [2022-12-06 07:31:00,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:00,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:00,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:00,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:00,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:00,601 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:00,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:00,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:00,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:00,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:00,638 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:00,638 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:00,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:00,638 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:00,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:00,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:00,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:00,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:00,639 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:00,639 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:00,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:00,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:00,639 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:00,640 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:00,640 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:00,640 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:00,640 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:00,640 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:00,640 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:00,640 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:00,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:00,642 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:00,642 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:00,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:00,643 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:00,643 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:00,718 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:00,719 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:00,719 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:00,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:00,719 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:00,719 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:00,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1763 [2022-12-06 07:31:00,719 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-06 07:31:00,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:00,719 INFO L85 PathProgramCache]: Analyzing trace with hash 340670719, now seen corresponding path program 1 times [2022-12-06 07:31:00,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:00,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047849209] [2022-12-06 07:31:00,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:00,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:00,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-06 07:31:00,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:00,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047849209] [2022-12-06 07:31:00,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047849209] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:00,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:00,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:00,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829531480] [2022-12-06 07:31:00,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:00,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:00,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:00,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:00,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:00,784 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:00,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:00,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:00,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:00,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:00,824 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:00,824 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:00,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:00,824 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:00,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:00,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:00,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:00,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:00,825 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:00,825 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:00,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:00,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:00,826 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:00,826 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:00,826 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:00,826 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:00,826 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:00,826 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:00,826 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:00,826 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:00,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:00,828 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:00,828 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:00,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:00,829 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:00,829 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:00,903 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:00,903 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:00,904 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:00,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:00,904 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:00,904 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:00,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1764 [2022-12-06 07:31:00,904 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-06 07:31:00,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:00,904 INFO L85 PathProgramCache]: Analyzing trace with hash 371146912, now seen corresponding path program 1 times [2022-12-06 07:31:00,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:00,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535905248] [2022-12-06 07:31:00,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:00,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:00,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-06 07:31:00,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:00,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535905248] [2022-12-06 07:31:00,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535905248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:00,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:00,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:00,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737437351] [2022-12-06 07:31:00,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:00,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:00,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:00,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:00,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:00,966 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:00,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:00,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:00,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:00,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:01,003 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:01,004 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:01,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:01,004 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:01,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:01,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:01,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:01,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:01,005 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:01,005 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:01,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:01,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:01,005 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:01,005 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:01,006 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:01,006 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:01,006 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:01,006 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:01,006 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:01,006 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:01,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:01,008 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:01,008 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:01,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:01,008 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:01,009 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:01,082 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:01,083 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:01,083 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:01,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:01,083 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:01,083 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:01,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1765 [2022-12-06 07:31:01,084 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-06 07:31:01,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:01,084 INFO L85 PathProgramCache]: Analyzing trace with hash 397929021, now seen corresponding path program 1 times [2022-12-06 07:31:01,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:01,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377857099] [2022-12-06 07:31:01,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:01,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:01,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-06 07:31:01,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:01,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377857099] [2022-12-06 07:31:01,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377857099] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:01,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:01,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:01,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527443443] [2022-12-06 07:31:01,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:01,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:01,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:01,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:01,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:01,153 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:01,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:01,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:01,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:01,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:01,189 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:01,189 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:01,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:01,189 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:01,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:01,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:01,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:01,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:01,190 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:01,190 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:01,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:01,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:01,191 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:01,191 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:01,191 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:01,191 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:01,191 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:01,191 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:01,191 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:01,191 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:01,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:01,193 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:01,194 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:01,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:01,194 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:01,194 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:01,269 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:01,270 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:01,270 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:01,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:01,270 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:01,270 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:01,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1766 [2022-12-06 07:31:01,270 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-06 07:31:01,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:01,270 INFO L85 PathProgramCache]: Analyzing trace with hash 428405214, now seen corresponding path program 1 times [2022-12-06 07:31:01,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:01,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452146233] [2022-12-06 07:31:01,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:01,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:01,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:01,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-06 07:31:01,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:01,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452146233] [2022-12-06 07:31:01,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452146233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:01,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:01,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:01,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391631227] [2022-12-06 07:31:01,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:01,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:01,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:01,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:01,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:01,332 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:01,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:01,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:01,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:01,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:01,385 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:01,385 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:01,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:01,386 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:01,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:01,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:01,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:01,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:01,386 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:01,386 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:01,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:01,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:01,387 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:01,387 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:01,387 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:01,387 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:01,387 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:01,387 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:01,387 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:01,387 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:01,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:01,389 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:01,390 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:01,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:01,390 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:01,390 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:01,464 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:01,464 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:01,464 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:01,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:01,465 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:01,465 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:01,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1767 [2022-12-06 07:31:01,465 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-06 07:31:01,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:01,465 INFO L85 PathProgramCache]: Analyzing trace with hash 455187323, now seen corresponding path program 1 times [2022-12-06 07:31:01,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:01,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503263670] [2022-12-06 07:31:01,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:01,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:01,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-06 07:31:01,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:01,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503263670] [2022-12-06 07:31:01,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503263670] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:01,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:01,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:01,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395262056] [2022-12-06 07:31:01,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:01,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:01,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:01,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:01,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:01,529 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:01,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:01,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:01,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:01,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:01,564 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:01,564 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:01,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:01,565 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:01,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:01,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:01,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:01,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:01,565 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:01,565 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:01,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:01,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:01,566 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:01,566 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:01,566 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:01,566 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:01,566 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:01,567 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:01,567 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:01,567 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:01,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:01,569 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:01,569 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:01,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:01,569 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:01,569 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:01,643 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:01,644 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:01,644 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:01,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:01,644 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:01,645 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:01,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1768 [2022-12-06 07:31:01,645 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-06 07:31:01,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:01,645 INFO L85 PathProgramCache]: Analyzing trace with hash 485663516, now seen corresponding path program 1 times [2022-12-06 07:31:01,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:01,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690200832] [2022-12-06 07:31:01,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:01,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:01,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-06 07:31:01,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:01,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690200832] [2022-12-06 07:31:01,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690200832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:01,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:01,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:01,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676098060] [2022-12-06 07:31:01,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:01,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:01,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:01,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:01,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:01,710 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:01,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:01,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:01,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:01,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:01,750 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:01,750 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:01,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:01,750 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:01,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:01,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:01,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:01,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:01,751 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:01,751 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:01,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:01,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:01,751 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:01,752 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:01,752 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:01,752 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:01,752 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:01,752 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:01,752 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:01,752 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:01,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:01,754 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:01,754 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:01,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:01,754 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:01,755 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:01,829 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:01,829 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:01,829 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:01,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:01,830 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:01,830 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:01,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1769 [2022-12-06 07:31:01,830 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-06 07:31:01,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:01,830 INFO L85 PathProgramCache]: Analyzing trace with hash 512445625, now seen corresponding path program 1 times [2022-12-06 07:31:01,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:01,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213467267] [2022-12-06 07:31:01,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:01,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:01,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-06 07:31:01,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:01,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213467267] [2022-12-06 07:31:01,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213467267] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:01,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:01,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:01,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526532881] [2022-12-06 07:31:01,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:01,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:01,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:01,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:01,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:01,896 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:01,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:01,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:01,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:01,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:01,937 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:01,938 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:01,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:01,938 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:01,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:01,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:01,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:01,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:01,939 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:01,939 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:01,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:01,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:01,939 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:01,940 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:01,940 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:01,940 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:01,940 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:01,940 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:01,940 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:01,940 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:01,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:01,942 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:01,942 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:01,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:01,943 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:01,943 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:02,018 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:02,018 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:02,018 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:02,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:02,019 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:02,019 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:02,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1770 [2022-12-06 07:31:02,019 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-06 07:31:02,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:02,019 INFO L85 PathProgramCache]: Analyzing trace with hash 542921818, now seen corresponding path program 1 times [2022-12-06 07:31:02,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:02,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091481390] [2022-12-06 07:31:02,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:02,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:02,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-06 07:31:02,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:02,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091481390] [2022-12-06 07:31:02,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091481390] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:02,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:02,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:02,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442356671] [2022-12-06 07:31:02,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:02,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:02,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:02,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:02,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:02,084 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:02,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:02,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:02,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:02,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:02,127 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:02,127 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:02,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:02,127 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:02,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:02,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:02,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:02,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:02,128 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:02,128 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:02,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:02,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:02,129 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:02,129 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:02,129 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:02,129 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:02,129 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:02,129 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:02,129 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:02,129 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:02,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:02,132 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:02,132 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:02,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:02,132 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:02,132 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:02,206 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:02,207 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:02,207 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:02,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:02,207 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:02,207 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:02,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1771 [2022-12-06 07:31:02,207 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-06 07:31:02,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:02,208 INFO L85 PathProgramCache]: Analyzing trace with hash 569703927, now seen corresponding path program 1 times [2022-12-06 07:31:02,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:02,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718999361] [2022-12-06 07:31:02,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:02,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:02,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:31:02,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:02,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718999361] [2022-12-06 07:31:02,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718999361] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:02,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:02,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:02,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025939016] [2022-12-06 07:31:02,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:02,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:02,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:02,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:02,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:02,273 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:02,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:02,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:02,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:02,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:02,308 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:02,308 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:02,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:02,308 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:02,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:02,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:02,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:02,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:02,309 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:02,309 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:02,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:02,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:02,310 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:02,310 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:02,310 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:02,310 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:02,310 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:02,310 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:02,310 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:02,310 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:02,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:02,313 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:02,313 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:02,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:02,313 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:02,313 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:02,387 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:02,388 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:02,388 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:02,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:02,388 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:02,388 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:02,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1772 [2022-12-06 07:31:02,388 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-06 07:31:02,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:02,388 INFO L85 PathProgramCache]: Analyzing trace with hash 600180120, now seen corresponding path program 1 times [2022-12-06 07:31:02,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:02,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472163027] [2022-12-06 07:31:02,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:02,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:02,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-06 07:31:02,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:02,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472163027] [2022-12-06 07:31:02,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472163027] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:02,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:02,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:02,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077427428] [2022-12-06 07:31:02,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:02,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:02,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:02,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:02,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:02,452 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:02,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:02,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:02,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:02,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:02,488 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:02,488 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:02,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:02,489 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:02,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:02,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:02,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:02,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:02,489 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:02,490 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:02,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:02,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:02,490 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:02,490 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:02,490 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:02,490 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:02,491 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:02,491 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:02,491 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:02,491 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:02,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:02,493 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:02,493 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:02,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:02,493 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:02,493 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:02,577 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:02,578 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 07:31:02,578 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:02,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:02,578 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:02,578 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:02,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1773 [2022-12-06 07:31:02,578 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-06 07:31:02,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:02,578 INFO L85 PathProgramCache]: Analyzing trace with hash 626962229, now seen corresponding path program 1 times [2022-12-06 07:31:02,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:02,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687930272] [2022-12-06 07:31:02,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:02,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:02,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-06 07:31:02,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:02,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687930272] [2022-12-06 07:31:02,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687930272] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:02,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:02,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:02,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545614575] [2022-12-06 07:31:02,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:02,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:02,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:02,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:02,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:02,643 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:02,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:02,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:02,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:02,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:02,679 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:02,679 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:02,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 356 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:02,680 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:02,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:02,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:02,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:02,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:02,680 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:02,680 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:02,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:02,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:02,681 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:02,681 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:02,681 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:02,681 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:02,681 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:02,682 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:02,682 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:02,682 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:02,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:02,684 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:02,684 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:02,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:02,684 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:02,684 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:02,758 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:02,759 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:02,759 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:02,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:02,759 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:02,760 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:02,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1774 [2022-12-06 07:31:02,760 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-06 07:31:02,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:02,760 INFO L85 PathProgramCache]: Analyzing trace with hash 657438422, now seen corresponding path program 1 times [2022-12-06 07:31:02,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:02,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419928527] [2022-12-06 07:31:02,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:02,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:02,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-06 07:31:02,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:02,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419928527] [2022-12-06 07:31:02,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419928527] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:02,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:02,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:02,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313517017] [2022-12-06 07:31:02,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:02,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:02,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:02,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:02,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:02,824 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:02,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:02,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:02,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:02,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:02,861 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:02,861 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:02,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:02,861 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:02,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:02,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:02,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:02,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:02,862 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:02,862 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:02,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:02,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:02,863 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:02,863 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:02,863 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:02,863 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:02,863 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:02,863 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:02,863 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:02,863 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:02,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:02,865 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:02,866 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:02,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:02,866 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:02,866 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:02,940 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:02,941 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:02,941 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:02,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:02,941 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:02,941 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:02,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1775 [2022-12-06 07:31:02,941 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-06 07:31:02,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:02,941 INFO L85 PathProgramCache]: Analyzing trace with hash 684220531, now seen corresponding path program 1 times [2022-12-06 07:31:02,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:02,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399858724] [2022-12-06 07:31:02,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:02,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:03,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-06 07:31:03,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:03,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399858724] [2022-12-06 07:31:03,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399858724] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:03,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:03,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:03,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153166419] [2022-12-06 07:31:03,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:03,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:03,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:03,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:03,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:03,006 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:03,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:03,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:03,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:03,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:03,047 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:03,048 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:03,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:03,048 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:03,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:03,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:03,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:03,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:03,049 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:03,049 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:03,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:03,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:03,049 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:03,050 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:03,050 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:03,050 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:03,050 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:03,050 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:03,050 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:03,050 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:03,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:03,052 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:03,052 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:03,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:03,053 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:03,053 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:03,126 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:03,126 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:31:03,127 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:03,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:03,127 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:03,127 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:03,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1776 [2022-12-06 07:31:03,127 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-06 07:31:03,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:03,127 INFO L85 PathProgramCache]: Analyzing trace with hash 714696724, now seen corresponding path program 1 times [2022-12-06 07:31:03,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:03,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410533585] [2022-12-06 07:31:03,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:03,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:03,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:03,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-06 07:31:03,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:03,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410533585] [2022-12-06 07:31:03,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410533585] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:03,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:03,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:03,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764131429] [2022-12-06 07:31:03,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:03,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:03,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:03,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:03,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:03,188 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:03,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:03,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:03,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:03,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:03,225 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:03,226 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:03,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:03,226 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:03,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:03,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:03,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:03,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:03,227 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:03,227 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:03,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:03,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:03,227 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:03,227 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:03,228 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:03,228 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:03,228 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:03,228 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:03,228 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:03,228 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:03,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:03,230 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:03,230 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:03,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:03,230 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:03,230 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:03,304 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:03,305 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:03,305 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:03,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:03,305 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:03,305 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:03,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1777 [2022-12-06 07:31:03,305 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-06 07:31:03,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:03,305 INFO L85 PathProgramCache]: Analyzing trace with hash 741478833, now seen corresponding path program 1 times [2022-12-06 07:31:03,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:03,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139182210] [2022-12-06 07:31:03,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:03,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:03,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-06 07:31:03,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:03,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139182210] [2022-12-06 07:31:03,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139182210] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:03,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:03,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:03,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529019392] [2022-12-06 07:31:03,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:03,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:03,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:03,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:03,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:03,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:03,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:03,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:03,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:03,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:03,413 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:03,413 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:03,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:03,414 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:03,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:03,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:03,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:03,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:03,414 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:03,414 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:03,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:03,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:03,415 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:03,415 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:03,415 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:03,415 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:03,415 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:03,416 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:03,416 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:03,416 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:03,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:03,418 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:03,418 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:03,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:03,418 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:03,418 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:03,496 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:03,497 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:31:03,497 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:03,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:03,497 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:03,497 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:03,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1778 [2022-12-06 07:31:03,498 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-06 07:31:03,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:03,498 INFO L85 PathProgramCache]: Analyzing trace with hash 771955026, now seen corresponding path program 1 times [2022-12-06 07:31:03,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:03,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797586031] [2022-12-06 07:31:03,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:03,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:03,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-06 07:31:03,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:03,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797586031] [2022-12-06 07:31:03,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797586031] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:03,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:03,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:03,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887268853] [2022-12-06 07:31:03,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:03,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:03,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:03,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:03,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:03,561 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:03,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:03,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:03,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:03,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:03,604 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:03,604 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:03,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:03,604 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:03,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:03,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:03,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:03,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:03,605 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:03,605 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:03,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:03,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:03,606 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:03,606 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:03,606 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:03,606 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:03,606 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:03,606 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:03,606 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:03,606 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:03,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:03,608 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:03,608 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:03,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:03,609 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:03,609 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:03,683 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:03,684 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:03,684 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:03,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:03,684 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:03,684 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:03,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1779 [2022-12-06 07:31:03,684 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-06 07:31:03,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:03,685 INFO L85 PathProgramCache]: Analyzing trace with hash 798737135, now seen corresponding path program 1 times [2022-12-06 07:31:03,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:03,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486755015] [2022-12-06 07:31:03,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:03,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:03,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-06 07:31:03,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:03,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486755015] [2022-12-06 07:31:03,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486755015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:03,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:03,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:03,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060774545] [2022-12-06 07:31:03,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:03,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:03,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:03,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:03,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:03,756 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:03,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:03,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:03,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:03,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:03,791 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:03,792 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:03,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:03,792 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:03,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:03,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:03,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:03,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:03,793 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:03,793 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:03,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:03,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:03,793 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:03,793 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:03,794 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:03,794 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:03,794 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:03,794 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:03,794 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:03,794 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:03,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:03,796 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:03,796 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:03,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:03,796 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:03,797 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:03,870 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:03,871 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:03,871 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:03,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:03,871 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:03,871 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:03,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1780 [2022-12-06 07:31:03,871 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-06 07:31:03,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:03,872 INFO L85 PathProgramCache]: Analyzing trace with hash 829213328, now seen corresponding path program 1 times [2022-12-06 07:31:03,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:03,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061246410] [2022-12-06 07:31:03,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:03,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:03,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-06 07:31:03,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:03,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061246410] [2022-12-06 07:31:03,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061246410] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:03,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:03,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:03,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503968423] [2022-12-06 07:31:03,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:03,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:03,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:03,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:03,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:03,933 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:03,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:03,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:03,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:03,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:03,975 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:03,975 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:03,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:03,975 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:03,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:03,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:03,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:03,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:03,976 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:03,976 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:03,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:03,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:03,977 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:03,977 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:03,977 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:03,977 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:03,977 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:03,977 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:03,977 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:03,977 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:03,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:03,979 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:03,979 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:03,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:03,980 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:03,980 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:04,055 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:04,056 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:04,056 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:04,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:04,056 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:04,056 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:04,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1781 [2022-12-06 07:31:04,056 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-06 07:31:04,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:04,056 INFO L85 PathProgramCache]: Analyzing trace with hash 855995437, now seen corresponding path program 1 times [2022-12-06 07:31:04,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:04,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818988010] [2022-12-06 07:31:04,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:04,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:04,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-06 07:31:04,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:04,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818988010] [2022-12-06 07:31:04,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818988010] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:04,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:04,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:04,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259971511] [2022-12-06 07:31:04,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:04,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:04,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:04,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:04,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:04,125 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:04,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:04,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:04,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:04,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:04,167 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:04,167 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:04,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:04,168 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:04,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:04,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:04,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:04,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:04,168 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:04,168 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:04,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:04,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:04,169 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:04,169 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:04,169 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:04,169 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:04,169 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:04,169 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:04,169 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:04,169 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:04,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:04,172 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:04,172 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:04,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:04,172 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:04,172 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:04,246 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:04,247 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:04,247 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:04,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:04,247 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:04,247 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:04,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1782 [2022-12-06 07:31:04,248 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-06 07:31:04,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:04,248 INFO L85 PathProgramCache]: Analyzing trace with hash 886471630, now seen corresponding path program 1 times [2022-12-06 07:31:04,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:04,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362219435] [2022-12-06 07:31:04,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:04,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:04,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-06 07:31:04,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:04,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362219435] [2022-12-06 07:31:04,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362219435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:04,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:04,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:04,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210814518] [2022-12-06 07:31:04,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:04,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:04,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:04,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:04,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:04,311 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:04,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:04,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:04,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:04,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:04,353 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:04,353 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:04,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:04,354 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:04,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:04,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:04,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:04,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:04,354 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:04,354 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:04,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:04,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:04,355 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:04,355 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:04,355 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:04,355 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:04,356 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:04,356 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:04,356 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:04,356 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:04,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:04,358 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:04,358 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:04,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 118 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:04,358 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:04,358 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:04,438 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:04,439 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:31:04,439 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:04,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:04,439 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:04,439 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:04,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1783 [2022-12-06 07:31:04,440 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-06 07:31:04,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:04,440 INFO L85 PathProgramCache]: Analyzing trace with hash 913253739, now seen corresponding path program 1 times [2022-12-06 07:31:04,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:04,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262664726] [2022-12-06 07:31:04,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:04,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:04,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-06 07:31:04,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:04,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262664726] [2022-12-06 07:31:04,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262664726] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:04,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:04,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:04,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58064818] [2022-12-06 07:31:04,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:04,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:04,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:04,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:04,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:04,506 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:04,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:04,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:04,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:04,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:04,549 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:04,549 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:04,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:04,549 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:04,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:04,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:04,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:04,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:04,550 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:04,550 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:04,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:04,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:04,551 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:04,551 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:04,551 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:04,551 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:04,551 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:04,551 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:04,551 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:04,551 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:04,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:04,553 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:04,553 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:04,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:04,554 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:04,554 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:04,629 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:04,630 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:04,630 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:04,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:04,630 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:04,630 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:04,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1784 [2022-12-06 07:31:04,630 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-06 07:31:04,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:04,630 INFO L85 PathProgramCache]: Analyzing trace with hash 943729932, now seen corresponding path program 1 times [2022-12-06 07:31:04,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:04,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837140938] [2022-12-06 07:31:04,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:04,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:04,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:31:04,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:04,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837140938] [2022-12-06 07:31:04,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837140938] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:04,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:04,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:04,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271032931] [2022-12-06 07:31:04,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:04,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:04,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:04,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:04,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:04,691 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:04,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:04,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:04,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:04,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:04,733 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:04,734 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:04,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:04,734 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:04,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:04,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:04,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:04,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:04,734 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:04,735 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:04,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:04,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:04,735 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:04,735 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:04,735 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:04,735 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:04,736 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:04,736 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:04,736 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:04,736 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:04,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:04,738 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:04,738 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:04,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:04,738 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:04,738 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:04,813 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:04,813 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:04,814 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:04,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:04,814 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:04,814 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:04,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1785 [2022-12-06 07:31:04,814 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-06 07:31:04,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:04,814 INFO L85 PathProgramCache]: Analyzing trace with hash 970512041, now seen corresponding path program 1 times [2022-12-06 07:31:04,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:04,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95411657] [2022-12-06 07:31:04,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:04,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:04,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:31:04,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:04,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95411657] [2022-12-06 07:31:04,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95411657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:04,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:04,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:04,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840821176] [2022-12-06 07:31:04,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:04,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:04,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:04,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:04,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:04,886 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:04,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:04,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:04,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:04,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:04,927 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:04,927 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:04,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:04,927 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:04,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:04,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:04,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:04,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:04,928 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:04,928 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:04,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:04,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:04,929 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:04,929 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:04,929 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:04,929 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:04,929 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:04,929 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:04,929 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:04,929 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:04,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:04,931 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:04,932 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:04,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:04,932 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:04,932 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:05,010 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:05,011 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:31:05,011 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:05,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:05,011 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:05,011 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:05,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1786 [2022-12-06 07:31:05,011 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-06 07:31:05,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:05,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1000988234, now seen corresponding path program 1 times [2022-12-06 07:31:05,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:05,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593515337] [2022-12-06 07:31:05,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:05,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:05,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-06 07:31:05,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:05,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593515337] [2022-12-06 07:31:05,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593515337] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:05,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:05,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:05,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057326714] [2022-12-06 07:31:05,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:05,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:05,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:05,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:05,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:05,092 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:05,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:05,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:05,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:05,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:05,139 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:05,139 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:05,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:05,140 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:05,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:05,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:05,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:05,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:05,140 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:05,140 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:05,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:05,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:05,141 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:05,141 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:05,141 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:05,141 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:05,141 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:05,142 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:05,142 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:05,142 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:05,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:05,144 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:05,144 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:05,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:05,144 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:05,144 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:05,219 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:05,219 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:05,220 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:05,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:05,220 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:05,220 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:05,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1787 [2022-12-06 07:31:05,220 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-06 07:31:05,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:05,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1027770343, now seen corresponding path program 1 times [2022-12-06 07:31:05,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:05,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779481372] [2022-12-06 07:31:05,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:05,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:05,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-06 07:31:05,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:05,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779481372] [2022-12-06 07:31:05,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779481372] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:05,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:05,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:05,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890337071] [2022-12-06 07:31:05,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:05,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:05,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:05,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:05,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:05,285 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:05,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:05,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:05,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:05,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:05,342 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:05,343 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:05,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:05,343 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:05,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:05,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:05,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:05,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:05,344 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:05,344 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:05,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:05,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:05,344 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:05,345 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:05,345 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:05,345 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:05,345 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:05,345 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:05,345 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:05,345 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:05,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:05,348 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:05,348 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:05,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:05,348 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:05,348 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:05,424 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:05,425 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:31:05,425 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:05,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:05,425 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:05,425 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:05,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1788 [2022-12-06 07:31:05,425 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-06 07:31:05,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:05,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1058246536, now seen corresponding path program 1 times [2022-12-06 07:31:05,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:05,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185644087] [2022-12-06 07:31:05,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:05,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:05,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-06 07:31:05,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:05,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185644087] [2022-12-06 07:31:05,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185644087] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:05,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:05,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:05,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868081896] [2022-12-06 07:31:05,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:05,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:05,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:05,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:05,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:05,489 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:05,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:05,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:05,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:05,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:05,538 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:05,539 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:05,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:05,539 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:05,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:05,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:05,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:05,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:05,540 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:05,540 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:05,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:05,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:05,541 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:05,541 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:05,541 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:05,541 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:05,541 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:05,541 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:05,541 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:05,541 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:05,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:05,543 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:05,543 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:05,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:05,544 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:05,544 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:05,619 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:05,620 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:05,620 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:05,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:05,620 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:05,620 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:05,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1789 [2022-12-06 07:31:05,620 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-06 07:31:05,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:05,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1085028645, now seen corresponding path program 1 times [2022-12-06 07:31:05,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:05,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614292944] [2022-12-06 07:31:05,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:05,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:05,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-06 07:31:05,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:05,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614292944] [2022-12-06 07:31:05,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614292944] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:05,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:05,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:05,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245701180] [2022-12-06 07:31:05,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:05,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:05,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:05,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:05,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:05,702 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:05,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:05,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:05,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:05,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:05,739 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:05,740 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:05,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:05,740 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:05,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:05,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:05,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:05,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:05,741 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:05,741 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:05,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:05,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:05,742 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:05,742 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:05,742 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:05,742 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:05,742 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:05,742 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:05,742 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:05,742 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:05,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:05,746 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:05,746 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:05,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:05,746 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:05,746 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:05,833 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:05,834 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-06 07:31:05,834 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:05,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:05,834 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:05,834 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:05,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1790 [2022-12-06 07:31:05,834 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-06 07:31:05,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:05,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1115504838, now seen corresponding path program 1 times [2022-12-06 07:31:05,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:05,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610058539] [2022-12-06 07:31:05,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:05,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:05,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-06 07:31:05,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:05,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610058539] [2022-12-06 07:31:05,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610058539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:05,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:05,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:05,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053727417] [2022-12-06 07:31:05,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:05,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:05,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:05,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:05,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:05,909 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:05,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:05,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:05,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:05,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:05,967 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:05,968 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:05,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:05,968 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:05,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:05,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:05,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:05,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:05,969 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:05,969 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:05,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:05,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:05,970 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:05,970 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:05,970 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:05,970 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:05,970 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:05,971 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:05,971 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:05,971 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:05,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:05,974 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:05,974 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:05,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:05,974 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:05,974 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:06,067 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:06,068 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 07:31:06,068 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:06,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:06,068 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:06,068 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:06,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1791 [2022-12-06 07:31:06,069 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-06 07:31:06,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:06,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1142286947, now seen corresponding path program 1 times [2022-12-06 07:31:06,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:06,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686894412] [2022-12-06 07:31:06,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:06,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:06,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-06 07:31:06,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:06,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686894412] [2022-12-06 07:31:06,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686894412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:06,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:06,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:06,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562002871] [2022-12-06 07:31:06,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:06,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:06,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:06,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:06,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:06,166 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:06,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:06,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:06,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:06,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:06,210 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:06,211 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:06,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:06,211 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:06,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:06,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:06,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:06,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:06,212 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:06,212 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:06,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:06,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:06,213 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:06,213 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:06,213 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:06,213 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:06,213 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:06,214 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:06,214 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:06,214 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:06,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:06,217 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:06,217 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:06,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:06,217 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:06,217 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:06,303 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:06,303 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-06 07:31:06,303 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:06,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:06,303 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:06,304 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:06,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1792 [2022-12-06 07:31:06,304 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-06 07:31:06,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:06,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1172763140, now seen corresponding path program 1 times [2022-12-06 07:31:06,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:06,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901116333] [2022-12-06 07:31:06,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:06,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:06,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:06,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-06 07:31:06,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:06,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901116333] [2022-12-06 07:31:06,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901116333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:06,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:06,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:06,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377675378] [2022-12-06 07:31:06,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:06,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:06,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:06,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:06,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:06,367 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:06,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:06,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:06,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:06,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:06,410 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:06,410 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:06,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:06,411 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:06,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:06,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:06,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:06,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:06,411 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:06,411 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:06,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:06,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:06,412 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:06,412 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:06,412 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:06,412 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:06,412 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:06,412 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:06,412 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:06,412 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:06,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:06,415 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:06,415 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:06,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:06,415 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:06,415 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:06,488 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:06,488 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:31:06,489 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:06,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:06,489 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:06,489 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:06,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1793 [2022-12-06 07:31:06,489 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-06 07:31:06,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:06,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1199545249, now seen corresponding path program 1 times [2022-12-06 07:31:06,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:06,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749269960] [2022-12-06 07:31:06,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:06,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:06,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-06 07:31:06,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:06,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749269960] [2022-12-06 07:31:06,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749269960] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:06,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:06,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:06,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74693355] [2022-12-06 07:31:06,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:06,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:06,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:06,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:06,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:06,554 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:06,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:06,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:06,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:06,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:06,589 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:06,589 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:06,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 370 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:06,589 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:06,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:06,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:06,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:06,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:06,590 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:06,590 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:06,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:06,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:06,591 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:06,591 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:06,591 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:06,591 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:06,591 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:06,591 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:06,591 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:06,591 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:06,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:06,593 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:06,593 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:06,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:06,594 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:06,594 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:06,668 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:06,669 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:06,669 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:06,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:06,669 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:06,669 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:06,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1794 [2022-12-06 07:31:06,669 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-06 07:31:06,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:06,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1230021442, now seen corresponding path program 1 times [2022-12-06 07:31:06,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:06,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557315478] [2022-12-06 07:31:06,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:06,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:06,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:06,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-06 07:31:06,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:06,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557315478] [2022-12-06 07:31:06,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557315478] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:06,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:06,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:06,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229311795] [2022-12-06 07:31:06,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:06,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:06,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:06,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:06,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:06,731 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:06,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:06,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:06,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:06,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:06,773 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:06,773 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:06,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:06,774 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:06,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:06,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:06,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:06,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:06,775 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:06,775 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:06,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:06,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:06,775 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:06,775 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:06,776 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:06,776 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:06,776 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:06,776 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:06,776 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:06,776 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:06,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:06,778 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:06,778 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:06,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:06,779 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:06,779 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:06,853 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:06,854 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:06,854 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:06,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:06,854 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:06,854 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:06,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1795 [2022-12-06 07:31:06,854 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-06 07:31:06,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:06,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1256803551, now seen corresponding path program 1 times [2022-12-06 07:31:06,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:06,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940113267] [2022-12-06 07:31:06,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:06,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:06,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:06,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-06 07:31:06,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:06,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940113267] [2022-12-06 07:31:06,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940113267] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:06,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:06,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:06,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794718139] [2022-12-06 07:31:06,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:06,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:06,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:06,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:06,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:06,921 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:06,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:06,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:06,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:06,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:06,956 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:06,956 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:06,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:06,957 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:06,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:06,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:06,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:06,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:06,957 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:06,957 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:06,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:06,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:06,958 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:06,958 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:06,958 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:06,958 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:06,958 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:06,959 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:06,959 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:06,959 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:06,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:06,961 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:06,961 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:06,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:06,961 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:06,961 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:07,035 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:07,036 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:07,036 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:07,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:07,036 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:07,036 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:07,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1796 [2022-12-06 07:31:07,036 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-06 07:31:07,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:07,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1287279744, now seen corresponding path program 1 times [2022-12-06 07:31:07,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:07,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334780240] [2022-12-06 07:31:07,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:07,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:07,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-06 07:31:07,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:07,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334780240] [2022-12-06 07:31:07,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334780240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:07,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:07,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:07,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626269201] [2022-12-06 07:31:07,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:07,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:07,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:07,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:07,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:07,105 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:07,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:07,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:07,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:07,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:07,147 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:07,147 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:07,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:07,147 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:07,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:07,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:07,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:07,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:07,148 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:07,148 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:07,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:07,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:07,149 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:07,149 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:07,149 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:07,149 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:07,149 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:07,149 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:07,149 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:07,149 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:07,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:07,152 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:07,152 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:07,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:07,152 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:07,152 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:07,228 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:07,229 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:31:07,229 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:07,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:07,229 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:07,229 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:07,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1797 [2022-12-06 07:31:07,229 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-06 07:31:07,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:07,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1314061853, now seen corresponding path program 1 times [2022-12-06 07:31:07,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:07,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847050600] [2022-12-06 07:31:07,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:07,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:07,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-06 07:31:07,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:07,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847050600] [2022-12-06 07:31:07,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847050600] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:07,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:07,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:07,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490715379] [2022-12-06 07:31:07,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:07,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:07,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:07,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:07,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:07,309 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:07,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:07,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:07,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:07,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:07,350 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:07,350 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:07,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:07,350 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:07,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:07,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:07,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:07,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:07,351 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:07,351 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:07,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:07,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:07,352 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:07,352 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:07,352 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:07,352 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:07,352 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:07,352 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:07,352 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:07,352 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:07,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:07,354 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:07,354 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:07,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:07,355 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:07,355 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:07,429 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:07,430 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:07,430 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:07,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:07,430 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:07,430 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:07,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1798 [2022-12-06 07:31:07,430 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-06 07:31:07,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:07,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1344538046, now seen corresponding path program 1 times [2022-12-06 07:31:07,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:07,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953709386] [2022-12-06 07:31:07,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:07,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:07,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:07,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-06 07:31:07,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:07,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953709386] [2022-12-06 07:31:07,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953709386] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:07,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:07,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:07,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139568167] [2022-12-06 07:31:07,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:07,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:07,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:07,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:07,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:07,492 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:07,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:07,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:07,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:07,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:07,534 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:07,534 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:07,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:07,534 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:07,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:07,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:07,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:07,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:07,535 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:07,535 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:07,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:07,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:07,535 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:07,535 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:07,536 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:07,536 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:07,536 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:07,536 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:07,536 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:07,536 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:07,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:07,538 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:07,538 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:07,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:07,538 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:07,538 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:07,613 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:07,614 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:07,614 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:07,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:07,614 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:07,614 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:07,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1799 [2022-12-06 07:31:07,614 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-06 07:31:07,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:07,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1371320155, now seen corresponding path program 1 times [2022-12-06 07:31:07,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:07,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442385647] [2022-12-06 07:31:07,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:07,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:07,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-06 07:31:07,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:07,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442385647] [2022-12-06 07:31:07,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442385647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:07,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:07,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:07,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397652159] [2022-12-06 07:31:07,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:07,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:07,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:07,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:07,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:07,679 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:07,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:07,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:07,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:07,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:07,720 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:07,720 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:07,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:07,721 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:07,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:07,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:07,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:07,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:07,721 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:07,721 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:07,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:07,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:07,722 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:07,722 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:07,722 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:07,722 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:07,722 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:07,722 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:07,722 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:07,722 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:07,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:07,725 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:07,725 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:07,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:07,725 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:07,725 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:07,799 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:07,800 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:07,800 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:07,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:07,800 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:07,800 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:07,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1800 [2022-12-06 07:31:07,800 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-06 07:31:07,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:07,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1401796348, now seen corresponding path program 1 times [2022-12-06 07:31:07,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:07,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657017676] [2022-12-06 07:31:07,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:07,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:07,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-06 07:31:07,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:07,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657017676] [2022-12-06 07:31:07,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657017676] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:07,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:07,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:07,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624670461] [2022-12-06 07:31:07,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:07,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:07,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:07,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:07,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:07,862 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:07,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:07,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:07,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:07,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:07,899 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:07,899 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:07,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:07,899 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:07,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:07,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:07,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:07,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:07,900 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:07,900 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:07,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:07,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:07,901 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:07,901 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:07,901 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:07,901 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:07,901 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:07,901 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:07,901 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:07,901 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:07,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:07,903 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:07,903 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:07,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:07,904 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:07,904 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:07,979 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:07,979 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:07,979 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:07,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:07,980 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:07,980 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:07,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1801 [2022-12-06 07:31:07,980 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-06 07:31:07,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:07,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1428578457, now seen corresponding path program 1 times [2022-12-06 07:31:07,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:07,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54895253] [2022-12-06 07:31:07,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:07,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:08,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-06 07:31:08,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:08,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54895253] [2022-12-06 07:31:08,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54895253] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:08,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:08,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:08,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558102519] [2022-12-06 07:31:08,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:08,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:08,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:08,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:08,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:08,048 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:08,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:08,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:08,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:08,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:08,085 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:08,085 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:08,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:08,086 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:08,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:08,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:08,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:08,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:08,087 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:08,087 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:08,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:08,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:08,087 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:08,087 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:08,088 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:08,088 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:08,088 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:08,088 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:08,088 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:08,088 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:08,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:08,090 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:08,090 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:08,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:08,091 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:08,091 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:08,165 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:08,166 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:08,166 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:08,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:08,166 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:08,166 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:08,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1802 [2022-12-06 07:31:08,166 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-06 07:31:08,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:08,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1459054650, now seen corresponding path program 1 times [2022-12-06 07:31:08,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:08,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746001280] [2022-12-06 07:31:08,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:08,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:08,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-06 07:31:08,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:08,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746001280] [2022-12-06 07:31:08,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746001280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:08,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:08,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:08,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751038015] [2022-12-06 07:31:08,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:08,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:08,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:08,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:08,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:08,230 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:08,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:08,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:08,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:08,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:08,273 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:08,273 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:08,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:08,274 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:08,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:08,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:08,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:08,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:08,274 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:08,274 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:08,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:08,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:08,275 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:08,275 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:08,275 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:08,275 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:08,275 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:08,275 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:08,275 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:08,276 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:08,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:08,278 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:08,278 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:08,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:08,278 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:08,278 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:08,353 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:08,354 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:08,354 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:08,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:08,354 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:08,354 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:08,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1803 [2022-12-06 07:31:08,355 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-06 07:31:08,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:08,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1485836759, now seen corresponding path program 1 times [2022-12-06 07:31:08,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:08,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951402334] [2022-12-06 07:31:08,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:08,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:08,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-06 07:31:08,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:08,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951402334] [2022-12-06 07:31:08,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951402334] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:08,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:08,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:08,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759071595] [2022-12-06 07:31:08,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:08,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:08,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:08,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:08,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:08,432 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:08,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:08,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:08,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:08,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:08,466 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:08,467 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:08,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:08,467 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:08,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:08,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:08,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:08,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:08,468 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:08,468 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:08,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:08,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:08,468 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:08,468 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:08,468 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:08,468 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:08,469 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:08,469 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:08,469 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:08,469 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:08,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:08,471 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:08,471 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:08,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:08,471 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:08,471 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:08,546 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:08,546 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:08,547 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:08,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:08,547 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:08,547 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:08,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1804 [2022-12-06 07:31:08,547 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-06 07:31:08,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:08,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1516312952, now seen corresponding path program 1 times [2022-12-06 07:31:08,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:08,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540297224] [2022-12-06 07:31:08,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:08,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:08,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-06 07:31:08,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:08,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540297224] [2022-12-06 07:31:08,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540297224] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:08,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:08,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:08,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121217464] [2022-12-06 07:31:08,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:08,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:08,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:08,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:08,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:08,614 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:08,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:08,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:08,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:08,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:08,657 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:08,657 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:08,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 349 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:08,658 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:08,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:08,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:08,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:08,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:08,658 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:08,658 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:08,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:08,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:08,659 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:08,659 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:08,659 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:08,659 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:08,659 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:08,659 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:08,659 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:08,659 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:08,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:08,661 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:08,662 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:08,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:08,662 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:08,662 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:08,737 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:08,738 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:08,738 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:08,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:08,738 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:08,738 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:08,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1805 [2022-12-06 07:31:08,738 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-06 07:31:08,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:08,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1543095061, now seen corresponding path program 1 times [2022-12-06 07:31:08,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:08,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866699982] [2022-12-06 07:31:08,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:08,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:08,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-06 07:31:08,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:08,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866699982] [2022-12-06 07:31:08,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866699982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:08,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:08,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:08,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704713216] [2022-12-06 07:31:08,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:08,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:08,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:08,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:08,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:08,803 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:08,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:08,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:08,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:08,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:08,840 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:08,840 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:08,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:08,841 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:08,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:08,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:08,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:08,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:08,841 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:08,841 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:08,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:08,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:08,842 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:08,842 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:08,842 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:08,843 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:08,843 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:08,843 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:08,843 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:08,843 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:08,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:08,845 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:08,845 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:08,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:08,846 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:08,846 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:08,921 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:08,922 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:08,922 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:08,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:08,922 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:08,922 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:08,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1806 [2022-12-06 07:31:08,922 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-06 07:31:08,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:08,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1573571254, now seen corresponding path program 1 times [2022-12-06 07:31:08,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:08,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626205949] [2022-12-06 07:31:08,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:08,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:08,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-06 07:31:08,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:08,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626205949] [2022-12-06 07:31:08,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626205949] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:08,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:08,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:08,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881118271] [2022-12-06 07:31:08,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:08,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:08,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:08,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:08,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:08,984 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:08,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:08,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:08,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:08,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:09,026 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:09,026 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:09,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:09,027 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:09,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:09,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:09,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:09,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:09,027 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:09,027 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:09,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:09,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:09,028 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:09,028 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:09,028 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:09,028 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:09,028 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:09,028 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:09,028 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:09,028 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:09,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:09,030 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:09,031 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:09,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:09,031 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:09,031 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:09,105 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:09,106 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:09,106 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:09,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:09,106 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:09,106 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:09,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1807 [2022-12-06 07:31:09,106 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-06 07:31:09,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:09,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1600353363, now seen corresponding path program 1 times [2022-12-06 07:31:09,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:09,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464796440] [2022-12-06 07:31:09,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:09,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:09,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-06 07:31:09,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:09,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464796440] [2022-12-06 07:31:09,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464796440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:09,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:09,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:09,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246624555] [2022-12-06 07:31:09,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:09,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:09,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:09,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:09,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:09,172 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:09,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:09,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:09,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:09,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:09,214 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:09,214 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:09,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:09,215 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:09,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:09,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:09,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:09,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:09,215 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:09,215 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:09,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:09,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:09,216 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:09,216 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:09,216 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:09,216 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:09,216 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:09,217 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:09,217 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:09,217 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:09,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:09,219 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:09,219 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:09,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:09,219 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:09,219 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:09,295 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:09,296 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:31:09,296 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:09,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:09,296 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:09,296 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:09,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1808 [2022-12-06 07:31:09,296 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-06 07:31:09,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:09,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1630829556, now seen corresponding path program 1 times [2022-12-06 07:31:09,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:09,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980750127] [2022-12-06 07:31:09,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:09,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:09,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-06 07:31:09,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:09,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980750127] [2022-12-06 07:31:09,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980750127] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:09,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:09,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:09,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149323076] [2022-12-06 07:31:09,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:09,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:09,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:09,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:09,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:09,358 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:09,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:09,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:09,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:09,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:09,395 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:09,395 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:09,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:09,396 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:09,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:09,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:09,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:09,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:09,396 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:09,396 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:09,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:09,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:09,397 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:09,397 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:09,397 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:09,397 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:09,397 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:09,397 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:09,397 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:09,397 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:09,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:09,400 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:09,400 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:09,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:09,400 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:09,400 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:09,475 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:09,475 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:09,475 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:09,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:09,476 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:09,476 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:09,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1809 [2022-12-06 07:31:09,476 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-06 07:31:09,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:09,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1657611665, now seen corresponding path program 1 times [2022-12-06 07:31:09,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:09,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370857855] [2022-12-06 07:31:09,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:09,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:09,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:09,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-06 07:31:09,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:09,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370857855] [2022-12-06 07:31:09,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370857855] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:09,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:09,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:09,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235428929] [2022-12-06 07:31:09,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:09,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:09,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:09,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:09,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:09,557 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:09,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:09,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:09,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:09,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:09,599 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:09,599 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:09,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:09,599 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:09,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:09,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:09,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:09,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:09,600 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:09,600 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:09,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:09,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:09,601 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:09,601 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:09,601 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:09,601 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:09,601 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:09,601 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:09,601 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:09,601 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:09,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:09,603 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:09,603 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:09,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:09,604 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:09,604 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:09,681 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:09,682 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:31:09,682 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:09,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:09,682 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:09,682 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:09,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1810 [2022-12-06 07:31:09,682 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-06 07:31:09,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:09,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1688087858, now seen corresponding path program 1 times [2022-12-06 07:31:09,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:09,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237460416] [2022-12-06 07:31:09,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:09,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:09,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-06 07:31:09,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:09,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237460416] [2022-12-06 07:31:09,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237460416] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:09,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:09,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:09,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374024241] [2022-12-06 07:31:09,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:09,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:09,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:09,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:09,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:09,745 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:09,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:09,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:09,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:09,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:09,781 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:09,781 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:09,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:09,782 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:09,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:09,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:09,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:09,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:09,782 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:09,782 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:09,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:09,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:09,783 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:09,783 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:09,783 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:09,783 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:09,783 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:09,784 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:09,784 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:09,784 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:09,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:09,786 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:09,786 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:09,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:09,786 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:09,786 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:09,861 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:09,862 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:09,862 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:09,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:09,862 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:09,862 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:09,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1811 [2022-12-06 07:31:09,862 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-06 07:31:09,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:09,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1714869967, now seen corresponding path program 1 times [2022-12-06 07:31:09,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:09,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615609770] [2022-12-06 07:31:09,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:09,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:09,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-06 07:31:09,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:09,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615609770] [2022-12-06 07:31:09,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615609770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:09,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:09,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:09,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431882825] [2022-12-06 07:31:09,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:09,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:09,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:09,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:09,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:09,931 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:09,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:09,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:09,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:09,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:09,973 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:09,973 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:09,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:09,973 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:09,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:09,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:09,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:09,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:09,974 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:09,974 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:09,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:09,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:09,975 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:09,975 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:09,975 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:09,975 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:09,975 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:09,975 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:09,975 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:09,975 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:09,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:09,977 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:09,977 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:09,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:09,978 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:09,978 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:10,053 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:10,054 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:10,054 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:10,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:10,055 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:10,055 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:10,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1812 [2022-12-06 07:31:10,055 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-06 07:31:10,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:10,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1745346160, now seen corresponding path program 1 times [2022-12-06 07:31:10,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:10,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334904996] [2022-12-06 07:31:10,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:10,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:10,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-06 07:31:10,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:10,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334904996] [2022-12-06 07:31:10,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334904996] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:10,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:10,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:10,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802655138] [2022-12-06 07:31:10,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:10,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:10,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:10,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:10,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:10,120 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:10,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:10,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:10,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:10,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:10,173 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:10,173 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:10,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 350 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:10,174 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:10,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:10,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:10,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:10,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:10,174 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:10,174 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:10,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:10,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:10,175 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:10,175 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:10,175 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:10,175 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:10,176 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:10,176 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:10,176 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:10,176 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:10,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:10,178 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:10,178 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:10,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:10,179 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:10,179 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:10,265 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:10,267 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-06 07:31:10,267 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:10,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:10,267 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:10,267 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:10,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1813 [2022-12-06 07:31:10,267 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-06 07:31:10,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:10,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1772128269, now seen corresponding path program 1 times [2022-12-06 07:31:10,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:10,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773118996] [2022-12-06 07:31:10,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:10,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:10,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-06 07:31:10,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:10,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773118996] [2022-12-06 07:31:10,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773118996] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:10,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:10,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:10,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817718224] [2022-12-06 07:31:10,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:10,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:10,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:10,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:10,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:10,339 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:10,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:10,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:10,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:10,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:10,375 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:10,376 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:10,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:10,376 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:10,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:10,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:10,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:10,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:10,377 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:10,377 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:10,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:10,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:10,377 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:10,378 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:10,378 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:10,378 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:10,378 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:10,378 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:10,378 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:10,378 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:10,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:10,380 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:10,380 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:10,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:10,381 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:10,381 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:10,459 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:10,460 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:31:10,460 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:10,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:10,460 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:10,460 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:10,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1814 [2022-12-06 07:31:10,460 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-06 07:31:10,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:10,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1802604462, now seen corresponding path program 1 times [2022-12-06 07:31:10,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:10,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15953204] [2022-12-06 07:31:10,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:10,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:10,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-06 07:31:10,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:10,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15953204] [2022-12-06 07:31:10,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15953204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:10,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:10,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:10,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633510187] [2022-12-06 07:31:10,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:10,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:10,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:10,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:10,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:10,526 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:10,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:10,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:10,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:10,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:10,565 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:10,565 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:10,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:10,566 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:10,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:10,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:10,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:10,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:10,566 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:10,566 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:10,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:10,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:10,567 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:10,567 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:10,567 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:10,567 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:10,567 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:10,567 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:10,567 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:10,567 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:10,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:10,570 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:10,570 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:10,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:10,570 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:10,570 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:10,646 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:10,646 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:10,646 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:10,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:10,646 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:10,647 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:10,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1815 [2022-12-06 07:31:10,647 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-06 07:31:10,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:10,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1829386571, now seen corresponding path program 1 times [2022-12-06 07:31:10,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:10,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027792582] [2022-12-06 07:31:10,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:10,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:10,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-06 07:31:10,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:10,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027792582] [2022-12-06 07:31:10,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027792582] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:10,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:10,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:10,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634004639] [2022-12-06 07:31:10,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:10,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:10,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:10,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:10,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:10,726 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:10,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:10,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:10,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:10,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:10,768 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:10,768 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:10,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:10,769 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:10,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:10,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:10,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:10,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:10,769 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:10,769 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:10,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:10,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:10,770 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:10,770 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:10,770 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:10,770 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:10,770 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:10,771 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:10,771 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:10,771 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:10,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:10,773 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:10,773 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:10,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:10,773 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:10,773 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:10,848 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:10,849 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:10,849 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:10,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:10,849 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:10,849 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:10,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1816 [2022-12-06 07:31:10,850 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-06 07:31:10,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:10,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1859862764, now seen corresponding path program 1 times [2022-12-06 07:31:10,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:10,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215419165] [2022-12-06 07:31:10,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:10,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:10,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-06 07:31:10,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:10,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215419165] [2022-12-06 07:31:10,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215419165] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:10,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:10,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:10,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358961065] [2022-12-06 07:31:10,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:10,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:10,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:10,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:10,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:10,913 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:10,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:10,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:10,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:10,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:10,949 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:10,949 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:10,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:10,949 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:10,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:10,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:10,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:10,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:10,950 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:10,950 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:10,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:10,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:10,950 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:10,950 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:10,951 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:10,951 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:10,951 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:10,951 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:10,951 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:10,951 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:10,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:10,953 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:10,953 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:10,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:10,953 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:10,953 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:11,026 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:11,027 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:31:11,027 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:11,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:11,027 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:11,027 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:11,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1817 [2022-12-06 07:31:11,027 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-06 07:31:11,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:11,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1886644873, now seen corresponding path program 1 times [2022-12-06 07:31:11,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:11,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721521089] [2022-12-06 07:31:11,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:11,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:11,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-06 07:31:11,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:11,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721521089] [2022-12-06 07:31:11,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721521089] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:11,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:11,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:11,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614729325] [2022-12-06 07:31:11,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:11,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:11,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:11,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:11,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:11,107 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:11,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:11,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:11,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:11,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:11,143 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:11,143 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:11,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:11,144 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:11,144 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:11,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:11,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:11,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:11,144 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:11,144 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:11,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:11,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:11,145 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:11,145 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:11,145 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:11,145 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:11,146 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:11,146 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:11,146 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:11,146 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:11,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:11,148 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:11,148 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:11,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:11,148 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:11,148 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:11,222 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:11,223 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:11,223 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:11,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:11,224 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:11,224 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:11,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1818 [2022-12-06 07:31:11,224 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-06 07:31:11,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:11,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1917121066, now seen corresponding path program 1 times [2022-12-06 07:31:11,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:11,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661569656] [2022-12-06 07:31:11,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:11,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:11,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:31:11,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:11,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661569656] [2022-12-06 07:31:11,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661569656] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:11,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:11,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:11,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907251617] [2022-12-06 07:31:11,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:11,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:11,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:11,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:11,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:11,286 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:11,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:11,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:11,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:11,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:11,321 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:11,321 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:11,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:11,322 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:11,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:11,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:11,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:11,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:11,322 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:11,322 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:11,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:11,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:11,323 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:11,323 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:11,323 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:11,323 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:11,323 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:11,324 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:11,324 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:11,324 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:11,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:11,326 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:11,326 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:11,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:11,326 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:11,326 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:11,400 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:11,401 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:11,401 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:11,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:11,401 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:11,401 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:11,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1819 [2022-12-06 07:31:11,401 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-06 07:31:11,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:11,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1943903175, now seen corresponding path program 1 times [2022-12-06 07:31:11,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:11,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858217624] [2022-12-06 07:31:11,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:11,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:11,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-06 07:31:11,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:11,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858217624] [2022-12-06 07:31:11,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858217624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:11,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:11,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:11,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144819141] [2022-12-06 07:31:11,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:11,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:11,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:11,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:11,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:11,466 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:11,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:11,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:11,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:11,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:11,507 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:11,507 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:11,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:11,507 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:11,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:11,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:11,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:11,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:11,508 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:11,508 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:11,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:11,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:11,509 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:11,509 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:11,509 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:11,509 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:11,509 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:11,509 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:11,509 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:11,509 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:11,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:11,511 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:11,511 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:11,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:11,512 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:11,512 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:11,586 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:11,587 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:11,587 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:11,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:11,587 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:11,587 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:11,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1820 [2022-12-06 07:31:11,587 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-06 07:31:11,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:11,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1974379368, now seen corresponding path program 1 times [2022-12-06 07:31:11,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:11,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645962339] [2022-12-06 07:31:11,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:11,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:11,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-06 07:31:11,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:11,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645962339] [2022-12-06 07:31:11,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645962339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:11,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:11,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:11,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312327604] [2022-12-06 07:31:11,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:11,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:11,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:11,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:11,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:11,649 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:11,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:11,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:11,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:11,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:11,692 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:11,692 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:11,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:11,693 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:11,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:11,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:11,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:11,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:11,693 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:11,693 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:11,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:11,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:11,694 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:11,694 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:11,694 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:11,694 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:11,694 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:11,694 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:11,695 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:11,695 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:11,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:11,697 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:11,697 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:11,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:11,697 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:11,697 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:11,773 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:11,774 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:31:11,774 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:11,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:11,774 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:11,774 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:11,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1821 [2022-12-06 07:31:11,774 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-06 07:31:11,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:11,774 INFO L85 PathProgramCache]: Analyzing trace with hash 2001161477, now seen corresponding path program 1 times [2022-12-06 07:31:11,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:11,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053512038] [2022-12-06 07:31:11,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:11,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:11,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:11,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-06 07:31:11,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:11,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053512038] [2022-12-06 07:31:11,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053512038] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:11,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:11,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:11,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085063270] [2022-12-06 07:31:11,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:11,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:11,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:11,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:11,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:11,852 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:11,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:11,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:11,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:11,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:11,888 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:11,888 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:11,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:11,888 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:11,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:11,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:11,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:11,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:11,889 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:11,889 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:11,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:11,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:11,889 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:11,889 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:11,890 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:11,890 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:11,890 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:11,890 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:11,890 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:11,890 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:11,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:11,892 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:11,892 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:11,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:11,892 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:11,892 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:11,966 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:11,967 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:11,967 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:11,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:11,967 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:11,967 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:11,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1822 [2022-12-06 07:31:11,967 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-06 07:31:11,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:11,968 INFO L85 PathProgramCache]: Analyzing trace with hash 2031637670, now seen corresponding path program 1 times [2022-12-06 07:31:11,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:11,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735266921] [2022-12-06 07:31:11,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:11,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:12,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-06 07:31:12,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:12,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735266921] [2022-12-06 07:31:12,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735266921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:12,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:12,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:12,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627611963] [2022-12-06 07:31:12,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:12,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:12,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:12,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:12,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:12,038 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:12,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:12,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:12,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:12,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:12,082 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:12,082 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:12,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:12,082 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:12,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:12,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:12,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:12,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:12,083 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:12,083 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:12,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:12,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:12,084 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:12,084 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:12,084 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:12,084 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:12,084 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:12,084 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:12,084 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:12,084 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:12,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:12,086 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:12,086 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:12,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:12,087 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:12,087 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:12,161 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:12,162 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:12,162 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:12,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:12,162 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:12,162 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:12,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1823 [2022-12-06 07:31:12,162 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-06 07:31:12,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:12,163 INFO L85 PathProgramCache]: Analyzing trace with hash 2058419779, now seen corresponding path program 1 times [2022-12-06 07:31:12,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:12,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013549423] [2022-12-06 07:31:12,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:12,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:12,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:12,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-06 07:31:12,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:12,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013549423] [2022-12-06 07:31:12,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013549423] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:12,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:12,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:12,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895925850] [2022-12-06 07:31:12,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:12,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:12,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:12,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:12,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:12,231 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:12,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:12,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:12,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:12,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:12,274 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:12,274 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:12,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:12,274 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:12,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:12,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:12,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:12,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:12,275 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:12,275 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:12,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:12,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:12,275 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:12,276 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:12,276 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:12,276 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:12,276 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:12,276 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:12,276 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:12,276 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:12,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:12,278 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:12,278 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:12,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:12,279 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:12,279 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:12,353 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:12,354 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:12,354 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:12,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:12,354 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:12,354 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:12,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1824 [2022-12-06 07:31:12,354 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-06 07:31:12,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:12,354 INFO L85 PathProgramCache]: Analyzing trace with hash 2088895972, now seen corresponding path program 1 times [2022-12-06 07:31:12,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:12,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10538526] [2022-12-06 07:31:12,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:12,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:12,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-06 07:31:12,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:12,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10538526] [2022-12-06 07:31:12,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10538526] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:12,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:12,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:12,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397791065] [2022-12-06 07:31:12,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:12,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:12,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:12,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:12,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:12,416 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:12,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:12,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:12,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:12,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:12,458 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:12,458 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:12,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:12,459 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:12,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:12,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:12,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:12,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:12,459 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:12,459 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:12,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:12,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:12,460 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:12,460 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:12,460 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:12,460 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:12,460 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:12,460 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:12,460 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:12,460 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:12,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:12,462 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:12,462 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:12,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:12,463 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:12,463 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:12,536 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:12,537 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:12,537 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:12,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:12,537 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:12,537 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:12,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1825 [2022-12-06 07:31:12,537 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-06 07:31:12,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:12,537 INFO L85 PathProgramCache]: Analyzing trace with hash 2115678081, now seen corresponding path program 1 times [2022-12-06 07:31:12,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:12,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820940584] [2022-12-06 07:31:12,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:12,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:12,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:31:12,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:12,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820940584] [2022-12-06 07:31:12,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820940584] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:12,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:12,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:12,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742053124] [2022-12-06 07:31:12,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:12,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:12,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:12,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:12,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:12,603 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:12,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:12,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:12,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:12,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:12,639 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:12,639 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:12,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:12,639 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:12,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:12,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:12,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:12,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:12,640 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:12,640 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:12,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:12,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:12,641 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:12,641 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:12,641 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:12,641 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:12,641 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:12,641 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:12,641 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:12,641 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:12,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:12,643 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:12,643 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:12,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:12,644 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:12,644 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:12,718 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:12,719 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:12,719 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:12,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:12,719 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:12,719 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:12,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1826 [2022-12-06 07:31:12,719 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-06 07:31:12,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:12,719 INFO L85 PathProgramCache]: Analyzing trace with hash 2146154274, now seen corresponding path program 1 times [2022-12-06 07:31:12,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:12,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770869129] [2022-12-06 07:31:12,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:12,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:12,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-06 07:31:12,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:12,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770869129] [2022-12-06 07:31:12,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770869129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:12,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:12,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:12,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739836533] [2022-12-06 07:31:12,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:12,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:12,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:12,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:12,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:12,784 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:12,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:12,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:12,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:12,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:12,822 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:12,822 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:12,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:12,822 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:12,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:12,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:12,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:12,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:12,823 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:12,823 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:12,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:12,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:12,823 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:12,824 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:12,824 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:12,824 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:12,824 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:12,824 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:12,824 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:12,824 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:12,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:12,826 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:12,826 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:12,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:12,827 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:12,827 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:12,901 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:12,902 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:12,902 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:12,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:12,902 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:12,902 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:12,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1827 [2022-12-06 07:31:12,902 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-06 07:31:12,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:12,903 INFO L85 PathProgramCache]: Analyzing trace with hash -2122030913, now seen corresponding path program 1 times [2022-12-06 07:31:12,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:12,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631994409] [2022-12-06 07:31:12,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:12,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:12,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-06 07:31:12,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:12,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631994409] [2022-12-06 07:31:12,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631994409] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:12,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:12,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:12,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757356129] [2022-12-06 07:31:12,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:12,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:12,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:12,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:12,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:12,983 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:12,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:12,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:12,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:12,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:13,023 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:13,023 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:13,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:13,024 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:13,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:13,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:13,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:13,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:13,024 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:13,024 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:13,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:13,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:13,025 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:13,025 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:13,025 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:13,025 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:13,025 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:13,025 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:13,026 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:13,026 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:13,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:13,028 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:13,028 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:13,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:13,028 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:13,028 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:13,102 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:13,103 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:13,103 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:13,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:13,103 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:13,103 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:13,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1828 [2022-12-06 07:31:13,104 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-06 07:31:13,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:13,104 INFO L85 PathProgramCache]: Analyzing trace with hash -2091554720, now seen corresponding path program 1 times [2022-12-06 07:31:13,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:13,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217976284] [2022-12-06 07:31:13,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:13,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:13,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-06 07:31:13,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:13,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217976284] [2022-12-06 07:31:13,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217976284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:13,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:13,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:13,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168882222] [2022-12-06 07:31:13,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:13,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:13,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:13,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:13,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:13,167 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:13,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:13,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:13,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:13,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:13,211 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:13,211 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:13,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:13,211 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:13,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:13,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:13,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:13,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:13,212 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:13,212 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:13,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:13,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:13,213 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:13,213 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:13,213 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:13,213 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:13,213 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:13,213 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:13,213 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:13,213 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:13,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:13,216 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:13,216 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:13,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:13,216 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:13,216 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:13,294 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:13,295 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:31:13,295 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:13,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:13,295 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:13,295 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:13,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1829 [2022-12-06 07:31:13,295 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-06 07:31:13,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:13,295 INFO L85 PathProgramCache]: Analyzing trace with hash -2064772611, now seen corresponding path program 1 times [2022-12-06 07:31:13,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:13,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799012722] [2022-12-06 07:31:13,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:13,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:13,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-06 07:31:13,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:13,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799012722] [2022-12-06 07:31:13,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799012722] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:13,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:13,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:13,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462342304] [2022-12-06 07:31:13,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:13,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:13,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:13,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:13,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:13,376 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:13,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:13,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:13,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:13,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:13,417 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:13,417 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:13,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:13,417 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:13,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:13,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:13,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:13,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:13,418 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:13,418 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:13,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:13,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:13,419 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:13,419 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:13,419 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:13,419 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:13,419 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:13,419 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:13,419 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:13,419 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:13,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:13,422 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:13,422 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:13,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:13,422 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:13,422 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:13,497 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:13,498 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:13,498 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:13,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:13,498 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:13,498 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:13,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1830 [2022-12-06 07:31:13,498 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-06 07:31:13,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:13,498 INFO L85 PathProgramCache]: Analyzing trace with hash -2034296418, now seen corresponding path program 1 times [2022-12-06 07:31:13,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:13,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240570765] [2022-12-06 07:31:13,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:13,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:13,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-06 07:31:13,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:13,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240570765] [2022-12-06 07:31:13,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240570765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:13,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:13,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:13,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768513781] [2022-12-06 07:31:13,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:13,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:13,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:13,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:13,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:13,560 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:13,560 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:13,560 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:13,560 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:13,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:13,596 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:13,596 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:13,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:13,597 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:13,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:13,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:13,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:13,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:13,597 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:13,597 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:13,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:13,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:13,598 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:13,598 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:13,598 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:13,598 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:13,598 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:13,598 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:13,598 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:13,598 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:13,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:13,600 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:13,601 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:13,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:13,601 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:13,601 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:13,673 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:13,674 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:31:13,674 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:13,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:13,674 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:13,674 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:13,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1831 [2022-12-06 07:31:13,674 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-06 07:31:13,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:13,674 INFO L85 PathProgramCache]: Analyzing trace with hash -2007514309, now seen corresponding path program 1 times [2022-12-06 07:31:13,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:13,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146498545] [2022-12-06 07:31:13,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:13,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:13,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-06 07:31:13,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:13,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146498545] [2022-12-06 07:31:13,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146498545] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:13,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:13,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:13,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356608160] [2022-12-06 07:31:13,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:13,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:13,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:13,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:13,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:13,741 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:13,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:13,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:13,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:13,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:13,778 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:13,778 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:13,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:13,778 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:13,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:13,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:13,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:13,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:13,779 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:13,779 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:13,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:13,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:13,780 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:13,780 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:13,780 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:13,780 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:13,780 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:13,780 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:13,780 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:13,780 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:13,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:13,783 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:13,783 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:13,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:13,783 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:13,783 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:13,858 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:13,859 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:13,859 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:13,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:13,859 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:13,859 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:13,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1832 [2022-12-06 07:31:13,859 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-06 07:31:13,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:13,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1977038116, now seen corresponding path program 1 times [2022-12-06 07:31:13,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:13,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279166052] [2022-12-06 07:31:13,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:13,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:13,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-06 07:31:13,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:13,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279166052] [2022-12-06 07:31:13,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279166052] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:13,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:13,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:13,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265868458] [2022-12-06 07:31:13,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:13,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:13,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:13,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:13,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:13,931 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:13,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:13,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:13,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:13,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:13,975 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:13,976 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:13,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:13,976 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:13,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:13,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:13,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:13,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:13,977 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:13,977 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:13,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:13,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:13,977 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:13,977 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:13,977 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:13,977 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:13,978 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:13,978 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:13,978 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:13,978 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:13,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:13,980 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:13,981 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:13,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:13,981 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:13,981 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:14,055 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:14,055 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:14,055 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:14,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:14,056 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:14,056 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:14,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1833 [2022-12-06 07:31:14,056 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-06 07:31:14,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:14,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1950256007, now seen corresponding path program 1 times [2022-12-06 07:31:14,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:14,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747215585] [2022-12-06 07:31:14,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:14,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:14,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-06 07:31:14,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:14,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747215585] [2022-12-06 07:31:14,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747215585] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:14,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:14,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:14,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096609017] [2022-12-06 07:31:14,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:14,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:14,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:14,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:14,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:14,141 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:14,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:14,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:14,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:14,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:14,181 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:14,181 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:14,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 372 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:14,181 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:14,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:14,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:14,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:14,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:14,182 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:14,182 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:14,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:14,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:14,182 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:14,183 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:14,183 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:14,183 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:14,183 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:14,183 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:14,183 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:14,183 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:14,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:14,185 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:14,185 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:14,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:14,186 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:14,186 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:14,260 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:14,261 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:14,261 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:14,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:14,261 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:14,261 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:14,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1834 [2022-12-06 07:31:14,261 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-06 07:31:14,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:14,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1919779814, now seen corresponding path program 1 times [2022-12-06 07:31:14,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:14,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606500836] [2022-12-06 07:31:14,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:14,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:14,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-06 07:31:14,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:14,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606500836] [2022-12-06 07:31:14,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606500836] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:14,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:14,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:14,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900313436] [2022-12-06 07:31:14,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:14,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:14,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:14,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:14,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:14,324 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:14,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:14,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:14,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:14,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:14,366 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:14,366 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:14,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:14,366 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:14,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:14,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:14,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:14,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:14,367 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:14,367 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:14,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:14,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:14,367 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:14,367 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:14,368 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:14,368 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:14,368 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:14,368 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:14,368 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:14,368 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:14,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:14,370 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:14,370 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:14,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:14,370 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:14,371 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:14,448 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:14,449 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:31:14,449 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:14,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:14,449 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:14,449 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:14,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1835 [2022-12-06 07:31:14,449 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-06 07:31:14,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:14,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1892997705, now seen corresponding path program 1 times [2022-12-06 07:31:14,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:14,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735584801] [2022-12-06 07:31:14,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:14,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:14,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-06 07:31:14,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:14,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735584801] [2022-12-06 07:31:14,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735584801] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:14,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:14,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:14,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901675689] [2022-12-06 07:31:14,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:14,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:14,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:14,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:14,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:14,514 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:14,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:14,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:14,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:14,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:14,556 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:14,556 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:14,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:14,557 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:14,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:14,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:14,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:14,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:14,557 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:14,557 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:14,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:14,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:14,558 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:14,558 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:14,558 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:14,558 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:14,558 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:14,558 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:14,558 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:14,558 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:14,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:14,561 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:14,561 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:14,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:14,561 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:14,561 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:14,635 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:14,635 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:14,635 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:14,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:14,636 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:14,636 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:14,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1836 [2022-12-06 07:31:14,636 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-06 07:31:14,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:14,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1862521512, now seen corresponding path program 1 times [2022-12-06 07:31:14,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:14,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203766168] [2022-12-06 07:31:14,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:14,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:14,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-06 07:31:14,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:14,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203766168] [2022-12-06 07:31:14,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203766168] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:14,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:14,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:14,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288542160] [2022-12-06 07:31:14,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:14,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:14,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:14,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:14,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:14,699 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:14,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:14,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:14,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:14,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:14,740 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:14,740 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:14,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:14,741 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:14,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:14,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:14,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:14,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:14,741 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:14,741 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:14,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:14,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:14,742 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:14,742 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:14,742 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:14,742 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:14,742 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:14,742 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:14,742 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:14,743 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:14,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:14,745 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:14,745 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:14,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:14,745 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:14,745 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:14,821 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:14,822 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:31:14,822 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:14,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:14,822 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:14,822 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:14,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1837 [2022-12-06 07:31:14,822 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-06 07:31:14,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:14,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1835739403, now seen corresponding path program 1 times [2022-12-06 07:31:14,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:14,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112545114] [2022-12-06 07:31:14,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:14,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31: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-06 07:31:14,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:14,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112545114] [2022-12-06 07:31:14,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112545114] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:14,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:14,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:14,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730646121] [2022-12-06 07:31:14,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:14,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:14,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:14,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:14,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:14,887 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:14,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:14,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:14,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:14,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:14,929 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:14,929 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:14,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:14,929 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:14,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:14,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:14,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:14,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:14,930 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:14,930 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:14,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:14,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:14,930 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:14,931 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:14,931 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:14,931 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:14,931 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:14,931 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:14,931 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:14,931 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:14,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:14,933 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:14,933 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:14,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:14,933 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:14,933 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:15,007 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:15,008 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:15,008 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:15,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:15,008 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:15,008 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:15,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1838 [2022-12-06 07:31:15,008 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-06 07:31:15,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:15,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1805263210, now seen corresponding path program 1 times [2022-12-06 07:31:15,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:15,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428925411] [2022-12-06 07:31:15,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:15,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:15,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-06 07:31:15,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:15,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428925411] [2022-12-06 07:31:15,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428925411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:15,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:15,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:15,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139549527] [2022-12-06 07:31:15,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:15,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:15,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:15,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:15,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:15,074 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:15,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:15,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:15,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:15,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:15,114 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:15,115 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:15,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:15,115 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:15,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:15,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:15,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:15,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:15,116 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:15,116 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:15,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:15,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:15,117 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:15,117 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:15,117 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:15,117 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:15,117 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:15,117 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:15,117 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:15,117 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:15,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:15,119 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:15,119 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:15,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:15,120 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:15,120 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:15,193 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:15,194 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:15,194 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:15,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:15,194 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:15,194 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:15,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1839 [2022-12-06 07:31:15,194 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-06 07:31:15,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:15,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1778481101, now seen corresponding path program 1 times [2022-12-06 07:31:15,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:15,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429982121] [2022-12-06 07:31:15,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:15,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:15,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-06 07:31:15,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:15,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429982121] [2022-12-06 07:31:15,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429982121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:15,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:15,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:15,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643608280] [2022-12-06 07:31:15,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:15,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:15,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:15,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:15,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:15,270 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:15,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:15,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:15,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:15,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:15,327 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:15,327 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:15,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:15,327 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:15,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:15,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:15,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:15,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:15,328 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:15,328 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:15,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:15,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:15,329 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:15,329 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:15,329 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:15,329 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:15,329 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:15,329 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:15,329 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:15,329 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:15,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:15,331 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:15,331 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:15,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:15,332 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:15,332 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:15,405 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:15,406 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:15,406 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:15,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:15,406 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:15,406 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:15,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1840 [2022-12-06 07:31:15,406 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-06 07:31:15,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:15,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1748004908, now seen corresponding path program 1 times [2022-12-06 07:31:15,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:15,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104066607] [2022-12-06 07:31:15,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:15,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:15,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-06 07:31:15,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:15,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104066607] [2022-12-06 07:31:15,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104066607] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:15,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:15,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:15,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537623817] [2022-12-06 07:31:15,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:15,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:15,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:15,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:15,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:15,468 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:15,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:15,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:15,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:15,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:15,504 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:15,505 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:15,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:15,505 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:15,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:15,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:15,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:15,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:15,506 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:15,506 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:15,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:15,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:15,506 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:15,506 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:15,507 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:15,507 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:15,507 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:15,507 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:15,507 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:15,507 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:15,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:15,509 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:15,509 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:15,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:15,509 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:15,509 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:15,594 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:15,594 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 07:31:15,594 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:15,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:15,595 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:15,595 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:15,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1841 [2022-12-06 07:31:15,595 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-06 07:31:15,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:15,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1721222799, now seen corresponding path program 1 times [2022-12-06 07:31:15,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:15,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051566578] [2022-12-06 07:31:15,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:15,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31: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-06 07:31:15,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:15,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051566578] [2022-12-06 07:31:15,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051566578] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:15,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:15,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:15,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690008774] [2022-12-06 07:31:15,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:15,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:15,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:15,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:15,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:15,667 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:15,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:15,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:15,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:15,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:15,709 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:15,709 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:15,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:15,710 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:15,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:15,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:15,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:15,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:15,710 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:15,710 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:15,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:15,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:15,711 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:15,711 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:15,711 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:15,711 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:15,711 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:15,711 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:15,711 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:15,711 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:15,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:15,714 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:15,714 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:15,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:15,714 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:15,714 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:15,794 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:15,795 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:31:15,795 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:15,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:15,795 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:15,795 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:15,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1842 [2022-12-06 07:31:15,795 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-06 07:31:15,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:15,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1690746606, now seen corresponding path program 1 times [2022-12-06 07:31:15,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:15,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788761675] [2022-12-06 07:31:15,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:15,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:15,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-06 07:31:15,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:15,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788761675] [2022-12-06 07:31:15,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788761675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:15,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:15,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:15,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877956393] [2022-12-06 07:31:15,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:15,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:15,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:15,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:15,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:15,864 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:15,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:15,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:15,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:15,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:15,901 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:15,902 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:15,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:15,902 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:15,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:15,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:15,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:15,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:15,903 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:15,903 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:15,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:15,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:15,903 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:15,903 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:15,903 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:15,903 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:15,904 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:15,904 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:15,904 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:15,904 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:15,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:15,906 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:15,906 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:15,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:15,906 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:15,906 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:15,989 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:15,989 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-06 07:31:15,989 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:15,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:15,990 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:15,990 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:15,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1843 [2022-12-06 07:31:15,990 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-06 07:31:15,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:15,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1663964497, now seen corresponding path program 1 times [2022-12-06 07:31:15,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:15,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731571936] [2022-12-06 07:31:15,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:15,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:16,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:16,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:31:16,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:16,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731571936] [2022-12-06 07:31:16,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731571936] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:16,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:16,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:16,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876988369] [2022-12-06 07:31:16,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:16,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:16,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:16,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:16,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:16,054 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:16,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:16,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:16,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:16,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:16,090 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:16,090 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:16,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:16,090 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:16,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:16,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:16,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:16,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:16,091 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:16,091 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:16,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:16,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:16,092 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:16,092 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:16,092 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:16,092 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:16,092 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:16,092 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:16,092 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:16,092 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:16,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:16,094 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:16,094 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:16,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:16,094 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:16,095 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:16,168 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:16,169 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:16,169 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:16,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:16,169 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:16,169 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:16,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1844 [2022-12-06 07:31:16,169 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-06 07:31:16,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:16,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1633488304, now seen corresponding path program 1 times [2022-12-06 07:31:16,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:16,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888137332] [2022-12-06 07:31:16,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:16,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:16,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-06 07:31:16,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:16,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888137332] [2022-12-06 07:31:16,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888137332] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:16,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:16,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:16,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444854692] [2022-12-06 07:31:16,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:16,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:16,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:16,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:16,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:16,239 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:16,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:16,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:16,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:16,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:16,282 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:16,282 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:16,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:16,283 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:16,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:16,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:16,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:16,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:16,283 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:16,283 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:16,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:16,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:16,284 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:16,284 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:16,284 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:16,284 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:16,284 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:16,284 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:16,284 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:16,285 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:16,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:16,287 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:16,287 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:16,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 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 116. Up to 16 conditions per place. [2022-12-06 07:31:16,287 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:16,287 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:16,371 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:16,372 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 07:31:16,372 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:16,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:16,372 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:16,372 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:16,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1845 [2022-12-06 07:31:16,372 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-06 07:31:16,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:16,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1606706195, now seen corresponding path program 1 times [2022-12-06 07:31:16,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:16,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307408392] [2022-12-06 07:31:16,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:16,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:16,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-06 07:31:16,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:16,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307408392] [2022-12-06 07:31:16,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307408392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:16,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:16,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:16,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250047054] [2022-12-06 07:31:16,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:16,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:16,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:16,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:16,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:16,454 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:16,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:16,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:16,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:16,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:16,490 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:16,490 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:16,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 371 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:16,490 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:16,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:16,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:16,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:16,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:16,491 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:16,491 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:16,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:16,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:16,492 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:16,492 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:16,492 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:16,492 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:16,492 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:16,492 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:16,492 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:16,492 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:16,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:16,494 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:16,494 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:16,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:16,495 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:16,495 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:16,568 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:16,569 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:16,569 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:16,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:16,569 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:16,569 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:16,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1846 [2022-12-06 07:31:16,569 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-06 07:31:16,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:16,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1576230002, now seen corresponding path program 1 times [2022-12-06 07:31:16,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:16,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499975347] [2022-12-06 07:31:16,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:16,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:16,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-06 07:31:16,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:16,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499975347] [2022-12-06 07:31:16,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499975347] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:16,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:16,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:16,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924476094] [2022-12-06 07:31:16,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:16,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:16,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:16,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:16,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:16,633 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:16,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:16,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:16,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:16,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:16,676 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:16,676 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:16,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:16,676 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:16,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:16,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:16,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:16,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:16,677 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:16,677 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:16,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:16,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:16,678 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:16,678 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:16,678 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:16,678 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:16,678 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:16,678 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:16,678 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:16,678 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:16,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:16,680 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:16,680 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:16,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:16,681 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:16,681 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:16,756 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:16,757 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:16,757 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:16,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:16,757 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:16,757 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:16,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1847 [2022-12-06 07:31:16,757 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-06 07:31:16,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:16,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1549447893, now seen corresponding path program 1 times [2022-12-06 07:31:16,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:16,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319369294] [2022-12-06 07:31:16,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:16,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31: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-06 07:31:16,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:16,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319369294] [2022-12-06 07:31:16,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319369294] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:16,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:16,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:16,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839442404] [2022-12-06 07:31:16,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:16,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:16,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:16,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:16,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:16,818 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:16,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:16,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:16,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:16,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:16,855 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:16,855 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:16,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:16,855 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:16,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:16,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:16,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:16,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:16,856 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:16,856 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:16,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:16,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:16,857 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:16,857 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:16,857 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:16,857 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:16,857 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:16,857 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:16,857 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:16,857 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:16,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:16,859 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:16,859 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:16,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:16,860 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:16,860 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:16,933 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:16,933 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:31:16,933 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:16,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:16,933 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:16,934 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:16,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1848 [2022-12-06 07:31:16,934 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-06 07:31:16,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:16,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1518971700, now seen corresponding path program 1 times [2022-12-06 07:31:16,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:16,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446451469] [2022-12-06 07:31:16,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:16,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:16,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:31:16,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:16,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446451469] [2022-12-06 07:31:16,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446451469] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:16,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:16,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:16,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494736649] [2022-12-06 07:31:16,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:16,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:16,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:16,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:16,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:16,994 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:16,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:16,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:16,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:16,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:17,035 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:17,036 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:17,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:17,036 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:17,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:17,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:17,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:17,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:17,038 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:17,038 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:17,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:17,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:17,039 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:17,039 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:17,040 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:17,040 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:17,040 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:17,040 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:17,040 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:17,040 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:17,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:17,043 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:17,043 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:17,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:17,043 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:17,043 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:17,116 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:17,117 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:17,117 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:17,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:17,117 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:17,117 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:17,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1849 [2022-12-06 07:31:17,117 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-06 07:31:17,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:17,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1492189591, now seen corresponding path program 1 times [2022-12-06 07:31:17,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:17,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696465797] [2022-12-06 07:31:17,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:17,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:17,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-06 07:31:17,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:17,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696465797] [2022-12-06 07:31:17,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696465797] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:17,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:17,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:17,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706226331] [2022-12-06 07:31:17,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:17,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:17,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:17,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:17,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:17,181 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:17,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:17,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:17,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:17,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:17,222 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:17,222 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:17,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:17,222 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:17,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:17,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:17,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:17,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:17,223 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:17,223 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:17,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:17,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:17,223 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:17,223 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:17,223 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:17,224 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:17,224 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:17,224 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:17,224 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:17,224 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:17,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:17,226 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:17,226 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:17,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:17,226 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:17,226 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:17,299 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:17,300 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:31:17,300 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:17,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:17,300 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:17,300 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:17,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1850 [2022-12-06 07:31:17,300 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-06 07:31:17,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:17,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1461713398, now seen corresponding path program 1 times [2022-12-06 07:31:17,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:17,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611002671] [2022-12-06 07:31:17,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:17,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:17,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-06 07:31:17,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:17,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611002671] [2022-12-06 07:31:17,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611002671] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:17,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:17,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:17,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319065076] [2022-12-06 07:31:17,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:17,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:17,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:17,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:17,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:17,362 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:17,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:17,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:17,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:17,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:17,403 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:17,403 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:17,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:17,404 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:17,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:17,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:17,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:17,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:17,404 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:17,404 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:17,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:17,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:17,405 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:17,405 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:17,405 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:17,405 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:17,405 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:17,406 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:17,406 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:17,406 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:17,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:17,408 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:17,408 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:17,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 115 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:17,408 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:17,408 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:17,482 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:17,483 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:17,483 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:17,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:17,483 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:17,483 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:17,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1851 [2022-12-06 07:31:17,483 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-06 07:31:17,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:17,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1434931289, now seen corresponding path program 1 times [2022-12-06 07:31:17,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:17,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594400655] [2022-12-06 07:31:17,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:17,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:17,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:17,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-06 07:31:17,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:17,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594400655] [2022-12-06 07:31:17,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594400655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:17,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:17,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:17,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189237059] [2022-12-06 07:31:17,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:17,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:17,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:17,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:17,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:17,561 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:17,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:17,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:17,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:17,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:17,602 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:17,602 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:17,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:17,603 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:17,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:17,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:17,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:17,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:17,603 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:17,603 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:17,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:17,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:17,604 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:17,604 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:17,604 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:17,604 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:17,604 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:17,604 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:17,604 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:17,604 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:17,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:17,606 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:17,606 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:17,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:17,607 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:17,607 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:17,680 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:17,681 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:17,681 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:17,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:17,681 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:17,681 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:17,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1852 [2022-12-06 07:31:17,681 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-06 07:31:17,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:17,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1404455096, now seen corresponding path program 1 times [2022-12-06 07:31:17,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:17,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524663153] [2022-12-06 07:31:17,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:17,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:17,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-06 07:31:17,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:17,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524663153] [2022-12-06 07:31:17,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524663153] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:17,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:17,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:17,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332159943] [2022-12-06 07:31:17,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:17,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:17,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:17,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:17,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:17,743 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:17,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:17,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:17,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:17,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:17,786 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:17,786 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:17,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:17,786 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:17,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:17,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:17,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:17,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:17,787 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:17,787 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:17,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:17,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:17,787 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:17,787 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:17,788 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:17,788 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:17,788 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:17,788 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:17,788 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:17,788 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:17,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:17,790 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:17,790 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:17,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:17,790 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:17,790 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:17,863 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:17,864 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:31:17,864 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:17,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:17,864 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:17,864 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:17,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1853 [2022-12-06 07:31:17,864 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-06 07:31:17,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:17,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1377672987, now seen corresponding path program 1 times [2022-12-06 07:31:17,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:17,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451552507] [2022-12-06 07:31:17,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:17,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:17,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-06 07:31:17,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:17,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451552507] [2022-12-06 07:31:17,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451552507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:17,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:17,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:17,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277006595] [2022-12-06 07:31:17,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:17,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:17,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:17,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:17,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:17,929 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:17,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:17,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:17,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:17,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:17,970 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:17,970 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:17,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:17,970 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:17,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:17,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:17,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:17,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:17,971 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:17,971 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:17,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:17,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:17,972 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:17,972 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:17,972 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:17,972 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:17,972 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:17,972 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:17,972 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:17,972 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:17,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:17,974 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:17,974 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:17,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 147 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:17,975 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:17,975 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:18,048 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:18,048 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:31:18,048 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:18,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:18,049 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:18,049 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:18,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1854 [2022-12-06 07:31:18,049 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-06 07:31:18,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:18,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1347196794, now seen corresponding path program 1 times [2022-12-06 07:31:18,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:18,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614294761] [2022-12-06 07:31:18,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:18,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:18,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-06 07:31:18,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:18,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614294761] [2022-12-06 07:31:18,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614294761] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:18,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:18,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:18,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32156989] [2022-12-06 07:31:18,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:18,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:18,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:18,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:18,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:18,109 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:18,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:18,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:18,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:18,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:18,154 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:18,154 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:18,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:18,155 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:18,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:18,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:18,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:18,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:18,155 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:18,155 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:18,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:18,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:18,156 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:18,156 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:18,156 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:18,156 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:18,156 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:18,156 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:18,156 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:18,156 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:18,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:18,158 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:18,159 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:18,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:18,159 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:18,159 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:18,236 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:18,237 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:31:18,237 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:18,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:18,237 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:18,237 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:18,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1855 [2022-12-06 07:31:18,237 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-06 07:31:18,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:18,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1320414685, now seen corresponding path program 1 times [2022-12-06 07:31:18,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:18,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061341350] [2022-12-06 07:31:18,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:18,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:18,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-06 07:31:18,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:18,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061341350] [2022-12-06 07:31:18,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061341350] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:18,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:18,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:18,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137161] [2022-12-06 07:31:18,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:18,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:18,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:18,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:18,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:18,302 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:18,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:18,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:18,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:18,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:18,337 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:18,337 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:18,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:18,337 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:18,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:18,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:18,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:18,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:18,338 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:18,338 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:18,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:18,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:18,339 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:18,339 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:18,339 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:18,339 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:18,339 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:18,339 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:18,339 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:18,339 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:18,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:18,341 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:18,341 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:18,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:18,342 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:18,342 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:18,417 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:18,418 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:18,418 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:18,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:18,418 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:18,418 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:18,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1856 [2022-12-06 07:31:18,418 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-06 07:31:18,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:18,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1289938492, now seen corresponding path program 1 times [2022-12-06 07:31:18,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:18,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815026013] [2022-12-06 07:31:18,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:18,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:18,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-06 07:31:18,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:18,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815026013] [2022-12-06 07:31:18,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815026013] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:18,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:18,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:18,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242244488] [2022-12-06 07:31:18,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:18,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:18,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:18,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:18,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:18,479 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:18,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:18,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:18,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:18,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:18,521 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:18,521 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:18,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:18,521 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:18,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:18,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:18,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:18,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:18,522 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:18,522 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:18,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:18,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:18,523 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:18,523 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:18,523 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:18,523 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:18,523 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:18,523 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:18,523 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:18,523 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:18,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:18,525 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:18,525 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:18,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:18,526 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:18,526 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:18,599 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:18,600 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:18,600 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:18,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:18,600 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:18,600 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:18,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1857 [2022-12-06 07:31:18,600 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-06 07:31:18,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:18,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1263156383, now seen corresponding path program 1 times [2022-12-06 07:31:18,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:18,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416356355] [2022-12-06 07:31:18,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:18,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:18,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:18,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-06 07:31:18,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:18,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416356355] [2022-12-06 07:31:18,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416356355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:18,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:18,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:18,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839478522] [2022-12-06 07:31:18,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:18,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:18,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:18,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:18,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:18,681 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:18,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:18,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:18,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:18,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:18,724 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:18,724 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:18,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:18,725 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:18,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:18,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:18,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:18,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:18,725 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:18,725 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:18,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:18,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:18,726 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:18,726 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:18,726 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:18,726 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:18,726 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:18,726 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:18,727 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:18,727 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:18,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:18,729 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:18,729 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:18,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:18,729 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:18,729 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:18,804 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:18,805 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:18,805 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:18,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:18,805 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:18,805 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:18,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1858 [2022-12-06 07:31:18,805 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-06 07:31:18,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:18,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1232680190, now seen corresponding path program 1 times [2022-12-06 07:31:18,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:18,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068693356] [2022-12-06 07:31:18,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:18,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:18,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:18,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-06 07:31:18,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:18,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068693356] [2022-12-06 07:31:18,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068693356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:18,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:18,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:18,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798665375] [2022-12-06 07:31:18,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:18,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:18,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:18,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:18,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:18,868 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:18,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:18,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:18,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:18,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:18,910 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:18,910 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:18,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:18,910 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:18,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:18,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:18,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:18,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:18,911 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:18,911 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:18,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:18,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:18,911 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:18,911 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:18,911 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:18,912 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:18,912 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:18,912 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:18,912 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:18,912 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:18,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:18,914 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:18,914 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:18,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:18,914 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:18,914 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:18,990 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:18,991 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:18,991 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:18,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:18,991 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:18,991 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:18,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1859 [2022-12-06 07:31:18,991 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-06 07:31:18,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:18,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1205898081, now seen corresponding path program 1 times [2022-12-06 07:31:18,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:18,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688561585] [2022-12-06 07:31:18,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:18,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31: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-06 07:31:19,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:19,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688561585] [2022-12-06 07:31:19,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688561585] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:19,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:19,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:19,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586602321] [2022-12-06 07:31:19,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:19,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:19,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:19,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:19,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:19,059 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:19,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:19,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:19,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:19,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:19,102 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:19,103 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:19,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:19,103 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:19,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:19,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:19,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:19,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:19,104 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:19,104 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:19,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:19,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:19,104 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:19,104 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:19,105 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:19,105 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:19,105 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:19,105 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:19,105 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:19,105 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:19,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:19,107 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:19,107 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:19,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:19,107 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:19,107 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:19,186 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:19,186 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:31:19,187 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:19,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:19,187 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:19,187 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:19,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1860 [2022-12-06 07:31:19,187 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-06 07:31:19,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:19,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1175421888, now seen corresponding path program 1 times [2022-12-06 07:31:19,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:19,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931971747] [2022-12-06 07:31:19,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:19,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:19,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-06 07:31:19,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:19,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931971747] [2022-12-06 07:31:19,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931971747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:19,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:19,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:19,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040987998] [2022-12-06 07:31:19,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:19,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:19,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:19,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:19,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:19,250 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:19,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:19,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:19,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:19,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:19,293 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:19,294 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:19,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:19,294 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:19,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:19,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:19,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:19,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:19,295 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:19,295 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:19,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:19,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:19,295 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:19,295 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:19,296 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:19,296 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:19,296 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:19,296 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:19,296 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:19,296 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:19,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:19,298 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:19,298 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:19,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:19,298 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:19,298 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:19,376 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:19,376 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:31:19,377 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:19,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:19,377 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:19,377 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:19,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1861 [2022-12-06 07:31:19,377 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-06 07:31:19,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:19,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1148639779, now seen corresponding path program 1 times [2022-12-06 07:31:19,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:19,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596718569] [2022-12-06 07:31:19,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:19,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:19,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-06 07:31:19,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:19,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596718569] [2022-12-06 07:31:19,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596718569] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:19,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:19,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:19,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418032891] [2022-12-06 07:31:19,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:19,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:19,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:19,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:19,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:19,441 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:19,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:19,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:19,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:19,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:19,478 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:19,478 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:19,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:19,478 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:19,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:19,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:19,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:19,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:19,479 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:19,479 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:19,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:19,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:19,480 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:19,480 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:19,480 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:19,480 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:19,480 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:19,480 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:19,480 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:19,480 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:19,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:19,482 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:19,482 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:19,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:19,483 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:19,483 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:19,556 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:19,557 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:19,557 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:19,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:19,557 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:19,557 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:19,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1862 [2022-12-06 07:31:19,557 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-06 07:31:19,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:19,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1118163586, now seen corresponding path program 1 times [2022-12-06 07:31:19,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:19,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787448625] [2022-12-06 07:31:19,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:19,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:19,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31: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-06 07:31:19,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:19,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787448625] [2022-12-06 07:31:19,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787448625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:19,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:19,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:19,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680562001] [2022-12-06 07:31:19,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:19,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:19,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:19,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:19,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:19,619 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:19,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:19,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:19,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:19,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:19,656 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:19,656 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:19,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:19,656 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:19,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:19,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:19,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:19,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:19,657 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:19,657 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:19,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:19,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:19,658 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:19,658 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:19,658 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:19,658 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:19,658 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:19,658 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:19,658 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:19,658 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:19,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:19,660 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:19,660 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:19,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:19,661 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:19,661 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:19,735 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:19,736 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:19,736 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:19,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:19,736 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:19,736 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:19,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1863 [2022-12-06 07:31:19,736 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-06 07:31:19,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:19,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1091381477, now seen corresponding path program 1 times [2022-12-06 07:31:19,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:19,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371375377] [2022-12-06 07:31:19,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:19,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:19,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-06 07:31:19,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:19,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371375377] [2022-12-06 07:31:19,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371375377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:19,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:19,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:19,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315971661] [2022-12-06 07:31:19,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:19,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:19,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:19,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:19,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:19,817 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:19,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:19,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:19,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:19,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:19,853 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:19,853 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:19,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:19,853 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:19,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:19,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:19,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:19,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:19,854 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:19,854 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:19,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:19,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:19,854 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:19,854 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:19,855 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:19,855 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:19,855 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:19,855 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:19,855 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:19,855 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:19,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:19,857 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:19,857 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:19,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:19,858 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:19,858 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:19,933 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:19,934 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:19,934 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:19,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:19,934 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:19,935 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:19,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1864 [2022-12-06 07:31:19,935 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-06 07:31:19,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:19,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1060905284, now seen corresponding path program 1 times [2022-12-06 07:31:19,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:19,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653004817] [2022-12-06 07:31:19,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:19,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31: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-06 07:31:19,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:19,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653004817] [2022-12-06 07:31:19,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653004817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:19,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:19,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:19,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281357398] [2022-12-06 07:31:19,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:19,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:19,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:19,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:19,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:19,996 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:19,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:19,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:19,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:19,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:20,037 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:20,037 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:20,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:20,037 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:20,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:20,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:20,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:20,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:20,038 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:20,038 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:20,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:20,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:20,038 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:20,039 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:20,039 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:20,039 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:20,039 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:20,039 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:20,039 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:20,039 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:20,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:20,041 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:20,041 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:20,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:20,042 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:20,042 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:20,115 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:20,115 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:31:20,115 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:20,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:20,116 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:20,116 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:20,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1865 [2022-12-06 07:31:20,116 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-06 07:31:20,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:20,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1034123175, now seen corresponding path program 1 times [2022-12-06 07:31:20,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:20,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481564137] [2022-12-06 07:31:20,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:20,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:20,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-06 07:31:20,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:20,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481564137] [2022-12-06 07:31:20,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481564137] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:20,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:20,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:20,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54268878] [2022-12-06 07:31:20,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:20,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:20,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:20,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:20,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:20,182 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:20,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:20,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:20,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:20,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:20,218 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:20,218 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:20,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:20,218 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:20,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:20,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:20,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:20,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:20,219 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:20,219 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:20,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:20,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:20,220 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:20,220 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:20,220 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:20,220 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:20,220 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:20,220 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:20,220 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:20,220 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:20,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:20,222 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:20,222 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:20,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:20,223 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:20,223 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:20,295 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:20,296 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:31:20,296 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:20,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:20,296 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:20,296 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:20,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1866 [2022-12-06 07:31:20,296 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-06 07:31:20,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:20,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1003646982, now seen corresponding path program 1 times [2022-12-06 07:31:20,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:20,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721003544] [2022-12-06 07:31:20,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:20,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:20,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-06 07:31:20,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:20,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721003544] [2022-12-06 07:31:20,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721003544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:20,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:20,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:20,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848833217] [2022-12-06 07:31:20,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:20,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:20,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:20,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:20,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:20,357 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:20,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:20,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:20,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:20,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:20,399 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:20,399 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:20,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:20,400 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:20,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:20,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:20,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:20,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:20,400 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:20,400 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:20,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:20,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:20,401 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:20,401 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:20,401 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:20,401 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:20,401 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:20,401 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:20,401 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:20,401 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:20,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:20,404 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:20,404 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:20,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:20,404 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:20,404 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:20,477 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:20,478 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:20,478 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:20,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:20,478 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:20,478 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:20,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1867 [2022-12-06 07:31:20,478 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-06 07:31:20,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:20,478 INFO L85 PathProgramCache]: Analyzing trace with hash -976864873, now seen corresponding path program 1 times [2022-12-06 07:31:20,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:20,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105906790] [2022-12-06 07:31:20,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:20,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:20,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-06 07:31:20,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:20,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105906790] [2022-12-06 07:31:20,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105906790] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:20,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:20,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:20,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200309247] [2022-12-06 07:31:20,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:20,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:20,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:20,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:20,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:20,543 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:20,543 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:20,543 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:20,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:20,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:20,577 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:20,577 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:20,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:20,577 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:20,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:20,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:20,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:20,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:20,578 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:20,578 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:20,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:20,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:20,579 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:20,579 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:20,579 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:20,579 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:20,579 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:20,579 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:20,579 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:20,579 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:20,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:20,581 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:20,581 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:20,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:20,582 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:20,582 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:20,655 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:20,656 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:20,656 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:20,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:20,656 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:20,656 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:20,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1868 [2022-12-06 07:31:20,656 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-06 07:31:20,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:20,657 INFO L85 PathProgramCache]: Analyzing trace with hash -946388680, now seen corresponding path program 1 times [2022-12-06 07:31:20,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:20,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376847972] [2022-12-06 07:31:20,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:20,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:20,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:31:20,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:20,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376847972] [2022-12-06 07:31:20,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376847972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:20,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:20,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:20,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001969595] [2022-12-06 07:31:20,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:20,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:20,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:20,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:20,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:20,724 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:20,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:20,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:20,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:20,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:20,767 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:20,767 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:20,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:20,767 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:20,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:20,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:20,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:20,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:20,768 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:20,768 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:20,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:20,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:20,769 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:20,769 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:20,769 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:20,769 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:20,769 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:20,769 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:20,769 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:20,769 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:20,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:20,771 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:20,771 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:20,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:20,772 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:20,772 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:20,846 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:20,847 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:20,847 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:20,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:20,847 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:20,847 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:20,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1869 [2022-12-06 07:31:20,847 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-06 07:31:20,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:20,847 INFO L85 PathProgramCache]: Analyzing trace with hash -919606571, now seen corresponding path program 1 times [2022-12-06 07:31:20,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:20,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868511521] [2022-12-06 07:31:20,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:20,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:20,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-06 07:31:20,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:20,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868511521] [2022-12-06 07:31:20,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868511521] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:20,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:20,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:20,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882576326] [2022-12-06 07:31:20,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:20,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:20,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:20,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:20,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:20,927 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:20,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:20,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:20,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:20,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:20,967 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:20,967 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:20,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:20,968 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:20,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:20,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:20,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:20,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:20,968 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:20,968 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:20,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:20,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:20,969 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:20,969 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:20,969 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:20,969 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:20,969 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:20,970 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:20,970 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:20,970 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:20,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:20,972 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:20,972 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:20,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:20,972 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:20,972 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:21,050 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:21,050 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:31:21,050 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:21,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:21,051 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:21,051 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:21,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1870 [2022-12-06 07:31:21,051 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-06 07:31:21,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:21,051 INFO L85 PathProgramCache]: Analyzing trace with hash -889130378, now seen corresponding path program 1 times [2022-12-06 07:31:21,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:21,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114035049] [2022-12-06 07:31:21,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:21,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:21,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:31:21,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:21,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114035049] [2022-12-06 07:31:21,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114035049] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:21,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:21,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:21,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810863620] [2022-12-06 07:31:21,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:21,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:21,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:21,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:21,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:21,116 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:21,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:21,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:21,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:21,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:21,152 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:21,152 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:21,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:21,153 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:21,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:21,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:21,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:21,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:21,153 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:21,153 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:21,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:21,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:21,154 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:21,154 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:21,154 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:21,154 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:21,154 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:21,154 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:21,154 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:21,155 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:21,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:21,157 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:21,157 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:21,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:21,157 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:21,157 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:21,231 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:21,232 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:21,232 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:21,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:21,232 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:21,232 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:21,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1871 [2022-12-06 07:31:21,232 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-06 07:31:21,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:21,232 INFO L85 PathProgramCache]: Analyzing trace with hash -862348269, now seen corresponding path program 1 times [2022-12-06 07:31:21,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:21,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989684279] [2022-12-06 07:31:21,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:21,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:21,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-06 07:31:21,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:21,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989684279] [2022-12-06 07:31:21,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989684279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:21,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:21,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:21,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085694132] [2022-12-06 07:31:21,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:21,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:21,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:21,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:21,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:21,315 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:21,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:21,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:21,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:21,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:21,359 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:21,359 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:21,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 372 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:21,360 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:21,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:21,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:21,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:21,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:21,360 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:21,360 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:21,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:21,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:21,361 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:21,361 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:21,361 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:21,361 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:21,361 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:21,361 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:21,361 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:21,361 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:21,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:21,364 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:21,364 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:21,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:21,364 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:21,364 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:21,446 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:21,447 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-06 07:31:21,447 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:21,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:21,448 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:21,448 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:21,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1872 [2022-12-06 07:31:21,448 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-06 07:31:21,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:21,448 INFO L85 PathProgramCache]: Analyzing trace with hash -831872076, now seen corresponding path program 1 times [2022-12-06 07:31:21,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:21,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389754735] [2022-12-06 07:31:21,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:21,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:21,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-06 07:31:21,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:21,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389754735] [2022-12-06 07:31:21,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389754735] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:21,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:21,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:21,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737981877] [2022-12-06 07:31:21,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:21,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:21,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:21,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:21,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:21,531 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:21,531 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:21,531 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:21,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:21,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:21,580 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:21,580 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:21,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:21,581 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:21,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:21,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:21,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:21,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:21,581 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:21,581 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:21,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:21,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:21,582 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:21,583 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:21,583 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:21,583 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:21,583 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:21,583 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:21,583 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:21,583 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:21,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:21,586 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:21,586 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:21,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:21,587 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:21,587 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:21,679 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:21,680 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 07:31:21,680 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:21,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:21,680 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:21,680 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:21,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1873 [2022-12-06 07:31:21,680 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-06 07:31:21,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:21,680 INFO L85 PathProgramCache]: Analyzing trace with hash -805089967, now seen corresponding path program 1 times [2022-12-06 07:31:21,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:21,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438532035] [2022-12-06 07:31:21,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:21,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:21,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-06 07:31:21,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:21,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438532035] [2022-12-06 07:31:21,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438532035] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:21,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:21,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:21,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205730612] [2022-12-06 07:31:21,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:21,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:21,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:21,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:21,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:21,794 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:21,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:21,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:21,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:21,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:21,850 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:21,851 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:21,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:21,851 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:21,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:21,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:21,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:21,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:21,852 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:21,852 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:21,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:21,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:21,853 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:21,853 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:21,853 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:21,853 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:21,853 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:21,853 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:21,853 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:21,854 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:21,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:21,856 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:21,856 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:21,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:21,857 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:21,857 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:21,946 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:21,947 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 07:31:21,947 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:21,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:21,947 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:21,947 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:21,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1874 [2022-12-06 07:31:21,948 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-06 07:31:21,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:21,948 INFO L85 PathProgramCache]: Analyzing trace with hash -774613774, now seen corresponding path program 1 times [2022-12-06 07:31:21,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:21,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465849394] [2022-12-06 07:31:21,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:21,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:22,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-06 07:31:22,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:22,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465849394] [2022-12-06 07:31:22,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465849394] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:22,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:22,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:22,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017573449] [2022-12-06 07:31:22,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:22,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:22,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:22,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:22,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:22,031 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:22,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:22,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:22,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:22,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:22,077 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:22,077 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:22,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:22,077 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:22,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:22,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:22,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:22,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:22,078 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:22,078 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:22,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:22,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:22,079 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:22,079 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:22,079 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:22,079 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:22,079 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:22,079 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:22,079 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:22,079 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:22,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:22,081 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:22,081 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:22,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:22,082 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:22,082 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:22,156 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:22,157 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:22,157 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:22,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:22,157 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:22,157 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:22,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1875 [2022-12-06 07:31:22,157 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-06 07:31:22,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:22,157 INFO L85 PathProgramCache]: Analyzing trace with hash -747831665, now seen corresponding path program 1 times [2022-12-06 07:31:22,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:22,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912717715] [2022-12-06 07:31:22,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:22,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:22,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:22,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-06 07:31:22,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:22,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912717715] [2022-12-06 07:31:22,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912717715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:22,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:22,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:22,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681744378] [2022-12-06 07:31:22,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:22,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:22,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:22,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:22,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:22,235 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:22,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:22,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:22,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:22,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:22,270 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:22,270 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:22,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:22,271 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:22,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:22,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:22,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:22,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:22,271 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:22,271 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:22,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:22,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:22,272 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:22,272 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:22,272 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:22,272 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:22,272 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:22,272 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:22,273 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:22,273 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:22,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:22,275 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:22,275 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:22,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:22,276 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:22,276 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:22,349 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:22,350 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:22,350 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:22,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:22,350 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:22,350 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:22,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1876 [2022-12-06 07:31:22,350 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-06 07:31:22,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:22,350 INFO L85 PathProgramCache]: Analyzing trace with hash -717355472, now seen corresponding path program 1 times [2022-12-06 07:31:22,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:22,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013163726] [2022-12-06 07:31:22,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:22,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:22,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-06 07:31:22,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:22,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013163726] [2022-12-06 07:31:22,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013163726] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:22,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:22,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:22,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569159561] [2022-12-06 07:31:22,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:22,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:22,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:22,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:22,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:22,414 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:22,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:22,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:22,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:22,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:22,456 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:22,456 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:22,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:22,457 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:22,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:22,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:22,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:22,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:22,457 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:22,457 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:22,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:22,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:22,458 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:22,458 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:22,458 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:22,458 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:22,458 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:22,459 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:22,459 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:22,459 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:22,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:22,461 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:22,461 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:22,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:22,461 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:22,461 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:22,536 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:22,536 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:22,536 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:22,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:22,536 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:22,537 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:22,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1877 [2022-12-06 07:31:22,537 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-06 07:31:22,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:22,537 INFO L85 PathProgramCache]: Analyzing trace with hash -690573363, now seen corresponding path program 1 times [2022-12-06 07:31:22,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:22,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911638645] [2022-12-06 07:31:22,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:22,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:22,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-06 07:31:22,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:22,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911638645] [2022-12-06 07:31:22,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911638645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:22,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:22,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:22,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281206144] [2022-12-06 07:31:22,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:22,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:22,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:22,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:22,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:22,601 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:22,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:22,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:22,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:22,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:22,639 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:22,639 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:22,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:22,640 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:22,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:22,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:22,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:22,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:22,640 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:22,640 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:22,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:22,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:22,641 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:22,641 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:22,641 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:22,641 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:22,641 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:22,641 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:22,641 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:22,641 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:22,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:22,644 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:22,644 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:22,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 146 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:22,644 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:22,644 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:22,718 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:22,718 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:22,718 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:22,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:22,719 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:22,719 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:22,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1878 [2022-12-06 07:31:22,719 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-06 07:31:22,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:22,719 INFO L85 PathProgramCache]: Analyzing trace with hash -660097170, now seen corresponding path program 1 times [2022-12-06 07:31:22,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:22,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798644716] [2022-12-06 07:31:22,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:22,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:22,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-06 07:31:22,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:22,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798644716] [2022-12-06 07:31:22,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798644716] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:22,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:22,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:22,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122068548] [2022-12-06 07:31:22,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:22,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:22,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:22,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:22,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:22,779 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:22,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:22,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:22,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:22,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:22,815 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:22,816 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:22,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:22,816 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:22,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:22,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:22,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:22,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:22,817 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:22,817 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:22,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:22,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:22,817 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:22,818 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:22,818 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:22,818 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:22,818 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:22,818 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:22,818 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:22,818 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:22,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:22,820 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:22,820 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:22,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:22,821 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:22,821 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:22,895 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:22,896 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:22,896 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:22,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:22,896 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:22,896 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:22,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1879 [2022-12-06 07:31:22,896 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-06 07:31:22,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:22,896 INFO L85 PathProgramCache]: Analyzing trace with hash -633315061, now seen corresponding path program 1 times [2022-12-06 07:31:22,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:22,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84084413] [2022-12-06 07:31:22,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:22,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:22,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-06 07:31:22,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:22,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84084413] [2022-12-06 07:31:22,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84084413] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:22,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:22,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:22,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353478916] [2022-12-06 07:31:22,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:22,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:22,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:22,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:22,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:22,961 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:22,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:22,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:22,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:22,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:23,002 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:23,002 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:23,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:23,003 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:23,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:23,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:23,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:23,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:23,003 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:23,003 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:23,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:23,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:23,004 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:23,004 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:23,004 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:23,004 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:23,004 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:23,005 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:23,005 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:23,005 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:23,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:23,007 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:23,007 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:23,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:23,007 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:23,007 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:23,081 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:23,082 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:23,082 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:23,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:23,082 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:23,082 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:23,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1880 [2022-12-06 07:31:23,082 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-06 07:31:23,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:23,082 INFO L85 PathProgramCache]: Analyzing trace with hash -602838868, now seen corresponding path program 1 times [2022-12-06 07:31:23,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:23,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763043124] [2022-12-06 07:31:23,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:23,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:23,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-06 07:31:23,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:23,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763043124] [2022-12-06 07:31:23,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763043124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:23,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:23,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:23,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293882018] [2022-12-06 07:31:23,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:23,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:23,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:23,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:23,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:23,147 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:23,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:23,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:23,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:23,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:23,189 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:23,189 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:23,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:23,189 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:23,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:23,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:23,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:23,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:23,190 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:23,190 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:23,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:23,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:23,191 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:23,191 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:23,191 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:23,191 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:23,191 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:23,191 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:23,191 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:23,192 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:23,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:23,194 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:23,194 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:23,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:23,194 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:23,194 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:23,272 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:23,273 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:31:23,273 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:23,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:23,273 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:23,273 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:23,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1881 [2022-12-06 07:31:23,273 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-06 07:31:23,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:23,273 INFO L85 PathProgramCache]: Analyzing trace with hash -576056759, now seen corresponding path program 1 times [2022-12-06 07:31:23,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:23,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202383780] [2022-12-06 07:31:23,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:23,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:23,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-06 07:31:23,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:23,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202383780] [2022-12-06 07:31:23,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202383780] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:23,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:23,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:23,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73802816] [2022-12-06 07:31:23,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:23,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:23,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:23,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:23,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:23,355 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:23,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:23,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:23,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:23,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:23,388 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:23,388 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:23,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:23,389 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:23,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:23,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:23,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:23,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:23,389 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:23,389 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:23,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:23,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:23,390 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:23,390 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:23,390 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:23,390 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:23,390 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:23,391 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:23,391 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:23,391 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:23,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:23,393 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:23,393 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:23,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:23,393 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:23,393 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:23,467 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:23,468 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:23,468 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:23,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:23,468 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:23,468 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:23,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1882 [2022-12-06 07:31:23,468 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-06 07:31:23,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:23,468 INFO L85 PathProgramCache]: Analyzing trace with hash -545580566, now seen corresponding path program 1 times [2022-12-06 07:31:23,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:23,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112793832] [2022-12-06 07:31:23,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:23,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:23,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-06 07:31:23,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:23,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112793832] [2022-12-06 07:31:23,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112793832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:23,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:23,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:23,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884250565] [2022-12-06 07:31:23,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:23,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:23,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:23,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:23,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:23,534 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:23,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:23,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:23,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:23,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:23,576 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:23,576 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:23,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:23,577 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:23,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:23,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:23,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:23,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:23,577 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:23,577 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:23,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:23,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:23,578 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:23,578 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:23,578 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:23,578 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:23,578 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:23,578 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:23,578 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:23,578 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:23,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:23,581 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:23,581 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:23,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:23,581 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:23,581 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:23,656 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:23,657 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:23,657 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:23,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:23,657 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:23,657 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:23,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1883 [2022-12-06 07:31:23,657 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-06 07:31:23,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:23,657 INFO L85 PathProgramCache]: Analyzing trace with hash -518798457, now seen corresponding path program 1 times [2022-12-06 07:31:23,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:23,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735752765] [2022-12-06 07:31:23,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:23,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:23,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:23,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-06 07:31:23,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:23,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735752765] [2022-12-06 07:31:23,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735752765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:23,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:23,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:23,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683831497] [2022-12-06 07:31:23,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:23,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:23,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:23,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:23,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:23,721 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:23,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:23,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:23,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:23,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:23,756 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:23,756 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:23,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:23,757 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:23,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:23,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:23,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:23,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:23,757 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:23,758 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:23,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:23,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:23,758 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:23,758 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:23,758 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:23,758 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:23,759 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:23,759 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:23,759 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:23,759 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:23,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:23,761 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:23,761 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:23,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:23,761 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:23,761 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:23,836 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:23,837 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:23,837 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:23,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:23,837 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:23,838 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:23,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1884 [2022-12-06 07:31:23,838 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-06 07:31:23,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:23,838 INFO L85 PathProgramCache]: Analyzing trace with hash -488322264, now seen corresponding path program 1 times [2022-12-06 07:31:23,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:23,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280115613] [2022-12-06 07:31:23,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:23,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:23,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-06 07:31:23,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:23,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280115613] [2022-12-06 07:31:23,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280115613] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:23,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:23,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:23,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137153129] [2022-12-06 07:31:23,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:23,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:23,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:23,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:23,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:23,902 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:23,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:23,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:23,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:23,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:23,954 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:23,954 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:23,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:23,955 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:23,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:23,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:23,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:23,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:23,955 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:23,955 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:23,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:23,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:23,956 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:23,956 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:23,956 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:23,956 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:23,956 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:23,956 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:23,956 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:23,956 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:23,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:23,959 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:23,959 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:23,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:23,959 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:23,959 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:24,075 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:24,075 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-06 07:31:24,076 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:24,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:24,076 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:24,076 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:24,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1885 [2022-12-06 07:31:24,076 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-06 07:31:24,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:24,076 INFO L85 PathProgramCache]: Analyzing trace with hash -461540155, now seen corresponding path program 1 times [2022-12-06 07:31:24,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:24,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501034722] [2022-12-06 07:31:24,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:24,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:24,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-06 07:31:24,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:24,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501034722] [2022-12-06 07:31:24,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501034722] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:24,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:24,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:24,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650597900] [2022-12-06 07:31:24,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:24,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:24,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:24,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:24,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:24,144 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:24,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:24,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:24,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:24,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:24,179 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:24,180 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:24,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:24,180 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:24,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:24,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:24,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:24,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:24,181 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:24,181 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:24,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:24,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:24,181 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:24,181 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:24,181 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:24,182 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:24,182 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:24,182 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:24,182 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:24,182 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:24,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:24,184 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:24,184 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:24,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:24,184 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:24,184 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:24,256 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:24,257 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:31:24,257 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:24,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:24,257 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:24,257 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:24,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1886 [2022-12-06 07:31:24,257 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-06 07:31:24,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:24,257 INFO L85 PathProgramCache]: Analyzing trace with hash -431063962, now seen corresponding path program 1 times [2022-12-06 07:31:24,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:24,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709368718] [2022-12-06 07:31:24,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:24,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:24,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:24,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-06 07:31:24,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:24,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709368718] [2022-12-06 07:31:24,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709368718] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:24,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:24,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:24,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322684130] [2022-12-06 07:31:24,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:24,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:24,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:24,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:24,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:24,319 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:24,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:24,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:24,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:24,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:24,361 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:24,361 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:24,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:24,361 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:24,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:24,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:24,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:24,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:24,362 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:24,362 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:24,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:24,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:24,362 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:24,363 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:24,363 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:24,363 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:24,363 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:24,363 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:24,363 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:24,363 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:24,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:24,365 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:24,365 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:24,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:24,366 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:24,366 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:24,439 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:24,440 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:24,440 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:24,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:24,440 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:24,440 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:24,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1887 [2022-12-06 07:31:24,440 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-06 07:31:24,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:24,440 INFO L85 PathProgramCache]: Analyzing trace with hash -404281853, now seen corresponding path program 1 times [2022-12-06 07:31:24,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:24,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570399613] [2022-12-06 07:31:24,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:24,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31: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-06 07:31:24,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:24,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570399613] [2022-12-06 07:31:24,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570399613] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:24,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:24,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:24,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82204109] [2022-12-06 07:31:24,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:24,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:24,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:24,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:24,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:24,518 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:24,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:24,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:24,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:24,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:24,553 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:24,554 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:24,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:24,554 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:24,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:24,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:24,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:24,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:24,555 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:24,555 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:24,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:24,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:24,555 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:24,555 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:24,555 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:24,555 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:24,556 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:24,556 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:24,556 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:24,556 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:24,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:24,558 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:24,558 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:24,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:24,558 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:24,558 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:24,632 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:24,632 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:24,632 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:24,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:24,633 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:24,633 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:24,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1888 [2022-12-06 07:31:24,633 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-06 07:31:24,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:24,633 INFO L85 PathProgramCache]: Analyzing trace with hash -373805660, now seen corresponding path program 1 times [2022-12-06 07:31:24,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:24,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806828899] [2022-12-06 07:31:24,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:24,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:24,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-06 07:31:24,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:24,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806828899] [2022-12-06 07:31:24,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806828899] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:24,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:24,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:24,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189204414] [2022-12-06 07:31:24,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:24,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:24,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:24,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:24,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:24,694 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:24,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:24,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:24,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:24,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:24,731 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:24,731 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:24,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:24,731 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:24,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:24,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:24,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:24,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:24,732 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:24,732 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:24,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:24,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:24,733 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:24,733 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:24,733 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:24,733 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:24,733 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:24,733 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:24,733 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:24,733 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:24,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:24,735 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:24,735 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:24,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:24,736 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:24,736 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:24,808 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:24,809 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:31:24,809 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:24,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:24,809 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:24,809 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:24,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1889 [2022-12-06 07:31:24,809 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-06 07:31:24,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:24,810 INFO L85 PathProgramCache]: Analyzing trace with hash -347023551, now seen corresponding path program 1 times [2022-12-06 07:31:24,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:24,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59781403] [2022-12-06 07:31:24,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:24,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:24,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-06 07:31:24,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:24,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59781403] [2022-12-06 07:31:24,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59781403] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:24,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:24,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:24,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967020823] [2022-12-06 07:31:24,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:24,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:24,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:24,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:24,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:24,874 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:24,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:24,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:24,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:24,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:24,909 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:24,909 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:24,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:24,910 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:24,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:24,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:24,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:24,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:24,910 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:24,910 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:24,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:24,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:24,911 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:24,911 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:24,911 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:24,911 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:24,911 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:24,912 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:24,912 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:24,912 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:24,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:24,914 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:24,914 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:24,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:24,914 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:24,914 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:24,988 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:24,989 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:24,989 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:24,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:24,989 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:24,989 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:24,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1890 [2022-12-06 07:31:24,989 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-06 07:31:24,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:24,990 INFO L85 PathProgramCache]: Analyzing trace with hash -316547358, now seen corresponding path program 1 times [2022-12-06 07:31:24,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:24,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008895789] [2022-12-06 07:31:24,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:24,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:25,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-06 07:31:25,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:25,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008895789] [2022-12-06 07:31:25,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008895789] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:25,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:25,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:25,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548312653] [2022-12-06 07:31:25,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:25,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:25,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:25,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:25,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:25,050 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:25,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:25,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:25,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:25,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:25,091 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:25,091 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:25,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:25,091 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:25,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:25,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:25,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:25,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:25,092 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:25,092 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:25,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:25,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:25,092 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:25,093 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:25,093 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:25,093 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:25,093 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:25,093 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:25,093 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:25,093 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:25,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:25,095 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:25,095 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:25,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:25,095 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:25,096 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:25,169 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:25,169 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:31:25,169 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:25,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:25,170 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:25,170 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:25,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1891 [2022-12-06 07:31:25,170 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-06 07:31:25,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:25,170 INFO L85 PathProgramCache]: Analyzing trace with hash -289765249, now seen corresponding path program 1 times [2022-12-06 07:31:25,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:25,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303485753] [2022-12-06 07:31:25,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:25,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:25,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-06 07:31:25,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:25,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303485753] [2022-12-06 07:31:25,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303485753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:25,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:25,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:25,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139783114] [2022-12-06 07:31:25,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:25,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:25,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:25,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:25,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:25,235 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:25,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:25,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:25,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:25,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:25,275 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:25,276 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:25,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 371 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:25,276 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:25,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:25,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:25,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:25,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:25,276 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:25,276 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:25,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:25,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:25,277 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:25,277 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:25,277 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:25,277 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:25,277 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:25,278 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:25,278 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:25,278 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:25,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:25,280 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:25,280 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:25,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:25,280 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:25,280 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:25,354 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:25,354 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:25,354 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:25,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:25,355 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:25,355 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:25,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1892 [2022-12-06 07:31:25,355 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-06 07:31:25,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:25,355 INFO L85 PathProgramCache]: Analyzing trace with hash -259289056, now seen corresponding path program 1 times [2022-12-06 07:31:25,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:25,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902070253] [2022-12-06 07:31:25,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:25,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:25,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-06 07:31:25,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:25,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902070253] [2022-12-06 07:31:25,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902070253] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:25,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:25,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:25,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834194038] [2022-12-06 07:31:25,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:25,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:25,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:25,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:25,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:25,417 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:25,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:25,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:25,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:25,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:25,458 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:25,459 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:25,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:25,459 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:25,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:25,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:25,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:25,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:25,460 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:25,460 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:25,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:25,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:25,460 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:25,460 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:25,460 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:25,461 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:25,461 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:25,461 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:25,461 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:25,461 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:25,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:25,463 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:25,463 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:25,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:25,463 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:25,463 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:25,536 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:25,537 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:31:25,537 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:25,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:25,537 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:25,537 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:25,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1893 [2022-12-06 07:31:25,538 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-06 07:31:25,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:25,538 INFO L85 PathProgramCache]: Analyzing trace with hash -232506947, now seen corresponding path program 1 times [2022-12-06 07:31:25,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:25,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274927568] [2022-12-06 07:31:25,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:25,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:25,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-06 07:31:25,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:25,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274927568] [2022-12-06 07:31:25,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274927568] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:25,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:25,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:25,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585835893] [2022-12-06 07:31:25,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:25,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:25,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:25,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:25,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:25,616 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:25,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:25,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:25,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:25,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:25,654 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:25,654 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:25,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:25,655 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:25,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:25,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:25,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:25,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:25,655 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:25,655 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:25,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:25,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:25,656 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:25,656 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:25,656 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:25,656 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:25,656 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:25,656 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:25,656 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:25,657 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:25,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:25,659 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:25,659 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:25,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:25,659 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:25,659 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:25,731 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:25,732 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:31:25,732 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:25,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:25,732 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:25,732 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:25,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1894 [2022-12-06 07:31:25,732 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-06 07:31:25,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:25,732 INFO L85 PathProgramCache]: Analyzing trace with hash -202030754, now seen corresponding path program 1 times [2022-12-06 07:31:25,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:25,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763058026] [2022-12-06 07:31:25,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:25,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:25,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:25,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:31:25,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:25,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763058026] [2022-12-06 07:31:25,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763058026] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:25,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:25,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:25,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093713431] [2022-12-06 07:31:25,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:25,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:25,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:25,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:25,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:25,796 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:25,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:25,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:25,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:25,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:25,832 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:25,832 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:25,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:25,833 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:25,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:25,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:25,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:25,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:25,833 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:25,833 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:25,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:25,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:25,834 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:25,834 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:25,834 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:25,834 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:25,834 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:25,834 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:25,834 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:25,834 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:25,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:25,837 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:25,837 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:25,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:25,837 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:25,837 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:25,912 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:25,913 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:25,913 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:25,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:25,913 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:25,913 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:25,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1895 [2022-12-06 07:31:25,913 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-06 07:31:25,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:25,914 INFO L85 PathProgramCache]: Analyzing trace with hash -175248645, now seen corresponding path program 1 times [2022-12-06 07:31:25,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:25,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067235959] [2022-12-06 07:31:25,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:25,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:25,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:31:25,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:25,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067235959] [2022-12-06 07:31:25,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067235959] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:25,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:25,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:25,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618359312] [2022-12-06 07:31:25,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:25,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:25,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:25,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:25,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:25,984 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:25,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:25,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:25,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:25,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:26,023 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:26,023 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:26,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:26,023 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:26,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:26,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:26,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:26,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:26,024 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:26,024 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:26,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:26,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:26,024 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:26,024 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:26,025 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:26,025 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:26,025 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:26,025 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:26,025 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:26,025 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:26,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:26,027 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:26,027 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:26,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:26,027 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:26,027 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:26,100 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:26,101 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:31:26,101 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:26,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:26,101 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:26,101 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:26,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1896 [2022-12-06 07:31:26,101 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-06 07:31:26,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:26,101 INFO L85 PathProgramCache]: Analyzing trace with hash -144772452, now seen corresponding path program 1 times [2022-12-06 07:31:26,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:26,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830442369] [2022-12-06 07:31:26,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:26,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:26,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-06 07:31:26,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:26,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830442369] [2022-12-06 07:31:26,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830442369] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:26,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:26,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:26,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488486367] [2022-12-06 07:31:26,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:26,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:26,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:26,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:26,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:26,162 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:26,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:26,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:26,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:26,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:26,198 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:26,198 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:26,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:26,198 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:26,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:26,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:26,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:26,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:26,199 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:26,199 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:26,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:26,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:26,199 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:26,199 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:26,199 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:26,199 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:26,200 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:26,200 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:26,200 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:26,200 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:26,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:26,202 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:26,202 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:26,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:26,202 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:26,202 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:26,275 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:26,276 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:26,276 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:26,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:26,276 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:26,276 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:26,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1897 [2022-12-06 07:31:26,276 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-06 07:31:26,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:26,276 INFO L85 PathProgramCache]: Analyzing trace with hash -117990343, now seen corresponding path program 1 times [2022-12-06 07:31:26,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:26,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17248225] [2022-12-06 07:31:26,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:26,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:26,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:31:26,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:26,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17248225] [2022-12-06 07:31:26,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17248225] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:26,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:26,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:26,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966535072] [2022-12-06 07:31:26,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:26,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:26,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:26,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:26,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:26,340 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:26,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:26,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:26,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:26,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:26,380 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:26,381 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:26,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:26,381 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:26,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:26,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:26,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:26,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:26,381 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:26,381 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:26,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:26,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:26,382 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:26,382 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:26,382 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:26,382 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:26,382 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:26,383 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:26,383 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:26,383 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:26,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:26,385 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:26,385 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:26,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:26,385 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:26,385 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:26,458 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:26,459 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:26,459 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:26,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:26,459 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:26,459 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:26,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1898 [2022-12-06 07:31:26,459 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-06 07:31:26,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:26,460 INFO L85 PathProgramCache]: Analyzing trace with hash -87514150, now seen corresponding path program 1 times [2022-12-06 07:31:26,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:26,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147362387] [2022-12-06 07:31:26,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:26,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:26,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-06 07:31:26,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:26,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147362387] [2022-12-06 07:31:26,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147362387] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:26,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:26,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:26,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377935190] [2022-12-06 07:31:26,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:26,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:26,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:26,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:26,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:26,521 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:26,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:26,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:26,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:26,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:26,561 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:26,561 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:26,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:26,562 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:26,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:26,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:26,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:26,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:26,562 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:26,562 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:26,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:26,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:26,563 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:26,563 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:26,563 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:26,563 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:26,563 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:26,564 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:26,564 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:26,564 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:26,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:26,566 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:26,566 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:26,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:26,566 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:26,566 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:26,639 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:26,640 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:26,640 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:26,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:26,640 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:26,640 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:26,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1899 [2022-12-06 07:31:26,640 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-06 07:31:26,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:26,640 INFO L85 PathProgramCache]: Analyzing trace with hash -60732041, now seen corresponding path program 1 times [2022-12-06 07:31:26,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:26,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109881975] [2022-12-06 07:31:26,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:26,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:26,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:31:26,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:26,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109881975] [2022-12-06 07:31:26,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109881975] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:26,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:26,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:26,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975406105] [2022-12-06 07:31:26,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:26,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:26,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:26,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:26,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:26,719 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:26,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:26,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:26,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:26,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:26,760 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:26,761 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:26,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:26,761 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:26,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:26,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:26,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:26,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:26,762 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:26,762 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:26,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:26,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:26,762 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:26,762 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:26,763 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:26,763 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:26,763 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:26,763 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:26,763 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:26,763 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:26,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:26,765 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:26,765 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:26,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:26,765 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:26,765 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:26,838 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:26,839 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:31:26,839 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:26,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:26,839 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:26,839 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:26,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1900 [2022-12-06 07:31:26,839 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-06 07:31:26,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:26,840 INFO L85 PathProgramCache]: Analyzing trace with hash -30255848, now seen corresponding path program 1 times [2022-12-06 07:31:26,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:26,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048194553] [2022-12-06 07:31:26,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:26,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:26,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:26,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-06 07:31:26,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:26,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048194553] [2022-12-06 07:31:26,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048194553] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:26,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:26,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:26,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859182989] [2022-12-06 07:31:26,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:26,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:26,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:26,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:26,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:26,900 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:26,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:26,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:26,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:26,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:26,943 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:26,943 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:26,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:26,943 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:26,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:26,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:26,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:26,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:26,944 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:26,944 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:26,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:26,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:26,945 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:26,945 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:26,945 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:26,945 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:26,945 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:26,945 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:26,945 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:26,945 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:26,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:26,947 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:26,947 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:26,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:26,948 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:26,948 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:27,021 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:27,022 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:27,022 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:27,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:27,022 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:27,022 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:27,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1901 [2022-12-06 07:31:27,022 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-06 07:31:27,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:27,023 INFO L85 PathProgramCache]: Analyzing trace with hash -3473739, now seen corresponding path program 1 times [2022-12-06 07:31:27,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:27,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153391970] [2022-12-06 07:31:27,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:27,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:27,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-06 07:31:27,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:27,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153391970] [2022-12-06 07:31:27,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153391970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:27,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:27,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:27,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962979708] [2022-12-06 07:31:27,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:27,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:27,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:27,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:27,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:27,086 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:27,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:27,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:27,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:27,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:27,126 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:27,126 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:27,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:27,127 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:27,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:27,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:27,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:27,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:27,127 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:27,127 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:27,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:27,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:27,128 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:27,128 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:27,128 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:27,128 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:27,128 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:27,129 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:27,129 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:27,129 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:27,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:27,131 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:27,131 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:27,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:27,131 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:27,131 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:27,205 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:27,206 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:27,206 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:27,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:27,206 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:27,206 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:27,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1902 [2022-12-06 07:31:27,206 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-06 07:31:27,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:27,206 INFO L85 PathProgramCache]: Analyzing trace with hash 27002454, now seen corresponding path program 1 times [2022-12-06 07:31:27,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:27,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711671658] [2022-12-06 07:31:27,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:27,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:27,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-06 07:31:27,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:27,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711671658] [2022-12-06 07:31:27,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711671658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:27,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:27,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:27,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683499013] [2022-12-06 07:31:27,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:27,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:27,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:27,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:27,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:27,267 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:27,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:27,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:27,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:27,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:27,308 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:27,308 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:27,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:27,309 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:27,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:27,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:27,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:27,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:27,309 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:27,309 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:27,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:27,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:27,310 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:27,310 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:27,310 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:27,310 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:27,310 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:27,310 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:27,310 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:27,310 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:27,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:27,313 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:27,313 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:27,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:27,313 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:27,313 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:27,387 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:27,388 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:27,388 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:27,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:27,388 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:27,388 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:27,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1903 [2022-12-06 07:31:27,388 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-06 07:31:27,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:27,389 INFO L85 PathProgramCache]: Analyzing trace with hash 53784563, now seen corresponding path program 1 times [2022-12-06 07:31:27,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:27,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298095274] [2022-12-06 07:31:27,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:27,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:27,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-06 07:31:27,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:27,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298095274] [2022-12-06 07:31:27,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298095274] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:27,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:27,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:27,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066877953] [2022-12-06 07:31:27,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:27,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:27,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:27,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:27,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:27,454 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:27,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:27,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:27,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:27,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:27,494 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:27,494 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:27,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:27,495 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:27,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:27,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:27,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:27,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:27,495 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:27,495 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:27,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:27,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:27,496 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:27,496 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:27,496 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:27,496 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:27,496 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:27,497 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:27,497 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:27,497 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:27,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:27,499 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:27,499 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:27,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:27,499 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:27,499 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:27,573 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:27,574 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:27,574 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:27,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:27,574 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:27,574 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:27,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1904 [2022-12-06 07:31:27,574 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-06 07:31:27,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:27,574 INFO L85 PathProgramCache]: Analyzing trace with hash 84260756, now seen corresponding path program 1 times [2022-12-06 07:31:27,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:27,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834592338] [2022-12-06 07:31:27,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:27,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:27,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-06 07:31:27,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:27,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834592338] [2022-12-06 07:31:27,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834592338] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:27,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:27,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:27,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452186980] [2022-12-06 07:31:27,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:27,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:27,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:27,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:27,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:27,643 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:27,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:27,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:27,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:27,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:27,681 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:27,681 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:27,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:27,682 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:27,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:27,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:27,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:27,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:27,682 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:27,682 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:27,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:27,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:27,683 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:27,683 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:27,683 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:27,683 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:27,683 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:27,683 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:27,683 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:27,683 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:27,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:27,685 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:27,686 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:27,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:27,686 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:27,686 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:27,762 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:27,763 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:31:27,763 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:27,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:27,763 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:27,763 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:27,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1905 [2022-12-06 07:31:27,763 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-06 07:31:27,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:27,763 INFO L85 PathProgramCache]: Analyzing trace with hash 111042865, now seen corresponding path program 1 times [2022-12-06 07:31:27,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:27,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155734313] [2022-12-06 07:31:27,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:27,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:27,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-06 07:31:27,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:27,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155734313] [2022-12-06 07:31:27,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155734313] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:27,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:27,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:27,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782597006] [2022-12-06 07:31:27,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:27,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:27,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:27,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:27,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:27,843 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:27,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:27,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:27,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:27,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:27,883 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:27,883 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:27,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:27,884 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:27,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:27,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:27,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:27,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:27,884 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:27,884 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:27,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:27,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:27,885 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:27,885 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:27,885 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:27,885 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:27,885 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:27,885 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:27,885 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:27,885 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:27,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:27,888 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:27,888 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:27,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:27,888 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:27,888 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:27,962 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:27,963 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:27,963 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:27,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:27,963 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:27,963 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:27,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1906 [2022-12-06 07:31:27,963 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-06 07:31:27,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:27,964 INFO L85 PathProgramCache]: Analyzing trace with hash 141519058, now seen corresponding path program 1 times [2022-12-06 07:31:27,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:27,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5130261] [2022-12-06 07:31:27,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:27,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:28,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-06 07:31:28,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:28,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5130261] [2022-12-06 07:31:28,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5130261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:28,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:28,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:28,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381519647] [2022-12-06 07:31:28,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:28,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:28,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:28,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:28,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:28,026 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:28,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:28,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:28,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:28,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:28,062 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:28,063 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:28,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:28,063 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:28,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:28,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:28,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:28,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:28,064 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:28,064 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:28,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:28,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:28,064 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:28,065 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:28,065 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:28,065 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:28,065 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:28,065 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:28,065 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:28,065 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:28,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:28,067 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:28,067 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:28,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:28,068 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:28,068 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:28,141 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:28,141 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:31:28,142 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:28,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:28,142 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:28,142 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:28,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1907 [2022-12-06 07:31:28,142 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-06 07:31:28,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:28,142 INFO L85 PathProgramCache]: Analyzing trace with hash 168301167, now seen corresponding path program 1 times [2022-12-06 07:31:28,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:28,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652531337] [2022-12-06 07:31:28,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:28,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:28,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-06 07:31:28,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:28,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652531337] [2022-12-06 07:31:28,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652531337] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:28,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:28,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:28,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321676447] [2022-12-06 07:31:28,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:28,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:28,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:28,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:28,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:28,204 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:28,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:28,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:28,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:28,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:28,241 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:28,241 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:28,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:28,242 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:28,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:28,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:28,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:28,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:28,242 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:28,242 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:28,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:28,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:28,243 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:28,243 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:28,243 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:28,243 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:28,243 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:28,243 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:28,243 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:28,244 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:28,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:28,246 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:28,246 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:28,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:28,246 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:28,246 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:28,321 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:28,322 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:28,322 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:28,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:28,322 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:28,322 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:28,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1908 [2022-12-06 07:31:28,322 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-06 07:31:28,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:28,322 INFO L85 PathProgramCache]: Analyzing trace with hash 198777360, now seen corresponding path program 1 times [2022-12-06 07:31:28,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:28,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577778186] [2022-12-06 07:31:28,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:28,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:28,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-06 07:31:28,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:28,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577778186] [2022-12-06 07:31:28,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577778186] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:28,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:28,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:28,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396930368] [2022-12-06 07:31:28,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:28,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:28,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:28,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:28,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:28,385 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:28,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:28,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:28,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:28,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:28,427 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:28,427 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:28,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:28,428 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:28,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:28,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:28,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:28,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:28,429 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:28,429 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:28,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:28,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:28,429 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:28,429 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:28,430 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:28,430 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:28,430 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:28,430 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:28,430 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:28,430 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:28,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:28,432 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:28,432 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:28,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:28,433 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:28,433 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:28,506 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:28,507 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:28,507 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:28,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:28,507 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:28,507 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:28,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1909 [2022-12-06 07:31:28,507 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-06 07:31:28,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:28,507 INFO L85 PathProgramCache]: Analyzing trace with hash 225559469, now seen corresponding path program 1 times [2022-12-06 07:31:28,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:28,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977865784] [2022-12-06 07:31:28,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:28,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:28,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-06 07:31:28,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:28,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977865784] [2022-12-06 07:31:28,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977865784] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:28,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:28,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:28,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34422979] [2022-12-06 07:31:28,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:28,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:28,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:28,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:28,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:28,573 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:28,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:28,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:28,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:28,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:28,609 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:28,609 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:28,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:28,609 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:28,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:28,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:28,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:28,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:28,610 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:28,610 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:28,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:28,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:28,611 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:28,611 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:28,611 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:28,611 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:28,611 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:28,611 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:28,611 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:28,611 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:28,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:28,613 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:28,613 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:28,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:28,614 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:28,614 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:28,689 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:28,690 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:28,690 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:28,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:28,690 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:28,690 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:28,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1910 [2022-12-06 07:31:28,690 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-06 07:31:28,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:28,690 INFO L85 PathProgramCache]: Analyzing trace with hash 256035662, now seen corresponding path program 1 times [2022-12-06 07:31:28,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:28,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370696755] [2022-12-06 07:31:28,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:28,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:28,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-06 07:31:28,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:28,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370696755] [2022-12-06 07:31:28,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370696755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:28,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:28,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:28,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980384201] [2022-12-06 07:31:28,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:28,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:28,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:28,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:28,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:28,754 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:28,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:28,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:28,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:28,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:28,790 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:28,790 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:28,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:28,790 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:28,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:28,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:28,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:28,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:28,791 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:28,791 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:28,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:28,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:28,792 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:28,792 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:28,792 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:28,792 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:28,792 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:28,792 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:28,792 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:28,792 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:28,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:28,794 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:28,794 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:28,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:28,795 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:28,795 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:28,869 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:28,869 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:28,870 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:28,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:28,870 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:28,870 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:28,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1911 [2022-12-06 07:31:28,870 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-06 07:31:28,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:28,870 INFO L85 PathProgramCache]: Analyzing trace with hash 282817771, now seen corresponding path program 1 times [2022-12-06 07:31:28,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:28,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557825003] [2022-12-06 07:31:28,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:28,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:28,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-06 07:31:28,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:28,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557825003] [2022-12-06 07:31:28,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557825003] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:28,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:28,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:28,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448469069] [2022-12-06 07:31:28,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:28,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:28,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:28,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:28,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:28,948 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:28,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:28,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:28,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:28,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:28,984 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:28,984 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:28,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:28,985 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:28,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:28,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:28,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:28,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:28,985 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:28,985 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:28,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:28,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:28,986 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:28,986 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:28,986 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:28,986 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:28,986 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:28,986 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:28,986 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:28,986 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:28,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:28,988 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:28,988 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:28,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:28,989 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:28,989 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:29,062 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:29,063 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:29,063 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:29,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:29,063 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:29,063 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:29,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1912 [2022-12-06 07:31:29,064 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-06 07:31:29,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:29,064 INFO L85 PathProgramCache]: Analyzing trace with hash 313293964, now seen corresponding path program 1 times [2022-12-06 07:31:29,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:29,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940066671] [2022-12-06 07:31:29,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:29,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:29,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:29,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-06 07:31:29,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:29,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940066671] [2022-12-06 07:31:29,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940066671] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:29,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:29,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:29,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218183456] [2022-12-06 07:31:29,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:29,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:29,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:29,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:29,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:29,127 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:29,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:29,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:29,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:29,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:29,163 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:29,163 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:29,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:29,164 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:29,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:29,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:29,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:29,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:29,164 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:29,164 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:29,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:29,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:29,165 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:29,165 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:29,165 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:29,165 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:29,165 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:29,165 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:29,165 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:29,166 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:29,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:29,168 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:29,168 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:29,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:29,168 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:29,168 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:29,241 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:29,241 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:31:29,241 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:29,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:29,242 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:29,242 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:29,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1913 [2022-12-06 07:31:29,242 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-06 07:31:29,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:29,242 INFO L85 PathProgramCache]: Analyzing trace with hash 340076073, now seen corresponding path program 1 times [2022-12-06 07:31:29,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:29,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591986107] [2022-12-06 07:31:29,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:29,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:29,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-06 07:31:29,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:29,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591986107] [2022-12-06 07:31:29,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591986107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:29,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:29,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:29,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267318528] [2022-12-06 07:31:29,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:29,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:29,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:29,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:29,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:29,307 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:29,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:29,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:29,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:29,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:29,347 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:29,347 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:29,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:29,348 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:29,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:29,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:29,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:29,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:29,348 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:29,348 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:29,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:29,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:29,349 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:29,349 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:29,349 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:29,349 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:29,349 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:29,349 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:29,349 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:29,350 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:29,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:29,352 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:29,352 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:29,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:29,352 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:29,352 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:29,426 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:29,426 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:29,426 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:29,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:29,427 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:29,427 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:29,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1914 [2022-12-06 07:31:29,427 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-06 07:31:29,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:29,427 INFO L85 PathProgramCache]: Analyzing trace with hash 370552266, now seen corresponding path program 1 times [2022-12-06 07:31:29,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:29,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987238606] [2022-12-06 07:31:29,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:29,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:29,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-06 07:31:29,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:29,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987238606] [2022-12-06 07:31:29,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987238606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:29,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:29,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:29,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514876555] [2022-12-06 07:31:29,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:29,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:29,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:29,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:29,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:29,489 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:29,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:29,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:29,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:29,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:29,529 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:29,530 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:29,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:29,530 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:29,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:29,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:29,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:29,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:29,530 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:29,531 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:29,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:29,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:29,531 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:29,531 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:29,531 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:29,531 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:29,531 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:29,532 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:29,532 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:29,532 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:29,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:29,534 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:29,534 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:29,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:29,534 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:29,534 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:29,606 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:29,606 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:31:29,606 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:29,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:29,606 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:29,606 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:29,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1915 [2022-12-06 07:31:29,607 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-06 07:31:29,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:29,607 INFO L85 PathProgramCache]: Analyzing trace with hash 397334375, now seen corresponding path program 1 times [2022-12-06 07:31:29,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:29,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240869381] [2022-12-06 07:31:29,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:29,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:29,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-06 07:31:29,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:29,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240869381] [2022-12-06 07:31:29,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240869381] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:29,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:29,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:29,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774378473] [2022-12-06 07:31:29,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:29,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:29,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:29,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:29,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:29,671 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:29,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:29,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:29,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:29,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:29,713 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:29,713 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:29,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:29,713 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:29,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:29,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:29,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:29,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:29,714 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:29,714 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:29,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:29,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:29,714 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:29,715 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:29,715 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:29,715 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:29,715 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:29,715 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:29,715 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:29,715 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:29,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:29,717 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:29,717 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:29,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:29,718 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:29,718 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:29,793 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:29,793 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:29,794 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:29,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:29,794 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:29,794 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:29,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1916 [2022-12-06 07:31:29,794 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-06 07:31:29,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:29,794 INFO L85 PathProgramCache]: Analyzing trace with hash 427810568, now seen corresponding path program 1 times [2022-12-06 07:31:29,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:29,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066274348] [2022-12-06 07:31:29,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:29,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:29,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-06 07:31:29,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:29,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066274348] [2022-12-06 07:31:29,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066274348] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:29,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:29,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:29,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610107270] [2022-12-06 07:31:29,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:29,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:29,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:29,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:29,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:29,855 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:29,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:29,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:29,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:29,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:29,891 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:29,892 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:29,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:29,892 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:29,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:29,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:29,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:29,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:29,893 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:29,893 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:29,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:29,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:29,893 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:29,893 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:29,894 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:29,894 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:29,894 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:29,894 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:29,894 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:29,894 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:29,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:29,896 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:29,896 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:29,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:29,896 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:29,897 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:29,969 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:29,970 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:31:29,970 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:29,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:29,970 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:29,971 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:29,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1917 [2022-12-06 07:31:29,971 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-06 07:31:29,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:29,971 INFO L85 PathProgramCache]: Analyzing trace with hash 454592677, now seen corresponding path program 1 times [2022-12-06 07:31:29,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:29,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773008621] [2022-12-06 07:31:29,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:29,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:30,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-06 07:31:30,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:30,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773008621] [2022-12-06 07:31:30,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773008621] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:30,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:30,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:30,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256300840] [2022-12-06 07:31:30,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:30,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:30,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:30,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:30,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:30,058 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:30,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:30,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:30,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:30,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:30,100 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:30,100 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:30,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:30,101 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:30,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:30,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:30,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:30,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:30,101 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:30,101 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:30,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:30,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:30,102 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:30,102 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:30,102 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:30,102 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:30,102 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:30,102 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:30,102 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:30,102 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:30,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:30,105 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:30,105 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:30,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:30,105 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:30,105 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:30,178 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:30,179 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:30,179 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:30,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:30,179 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:30,179 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:30,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1918 [2022-12-06 07:31:30,179 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-06 07:31:30,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:30,179 INFO L85 PathProgramCache]: Analyzing trace with hash 485068870, now seen corresponding path program 1 times [2022-12-06 07:31:30,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:30,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239820696] [2022-12-06 07:31:30,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:30,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:30,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-06 07:31:30,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:30,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239820696] [2022-12-06 07:31:30,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239820696] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:30,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:30,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:30,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697079177] [2022-12-06 07:31:30,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:30,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:30,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:30,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:30,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:30,241 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:30,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:30,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:30,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:30,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:30,279 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:30,279 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:30,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:30,280 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:30,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:30,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:30,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:30,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:30,281 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:30,281 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:30,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:30,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:30,281 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:30,281 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:30,281 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:30,282 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:30,282 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:30,282 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:30,282 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:30,282 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:30,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:30,284 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:30,284 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:30,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:30,284 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:30,284 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:30,364 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:30,365 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 07:31:30,365 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:30,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:30,365 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:30,365 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:30,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1919 [2022-12-06 07:31:30,365 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-06 07:31:30,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:30,365 INFO L85 PathProgramCache]: Analyzing trace with hash 511850979, now seen corresponding path program 1 times [2022-12-06 07:31:30,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:30,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736804451] [2022-12-06 07:31:30,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:30,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:30,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-06 07:31:30,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:30,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736804451] [2022-12-06 07:31:30,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736804451] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:30,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:30,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:30,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366191867] [2022-12-06 07:31:30,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:30,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:30,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:30,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:30,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:30,429 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:30,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:30,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:30,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:30,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:30,470 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:30,470 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:30,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:30,471 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:30,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:30,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:30,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:30,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:30,472 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:30,472 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:30,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:30,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:30,472 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:30,472 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:30,472 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:30,473 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:30,473 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:30,473 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:30,473 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:30,473 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:30,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:30,475 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:30,475 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:30,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:30,475 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:30,475 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:30,549 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:30,550 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:30,550 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:30,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:30,550 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:30,550 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:30,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1920 [2022-12-06 07:31:30,551 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-06 07:31:30,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:30,551 INFO L85 PathProgramCache]: Analyzing trace with hash 542327172, now seen corresponding path program 1 times [2022-12-06 07:31:30,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:30,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661957259] [2022-12-06 07:31:30,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:30,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:30,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:31:30,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:30,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661957259] [2022-12-06 07:31:30,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661957259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:30,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:30,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:30,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241518936] [2022-12-06 07:31:30,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:30,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:30,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:30,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:30,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:30,613 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:30,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:30,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:30,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:30,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:30,655 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:30,656 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:30,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:30,656 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:30,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:30,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:30,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:30,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:30,657 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:30,657 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:30,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:30,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:30,657 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:30,657 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:30,658 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:30,658 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:30,658 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:30,658 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:30,658 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:30,658 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:30,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:30,660 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:30,660 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:30,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:30,660 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:30,660 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:30,732 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:30,733 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:31:30,733 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:30,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:30,733 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:30,733 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:30,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1921 [2022-12-06 07:31:30,734 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-06 07:31:30,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:30,734 INFO L85 PathProgramCache]: Analyzing trace with hash 569109281, now seen corresponding path program 1 times [2022-12-06 07:31:30,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:30,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767537112] [2022-12-06 07:31:30,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:30,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:30,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:30,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-06 07:31:30,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:30,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767537112] [2022-12-06 07:31:30,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767537112] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:30,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:30,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:30,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460729272] [2022-12-06 07:31:30,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:30,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:30,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:30,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:30,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:30,797 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:30,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:30,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:30,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:30,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:30,838 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:30,838 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:30,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:30,838 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:30,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:30,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:30,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:30,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:30,839 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:30,839 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:30,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:30,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:30,839 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:30,839 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:30,840 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:30,840 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:30,840 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:30,840 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:30,840 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:30,840 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:30,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:30,842 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:30,842 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:30,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:30,842 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:30,842 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:30,915 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:30,916 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:31:30,916 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:30,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:30,916 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:30,916 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:30,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1922 [2022-12-06 07:31:30,916 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-06 07:31:30,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:30,916 INFO L85 PathProgramCache]: Analyzing trace with hash 599585474, now seen corresponding path program 1 times [2022-12-06 07:31:30,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:30,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374004366] [2022-12-06 07:31:30,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:30,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:30,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-06 07:31:30,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:30,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374004366] [2022-12-06 07:31:30,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374004366] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:30,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:30,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:30,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035811632] [2022-12-06 07:31:30,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:30,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:30,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:30,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:30,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:30,977 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:30,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:30,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:30,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:30,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:31,012 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:31,012 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:31,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:31,013 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:31,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:31,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:31,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:31,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:31,013 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:31,013 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:31,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:31,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:31,014 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:31,014 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:31,014 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:31,014 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:31,014 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:31,015 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:31,015 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:31,015 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:31,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:31,017 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:31,017 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:31,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 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 116. Up to 16 conditions per place. [2022-12-06 07:31:31,017 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:31,017 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:31,089 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:31,090 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:31:31,090 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:31,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:31,090 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:31,091 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:31,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1923 [2022-12-06 07:31:31,091 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-06 07:31:31,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:31,091 INFO L85 PathProgramCache]: Analyzing trace with hash 626367583, now seen corresponding path program 1 times [2022-12-06 07:31:31,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:31,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935704319] [2022-12-06 07:31:31,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:31,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:31,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-06 07:31:31,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:31,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935704319] [2022-12-06 07:31:31,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935704319] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:31,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:31,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:31,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105027397] [2022-12-06 07:31:31,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:31,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:31,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:31,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:31,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:31,170 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:31,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:31,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:31,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:31,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:31,211 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:31,211 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:31,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:31,212 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:31,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:31,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:31,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:31,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:31,212 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:31,212 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:31,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:31,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:31,213 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:31,213 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:31,213 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:31,213 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:31,213 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:31,213 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:31,213 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:31,213 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:31,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:31,216 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:31,216 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:31,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:31,216 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:31,216 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:31,289 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:31,290 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:31,290 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:31,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:31,290 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:31,290 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:31,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1924 [2022-12-06 07:31:31,290 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-06 07:31:31,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:31,290 INFO L85 PathProgramCache]: Analyzing trace with hash 656843776, now seen corresponding path program 1 times [2022-12-06 07:31:31,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:31,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841237010] [2022-12-06 07:31:31,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:31,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:31,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-06 07:31:31,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:31,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841237010] [2022-12-06 07:31:31,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841237010] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:31,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:31,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:31,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284871044] [2022-12-06 07:31:31,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:31,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:31,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:31,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:31,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:31,351 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:31,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:31,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:31,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:31,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:31,387 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:31,388 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:31,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:31,388 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:31,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:31,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:31,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:31,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:31,389 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:31,389 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:31,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:31,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:31,389 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:31,389 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:31,389 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:31,389 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:31,390 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:31,390 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:31,390 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:31,390 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:31,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:31,392 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:31,392 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:31,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:31,392 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:31,392 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:31,466 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:31,467 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:31,467 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:31,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:31,467 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:31,467 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:31,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1925 [2022-12-06 07:31:31,467 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-06 07:31:31,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:31,467 INFO L85 PathProgramCache]: Analyzing trace with hash 683625885, now seen corresponding path program 1 times [2022-12-06 07:31:31,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:31,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408773358] [2022-12-06 07:31:31,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:31,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:31,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-06 07:31:31,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:31,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408773358] [2022-12-06 07:31:31,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408773358] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:31,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:31,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:31,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586399140] [2022-12-06 07:31:31,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:31,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:31,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:31,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:31,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:31,532 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:31,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:31,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:31,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:31,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:31,570 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:31,570 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:31,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 356 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:31,571 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:31,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:31,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:31,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:31,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:31,571 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:31,571 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:31,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:31,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:31,572 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:31,572 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:31,572 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:31,572 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:31,572 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:31,572 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:31,572 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:31,573 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:31,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:31,575 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:31,575 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:31,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:31,575 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:31,575 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:31,652 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:31,653 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:31:31,653 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:31,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:31,653 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:31,653 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:31,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1926 [2022-12-06 07:31:31,653 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-06 07:31:31,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:31,653 INFO L85 PathProgramCache]: Analyzing trace with hash 714102078, now seen corresponding path program 1 times [2022-12-06 07:31:31,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:31,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584881448] [2022-12-06 07:31:31,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:31,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:31,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:31,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-06 07:31:31,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:31,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584881448] [2022-12-06 07:31:31,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584881448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:31,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:31,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:31,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360034784] [2022-12-06 07:31:31,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:31,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:31,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:31,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:31,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:31,718 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:31,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:31,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:31,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:31,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:31,755 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:31,755 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:31,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:31,756 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:31,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:31,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:31,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:31,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:31,756 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:31,756 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:31,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:31,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:31,757 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:31,757 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:31,757 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:31,757 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:31,757 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:31,757 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:31,757 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:31,757 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:31,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:31,759 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:31,760 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:31,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:31,760 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:31,760 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:31,834 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:31,835 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:31,835 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:31,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:31,835 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:31,835 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:31,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1927 [2022-12-06 07:31:31,835 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-06 07:31:31,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:31,835 INFO L85 PathProgramCache]: Analyzing trace with hash 740884187, now seen corresponding path program 1 times [2022-12-06 07:31:31,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:31,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291918164] [2022-12-06 07:31:31,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:31,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:31,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-06 07:31:31,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:31,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291918164] [2022-12-06 07:31:31,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291918164] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:31,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:31,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:31,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639720959] [2022-12-06 07:31:31,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:31,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:31,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:31,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:31,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:31,899 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:31,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:31,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:31,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:31,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:31,935 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:31,936 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:31,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:31,936 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:31,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:31,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:31,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:31,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:31,937 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:31,937 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:31,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:31,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:31,937 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:31,937 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:31,938 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:31,938 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:31,938 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:31,938 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:31,938 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:31,938 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:31,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:31,940 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:31,940 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:31,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:31,940 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:31,941 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:32,014 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:32,015 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:32,015 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:32,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:32,015 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:32,015 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:32,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1928 [2022-12-06 07:31:32,015 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-06 07:31:32,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:32,015 INFO L85 PathProgramCache]: Analyzing trace with hash 771360380, now seen corresponding path program 1 times [2022-12-06 07:31:32,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:32,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116656113] [2022-12-06 07:31:32,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:32,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:32,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-06 07:31:32,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:32,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116656113] [2022-12-06 07:31:32,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116656113] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:32,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:32,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:32,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724559137] [2022-12-06 07:31:32,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:32,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:32,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:32,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:32,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:32,077 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:32,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:32,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:32,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:32,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:32,112 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:32,112 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:32,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:32,113 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:32,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:32,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:32,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:32,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:32,113 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:32,113 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:32,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:32,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:32,114 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:32,114 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:32,114 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:32,114 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:32,114 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:32,114 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:32,114 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:32,114 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:32,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:32,117 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:32,117 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:32,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 115 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:32,117 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:32,117 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:32,189 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:32,190 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:31:32,190 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:32,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:32,190 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:32,190 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:32,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1929 [2022-12-06 07:31:32,190 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-06 07:31:32,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:32,191 INFO L85 PathProgramCache]: Analyzing trace with hash 798142489, now seen corresponding path program 1 times [2022-12-06 07:31:32,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:32,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920334200] [2022-12-06 07:31:32,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:32,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:32,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-06 07:31:32,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:32,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920334200] [2022-12-06 07:31:32,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920334200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:32,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:32,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:32,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543349676] [2022-12-06 07:31:32,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:32,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:32,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:32,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:32,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:32,267 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:32,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:32,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:32,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:32,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:32,303 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:32,303 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:32,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:32,304 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:32,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:32,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:32,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:32,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:32,304 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:32,304 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:32,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:32,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:32,305 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:32,305 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:32,305 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:32,305 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:32,305 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:32,305 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:32,305 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:32,305 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:32,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:32,308 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:32,308 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:32,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:32,308 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:32,308 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:32,379 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:32,380 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:31:32,380 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:32,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:32,380 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:32,380 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:32,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1930 [2022-12-06 07:31:32,381 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-06 07:31:32,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:32,381 INFO L85 PathProgramCache]: Analyzing trace with hash 828618682, now seen corresponding path program 1 times [2022-12-06 07:31:32,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:32,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933783135] [2022-12-06 07:31:32,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:32,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:32,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-06 07:31:32,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:32,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933783135] [2022-12-06 07:31:32,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933783135] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:32,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:32,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:32,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350313844] [2022-12-06 07:31:32,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:32,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:32,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:32,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:32,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:32,443 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:32,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:32,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:32,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:32,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:32,485 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:32,485 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:32,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:32,486 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:32,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:32,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:32,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:32,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:32,486 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:32,486 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:32,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:32,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:32,487 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:32,487 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:32,487 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:32,487 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:32,487 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:32,487 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:32,487 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:32,488 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:32,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:32,490 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:32,490 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:32,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:32,490 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:32,490 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:32,563 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:32,564 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:32,564 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:32,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:32,564 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:32,564 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:32,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1931 [2022-12-06 07:31:32,565 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-06 07:31:32,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:32,565 INFO L85 PathProgramCache]: Analyzing trace with hash 855400791, now seen corresponding path program 1 times [2022-12-06 07:31:32,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:32,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854515201] [2022-12-06 07:31:32,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:32,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:32,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:31:32,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:32,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854515201] [2022-12-06 07:31:32,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854515201] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:32,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:32,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:32,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107334928] [2022-12-06 07:31:32,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:32,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:32,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:32,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:32,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:32,628 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:32,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:32,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:32,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:32,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:32,663 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:32,663 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:32,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:32,664 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:32,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:32,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:32,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:32,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:32,664 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:32,664 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:32,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:32,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:32,665 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:32,665 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:32,665 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:32,665 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:32,665 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:32,666 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:32,666 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:32,666 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:32,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:32,668 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:32,668 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:32,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:32,668 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:32,668 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:32,741 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:32,742 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:32,742 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:32,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:32,742 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:32,742 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:32,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1932 [2022-12-06 07:31:32,742 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-06 07:31:32,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:32,742 INFO L85 PathProgramCache]: Analyzing trace with hash 885876984, now seen corresponding path program 1 times [2022-12-06 07:31:32,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:32,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387805459] [2022-12-06 07:31:32,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:32,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:32,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-06 07:31:32,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:32,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387805459] [2022-12-06 07:31:32,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387805459] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:32,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:32,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:32,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557267686] [2022-12-06 07:31:32,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:32,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:32,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:32,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:32,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:32,806 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:32,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:32,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:32,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:32,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:32,841 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:32,842 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:32,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:32,842 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:32,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:32,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:32,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:32,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:32,843 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:32,843 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:32,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:32,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:32,843 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:32,843 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:32,844 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:32,844 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:32,844 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:32,844 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:32,844 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:32,844 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:32,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:32,846 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:32,846 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:32,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:32,846 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:32,846 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:32,919 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:32,920 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:31:32,920 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:32,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:32,920 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:32,920 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:32,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1933 [2022-12-06 07:31:32,921 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-06 07:31:32,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:32,921 INFO L85 PathProgramCache]: Analyzing trace with hash 912659093, now seen corresponding path program 1 times [2022-12-06 07:31:32,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:32,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698401198] [2022-12-06 07:31:32,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:32,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:32,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-06 07:31:32,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:32,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698401198] [2022-12-06 07:31:32,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698401198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:32,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:32,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:32,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562578326] [2022-12-06 07:31:32,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:32,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:32,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:32,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:32,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:32,986 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:32,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:32,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:32,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:32,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:33,021 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:33,021 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:33,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:33,022 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:33,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:33,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:33,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:33,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:33,022 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:33,023 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:33,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:33,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:33,023 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:33,023 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:33,023 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:33,023 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:33,024 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:33,024 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:33,024 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:33,024 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:33,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:33,026 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:33,026 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:33,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:33,026 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:33,026 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:33,099 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:33,100 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:33,100 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:33,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:33,100 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:33,100 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:33,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1934 [2022-12-06 07:31:33,100 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-06 07:31:33,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:33,100 INFO L85 PathProgramCache]: Analyzing trace with hash 943135286, now seen corresponding path program 1 times [2022-12-06 07:31:33,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:33,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534389127] [2022-12-06 07:31:33,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:33,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:33,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-06 07:31:33,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:33,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534389127] [2022-12-06 07:31:33,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534389127] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:33,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:33,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:33,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277511476] [2022-12-06 07:31:33,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:33,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:33,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:33,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:33,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:33,162 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:33,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:33,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:33,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:33,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:33,199 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:33,199 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:33,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:33,199 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:33,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:33,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:33,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:33,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:33,200 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:33,200 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:33,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:33,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:33,201 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:33,201 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:33,201 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:33,201 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:33,201 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:33,201 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:33,201 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:33,201 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:33,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:33,203 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:33,203 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:33,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 118 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:33,204 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:33,204 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:33,294 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:33,294 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-06 07:31:33,295 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:33,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:33,295 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:33,295 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:33,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1935 [2022-12-06 07:31:33,295 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-06 07:31:33,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:33,295 INFO L85 PathProgramCache]: Analyzing trace with hash 969917395, now seen corresponding path program 1 times [2022-12-06 07:31:33,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:33,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143703161] [2022-12-06 07:31:33,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:33,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31: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-06 07:31:33,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:33,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143703161] [2022-12-06 07:31:33,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143703161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:33,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:33,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:33,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413175739] [2022-12-06 07:31:33,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:33,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:33,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:33,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:33,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:33,376 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:33,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:33,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:33,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:33,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:33,418 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:33,419 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:33,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:33,419 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:33,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:33,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:33,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:33,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:33,420 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:33,420 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:33,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:33,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:33,420 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:33,420 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:33,421 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:33,421 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:33,421 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:33,421 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:33,421 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:33,421 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:33,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:33,423 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:33,423 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:33,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:33,424 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:33,424 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:33,497 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:33,498 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:33,498 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:33,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:33,498 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:33,498 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:33,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1936 [2022-12-06 07:31:33,499 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-06 07:31:33,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:33,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1000393588, now seen corresponding path program 1 times [2022-12-06 07:31:33,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:33,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358845483] [2022-12-06 07:31:33,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:33,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:33,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-06 07:31:33,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:33,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358845483] [2022-12-06 07:31:33,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358845483] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:33,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:33,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:33,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780273652] [2022-12-06 07:31:33,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:33,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:33,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:33,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:33,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:33,560 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:33,560 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:33,560 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:33,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:33,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:33,602 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:33,602 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:33,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:33,602 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:33,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:33,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:33,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:33,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:33,603 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:33,603 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:33,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:33,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:33,604 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:33,604 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:33,604 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:33,604 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:33,604 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:33,604 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:33,604 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:33,604 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:33,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:33,606 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:33,606 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:33,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:33,607 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:33,607 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:33,680 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:33,681 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:33,681 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:33,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:33,681 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:33,681 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:33,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1937 [2022-12-06 07:31:33,681 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-06 07:31:33,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:33,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1027175697, now seen corresponding path program 1 times [2022-12-06 07:31:33,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:33,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861655992] [2022-12-06 07:31:33,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:33,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:33,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-06 07:31:33,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:33,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861655992] [2022-12-06 07:31:33,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861655992] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:33,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:33,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:33,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970198826] [2022-12-06 07:31:33,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:33,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:33,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:33,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:33,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:33,747 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:33,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:33,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:33,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:33,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:33,783 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:33,783 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:33,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:33,784 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:33,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:33,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:33,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:33,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:33,784 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:33,784 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:33,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:33,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:33,785 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:33,785 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:33,785 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:33,785 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:33,785 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:33,785 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:33,785 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:33,785 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:33,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:33,788 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:33,788 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:33,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:33,788 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:33,788 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:33,862 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:33,863 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:33,863 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:33,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:33,863 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:33,863 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:33,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1938 [2022-12-06 07:31:33,863 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-06 07:31:33,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:33,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1057651890, now seen corresponding path program 1 times [2022-12-06 07:31:33,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:33,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233248220] [2022-12-06 07:31:33,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:33,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:33,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-06 07:31:33,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:33,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233248220] [2022-12-06 07:31:33,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233248220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:33,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:33,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:33,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729070269] [2022-12-06 07:31:33,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:33,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:33,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:33,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:33,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:33,925 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:33,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:33,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:33,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:33,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:33,966 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:33,966 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:33,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:33,966 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:33,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:33,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:33,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:33,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:33,967 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:33,967 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:33,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:33,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:33,968 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:33,968 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:33,968 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:33,968 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:33,968 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:33,968 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:33,968 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:33,968 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:33,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:33,971 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:33,971 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:33,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:33,971 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:33,971 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:34,044 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:34,045 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:34,045 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:34,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:34,045 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:34,045 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:34,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1939 [2022-12-06 07:31:34,045 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-06 07:31:34,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:34,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1084433999, now seen corresponding path program 1 times [2022-12-06 07:31:34,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:34,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910662671] [2022-12-06 07:31:34,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:34,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:34,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-06 07:31:34,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:34,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910662671] [2022-12-06 07:31:34,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910662671] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:34,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:34,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:34,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003245633] [2022-12-06 07:31:34,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:34,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:34,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:34,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:34,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:34,114 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:34,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:34,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:34,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:34,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:34,155 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:34,155 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:34,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:34,156 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:34,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:34,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:34,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:34,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:34,156 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:34,156 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:34,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:34,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:34,157 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:34,157 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:34,157 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:34,157 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:34,157 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:34,157 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:34,157 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:34,157 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:34,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:34,160 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:34,160 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:34,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:34,160 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:34,160 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:34,236 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:34,237 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:31:34,237 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:34,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:34,237 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:34,237 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:34,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1940 [2022-12-06 07:31:34,237 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-06 07:31:34,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:34,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1114910192, now seen corresponding path program 1 times [2022-12-06 07:31:34,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:34,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417217809] [2022-12-06 07:31:34,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:34,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:34,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:34,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-06 07:31:34,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:34,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417217809] [2022-12-06 07:31:34,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417217809] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:34,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:34,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:34,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372345717] [2022-12-06 07:31:34,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:34,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:34,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:34,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:34,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:34,304 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:34,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:34,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:34,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:34,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:34,347 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:34,347 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:34,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:34,347 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:34,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:34,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:34,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:34,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:34,348 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:34,348 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:34,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:34,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:34,349 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:34,349 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:34,349 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:34,349 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:34,349 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:34,349 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:34,349 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:34,349 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:34,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:34,351 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:34,352 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:34,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:34,352 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:34,352 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:34,426 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:34,427 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:34,427 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:34,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:34,427 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:34,427 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:34,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1941 [2022-12-06 07:31:34,427 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-06 07:31:34,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:34,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1141692301, now seen corresponding path program 1 times [2022-12-06 07:31:34,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:34,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757292418] [2022-12-06 07:31:34,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:34,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:34,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-06 07:31:34,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:34,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757292418] [2022-12-06 07:31:34,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757292418] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:34,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:34,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:34,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040968169] [2022-12-06 07:31:34,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:34,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:34,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:34,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:34,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:34,505 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:34,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:34,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:34,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:34,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:34,546 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:34,546 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:34,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:34,547 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:34,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:34,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:34,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:34,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:34,547 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:34,547 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:34,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:34,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:34,548 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:34,548 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:34,548 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:34,548 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:34,548 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:34,548 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:34,548 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:34,548 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:34,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:34,551 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:34,551 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:34,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:34,551 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:34,551 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:34,625 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:34,626 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:34,626 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:34,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:34,626 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:34,626 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:34,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1942 [2022-12-06 07:31:34,626 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-06 07:31:34,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:34,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1172168494, now seen corresponding path program 1 times [2022-12-06 07:31:34,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:34,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282502549] [2022-12-06 07:31:34,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:34,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:34,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-06 07:31:34,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:34,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282502549] [2022-12-06 07:31:34,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282502549] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:34,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:34,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:34,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343931914] [2022-12-06 07:31:34,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:34,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:34,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:34,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:34,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:34,689 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:34,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:34,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:34,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:34,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:34,731 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:34,731 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:34,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:34,731 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:34,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:34,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:34,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:34,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:34,732 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:34,732 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:34,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:34,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:34,733 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:34,733 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:34,733 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:34,733 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:34,733 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:34,733 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:34,733 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:34,733 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:34,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:34,735 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:34,735 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:34,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:34,736 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:34,736 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:34,810 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:34,811 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:34,811 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:34,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:34,811 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:34,811 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:34,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1943 [2022-12-06 07:31:34,811 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-06 07:31:34,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:34,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1198950603, now seen corresponding path program 1 times [2022-12-06 07:31:34,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:34,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130359921] [2022-12-06 07:31:34,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:34,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:34,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-06 07:31:34,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:34,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130359921] [2022-12-06 07:31:34,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130359921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:34,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:34,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:34,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006791796] [2022-12-06 07:31:34,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:34,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:34,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:34,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:34,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:34,877 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:34,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:34,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:34,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:34,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:34,918 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:34,918 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:34,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:34,919 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:34,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:34,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:34,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:34,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:34,920 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:34,920 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:34,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:34,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:34,920 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:34,920 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:34,920 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:34,921 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:34,921 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:34,921 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:34,921 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:34,921 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:34,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:34,923 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:34,923 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:34,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:34,924 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:34,924 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:35,001 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:35,002 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:31:35,002 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:35,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:35,002 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:35,002 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:35,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1944 [2022-12-06 07:31:35,002 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-06 07:31:35,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:35,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1229426796, now seen corresponding path program 1 times [2022-12-06 07:31:35,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:35,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315104] [2022-12-06 07:31:35,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:35,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:35,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:31:35,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:35,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315104] [2022-12-06 07:31:35,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315104] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:35,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:35,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:35,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40810692] [2022-12-06 07:31:35,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:35,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:35,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:35,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:35,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:35,065 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:35,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:35,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:35,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:35,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:35,108 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:35,108 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:35,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:35,108 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:35,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:35,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:35,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:35,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:35,109 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:35,109 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:35,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:35,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:35,110 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:35,110 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:35,110 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:35,110 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:35,110 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:35,110 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:35,110 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:35,110 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:35,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:35,112 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:35,112 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:35,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:35,113 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:35,113 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:35,186 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:35,187 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:35,187 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:35,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:35,187 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:35,187 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:35,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1945 [2022-12-06 07:31:35,187 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-06 07:31:35,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:35,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1256208905, now seen corresponding path program 1 times [2022-12-06 07:31:35,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:35,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695301344] [2022-12-06 07:31:35,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:35,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:35,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-06 07:31:35,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:35,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695301344] [2022-12-06 07:31:35,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695301344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:35,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:35,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:35,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897024487] [2022-12-06 07:31:35,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:35,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:35,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:35,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:35,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:35,254 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:35,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:35,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:35,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:35,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:35,290 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:35,290 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:35,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:35,291 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:35,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:35,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:35,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:35,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:35,291 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:35,291 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:35,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:35,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:35,292 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:35,292 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:35,292 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:35,292 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:35,292 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:35,292 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:35,292 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:35,293 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:35,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:35,295 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:35,295 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:35,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:35,295 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:35,295 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:35,371 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:35,372 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:31:35,372 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:35,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:35,372 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:35,372 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:35,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1946 [2022-12-06 07:31:35,372 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-06 07:31:35,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:35,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1286685098, now seen corresponding path program 1 times [2022-12-06 07:31:35,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:35,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937923111] [2022-12-06 07:31:35,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:35,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:35,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-06 07:31:35,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:35,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937923111] [2022-12-06 07:31:35,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937923111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:35,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:35,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:35,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638602691] [2022-12-06 07:31:35,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:35,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:35,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:35,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:35,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:35,435 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:35,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:35,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:35,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:35,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:35,477 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:35,477 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:35,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:35,477 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:35,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:35,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:35,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:35,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:35,478 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:35,478 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:35,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:35,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:35,479 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:35,479 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:35,479 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:35,479 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:35,479 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:35,479 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:35,479 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:35,479 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:35,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:35,481 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:35,481 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:35,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:35,482 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:35,482 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:35,556 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:35,557 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:35,557 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:35,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:35,557 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:35,557 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:35,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1947 [2022-12-06 07:31:35,557 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-06 07:31:35,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:35,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1313467207, now seen corresponding path program 1 times [2022-12-06 07:31:35,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:35,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368739573] [2022-12-06 07:31:35,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:35,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:35,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-06 07:31:35,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:35,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368739573] [2022-12-06 07:31:35,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368739573] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:35,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:35,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:35,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112696341] [2022-12-06 07:31:35,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:35,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:35,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:35,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:35,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:35,642 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:35,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:35,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:35,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:35,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:35,679 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:35,679 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:35,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:35,679 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:35,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:35,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:35,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:35,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:35,680 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:35,680 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:35,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:35,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:35,681 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:35,681 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:35,681 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:35,681 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:35,681 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:35,681 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:35,681 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:35,681 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:35,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:35,683 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:35,684 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:35,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:35,684 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:35,684 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:35,759 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:35,760 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:35,760 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:35,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:35,760 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:35,760 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:35,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1948 [2022-12-06 07:31:35,760 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-06 07:31:35,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:35,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1343943400, now seen corresponding path program 1 times [2022-12-06 07:31:35,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:35,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585257374] [2022-12-06 07:31:35,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:35,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:35,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-06 07:31:35,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:35,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585257374] [2022-12-06 07:31:35,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585257374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:35,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:35,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:35,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459390191] [2022-12-06 07:31:35,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:35,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:35,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:35,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:35,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:35,836 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:35,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:35,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:35,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:35,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:35,878 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:35,878 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:35,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:35,878 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:35,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:35,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:35,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:35,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:35,879 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:35,879 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:35,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:35,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:35,880 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:35,880 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:35,880 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:35,880 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:35,880 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:35,880 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:35,880 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:35,880 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:35,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:35,882 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:35,882 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:35,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:35,883 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:35,883 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:35,964 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:35,965 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 07:31:35,965 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:35,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:35,965 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:35,965 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:35,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1949 [2022-12-06 07:31:35,966 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-06 07:31:35,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:35,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1370725509, now seen corresponding path program 1 times [2022-12-06 07:31:35,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:35,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164943906] [2022-12-06 07:31:35,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:35,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:35,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:36,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-06 07:31:36,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:36,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164943906] [2022-12-06 07:31:36,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164943906] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:36,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:36,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:36,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203807789] [2022-12-06 07:31:36,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:36,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:36,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:36,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:36,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:36,033 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:36,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:36,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:36,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:36,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:36,080 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:36,080 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:36,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:36,081 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:36,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:36,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:36,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:36,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:36,081 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:36,081 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:36,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:36,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:36,082 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:36,082 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:36,082 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:36,082 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:36,082 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:36,083 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:36,083 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:36,083 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:36,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:36,085 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:36,085 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:36,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:36,085 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:36,085 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:36,159 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:36,160 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:36,160 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:36,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:36,160 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:36,160 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:36,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1950 [2022-12-06 07:31:36,160 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-06 07:31:36,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:36,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1401201702, now seen corresponding path program 1 times [2022-12-06 07:31:36,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:36,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243879085] [2022-12-06 07:31:36,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:36,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:36,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-06 07:31:36,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:36,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243879085] [2022-12-06 07:31:36,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243879085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:36,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:36,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:36,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776427022] [2022-12-06 07:31:36,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:36,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:36,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:36,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:36,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:36,229 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:36,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:36,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:36,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:36,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:36,266 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:36,266 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:36,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:36,267 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:36,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:36,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:36,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:36,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:36,267 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:36,268 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:36,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:36,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:36,268 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:36,268 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:36,268 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:36,269 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:36,269 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:36,269 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:36,269 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:36,269 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:36,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:36,271 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:36,271 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:36,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:36,271 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:36,272 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:36,347 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:36,348 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:31:36,348 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:36,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:36,348 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:36,348 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:36,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1951 [2022-12-06 07:31:36,348 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-06 07:31:36,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:36,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1427983811, now seen corresponding path program 1 times [2022-12-06 07:31:36,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:36,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401668874] [2022-12-06 07:31:36,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:36,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:36,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-06 07:31:36,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:36,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401668874] [2022-12-06 07:31:36,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401668874] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:36,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:36,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:36,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120903128] [2022-12-06 07:31:36,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:36,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:36,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:36,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:36,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:36,413 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:36,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:36,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:36,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:36,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:36,453 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:36,453 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:36,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 371 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:36,453 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:36,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:36,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:36,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:36,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:36,454 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:36,454 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:36,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:36,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:36,455 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:36,455 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:36,455 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:36,455 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:36,455 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:36,455 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:36,455 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:36,455 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:36,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:36,457 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:36,457 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:36,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:36,458 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:36,458 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:36,532 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:36,533 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:36,533 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:36,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:36,533 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:36,533 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:36,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1952 [2022-12-06 07:31:36,533 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-06 07:31:36,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:36,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1458460004, now seen corresponding path program 1 times [2022-12-06 07:31:36,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:36,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040458445] [2022-12-06 07:31:36,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:36,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:36,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-06 07:31:36,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:36,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040458445] [2022-12-06 07:31:36,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040458445] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:36,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:36,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:36,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051757283] [2022-12-06 07:31:36,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:36,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:36,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:36,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:36,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:36,597 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:36,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:36,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:36,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:36,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:36,640 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:36,640 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:36,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:36,640 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:36,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:36,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:36,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:36,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:36,641 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:36,641 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:36,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:36,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:36,642 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:36,642 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:36,642 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:36,642 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:36,642 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:36,642 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:36,642 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:36,642 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:36,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:36,644 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:36,644 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:36,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:36,645 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:36,645 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:36,718 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:36,719 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:36,719 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:36,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:36,719 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:36,719 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:36,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1953 [2022-12-06 07:31:36,719 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-06 07:31:36,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:36,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1485242113, now seen corresponding path program 1 times [2022-12-06 07:31:36,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:36,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734561649] [2022-12-06 07:31:36,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:36,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:36,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-06 07:31:36,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:36,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734561649] [2022-12-06 07:31:36,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734561649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:36,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:36,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:36,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656088738] [2022-12-06 07:31:36,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:36,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:36,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:36,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:36,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:36,798 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:36,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:36,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:36,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:36,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:36,839 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:36,840 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:36,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:36,840 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:36,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:36,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:36,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:36,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:36,841 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:36,841 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:36,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:36,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:36,841 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:36,841 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:36,842 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:36,842 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:36,842 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:36,842 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:36,842 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:36,842 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:36,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:36,844 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:36,844 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:36,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:36,844 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:36,845 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:36,920 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:36,921 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:36,921 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:36,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:36,921 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:36,921 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:36,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1954 [2022-12-06 07:31:36,921 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-06 07:31:36,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:36,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1515718306, now seen corresponding path program 1 times [2022-12-06 07:31:36,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:36,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278492554] [2022-12-06 07:31:36,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:36,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:36,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-06 07:31:36,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:36,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278492554] [2022-12-06 07:31:36,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278492554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:36,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:36,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:36,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965789998] [2022-12-06 07:31:36,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:36,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:36,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:36,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:36,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:36,983 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:36,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:36,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:36,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:36,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:37,027 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:37,027 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:37,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:37,028 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:37,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:37,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:37,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:37,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:37,028 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:37,028 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:37,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:37,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:37,029 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:37,029 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:37,029 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:37,029 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:37,029 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:37,030 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:37,030 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:37,030 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:37,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:37,032 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:37,032 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:37,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:37,032 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:37,032 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:37,107 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:37,108 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:37,108 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:37,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:37,108 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:37,108 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:37,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1955 [2022-12-06 07:31:37,108 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-06 07:31:37,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:37,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1542500415, now seen corresponding path program 1 times [2022-12-06 07:31:37,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:37,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571420154] [2022-12-06 07:31:37,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:37,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:37,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-06 07:31:37,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:37,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571420154] [2022-12-06 07:31:37,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571420154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:37,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:37,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:37,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577403909] [2022-12-06 07:31:37,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:37,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:37,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:37,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:37,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:37,173 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:37,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:37,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:37,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:37,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:37,213 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:37,213 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:37,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:37,214 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:37,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:37,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:37,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:37,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:37,214 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:37,214 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:37,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:37,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:37,215 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:37,215 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:37,215 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:37,215 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:37,215 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:37,215 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:37,215 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:37,216 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:37,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:37,218 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:37,218 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:37,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:37,218 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:37,218 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:37,292 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:37,293 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:37,293 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:37,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:37,293 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:37,293 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:37,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1956 [2022-12-06 07:31:37,293 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-06 07:31:37,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:37,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1572976608, now seen corresponding path program 1 times [2022-12-06 07:31:37,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:37,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769202324] [2022-12-06 07:31:37,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:37,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:37,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-06 07:31:37,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:37,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769202324] [2022-12-06 07:31:37,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769202324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:37,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:37,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:37,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947733515] [2022-12-06 07:31:37,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:37,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:37,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:37,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:37,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:37,354 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:37,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:37,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:37,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:37,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:37,390 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:37,390 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:37,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:37,391 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:37,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:37,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:37,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:37,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:37,391 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:37,391 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:37,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:37,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:37,392 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:37,392 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:37,392 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:37,392 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:37,392 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:37,392 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:37,392 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:37,393 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:37,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:37,395 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:37,395 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:37,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:37,395 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:37,395 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:37,468 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:37,469 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:37,469 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:37,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:37,469 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:37,469 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:37,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1957 [2022-12-06 07:31:37,470 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-06 07:31:37,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:37,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1599758717, now seen corresponding path program 1 times [2022-12-06 07:31:37,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:37,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563597111] [2022-12-06 07:31:37,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:37,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:37,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-06 07:31:37,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:37,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563597111] [2022-12-06 07:31:37,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563597111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:37,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:37,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:37,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992745837] [2022-12-06 07:31:37,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:37,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:37,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:37,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:37,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:37,535 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:37,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:37,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:37,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:37,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:37,576 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:37,576 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:37,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:37,577 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:37,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:37,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:37,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:37,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:37,577 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:37,577 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:37,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:37,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:37,578 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:37,578 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:37,578 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:37,578 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:37,578 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:37,578 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:37,578 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:37,578 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:37,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:37,581 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:37,581 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:37,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:37,581 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:37,581 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:37,655 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:37,656 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:37,656 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:37,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:37,656 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:37,656 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:37,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1958 [2022-12-06 07:31:37,656 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-06 07:31:37,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:37,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1630234910, now seen corresponding path program 1 times [2022-12-06 07:31:37,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:37,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463979871] [2022-12-06 07:31:37,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:37,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:37,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-06 07:31:37,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:37,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463979871] [2022-12-06 07:31:37,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463979871] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:37,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:37,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:37,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151298277] [2022-12-06 07:31:37,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:37,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:37,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:37,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:37,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:37,721 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:37,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:37,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:37,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:37,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:37,763 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:37,764 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:37,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:37,764 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:37,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:37,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:37,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:37,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:37,765 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:37,765 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:37,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:37,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:37,766 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:37,766 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:37,766 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:37,766 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:37,766 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:37,766 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:37,766 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:37,766 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:37,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:37,769 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:37,769 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:37,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:37,769 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:37,769 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:37,844 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:37,845 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:37,845 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:37,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:37,845 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:37,846 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:37,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1959 [2022-12-06 07:31:37,846 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-06 07:31:37,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:37,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1657017019, now seen corresponding path program 1 times [2022-12-06 07:31:37,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:37,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805021770] [2022-12-06 07:31:37,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:37,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:37,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-06 07:31:37,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:37,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805021770] [2022-12-06 07:31:37,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805021770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:37,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:37,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:37,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659012373] [2022-12-06 07:31:37,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:37,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:37,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:37,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:37,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:37,923 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:37,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:37,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:37,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:37,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:37,959 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:37,959 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:37,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:37,959 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:37,959 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:37,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:37,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:37,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:37,960 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:37,960 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:37,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:37,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:37,960 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:37,961 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:37,961 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:37,961 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:37,961 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:37,961 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:37,961 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:37,961 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:37,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:37,963 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:37,963 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:37,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:37,964 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:37,964 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:38,038 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:38,039 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:38,039 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:38,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:38,039 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:38,039 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:38,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1960 [2022-12-06 07:31:38,039 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-06 07:31:38,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:38,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1687493212, now seen corresponding path program 1 times [2022-12-06 07:31:38,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:38,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81767757] [2022-12-06 07:31:38,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:38,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:38,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-06 07:31:38,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:38,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81767757] [2022-12-06 07:31:38,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81767757] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:38,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:38,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:38,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581172018] [2022-12-06 07:31:38,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:38,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:38,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:38,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:38,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:38,104 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:38,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:38,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:38,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:38,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:38,142 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:38,142 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:38,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:38,142 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:38,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:38,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:38,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:38,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:38,143 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:38,143 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:38,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:38,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:38,144 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:38,144 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:38,144 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:38,144 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:38,144 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:38,144 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:38,144 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:38,144 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:38,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:38,146 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:38,146 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:38,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:38,147 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:38,147 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:38,220 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:38,221 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:38,221 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:38,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:38,221 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:38,221 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:38,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1961 [2022-12-06 07:31:38,221 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-06 07:31:38,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:38,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1714275321, now seen corresponding path program 1 times [2022-12-06 07:31:38,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:38,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992368425] [2022-12-06 07:31:38,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:38,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:38,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-06 07:31:38,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:38,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992368425] [2022-12-06 07:31:38,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992368425] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:38,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:38,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:38,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362960727] [2022-12-06 07:31:38,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:38,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:38,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:38,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:38,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:38,288 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:38,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:38,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:38,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:38,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:38,324 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:38,324 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:38,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:38,325 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:38,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:38,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:38,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:38,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:38,325 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:38,325 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:38,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:38,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:38,326 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:38,326 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:38,326 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:38,326 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:38,326 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:38,327 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:38,327 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:38,327 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:38,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:38,329 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:38,329 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:38,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:38,329 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:38,329 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:38,404 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:38,405 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:38,405 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:38,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:38,405 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:38,405 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:38,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1962 [2022-12-06 07:31:38,406 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-06 07:31:38,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:38,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1744751514, now seen corresponding path program 1 times [2022-12-06 07:31:38,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:38,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073456638] [2022-12-06 07:31:38,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:38,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31: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-06 07:31:38,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:38,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073456638] [2022-12-06 07:31:38,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073456638] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:38,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:38,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:38,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70538082] [2022-12-06 07:31:38,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:38,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:38,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:38,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:38,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:38,467 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:38,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:38,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:38,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:38,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:38,504 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:38,504 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:38,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:38,504 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:38,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:38,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:38,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:38,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:38,505 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:38,505 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:38,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:38,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:38,506 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:38,506 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:38,506 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:38,506 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:38,506 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:38,506 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:38,506 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:38,506 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:38,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:38,509 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:38,509 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:38,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:38,509 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:38,509 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:38,584 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:38,585 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:38,585 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:38,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:38,585 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:38,585 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:38,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1963 [2022-12-06 07:31:38,585 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-06 07:31:38,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:38,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1771533623, now seen corresponding path program 1 times [2022-12-06 07:31:38,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:38,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772627531] [2022-12-06 07:31:38,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:38,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:38,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:38,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-06 07:31:38,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:38,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772627531] [2022-12-06 07:31:38,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772627531] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:38,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:38,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:38,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360368378] [2022-12-06 07:31:38,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:38,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:38,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:38,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:38,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:38,653 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:38,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:38,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:38,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:38,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:38,692 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:38,692 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:38,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 380 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:38,693 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:38,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:38,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:38,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:38,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:38,693 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:38,693 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:38,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:38,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:38,694 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:38,694 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:38,694 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:38,694 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:38,694 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:38,694 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:38,694 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:38,694 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:38,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:38,697 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:38,697 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:38,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:38,697 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:38,697 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:38,771 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:38,772 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:38,772 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:38,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:38,772 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:38,772 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:38,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1964 [2022-12-06 07:31:38,773 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-06 07:31:38,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:38,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1802009816, now seen corresponding path program 1 times [2022-12-06 07:31:38,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:38,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015138730] [2022-12-06 07:31:38,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:38,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:38,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-06 07:31:38,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:38,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015138730] [2022-12-06 07:31:38,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015138730] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:38,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:38,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:38,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387519052] [2022-12-06 07:31:38,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:38,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:38,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:38,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:38,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:38,835 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:38,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:38,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:38,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:38,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:38,875 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:38,875 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:38,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:38,876 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:38,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:38,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:38,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:38,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:38,876 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:38,876 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:38,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:38,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:38,877 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:38,877 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:38,877 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:38,877 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:38,877 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:38,878 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:38,878 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:38,878 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:38,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:38,880 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:38,880 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:38,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:38,880 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:38,880 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:38,954 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:38,955 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:38,955 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:38,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:38,955 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:38,955 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:38,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1965 [2022-12-06 07:31:38,955 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-06 07:31:38,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:38,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1828791925, now seen corresponding path program 1 times [2022-12-06 07:31:38,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:38,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501421143] [2022-12-06 07:31:38,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:38,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:39,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-06 07:31:39,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:39,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501421143] [2022-12-06 07:31:39,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501421143] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:39,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:39,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:39,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178268907] [2022-12-06 07:31:39,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:39,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:39,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:39,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:39,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:39,035 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:39,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:39,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:39,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:39,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:39,076 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:39,077 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:39,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:39,077 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:39,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:39,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:39,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:39,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:39,078 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:39,078 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:39,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:39,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:39,078 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:39,079 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:39,079 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:39,079 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:39,079 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:39,079 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:39,079 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:39,079 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:39,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:39,081 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:39,081 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:39,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:39,082 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:39,082 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:39,156 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:39,157 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:39,157 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:39,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:39,157 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:39,158 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:39,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1966 [2022-12-06 07:31:39,158 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-06 07:31:39,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:39,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1859268118, now seen corresponding path program 1 times [2022-12-06 07:31:39,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:39,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621257416] [2022-12-06 07:31:39,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:39,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:39,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-06 07:31:39,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:39,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621257416] [2022-12-06 07:31:39,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621257416] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:39,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:39,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:39,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493666293] [2022-12-06 07:31:39,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:39,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:39,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:39,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:39,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:39,218 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:39,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:39,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:39,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:39,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:39,255 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:39,255 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:39,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:39,256 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:39,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:39,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:39,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:39,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:39,256 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:39,256 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:39,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:39,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:39,257 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:39,257 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:39,257 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:39,257 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:39,257 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:39,257 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:39,257 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:39,258 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:39,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:39,260 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:39,260 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:39,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:39,260 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:39,260 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:39,340 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:39,341 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:31:39,341 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:39,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:39,341 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:39,341 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:39,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1967 [2022-12-06 07:31:39,341 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-06 07:31:39,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:39,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1886050227, now seen corresponding path program 1 times [2022-12-06 07:31:39,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:39,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402910352] [2022-12-06 07:31:39,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:39,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:39,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-06 07:31:39,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:39,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402910352] [2022-12-06 07:31:39,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402910352] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:39,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:39,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:39,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341323562] [2022-12-06 07:31:39,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:39,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:39,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:39,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:39,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:39,408 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:39,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:39,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:39,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:39,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:39,444 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:39,444 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:39,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:39,444 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:39,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:39,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:39,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:39,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:39,445 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:39,445 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:39,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:39,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:39,446 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:39,446 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:39,446 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:39,446 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:39,446 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:39,446 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:39,446 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:39,446 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:39,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:39,448 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:39,448 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:39,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:39,449 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:39,449 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:39,522 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:39,523 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:39,523 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:39,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:39,523 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:39,523 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:39,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1968 [2022-12-06 07:31:39,523 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-06 07:31:39,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:39,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1916526420, now seen corresponding path program 1 times [2022-12-06 07:31:39,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:39,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62095817] [2022-12-06 07:31:39,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:39,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:39,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-06 07:31:39,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:39,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62095817] [2022-12-06 07:31:39,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62095817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:39,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:39,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:39,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388363739] [2022-12-06 07:31:39,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:39,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:39,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:39,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:39,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:39,587 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:39,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:39,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:39,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:39,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:39,623 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:39,623 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:39,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:39,623 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:39,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:39,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:39,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:39,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:39,624 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:39,624 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:39,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:39,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:39,625 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:39,625 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:39,625 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:39,625 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:39,625 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:39,625 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:39,625 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:39,625 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:39,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:39,627 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:39,627 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:39,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:39,628 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:39,628 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:39,702 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:39,703 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:39,703 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:39,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:39,703 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:39,703 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:39,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1969 [2022-12-06 07:31:39,704 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-06 07:31:39,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:39,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1943308529, now seen corresponding path program 1 times [2022-12-06 07:31:39,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:39,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081491909] [2022-12-06 07:31:39,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:39,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:39,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-06 07:31:39,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:39,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081491909] [2022-12-06 07:31:39,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081491909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:39,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:39,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:39,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939711591] [2022-12-06 07:31:39,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:39,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:39,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:39,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:39,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:39,768 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:39,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:39,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:39,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:39,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:39,802 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:39,802 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:39,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:39,803 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:39,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:39,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:39,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:39,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:39,803 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:39,803 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:39,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:39,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:39,804 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:39,804 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:39,804 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:39,804 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:39,804 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:39,804 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:39,805 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:39,805 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:39,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:39,807 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:39,807 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:39,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:39,807 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:39,807 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:39,880 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:39,881 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:39,881 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:39,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:39,881 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:39,881 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:39,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1970 [2022-12-06 07:31:39,881 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-06 07:31:39,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:39,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1973784722, now seen corresponding path program 1 times [2022-12-06 07:31:39,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:39,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489846517] [2022-12-06 07:31:39,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:39,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:39,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-06 07:31:39,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:39,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489846517] [2022-12-06 07:31:39,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489846517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:39,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:39,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:39,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173308624] [2022-12-06 07:31:39,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:39,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:39,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:39,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:39,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:39,943 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:39,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:39,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:39,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:39,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:39,986 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:39,986 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:39,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:39,987 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:39,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:39,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:39,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:39,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:39,988 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:39,988 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:39,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:39,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:39,988 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:39,988 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:39,988 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:39,988 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:39,989 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:39,989 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:39,989 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:39,989 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:39,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:39,991 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:39,991 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:39,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:39,991 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:39,991 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:40,066 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:40,067 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:40,067 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:40,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:40,067 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:40,067 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:40,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1971 [2022-12-06 07:31:40,067 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-06 07:31:40,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:40,067 INFO L85 PathProgramCache]: Analyzing trace with hash 2000566831, now seen corresponding path program 1 times [2022-12-06 07:31:40,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:40,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301963711] [2022-12-06 07:31:40,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:40,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:40,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-06 07:31:40,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:40,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301963711] [2022-12-06 07:31:40,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301963711] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:40,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:40,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:40,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788826107] [2022-12-06 07:31:40,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:40,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:40,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:40,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:40,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:40,149 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:40,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:40,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:40,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:40,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:40,186 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:40,186 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:40,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:40,186 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:40,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:40,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:40,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:40,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:40,187 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:40,187 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:40,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:40,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:40,188 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:40,188 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:40,188 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:40,188 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:40,188 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:40,188 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:40,188 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:40,188 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:40,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:40,190 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:40,190 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:40,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:40,191 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:40,191 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:40,265 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:40,266 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:40,266 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:40,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:40,266 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:40,266 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:40,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1972 [2022-12-06 07:31:40,266 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-06 07:31:40,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:40,266 INFO L85 PathProgramCache]: Analyzing trace with hash 2031043024, now seen corresponding path program 1 times [2022-12-06 07:31:40,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:40,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448858313] [2022-12-06 07:31:40,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:40,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:40,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-06 07:31:40,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:40,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448858313] [2022-12-06 07:31:40,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448858313] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:40,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:40,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:40,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575678843] [2022-12-06 07:31:40,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:40,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:40,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:40,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:40,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:40,328 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:40,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:40,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:40,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:40,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:40,369 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:40,369 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:40,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:40,370 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:40,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:40,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:40,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:40,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:40,370 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:40,370 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:40,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:40,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:40,371 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:40,371 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:40,371 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:40,371 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:40,371 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:40,371 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:40,371 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:40,371 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:40,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:40,374 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:40,374 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:40,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:40,374 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:40,374 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:40,448 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:40,448 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:40,448 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:40,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:40,449 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:40,449 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:40,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1973 [2022-12-06 07:31:40,449 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-06 07:31:40,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:40,449 INFO L85 PathProgramCache]: Analyzing trace with hash 2057825133, now seen corresponding path program 1 times [2022-12-06 07:31:40,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:40,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602180392] [2022-12-06 07:31:40,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:40,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:40,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-06 07:31:40,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:40,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602180392] [2022-12-06 07:31:40,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602180392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:40,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:40,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:40,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369997078] [2022-12-06 07:31:40,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:40,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:40,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:40,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:40,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:40,513 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:40,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:40,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:40,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:40,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:40,549 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:40,549 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:40,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:40,549 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:40,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:40,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:40,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:40,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:40,550 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:40,550 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:40,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:40,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:40,551 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:40,551 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:40,551 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:40,551 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:40,551 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:40,551 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:40,551 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:40,551 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:40,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:40,553 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:40,554 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:40,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:40,554 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:40,554 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:40,628 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:40,629 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:40,629 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:40,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:40,629 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:40,629 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:40,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1974 [2022-12-06 07:31:40,629 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-06 07:31:40,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:40,629 INFO L85 PathProgramCache]: Analyzing trace with hash 2088301326, now seen corresponding path program 1 times [2022-12-06 07:31:40,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:40,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087985842] [2022-12-06 07:31:40,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:40,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:40,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-06 07:31:40,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:40,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087985842] [2022-12-06 07:31:40,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087985842] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:40,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:40,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:40,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944481090] [2022-12-06 07:31:40,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:40,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:40,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:40,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:40,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:40,692 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:40,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:40,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:40,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:40,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:40,729 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:40,729 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:40,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:40,730 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:40,730 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:40,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:40,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:40,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:40,730 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:40,730 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:40,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:40,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:40,731 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:40,731 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:40,731 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:40,731 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:40,731 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:40,731 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:40,731 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:40,731 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:40,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:40,734 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:40,734 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:40,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:40,734 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:40,734 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:40,809 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:40,810 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:40,810 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:40,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:40,810 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:40,810 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:40,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1975 [2022-12-06 07:31:40,810 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-06 07:31:40,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:40,810 INFO L85 PathProgramCache]: Analyzing trace with hash 2115083435, now seen corresponding path program 1 times [2022-12-06 07:31:40,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:40,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398739293] [2022-12-06 07:31:40,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:40,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:40,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:31:40,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:40,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398739293] [2022-12-06 07:31:40,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398739293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:40,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:40,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:40,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071688037] [2022-12-06 07:31:40,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:40,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:40,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:40,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:40,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:40,875 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:40,875 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:40,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:40,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:40,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:40,910 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:40,910 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:40,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 371 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:40,910 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:40,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:40,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:40,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:40,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:40,911 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:40,911 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:40,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:40,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:40,912 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:40,912 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:40,912 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:40,912 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:40,912 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:40,912 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:40,912 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:40,912 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:40,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:40,914 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:40,914 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:40,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:40,915 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:40,915 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:40,989 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:40,990 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:40,990 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:40,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:40,990 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:40,990 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:40,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1976 [2022-12-06 07:31:40,990 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-06 07:31:40,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:40,991 INFO L85 PathProgramCache]: Analyzing trace with hash 2145559628, now seen corresponding path program 1 times [2022-12-06 07:31:40,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:40,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463718919] [2022-12-06 07:31:40,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:40,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:41,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-06 07:31:41,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:41,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463718919] [2022-12-06 07:31:41,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463718919] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:41,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:41,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:41,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579165139] [2022-12-06 07:31:41,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:41,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:41,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:41,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:41,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:41,054 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:41,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:41,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:41,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:41,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:41,090 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:41,090 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:41,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:41,091 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:41,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:41,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:41,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:41,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:41,091 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:41,091 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:41,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:41,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:41,092 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:41,092 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:41,092 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:41,092 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:41,092 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:41,093 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:41,093 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:41,093 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:41,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:41,095 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:41,095 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:41,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:41,095 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:41,095 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:41,170 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:41,171 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:41,171 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:41,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:41,171 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:41,172 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:41,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1977 [2022-12-06 07:31:41,172 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-06 07:31:41,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:41,172 INFO L85 PathProgramCache]: Analyzing trace with hash -2122625559, now seen corresponding path program 1 times [2022-12-06 07:31:41,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:41,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539498818] [2022-12-06 07:31:41,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:41,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:41,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-06 07:31:41,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:41,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539498818] [2022-12-06 07:31:41,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539498818] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:41,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:41,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:41,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262921870] [2022-12-06 07:31:41,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:41,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:41,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:41,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:41,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:41,249 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:41,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:41,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:41,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:41,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:41,289 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:41,290 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:41,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:41,290 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:41,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:41,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:41,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:41,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:41,291 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:41,291 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:41,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:41,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:41,291 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:41,292 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:41,292 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:41,292 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:41,292 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:41,292 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:41,292 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:41,292 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:41,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:41,294 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:41,294 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:41,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:41,295 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:41,295 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:41,368 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:41,368 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:31:41,368 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:41,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:41,369 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:41,369 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:41,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1978 [2022-12-06 07:31:41,369 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-06 07:31:41,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:41,369 INFO L85 PathProgramCache]: Analyzing trace with hash -2092149366, now seen corresponding path program 1 times [2022-12-06 07:31:41,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:41,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633075370] [2022-12-06 07:31:41,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:41,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:41,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-06 07:31:41,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:41,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633075370] [2022-12-06 07:31:41,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633075370] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:41,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:41,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:41,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291352898] [2022-12-06 07:31:41,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:41,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:41,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:41,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:41,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:41,433 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:41,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:41,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:41,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:41,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:41,474 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:41,474 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:41,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:41,475 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:41,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:41,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:41,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:41,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:41,475 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:41,475 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:41,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:41,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:41,476 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:41,476 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:41,476 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:41,476 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:41,476 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:41,477 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:41,477 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:41,477 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:41,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:41,480 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:41,480 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:41,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:41,480 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:41,480 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:41,556 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:41,557 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:31:41,557 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:41,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:41,557 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:41,557 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:41,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1979 [2022-12-06 07:31:41,557 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-06 07:31:41,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:41,557 INFO L85 PathProgramCache]: Analyzing trace with hash -2065367257, now seen corresponding path program 1 times [2022-12-06 07:31:41,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:41,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862391039] [2022-12-06 07:31:41,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:41,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:41,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-06 07:31:41,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:41,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862391039] [2022-12-06 07:31:41,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862391039] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:41,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:41,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:41,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440541720] [2022-12-06 07:31:41,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:41,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:41,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:41,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:41,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:41,624 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:41,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:41,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:41,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:41,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:41,665 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:41,665 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:41,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:41,665 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:41,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:41,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:41,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:41,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:41,666 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:41,666 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:41,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:41,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:41,667 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:41,667 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:41,667 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:41,667 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:41,667 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:41,667 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:41,667 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:41,667 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:41,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:41,670 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:41,670 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:41,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:41,670 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:41,670 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:41,745 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:41,746 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:41,746 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:41,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:41,746 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:41,746 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:41,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1980 [2022-12-06 07:31:41,746 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-06 07:31:41,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:41,746 INFO L85 PathProgramCache]: Analyzing trace with hash -2034891064, now seen corresponding path program 1 times [2022-12-06 07:31:41,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:41,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365782154] [2022-12-06 07:31:41,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:41,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31: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-06 07:31:41,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:41,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365782154] [2022-12-06 07:31:41,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365782154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:41,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:41,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:41,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551127176] [2022-12-06 07:31:41,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:41,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:41,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:41,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:41,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:41,810 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:41,810 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:41,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:41,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:41,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:41,847 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:41,847 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:41,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:41,848 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:41,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:41,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:41,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:41,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:41,848 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:41,849 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:41,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:41,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:41,849 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:41,849 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:41,849 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:41,850 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:41,850 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:41,850 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:41,850 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:41,850 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:41,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:41,852 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:41,852 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:41,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:41,853 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:41,853 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:41,926 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:41,927 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:41,927 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:41,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:41,927 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:41,927 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:41,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1981 [2022-12-06 07:31:41,927 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-06 07:31:41,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:41,928 INFO L85 PathProgramCache]: Analyzing trace with hash -2008108955, now seen corresponding path program 1 times [2022-12-06 07:31:41,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:41,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989742243] [2022-12-06 07:31:41,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:41,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:41,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-06 07:31:41,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:41,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989742243] [2022-12-06 07:31:41,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989742243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:41,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:41,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:41,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526216976] [2022-12-06 07:31:41,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:41,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:41,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:41,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:41,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:41,995 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:41,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:41,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:41,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:41,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:42,037 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:42,038 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:42,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:42,038 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:42,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:42,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:42,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:42,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:42,039 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:42,039 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:42,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:42,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:42,040 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:42,040 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:42,040 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:42,040 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:42,040 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:42,040 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:42,040 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:42,040 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:42,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:42,042 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:42,042 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:42,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:42,043 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:42,043 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:42,117 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:42,118 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:42,118 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:42,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:42,118 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:42,118 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:42,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1982 [2022-12-06 07:31:42,118 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-06 07:31:42,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:42,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1977632762, now seen corresponding path program 1 times [2022-12-06 07:31:42,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:42,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557947193] [2022-12-06 07:31:42,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:42,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:42,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-06 07:31:42,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:42,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557947193] [2022-12-06 07:31:42,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557947193] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:42,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:42,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:42,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890751427] [2022-12-06 07:31:42,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:42,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:42,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:42,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:42,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:42,184 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:42,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:42,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:42,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:42,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:42,227 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:42,227 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:42,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:42,227 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:42,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:42,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:42,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:42,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:42,228 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:42,228 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:42,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:42,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:42,228 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:42,229 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:42,229 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:42,229 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:42,229 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:42,229 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:42,229 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:42,229 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:42,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:42,231 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:42,231 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:42,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:42,232 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:42,232 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:42,307 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:42,308 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:42,308 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:42,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:42,308 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:42,308 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:42,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1983 [2022-12-06 07:31:42,309 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-06 07:31:42,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:42,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1950850653, now seen corresponding path program 1 times [2022-12-06 07:31:42,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:42,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777666039] [2022-12-06 07:31:42,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:42,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:42,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-06 07:31:42,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:42,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777666039] [2022-12-06 07:31:42,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777666039] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:42,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:42,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:42,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701786610] [2022-12-06 07:31:42,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:42,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:42,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:42,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:42,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:42,387 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:42,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:42,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:42,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:42,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:42,424 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:42,424 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:42,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:42,424 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:42,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:42,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:42,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:42,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:42,425 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:42,425 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:42,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:42,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:42,425 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:42,426 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:42,426 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:42,426 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:42,426 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:42,426 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:42,426 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:42,426 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:42,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:42,428 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:42,428 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:42,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:42,429 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:42,429 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:42,502 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:42,503 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:42,503 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:42,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:42,503 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:42,503 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:42,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1984 [2022-12-06 07:31:42,503 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-06 07:31:42,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:42,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1920374460, now seen corresponding path program 1 times [2022-12-06 07:31:42,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:42,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237900685] [2022-12-06 07:31:42,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:42,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:42,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-06 07:31:42,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:42,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237900685] [2022-12-06 07:31:42,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237900685] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:42,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:42,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:42,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864779450] [2022-12-06 07:31:42,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:42,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:42,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:42,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:42,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:42,569 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:42,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:42,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:42,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:42,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:42,612 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:42,613 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:42,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:42,613 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:42,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:42,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:42,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:42,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:42,614 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:42,614 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:42,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:42,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:42,615 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:42,615 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:42,615 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:42,615 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:42,615 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:42,615 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:42,615 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:42,615 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:42,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:42,617 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:42,617 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:42,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:42,618 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:42,618 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:42,693 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:42,694 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:42,694 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:42,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:42,694 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:42,694 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:42,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1985 [2022-12-06 07:31:42,694 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-06 07:31:42,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:42,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1893592351, now seen corresponding path program 1 times [2022-12-06 07:31:42,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:42,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630673410] [2022-12-06 07:31:42,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:42,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31: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-06 07:31:42,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:42,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630673410] [2022-12-06 07:31:42,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630673410] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:42,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:42,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:42,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871748] [2022-12-06 07:31:42,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:42,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:42,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:42,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:42,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:42,761 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:42,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:42,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:42,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:42,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:42,801 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:42,802 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:42,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:42,802 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:42,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:42,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:42,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:42,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:42,803 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:42,803 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:42,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:42,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:42,803 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:42,804 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:42,804 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:42,804 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:42,804 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:42,804 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:42,804 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:42,804 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:42,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:42,806 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:42,806 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:42,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:42,806 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:42,807 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:42,897 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:42,898 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 07:31:42,898 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:42,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:42,898 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:42,898 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:42,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1986 [2022-12-06 07:31:42,898 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-06 07:31:42,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:42,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1863116158, now seen corresponding path program 1 times [2022-12-06 07:31:42,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:42,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759818434] [2022-12-06 07:31:42,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:42,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:42,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-06 07:31:42,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:42,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759818434] [2022-12-06 07:31:42,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759818434] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:42,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:42,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:42,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381940792] [2022-12-06 07:31:42,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:42,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:42,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:42,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:42,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:42,961 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:42,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:42,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:42,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:42,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:42,998 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:42,998 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:42,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:42,998 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:42,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:42,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:42,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:42,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:42,999 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:42,999 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:42,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:42,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:43,000 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:43,000 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:43,000 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:43,000 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:43,000 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:43,000 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:43,000 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:43,000 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:43,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:43,002 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:43,002 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:43,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:43,003 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:43,003 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:43,076 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:43,077 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:43,077 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:43,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:43,077 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:43,077 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:43,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1987 [2022-12-06 07:31:43,077 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-06 07:31:43,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:43,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1836334049, now seen corresponding path program 1 times [2022-12-06 07:31:43,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:43,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876674614] [2022-12-06 07:31:43,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:43,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:43,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-06 07:31:43,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:43,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876674614] [2022-12-06 07:31:43,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876674614] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:43,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:43,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:43,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915911242] [2022-12-06 07:31:43,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:43,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:43,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:43,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:43,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:43,140 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:43,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:43,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:43,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:43,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:43,177 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:43,177 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:43,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:43,178 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:43,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:43,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:43,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:43,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:43,178 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:43,179 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:43,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:43,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:43,179 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:43,179 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:43,179 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:43,180 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:43,180 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:43,180 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:43,180 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:43,180 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:43,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:43,182 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:43,182 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:43,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:43,182 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:43,182 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:43,258 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:43,259 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:43,259 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:43,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:43,259 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:43,259 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:43,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1988 [2022-12-06 07:31:43,259 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-06 07:31:43,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:43,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1805857856, now seen corresponding path program 1 times [2022-12-06 07:31:43,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:43,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916260301] [2022-12-06 07:31:43,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:43,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:43,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-06 07:31:43,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:43,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916260301] [2022-12-06 07:31:43,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916260301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:43,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:43,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:43,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293908998] [2022-12-06 07:31:43,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:43,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:43,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:43,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:43,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:43,322 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:43,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:43,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:43,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:43,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:43,365 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:43,365 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:43,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:43,365 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:43,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:43,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:43,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:43,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:43,366 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:43,366 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:43,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:43,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:43,367 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:43,367 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:43,367 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:43,367 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:43,367 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:43,367 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:43,367 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:43,367 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:43,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:43,369 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:43,370 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:43,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:43,370 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:43,370 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:43,443 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:43,444 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:43,444 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:43,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:43,444 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:43,444 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:43,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1989 [2022-12-06 07:31:43,444 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-06 07:31:43,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:43,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1779075747, now seen corresponding path program 1 times [2022-12-06 07:31:43,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:43,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367021909] [2022-12-06 07:31:43,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:43,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:43,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:31:43,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:43,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367021909] [2022-12-06 07:31:43,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367021909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:43,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:43,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:43,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613989975] [2022-12-06 07:31:43,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:43,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:43,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:43,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:43,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:43,524 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:43,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:43,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:43,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:43,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:43,561 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:43,562 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:43,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:43,562 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:43,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:43,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:43,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:43,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:43,563 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:43,563 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:43,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:43,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:43,563 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:43,563 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:43,564 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:43,564 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:43,564 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:43,564 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:43,564 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:43,564 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:43,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:43,566 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:43,566 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:43,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:43,567 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:43,567 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:43,642 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:43,643 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:43,643 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:43,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:43,643 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:43,643 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:43,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1990 [2022-12-06 07:31:43,643 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-06 07:31:43,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:43,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1748599554, now seen corresponding path program 1 times [2022-12-06 07:31:43,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:43,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010897135] [2022-12-06 07:31:43,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:43,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:43,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-06 07:31:43,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:43,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010897135] [2022-12-06 07:31:43,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010897135] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:43,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:43,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:43,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308868987] [2022-12-06 07:31:43,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:43,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:43,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:43,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:43,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:43,710 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:43,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:43,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:43,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:43,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:43,747 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:43,747 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:43,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:43,748 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:43,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:43,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:43,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:43,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:43,748 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:43,748 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:43,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:43,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:43,749 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:43,749 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:43,749 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:43,749 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:43,749 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:43,749 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:43,750 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:43,750 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:43,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:43,752 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:43,752 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:43,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:43,752 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:43,752 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:43,828 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:43,829 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:31:43,829 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:43,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:43,829 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:43,829 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:43,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1991 [2022-12-06 07:31:43,830 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-06 07:31:43,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:43,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1721817445, now seen corresponding path program 1 times [2022-12-06 07:31:43,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:43,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018275298] [2022-12-06 07:31:43,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:43,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:43,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-06 07:31:43,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:43,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018275298] [2022-12-06 07:31:43,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018275298] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:43,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:43,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:43,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801203723] [2022-12-06 07:31:43,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:43,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:43,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:43,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:43,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:43,896 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:43,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:43,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:43,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:43,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:43,932 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:43,933 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:43,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:43,933 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:43,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:43,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:43,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:43,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:43,934 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:43,934 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:43,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:43,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:43,934 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:43,934 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:43,935 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:43,935 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:43,935 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:43,935 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:43,935 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:43,935 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:43,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:43,937 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:43,937 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:43,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:43,937 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:43,937 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:44,012 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:44,013 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:44,013 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:44,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:44,013 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:44,013 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:44,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1992 [2022-12-06 07:31:44,014 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-06 07:31:44,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:44,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1691341252, now seen corresponding path program 1 times [2022-12-06 07:31:44,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:44,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918607684] [2022-12-06 07:31:44,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:44,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:44,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:44,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-06 07:31:44,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:44,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918607684] [2022-12-06 07:31:44,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918607684] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:44,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:44,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:44,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497886652] [2022-12-06 07:31:44,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:44,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:44,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:44,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:44,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:44,075 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:44,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:44,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:44,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:44,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:44,117 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:44,117 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:44,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:44,118 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:44,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:44,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:44,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:44,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:44,118 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:44,118 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:44,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:44,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:44,119 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:44,119 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:44,119 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:44,119 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:44,119 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:44,120 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:44,120 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:44,120 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:44,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:44,122 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:44,122 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:44,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:44,122 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:44,122 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:44,198 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:44,199 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:31:44,199 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:44,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:44,199 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:44,199 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:44,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1993 [2022-12-06 07:31:44,199 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-06 07:31:44,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:44,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1664559143, now seen corresponding path program 1 times [2022-12-06 07:31:44,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:44,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901037049] [2022-12-06 07:31:44,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:44,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:44,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-06 07:31:44,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:44,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901037049] [2022-12-06 07:31:44,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901037049] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:44,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:44,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:44,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783070397] [2022-12-06 07:31:44,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:44,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:44,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:44,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:44,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:44,265 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:44,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:44,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:44,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:44,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:44,306 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:44,307 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:44,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:44,307 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:44,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:44,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:44,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:44,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:44,308 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:44,308 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:44,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:44,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:44,308 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:44,308 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:44,309 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:44,309 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:44,309 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:44,309 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:44,309 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:44,309 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:44,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:44,311 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:44,311 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:44,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:44,312 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:44,312 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:44,387 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:44,388 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:44,388 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:44,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:44,388 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:44,388 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:44,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1994 [2022-12-06 07:31:44,388 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-06 07:31:44,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:44,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1634082950, now seen corresponding path program 1 times [2022-12-06 07:31:44,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:44,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709303895] [2022-12-06 07:31:44,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:44,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:44,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:31:44,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:44,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709303895] [2022-12-06 07:31:44,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709303895] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:44,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:44,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:44,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332683238] [2022-12-06 07:31:44,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:44,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:44,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:44,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:44,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:44,455 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:44,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:44,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:44,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:44,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:44,493 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:44,493 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:44,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:44,493 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:44,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:44,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:44,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:44,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:44,494 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:44,494 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:44,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:44,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:44,495 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:44,495 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:44,495 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:44,495 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:44,495 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:44,495 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:44,495 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:44,495 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:44,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:44,497 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:44,498 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:44,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:44,498 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:44,498 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:44,574 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:44,575 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:31:44,575 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:44,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:44,575 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:44,575 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:44,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1995 [2022-12-06 07:31:44,575 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-06 07:31:44,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:44,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1607300841, now seen corresponding path program 1 times [2022-12-06 07:31:44,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:44,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832388273] [2022-12-06 07:31:44,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:44,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:44,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:44,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-06 07:31:44,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:44,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832388273] [2022-12-06 07:31:44,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832388273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:44,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:44,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:44,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743806805] [2022-12-06 07:31:44,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:44,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:44,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:44,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:44,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:44,657 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:44,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:44,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:44,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:44,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:44,699 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:44,699 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:44,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 370 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:44,700 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:44,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:44,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:44,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:44,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:44,700 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:44,700 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:44,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:44,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:44,701 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:44,701 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:44,701 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:44,701 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:44,701 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:44,701 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:44,702 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:44,702 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:44,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:44,704 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:44,704 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:44,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:44,704 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:44,704 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:44,778 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:44,779 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:44,779 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:44,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:44,779 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:44,779 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:44,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1996 [2022-12-06 07:31:44,779 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-06 07:31:44,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:44,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1576824648, now seen corresponding path program 1 times [2022-12-06 07:31:44,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:44,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254484278] [2022-12-06 07:31:44,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:44,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:44,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-06 07:31:44,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:44,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254484278] [2022-12-06 07:31:44,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254484278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:44,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:44,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:44,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049120458] [2022-12-06 07:31:44,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:44,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:44,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:44,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:44,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:44,845 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:44,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:44,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:44,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:44,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:44,881 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:44,882 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:44,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:44,882 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:44,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:44,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:44,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:44,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:44,883 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:44,883 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:44,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:44,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:44,883 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:44,883 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:44,883 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:44,883 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:44,884 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:44,884 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:44,884 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:44,884 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:44,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:44,886 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:44,886 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:44,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:44,886 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:44,886 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:44,962 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:44,962 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:44,963 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:44,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:44,963 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:44,963 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:44,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1997 [2022-12-06 07:31:44,963 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-06 07:31:44,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:44,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1550042539, now seen corresponding path program 1 times [2022-12-06 07:31:44,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:44,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758046267] [2022-12-06 07:31:44,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:44,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:45,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:31:45,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:45,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758046267] [2022-12-06 07:31:45,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758046267] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:45,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:45,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:45,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481804019] [2022-12-06 07:31:45,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:45,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:45,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:45,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:45,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:45,029 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:45,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:45,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:45,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:45,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:45,065 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:45,065 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:45,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:45,065 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:45,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:45,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:45,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:45,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:45,066 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:45,066 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:45,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:45,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:45,067 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:45,067 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:45,067 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:45,067 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:45,067 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:45,067 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:45,067 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:45,067 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:45,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:45,070 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:45,070 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:45,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:45,070 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:45,070 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:45,144 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:45,145 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:45,145 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:45,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:45,145 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:45,145 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:45,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1998 [2022-12-06 07:31:45,146 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-06 07:31:45,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:45,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1519566346, now seen corresponding path program 1 times [2022-12-06 07:31:45,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:45,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109422602] [2022-12-06 07:31:45,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:45,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:45,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:31:45,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:45,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109422602] [2022-12-06 07:31:45,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109422602] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:45,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:45,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:45,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776302655] [2022-12-06 07:31:45,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:45,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:45,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:45,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:45,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:45,208 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:45,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:45,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:45,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:45,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:45,245 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:45,245 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:45,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:45,245 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:45,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:45,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:45,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:45,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:45,246 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:45,246 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:45,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:45,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:45,247 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:45,247 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:45,247 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:45,247 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:45,247 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:45,247 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:45,247 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:45,247 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:45,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:45,249 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:45,250 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:45,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:45,250 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:45,250 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:45,325 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:45,325 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:45,326 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:45,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:45,326 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:45,326 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:45,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1999 [2022-12-06 07:31:45,326 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-06 07:31:45,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:45,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1492784237, now seen corresponding path program 1 times [2022-12-06 07:31:45,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:45,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896901083] [2022-12-06 07:31:45,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:45,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:45,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-06 07:31:45,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:45,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896901083] [2022-12-06 07:31:45,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896901083] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:45,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:45,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:45,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918692311] [2022-12-06 07:31:45,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:45,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:45,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:45,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:45,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:45,393 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:45,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:45,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:45,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:45,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:45,433 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:45,433 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:45,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:45,434 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:45,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:45,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:45,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:45,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:45,434 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:45,434 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:45,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:45,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:45,435 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:45,435 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:45,435 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:45,435 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:45,435 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:45,435 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:45,436 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:45,436 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:45,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:45,438 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:45,438 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:45,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:45,438 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:45,438 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:45,513 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:45,514 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:45,514 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:45,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:45,514 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:45,514 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:45,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2000 [2022-12-06 07:31:45,514 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-06 07:31:45,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:45,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1462308044, now seen corresponding path program 1 times [2022-12-06 07:31:45,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:45,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376980690] [2022-12-06 07:31:45,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:45,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:45,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-06 07:31:45,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:45,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376980690] [2022-12-06 07:31:45,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376980690] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:45,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:45,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:45,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805404951] [2022-12-06 07:31:45,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:45,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:45,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:45,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:45,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:45,578 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:45,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:45,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:45,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:45,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:45,619 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:45,620 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:45,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:45,620 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:45,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:45,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:45,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:45,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:45,621 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:45,621 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:45,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:45,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:45,621 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:45,621 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:45,621 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:45,622 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:45,622 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:45,622 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:45,622 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:45,622 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:45,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:45,624 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:45,624 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:45,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 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 116. Up to 16 conditions per place. [2022-12-06 07:31:45,624 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:45,624 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:45,700 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:45,701 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:45,701 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:45,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:45,701 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:45,701 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:45,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2001 [2022-12-06 07:31:45,701 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-06 07:31:45,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:45,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1435525935, now seen corresponding path program 1 times [2022-12-06 07:31:45,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:45,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021873819] [2022-12-06 07:31:45,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:45,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:45,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:31:45,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:45,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021873819] [2022-12-06 07:31:45,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021873819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:45,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:45,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:45,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471045326] [2022-12-06 07:31:45,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:45,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:45,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:45,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:45,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:45,775 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:45,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:45,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:45,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:45,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:45,816 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:45,816 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:45,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:45,817 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:45,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:45,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:45,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:45,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:45,817 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:45,817 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:45,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:45,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:45,818 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:45,818 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:45,818 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:45,818 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:45,818 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:45,819 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:45,819 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:45,819 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:45,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:45,821 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:45,821 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:45,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:45,821 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:45,821 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:45,895 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:45,895 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:45,896 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:45,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:45,896 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:45,896 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:45,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2002 [2022-12-06 07:31:45,896 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-06 07:31:45,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:45,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1405049742, now seen corresponding path program 1 times [2022-12-06 07:31:45,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:45,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884560632] [2022-12-06 07:31:45,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:45,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:45,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-06 07:31:45,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:45,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884560632] [2022-12-06 07:31:45,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884560632] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:45,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:45,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:45,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124144214] [2022-12-06 07:31:45,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:45,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:45,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:45,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:45,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:45,960 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:45,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:45,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:45,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:45,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:46,002 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:46,002 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:46,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:46,003 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:46,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:46,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:46,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:46,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:46,003 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:46,003 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:46,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:46,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:46,004 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:46,004 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:46,004 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:46,004 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:46,004 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:46,005 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:46,005 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:46,005 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:46,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:46,007 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:46,007 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:46,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:46,007 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:46,007 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:46,081 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:46,082 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:46,082 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:46,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:46,082 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:46,082 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:46,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2003 [2022-12-06 07:31:46,082 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-06 07:31:46,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:46,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1378267633, now seen corresponding path program 1 times [2022-12-06 07:31:46,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:46,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180874858] [2022-12-06 07:31:46,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:46,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:46,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:46,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-06 07:31:46,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:46,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180874858] [2022-12-06 07:31:46,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180874858] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:46,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:46,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:46,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245280788] [2022-12-06 07:31:46,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:46,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:46,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:46,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:46,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:46,147 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:46,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:46,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:46,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:46,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:46,184 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:46,184 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:46,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:46,184 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:46,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:46,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:46,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:46,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:46,185 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:46,185 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:46,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:46,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:46,186 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:46,186 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:46,186 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:46,186 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:46,186 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:46,186 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:46,186 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:46,186 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:46,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:46,188 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:46,188 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:46,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:46,189 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:46,189 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:46,264 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:46,265 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:46,265 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:46,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:46,265 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:46,265 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:46,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2004 [2022-12-06 07:31:46,266 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-06 07:31:46,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:46,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1347791440, now seen corresponding path program 1 times [2022-12-06 07:31:46,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:46,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100317282] [2022-12-06 07:31:46,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:46,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:46,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-06 07:31:46,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:46,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100317282] [2022-12-06 07:31:46,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100317282] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:46,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:46,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:46,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889995942] [2022-12-06 07:31:46,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:46,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:46,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:46,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:46,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:46,327 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:46,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:46,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:46,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:46,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:46,362 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:46,362 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:46,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:46,363 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:46,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:46,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:46,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:46,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:46,363 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:46,363 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:46,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:46,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:46,364 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:46,364 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:46,364 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:46,364 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:46,364 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:46,365 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:46,365 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:46,365 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:46,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:46,367 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:46,367 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:46,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:46,367 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:46,367 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:46,442 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:46,443 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:46,443 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:46,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:46,443 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:46,443 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:46,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2005 [2022-12-06 07:31:46,443 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-06 07:31:46,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:46,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1321009331, now seen corresponding path program 1 times [2022-12-06 07:31:46,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:46,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720336816] [2022-12-06 07:31:46,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:46,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:46,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-06 07:31:46,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:46,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720336816] [2022-12-06 07:31:46,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720336816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:46,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:46,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:46,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190863603] [2022-12-06 07:31:46,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:46,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:46,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:46,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:46,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:46,509 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:46,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:46,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:46,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:46,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:46,545 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:46,545 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:46,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:46,546 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:46,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:46,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:46,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:46,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:46,546 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:46,547 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:46,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:46,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:46,547 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:46,547 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:46,547 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:46,548 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:46,548 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:46,548 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:46,548 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:46,548 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:46,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:46,550 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:46,550 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:46,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:46,550 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:46,550 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:46,626 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:46,627 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:46,627 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:46,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:46,627 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:46,627 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:46,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2006 [2022-12-06 07:31:46,627 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-06 07:31:46,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:46,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1290533138, now seen corresponding path program 1 times [2022-12-06 07:31:46,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:46,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900033389] [2022-12-06 07:31:46,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:46,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:46,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:46,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:31:46,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:46,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900033389] [2022-12-06 07:31:46,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900033389] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:46,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:46,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:46,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618865230] [2022-12-06 07:31:46,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:46,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:46,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:46,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:46,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:46,691 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:46,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:46,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:46,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:46,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:46,733 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:46,733 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:46,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:46,734 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:46,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:46,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:46,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:46,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:46,734 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:46,734 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:46,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:46,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:46,735 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:46,735 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:46,735 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:46,735 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:46,735 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:46,735 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:46,735 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:46,736 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:46,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:46,738 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:46,738 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:46,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:46,738 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:46,738 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:46,832 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:46,832 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 07:31:46,833 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:46,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:46,833 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:46,833 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:46,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2007 [2022-12-06 07:31:46,833 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-06 07:31:46,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:46,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1263751029, now seen corresponding path program 1 times [2022-12-06 07:31:46,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:46,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642424687] [2022-12-06 07:31:46,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:46,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:46,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-06 07:31:46,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:46,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642424687] [2022-12-06 07:31:46,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642424687] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:46,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:46,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:46,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508881480] [2022-12-06 07:31:46,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:46,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:46,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:46,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:46,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:46,910 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:46,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:46,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:46,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:46,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:46,947 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:46,947 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:46,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:46,947 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:46,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:46,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:46,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:46,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:46,948 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:46,948 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:46,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:46,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:46,949 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:46,949 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:46,949 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:46,949 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:46,949 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:46,949 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:46,949 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:46,949 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:46,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:46,952 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:46,952 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:46,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:46,952 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:46,952 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:47,025 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:47,026 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:47,026 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:47,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:47,026 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:47,026 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:47,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2008 [2022-12-06 07:31:47,027 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-06 07:31:47,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:47,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1233274836, now seen corresponding path program 1 times [2022-12-06 07:31:47,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:47,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761898771] [2022-12-06 07:31:47,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:47,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:47,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-06 07:31:47,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:47,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761898771] [2022-12-06 07:31:47,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761898771] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:47,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:47,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:47,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745652196] [2022-12-06 07:31:47,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:47,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:47,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:47,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:47,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:47,089 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:47,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:47,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:47,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:47,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:47,132 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:47,132 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:47,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:47,132 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:47,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:47,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:47,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:47,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:47,133 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:47,133 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:47,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:47,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:47,134 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:47,134 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:47,134 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:47,134 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:47,134 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:47,134 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:47,134 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:47,134 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:47,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:47,136 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:47,136 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:47,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:47,137 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:47,137 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:47,217 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:47,218 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:31:47,218 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:47,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:47,218 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:47,218 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:47,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2009 [2022-12-06 07:31:47,218 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-06 07:31:47,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:47,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1206492727, now seen corresponding path program 1 times [2022-12-06 07:31:47,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:47,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349275491] [2022-12-06 07:31:47,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:47,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:47,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:47,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-06 07:31:47,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:47,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349275491] [2022-12-06 07:31:47,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349275491] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:47,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:47,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:47,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943814283] [2022-12-06 07:31:47,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:47,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:47,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:47,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:47,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:47,282 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:47,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:47,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:47,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:47,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:47,323 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:47,324 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:47,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:47,324 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:47,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:47,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:47,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:47,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:47,325 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:47,325 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:47,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:47,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:47,325 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:47,326 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:47,326 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:47,326 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:47,326 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:47,326 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:47,326 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:47,326 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:47,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:47,328 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:47,328 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:47,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:47,329 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:47,329 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:47,403 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:47,404 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:47,404 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:47,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:47,404 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:47,404 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:47,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2010 [2022-12-06 07:31:47,404 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-06 07:31:47,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:47,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1176016534, now seen corresponding path program 1 times [2022-12-06 07:31:47,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:47,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810963603] [2022-12-06 07:31:47,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:47,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:47,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-06 07:31:47,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:47,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810963603] [2022-12-06 07:31:47,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810963603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:47,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:47,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:47,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960266468] [2022-12-06 07:31:47,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:47,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:47,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:47,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:47,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:47,468 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:47,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:47,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:47,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:47,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:47,510 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:47,510 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:47,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:47,510 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:47,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:47,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:47,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:47,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:47,511 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:47,511 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:47,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:47,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:47,512 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:47,512 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:47,512 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:47,512 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:47,512 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:47,512 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:47,512 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:47,512 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:47,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:47,515 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:47,515 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:47,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:47,515 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:47,515 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:47,590 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:47,591 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:47,591 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:47,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:47,591 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:47,591 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:47,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2011 [2022-12-06 07:31:47,591 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-06 07:31:47,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:47,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1149234425, now seen corresponding path program 1 times [2022-12-06 07:31:47,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:47,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865952502] [2022-12-06 07:31:47,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:47,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:47,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-06 07:31:47,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:47,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865952502] [2022-12-06 07:31:47,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865952502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:47,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:47,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:47,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605857779] [2022-12-06 07:31:47,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:47,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:47,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:47,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:47,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:47,657 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:47,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:47,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:47,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:47,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:47,694 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:47,694 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:47,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:47,695 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:47,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:47,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:47,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:47,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:47,695 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:47,695 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:47,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:47,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:47,696 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:47,696 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:47,696 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:47,696 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:47,696 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:47,696 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:47,696 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:47,697 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:47,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:47,699 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:47,699 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:47,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:47,699 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:47,699 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:47,774 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:47,775 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:47,775 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:47,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:47,775 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:47,775 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:47,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2012 [2022-12-06 07:31:47,775 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-06 07:31:47,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:47,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1118758232, now seen corresponding path program 1 times [2022-12-06 07:31:47,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:47,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111783482] [2022-12-06 07:31:47,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:47,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:47,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-06 07:31:47,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:47,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111783482] [2022-12-06 07:31:47,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111783482] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:47,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:47,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:47,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905817366] [2022-12-06 07:31:47,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:47,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:47,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:47,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:47,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:47,841 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:47,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:47,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:47,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:47,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:47,878 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:47,878 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:47,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:47,878 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:47,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:47,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:47,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:47,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:47,879 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:47,879 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:47,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:47,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:47,880 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:47,880 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:47,880 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:47,880 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:47,880 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:47,880 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:47,880 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:47,880 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:47,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:47,882 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:47,883 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:47,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:47,883 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:47,883 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:47,958 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:47,959 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:47,959 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:47,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:47,959 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:47,959 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:47,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2013 [2022-12-06 07:31:47,959 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-06 07:31:47,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:47,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1091976123, now seen corresponding path program 1 times [2022-12-06 07:31:47,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:47,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836621758] [2022-12-06 07:31:47,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:47,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:48,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-06 07:31:48,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:48,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836621758] [2022-12-06 07:31:48,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836621758] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:48,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:48,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:48,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314137463] [2022-12-06 07:31:48,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:48,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:48,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:48,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:48,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:48,033 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:48,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:48,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:48,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:48,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:48,068 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:48,068 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:48,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:48,069 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:48,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:48,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:48,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:48,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:48,069 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:48,069 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:48,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:48,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:48,070 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:48,070 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:48,070 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:48,070 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:48,070 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:48,070 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:48,070 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:48,070 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:48,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:48,073 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:48,073 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:48,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:48,073 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:48,073 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:48,149 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:48,150 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:31:48,150 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:48,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:48,150 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:48,150 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:48,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2014 [2022-12-06 07:31:48,150 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-06 07:31:48,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:48,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1061499930, now seen corresponding path program 1 times [2022-12-06 07:31:48,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:48,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234106091] [2022-12-06 07:31:48,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:48,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:48,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-06 07:31:48,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:48,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234106091] [2022-12-06 07:31:48,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234106091] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:48,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:48,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:48,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503080852] [2022-12-06 07:31:48,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:48,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:48,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:48,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:48,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:48,212 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:48,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:48,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:48,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:48,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:48,254 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:48,254 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:48,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:48,254 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:48,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:48,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:48,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:48,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:48,255 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:48,255 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:48,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:48,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:48,256 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:48,256 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:48,256 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:48,256 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:48,256 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:48,256 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:48,256 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:48,256 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:48,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:48,258 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:48,258 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:48,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:48,259 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:48,259 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:48,332 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:48,332 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:31:48,332 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:48,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:48,333 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:48,333 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:48,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2015 [2022-12-06 07:31:48,333 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-06 07:31:48,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:48,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1034717821, now seen corresponding path program 1 times [2022-12-06 07:31:48,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:48,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032858092] [2022-12-06 07:31:48,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:48,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:48,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-06 07:31:48,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:48,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032858092] [2022-12-06 07:31:48,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032858092] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:48,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:48,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:48,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81876089] [2022-12-06 07:31:48,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:48,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:48,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:48,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:48,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:48,397 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:48,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:48,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:48,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:48,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:48,433 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:48,433 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:48,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:48,434 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:48,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:48,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:48,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:48,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:48,434 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:48,434 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:48,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:48,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:48,435 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:48,435 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:48,435 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:48,435 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:48,435 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:48,435 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:48,435 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:48,435 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:48,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:48,438 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:48,438 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:48,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:48,438 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:48,438 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:48,512 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:48,513 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:48,513 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:48,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:48,513 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:48,513 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:48,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2016 [2022-12-06 07:31:48,513 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-06 07:31:48,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:48,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1004241628, now seen corresponding path program 1 times [2022-12-06 07:31:48,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:48,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488673149] [2022-12-06 07:31:48,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:48,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:48,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-06 07:31:48,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:48,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488673149] [2022-12-06 07:31:48,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488673149] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:48,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:48,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:48,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525133960] [2022-12-06 07:31:48,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:48,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:48,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:48,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:48,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:48,575 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:48,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:48,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:48,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:48,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:48,612 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:48,612 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:48,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:48,613 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:48,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:48,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:48,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:48,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:48,613 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:48,613 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:48,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:48,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:48,614 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:48,614 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:48,614 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:48,614 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:48,614 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:48,614 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:48,615 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:48,615 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:48,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:48,617 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:48,617 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:48,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:48,617 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:48,617 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:48,692 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:48,693 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:48,693 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:48,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:48,693 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:48,693 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:48,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2017 [2022-12-06 07:31:48,694 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-06 07:31:48,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:48,694 INFO L85 PathProgramCache]: Analyzing trace with hash -977459519, now seen corresponding path program 1 times [2022-12-06 07:31:48,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:48,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936909292] [2022-12-06 07:31:48,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:48,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:48,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-06 07:31:48,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:48,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936909292] [2022-12-06 07:31:48,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936909292] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:48,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:48,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:48,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606926747] [2022-12-06 07:31:48,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:48,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:48,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:48,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:48,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:48,763 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:48,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:48,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:48,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:48,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:48,804 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:48,804 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:48,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:48,805 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:48,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:48,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:48,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:48,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:48,805 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:48,806 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:48,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:48,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:48,806 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:48,806 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:48,806 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:48,806 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:48,807 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:48,807 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:48,807 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:48,807 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:48,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:48,809 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:48,809 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:48,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:48,809 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:48,809 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:48,883 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:48,884 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:48,884 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:48,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:48,884 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:48,884 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:48,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2018 [2022-12-06 07:31:48,884 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-06 07:31:48,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:48,884 INFO L85 PathProgramCache]: Analyzing trace with hash -946983326, now seen corresponding path program 1 times [2022-12-06 07:31:48,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:48,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636268284] [2022-12-06 07:31:48,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:48,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:48,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-06 07:31:48,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:48,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636268284] [2022-12-06 07:31:48,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636268284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:48,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:48,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:48,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047009435] [2022-12-06 07:31:48,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:48,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:48,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:48,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:48,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:48,948 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:48,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:48,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:48,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:48,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:48,985 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:48,985 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:48,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:48,985 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:48,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:48,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:48,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:48,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:48,986 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:48,986 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:48,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:48,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:48,986 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:48,987 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:48,987 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:48,987 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:48,987 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:48,987 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:48,987 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:48,987 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:48,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:48,989 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:48,989 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:48,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:48,990 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:48,990 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:49,064 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:49,065 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:49,065 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:49,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:49,065 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:49,065 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:49,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2019 [2022-12-06 07:31:49,065 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-06 07:31:49,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:49,065 INFO L85 PathProgramCache]: Analyzing trace with hash -920201217, now seen corresponding path program 1 times [2022-12-06 07:31:49,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:49,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019486827] [2022-12-06 07:31:49,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:49,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:49,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-06 07:31:49,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:49,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019486827] [2022-12-06 07:31:49,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019486827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:49,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:49,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:49,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518244462] [2022-12-06 07:31:49,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:49,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:49,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:49,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:49,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:49,140 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:49,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:49,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:49,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:49,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:49,176 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:49,176 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:49,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:49,177 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:49,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:49,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:49,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:49,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:49,177 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:49,177 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:49,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:49,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:49,178 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:49,178 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:49,178 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:49,178 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:49,178 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:49,178 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:49,178 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:49,179 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:49,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:49,181 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:49,181 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:49,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:49,181 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:49,181 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:49,256 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:49,257 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:49,257 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:49,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:49,257 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:49,257 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:49,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2020 [2022-12-06 07:31:49,257 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-06 07:31:49,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:49,257 INFO L85 PathProgramCache]: Analyzing trace with hash -889725024, now seen corresponding path program 1 times [2022-12-06 07:31:49,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:49,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546214734] [2022-12-06 07:31:49,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:49,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:49,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-06 07:31:49,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:49,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546214734] [2022-12-06 07:31:49,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546214734] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:49,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:49,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:49,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572956512] [2022-12-06 07:31:49,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:49,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:49,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:49,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:49,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:49,321 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:49,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:49,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:49,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:49,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:49,364 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:49,364 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:49,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:49,365 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:49,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:49,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:49,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:49,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:49,365 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:49,365 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:49,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:49,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:49,366 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:49,366 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:49,366 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:49,366 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:49,366 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:49,366 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:49,366 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:49,366 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:49,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:49,369 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:49,369 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:49,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:49,369 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:49,369 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:49,443 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:49,444 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:49,444 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:49,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:49,444 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:49,444 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:49,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2021 [2022-12-06 07:31:49,444 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-06 07:31:49,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:49,445 INFO L85 PathProgramCache]: Analyzing trace with hash -862942915, now seen corresponding path program 1 times [2022-12-06 07:31:49,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:49,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718735020] [2022-12-06 07:31:49,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:49,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:49,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-06 07:31:49,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:49,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718735020] [2022-12-06 07:31:49,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718735020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:49,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:49,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:49,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985291054] [2022-12-06 07:31:49,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:49,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:49,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:49,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:49,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:49,513 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:49,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:49,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:49,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:49,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:49,554 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:49,554 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:49,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:49,554 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:49,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:49,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:49,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:49,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:49,555 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:49,555 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:49,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:49,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:49,555 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:49,556 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:49,556 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:49,556 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:49,556 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:49,556 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:49,556 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:49,556 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:49,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:49,558 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:49,558 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:49,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:49,559 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:49,559 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:49,637 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:49,638 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:31:49,638 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:49,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:49,638 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:49,638 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:49,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2022 [2022-12-06 07:31:49,638 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-06 07:31:49,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:49,638 INFO L85 PathProgramCache]: Analyzing trace with hash -832466722, now seen corresponding path program 1 times [2022-12-06 07:31:49,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:49,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684391706] [2022-12-06 07:31:49,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:49,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:49,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-06 07:31:49,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:49,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684391706] [2022-12-06 07:31:49,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684391706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:49,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:49,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:49,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592107369] [2022-12-06 07:31:49,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:49,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:49,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:49,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:49,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:49,704 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:49,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:49,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:49,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:49,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:49,741 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:49,741 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:49,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:49,742 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:49,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:49,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:49,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:49,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:49,742 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:49,742 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:49,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:49,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:49,743 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:49,743 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:49,743 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:49,743 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:49,743 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:49,744 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:49,744 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:49,744 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:49,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:49,746 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:49,746 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:49,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:49,746 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:49,746 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:49,822 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:49,823 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:31:49,823 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:49,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:49,823 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:49,823 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:49,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2023 [2022-12-06 07:31:49,823 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-06 07:31:49,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:49,824 INFO L85 PathProgramCache]: Analyzing trace with hash -805684613, now seen corresponding path program 1 times [2022-12-06 07:31:49,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:49,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057841531] [2022-12-06 07:31:49,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:49,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:49,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-06 07:31:49,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:49,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057841531] [2022-12-06 07:31:49,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057841531] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:49,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:49,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:49,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868013791] [2022-12-06 07:31:49,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:49,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:49,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:49,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:49,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:49,892 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:49,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:49,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:49,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:49,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:49,928 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:49,929 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:49,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:49,929 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:49,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:49,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:49,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:49,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:49,930 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:49,930 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:49,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:49,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:49,930 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:49,930 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:49,931 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:49,931 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:49,931 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:49,931 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:49,931 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:49,931 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:49,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:49,933 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:49,933 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:49,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:49,933 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:49,933 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:50,008 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:50,008 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:50,009 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:50,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:50,009 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:50,009 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:50,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2024 [2022-12-06 07:31:50,009 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-06 07:31:50,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:50,009 INFO L85 PathProgramCache]: Analyzing trace with hash -775208420, now seen corresponding path program 1 times [2022-12-06 07:31:50,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:50,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389329430] [2022-12-06 07:31:50,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:50,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:50,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-06 07:31:50,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:50,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389329430] [2022-12-06 07:31:50,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389329430] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:50,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:50,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:50,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734836615] [2022-12-06 07:31:50,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:50,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:50,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:50,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:50,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:50,074 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:50,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:50,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:50,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:50,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:50,115 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:50,115 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:50,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:50,116 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:50,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:50,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:50,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:50,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:50,116 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:50,116 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:50,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:50,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:50,117 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:50,117 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:50,117 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:50,117 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:50,117 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:50,117 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:50,117 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:50,117 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:50,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:50,120 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:50,120 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:50,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:50,120 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:50,120 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:50,204 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:50,205 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 07:31:50,205 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:50,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:50,205 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:50,205 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:50,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2025 [2022-12-06 07:31:50,205 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-06 07:31:50,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:50,205 INFO L85 PathProgramCache]: Analyzing trace with hash -748426311, now seen corresponding path program 1 times [2022-12-06 07:31:50,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:50,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080071112] [2022-12-06 07:31:50,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:50,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:50,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-06 07:31:50,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:50,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080071112] [2022-12-06 07:31:50,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080071112] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:50,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:50,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:50,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743580790] [2022-12-06 07:31:50,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:50,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:50,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:50,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:50,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:50,274 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:50,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:50,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:50,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:50,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:50,314 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:50,314 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:50,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:50,315 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:50,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:50,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:50,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:50,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:50,315 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:50,316 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:50,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:50,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:50,316 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:50,316 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:50,316 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:50,316 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:50,317 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:50,317 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:50,317 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:50,317 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:50,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:50,319 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:50,319 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:50,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:50,319 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:50,319 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:50,393 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:50,394 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:50,394 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:50,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:50,394 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:50,394 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:50,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2026 [2022-12-06 07:31:50,394 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-06 07:31:50,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:50,394 INFO L85 PathProgramCache]: Analyzing trace with hash -717950118, now seen corresponding path program 1 times [2022-12-06 07:31:50,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:50,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024511464] [2022-12-06 07:31:50,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:50,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:50,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-06 07:31:50,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:50,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024511464] [2022-12-06 07:31:50,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024511464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:50,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:50,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:50,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329480332] [2022-12-06 07:31:50,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:50,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:50,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:50,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:50,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:50,460 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:50,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:50,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:50,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:50,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:50,502 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:50,502 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:50,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:50,503 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:50,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:50,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:50,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:50,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:50,503 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:50,503 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:50,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:50,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:50,504 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:50,504 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:50,504 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:50,504 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:50,504 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:50,504 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:50,504 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:50,504 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:50,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:50,506 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:50,507 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:50,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:50,507 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:50,507 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:50,582 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:50,583 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:50,583 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:50,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:50,583 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:50,583 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:50,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2027 [2022-12-06 07:31:50,583 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-06 07:31:50,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:50,584 INFO L85 PathProgramCache]: Analyzing trace with hash -691168009, now seen corresponding path program 1 times [2022-12-06 07:31:50,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:50,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941105766] [2022-12-06 07:31:50,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:50,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:50,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-06 07:31:50,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:50,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941105766] [2022-12-06 07:31:50,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941105766] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:50,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:50,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:50,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099455321] [2022-12-06 07:31:50,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:50,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:50,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:50,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:50,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:50,649 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:50,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:50,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:50,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:50,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:50,689 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:50,689 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:50,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:50,690 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:50,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:50,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:50,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:50,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:50,690 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:50,690 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:50,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:50,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:50,691 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:50,691 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:50,691 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:50,691 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:50,691 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:50,691 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:50,691 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:50,691 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:50,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:50,694 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:50,694 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:50,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:50,694 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:50,694 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:50,768 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:50,769 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:50,769 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:50,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:50,769 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:50,769 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:50,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2028 [2022-12-06 07:31:50,769 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-06 07:31:50,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:50,769 INFO L85 PathProgramCache]: Analyzing trace with hash -660691816, now seen corresponding path program 1 times [2022-12-06 07:31:50,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:50,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216293995] [2022-12-06 07:31:50,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:50,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:50,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-06 07:31:50,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:50,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216293995] [2022-12-06 07:31:50,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216293995] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:50,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:50,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:50,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609392500] [2022-12-06 07:31:50,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:50,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:50,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:50,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:50,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:50,839 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:50,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:50,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:50,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:50,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:50,876 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:50,877 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:50,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:50,877 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:50,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:50,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:50,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:50,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:50,878 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:50,878 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:50,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:50,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:50,878 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:50,878 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:50,879 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:50,879 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:50,879 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:50,879 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:50,879 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:50,879 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:50,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:50,881 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:50,881 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:50,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 118 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:50,882 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:50,882 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:50,978 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:50,979 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 07:31:50,979 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:50,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:50,979 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:50,979 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:50,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2029 [2022-12-06 07:31:50,979 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-06 07:31:50,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:50,979 INFO L85 PathProgramCache]: Analyzing trace with hash -633909707, now seen corresponding path program 1 times [2022-12-06 07:31:50,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:50,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778499816] [2022-12-06 07:31:50,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:50,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:31:51,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:51,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778499816] [2022-12-06 07:31:51,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778499816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:51,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:51,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:51,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025848645] [2022-12-06 07:31:51,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:51,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:51,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:51,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:51,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:51,057 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:51,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:51,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:51,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:51,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:51,094 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:51,094 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:51,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:51,095 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:51,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:51,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:51,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:51,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:51,095 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:51,095 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:51,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:51,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:51,096 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:51,096 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:51,096 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:51,096 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:51,096 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:51,097 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:51,097 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:51,097 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:51,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:51,099 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:51,099 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:51,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:51,099 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:51,099 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:51,173 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:51,174 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:51,174 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:51,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:51,174 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:51,174 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:51,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2030 [2022-12-06 07:31:51,174 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-06 07:31:51,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:51,174 INFO L85 PathProgramCache]: Analyzing trace with hash -603433514, now seen corresponding path program 1 times [2022-12-06 07:31:51,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:51,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642128752] [2022-12-06 07:31:51,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:51,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:51,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-06 07:31:51,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:51,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642128752] [2022-12-06 07:31:51,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642128752] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:51,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:51,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:51,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346450653] [2022-12-06 07:31:51,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:51,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:51,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:51,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:51,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:51,238 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:51,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:51,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:51,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:51,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:51,280 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:51,280 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:51,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:51,291 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:51,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:51,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:51,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:51,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:51,292 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:51,292 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:51,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:51,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:51,292 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:51,292 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:51,293 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:51,293 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:51,293 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:51,293 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:51,293 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:51,293 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:51,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:51,295 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:51,296 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:51,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:51,296 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:51,296 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:51,370 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:51,371 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:51,371 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:51,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:51,371 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:51,371 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:51,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2031 [2022-12-06 07:31:51,371 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-06 07:31:51,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:51,371 INFO L85 PathProgramCache]: Analyzing trace with hash -576651405, now seen corresponding path program 1 times [2022-12-06 07:31:51,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:51,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216277986] [2022-12-06 07:31:51,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:51,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:51,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-06 07:31:51,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:51,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216277986] [2022-12-06 07:31:51,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216277986] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:51,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:51,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:51,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370229856] [2022-12-06 07:31:51,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:51,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:51,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:51,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:51,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:51,437 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:51,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:51,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:51,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:51,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:51,473 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:51,473 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:51,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:51,473 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:51,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:51,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:51,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:51,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:51,474 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:51,474 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:51,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:51,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:51,475 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:51,475 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:51,475 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:51,475 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:51,475 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:51,475 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:51,475 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:51,475 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:51,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:51,477 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:51,477 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:51,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:51,478 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:51,478 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:51,553 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:51,554 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:51,554 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:51,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:51,555 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:51,555 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:51,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2032 [2022-12-06 07:31:51,555 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-06 07:31:51,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:51,555 INFO L85 PathProgramCache]: Analyzing trace with hash -546175212, now seen corresponding path program 1 times [2022-12-06 07:31:51,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:51,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688641439] [2022-12-06 07:31:51,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:51,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:51,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-06 07:31:51,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:51,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688641439] [2022-12-06 07:31:51,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688641439] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:51,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:51,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:51,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395316835] [2022-12-06 07:31:51,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:51,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:51,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:51,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:51,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:51,619 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:51,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:51,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:51,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:51,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:51,661 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:51,661 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:51,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:51,662 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:51,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:51,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:51,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:51,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:51,662 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:51,662 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:51,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:51,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:51,663 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:51,663 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:51,663 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:51,663 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:51,663 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:51,663 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:51,663 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:51,663 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:51,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:51,666 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:51,666 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:51,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:51,666 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:51,666 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:51,739 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:51,740 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:51,740 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:51,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:51,740 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:51,740 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:51,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2033 [2022-12-06 07:31:51,740 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-06 07:31:51,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:51,741 INFO L85 PathProgramCache]: Analyzing trace with hash -519393103, now seen corresponding path program 1 times [2022-12-06 07:31:51,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:51,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826216437] [2022-12-06 07:31:51,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:51,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:51,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-06 07:31:51,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:51,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826216437] [2022-12-06 07:31:51,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826216437] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:51,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:51,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:51,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764044353] [2022-12-06 07:31:51,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:51,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:51,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:51,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:51,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:51,807 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:51,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:51,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:51,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:51,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:51,863 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:51,863 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:51,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:51,863 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:51,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:51,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:51,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:51,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:51,864 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:51,864 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:51,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:51,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:51,865 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:51,865 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:51,865 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:51,865 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:51,865 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:51,865 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:51,865 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:51,865 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:51,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:51,867 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:51,868 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:51,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:51,868 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:51,868 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:51,942 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:51,943 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:51,943 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:51,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:51,943 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:51,943 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:51,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2034 [2022-12-06 07:31:51,943 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-06 07:31:51,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:51,943 INFO L85 PathProgramCache]: Analyzing trace with hash -488916910, now seen corresponding path program 1 times [2022-12-06 07:31:51,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:51,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492209215] [2022-12-06 07:31:51,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:51,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:52,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-06 07:31:52,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:52,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492209215] [2022-12-06 07:31:52,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492209215] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:52,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:52,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:52,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60295405] [2022-12-06 07:31:52,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:52,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:52,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:52,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:52,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:52,011 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:52,011 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:52,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:52,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:52,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:52,053 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:52,053 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:52,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:52,054 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:52,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:52,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:52,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:52,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:52,054 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:52,054 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:52,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:52,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:52,055 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:52,055 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:52,055 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:52,055 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:52,055 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:52,055 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:52,055 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:52,055 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:52,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:52,058 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:52,058 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:52,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:52,058 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:52,058 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:52,132 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:52,133 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:52,133 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:52,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:52,133 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:52,133 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:52,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2035 [2022-12-06 07:31:52,133 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-06 07:31:52,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:52,133 INFO L85 PathProgramCache]: Analyzing trace with hash -462134801, now seen corresponding path program 1 times [2022-12-06 07:31:52,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:52,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524780260] [2022-12-06 07:31:52,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:52,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:52,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-06 07:31:52,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:52,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524780260] [2022-12-06 07:31:52,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524780260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:52,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:52,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:52,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257828819] [2022-12-06 07:31:52,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:52,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:52,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:52,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:52,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:52,201 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:52,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:52,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:52,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:52,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:52,242 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:52,242 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:52,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:52,243 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:52,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:52,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:52,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:52,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:52,243 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:52,244 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:52,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:52,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:52,244 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:52,244 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:52,244 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:52,244 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:52,245 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:52,245 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:52,245 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:52,245 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:52,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:52,247 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:52,247 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:52,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:52,247 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:52,247 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:52,321 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:52,322 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:52,322 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:52,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:52,322 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:52,322 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:52,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2036 [2022-12-06 07:31:52,323 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-06 07:31:52,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:52,323 INFO L85 PathProgramCache]: Analyzing trace with hash -431658608, now seen corresponding path program 1 times [2022-12-06 07:31:52,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:52,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911686774] [2022-12-06 07:31:52,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:52,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:52,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-06 07:31:52,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:52,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911686774] [2022-12-06 07:31:52,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911686774] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:52,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:52,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:52,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441223101] [2022-12-06 07:31:52,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:52,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:52,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:52,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:52,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:52,385 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:52,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:52,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:52,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:52,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:52,432 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:52,432 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:52,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:52,432 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:52,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:52,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:52,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:52,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:52,433 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:52,433 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:52,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:52,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:52,434 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:52,434 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:52,434 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:52,434 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:52,434 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:52,434 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:52,434 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:52,434 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:52,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:52,436 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:52,436 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:52,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:52,437 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:52,437 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:52,511 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:52,512 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:52,512 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:52,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:52,512 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:52,512 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:52,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2037 [2022-12-06 07:31:52,512 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-06 07:31:52,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:52,512 INFO L85 PathProgramCache]: Analyzing trace with hash -404876499, now seen corresponding path program 1 times [2022-12-06 07:31:52,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:52,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036853342] [2022-12-06 07:31:52,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:52,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:52,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-06 07:31:52,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:52,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036853342] [2022-12-06 07:31:52,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036853342] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:52,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:52,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:52,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140170160] [2022-12-06 07:31:52,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:52,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:52,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:52,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:52,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:52,580 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:52,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:52,580 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:52,580 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:52,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:52,615 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:52,615 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:52,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:52,616 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:52,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:52,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:52,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:52,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:52,616 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:52,616 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:52,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:52,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:52,617 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:52,617 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:52,617 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:52,617 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:52,617 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:52,618 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:52,618 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:52,618 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:52,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:52,620 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:52,620 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:52,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:52,620 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:52,620 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:52,693 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:52,693 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:31:52,694 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:52,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:52,694 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:52,694 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:52,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2038 [2022-12-06 07:31:52,694 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-06 07:31:52,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:52,694 INFO L85 PathProgramCache]: Analyzing trace with hash -374400306, now seen corresponding path program 1 times [2022-12-06 07:31:52,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:52,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229053702] [2022-12-06 07:31:52,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:52,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:52,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-06 07:31:52,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:52,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229053702] [2022-12-06 07:31:52,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229053702] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:52,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:52,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:52,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639861215] [2022-12-06 07:31:52,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:52,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:52,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:52,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:52,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:52,758 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:52,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:52,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:52,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:52,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:52,795 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:52,795 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:52,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:52,795 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:52,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:52,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:52,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:52,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:52,796 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:52,796 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:52,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:52,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:52,797 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:52,797 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:52,797 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:52,797 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:52,797 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:52,797 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:52,797 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:52,797 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:52,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:52,799 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:52,800 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:52,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:52,800 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:52,800 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:52,875 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:52,875 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:52,876 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:52,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:52,876 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:52,876 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:52,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2039 [2022-12-06 07:31:52,876 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-06 07:31:52,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:52,876 INFO L85 PathProgramCache]: Analyzing trace with hash -347618197, now seen corresponding path program 1 times [2022-12-06 07:31:52,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:52,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328141691] [2022-12-06 07:31:52,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:52,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:52,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:52,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-06 07:31:52,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:52,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328141691] [2022-12-06 07:31:52,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328141691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:52,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:52,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:52,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967233217] [2022-12-06 07:31:52,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:52,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:52,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:52,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:52,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:52,942 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:52,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:52,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:52,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:52,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:52,976 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:52,976 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:52,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 370 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:52,977 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:52,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:52,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:52,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:52,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:52,977 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:52,977 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:52,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:52,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:52,978 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:52,978 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:52,978 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:52,978 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:52,978 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:52,978 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:52,978 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:52,978 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:52,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:52,981 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:52,981 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:52,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:52,981 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:52,981 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:53,054 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:53,055 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:53,055 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:53,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:53,055 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:53,055 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:53,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2040 [2022-12-06 07:31:53,055 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-06 07:31:53,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:53,055 INFO L85 PathProgramCache]: Analyzing trace with hash -317142004, now seen corresponding path program 1 times [2022-12-06 07:31:53,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:53,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408784622] [2022-12-06 07:31:53,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:53,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:53,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-06 07:31:53,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:53,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408784622] [2022-12-06 07:31:53,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408784622] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:53,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:53,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:53,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579102900] [2022-12-06 07:31:53,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:53,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:53,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:53,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:53,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:53,121 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:53,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:53,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:53,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:53,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:53,157 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:53,157 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:53,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:53,158 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:53,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:53,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:53,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:53,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:53,158 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:53,158 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:53,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:53,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:53,159 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:53,159 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:53,159 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:53,159 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:53,159 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:53,159 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:53,159 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:53,159 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:53,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:53,161 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:53,162 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:53,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:53,162 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:53,162 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:53,238 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:53,239 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:31:53,239 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:53,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:53,239 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:53,239 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:53,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2041 [2022-12-06 07:31:53,239 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-06 07:31:53,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:53,239 INFO L85 PathProgramCache]: Analyzing trace with hash -290359895, now seen corresponding path program 1 times [2022-12-06 07:31:53,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:53,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768535720] [2022-12-06 07:31:53,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:53,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:53,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-06 07:31:53,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:53,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768535720] [2022-12-06 07:31:53,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768535720] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:53,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:53,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:53,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176040391] [2022-12-06 07:31:53,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:53,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:53,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:53,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:53,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:53,305 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:53,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:53,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:53,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:53,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:53,346 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:53,346 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:53,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:53,347 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:53,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:53,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:53,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:53,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:53,347 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:53,347 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:53,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:53,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:53,348 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:53,348 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:53,348 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:53,348 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:53,348 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:53,349 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:53,349 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:53,349 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:53,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:53,351 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:53,351 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:53,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:53,351 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:53,351 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:53,424 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:53,425 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:53,425 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:53,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:53,425 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:53,426 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:53,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2042 [2022-12-06 07:31:53,426 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-06 07:31:53,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:53,426 INFO L85 PathProgramCache]: Analyzing trace with hash -259883702, now seen corresponding path program 1 times [2022-12-06 07:31:53,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:53,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286579531] [2022-12-06 07:31:53,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:53,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:53,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-06 07:31:53,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:53,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286579531] [2022-12-06 07:31:53,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286579531] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:53,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:53,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:53,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234137034] [2022-12-06 07:31:53,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:53,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:53,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:53,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:53,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:53,501 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:53,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:53,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:53,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:53,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:53,542 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:53,543 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:53,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:53,543 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:53,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:53,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:53,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:53,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:53,544 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:53,544 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:53,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:53,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:53,544 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:53,544 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:53,545 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:53,545 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:53,545 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:53,545 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:53,545 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:53,545 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:53,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:53,547 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:53,547 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:53,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:53,548 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:53,548 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:53,622 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:53,623 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:53,623 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:53,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:53,623 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:53,623 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:53,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2043 [2022-12-06 07:31:53,623 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-06 07:31:53,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:53,624 INFO L85 PathProgramCache]: Analyzing trace with hash -233101593, now seen corresponding path program 1 times [2022-12-06 07:31:53,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:53,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262775101] [2022-12-06 07:31:53,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:53,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:53,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-06 07:31:53,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:53,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262775101] [2022-12-06 07:31:53,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262775101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:53,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:53,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:53,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414978698] [2022-12-06 07:31:53,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:53,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:53,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:53,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:53,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:53,689 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:53,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:53,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:53,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:53,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:53,725 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:53,725 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:53,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:53,726 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:53,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:53,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:53,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:53,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:53,726 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:53,726 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:53,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:53,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:53,727 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:53,727 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:53,727 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:53,727 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:53,727 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:53,727 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:53,727 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:53,727 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:53,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:53,729 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:53,730 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:53,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:53,730 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:53,730 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:53,806 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:53,807 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:31:53,807 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:53,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:53,808 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:53,808 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:53,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2044 [2022-12-06 07:31:53,808 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-06 07:31:53,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:53,808 INFO L85 PathProgramCache]: Analyzing trace with hash -202625400, now seen corresponding path program 1 times [2022-12-06 07:31:53,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:53,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202248251] [2022-12-06 07:31:53,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:53,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:53,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-06 07:31:53,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:53,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202248251] [2022-12-06 07:31:53,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202248251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:53,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:53,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:53,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630321362] [2022-12-06 07:31:53,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:53,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:53,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:53,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:53,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:53,881 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:53,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:53,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:53,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:53,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:53,925 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:53,925 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:53,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:53,926 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:53,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:53,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:53,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:53,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:53,926 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:53,926 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:53,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:53,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:53,927 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:53,927 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:53,927 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:53,927 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:53,927 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:53,927 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:53,927 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:53,928 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:53,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:53,930 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:53,930 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:53,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:53,930 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:53,930 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:54,004 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:54,005 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:54,005 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:54,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:54,005 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:54,006 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:54,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2045 [2022-12-06 07:31:54,006 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-06 07:31:54,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:54,006 INFO L85 PathProgramCache]: Analyzing trace with hash -175843291, now seen corresponding path program 1 times [2022-12-06 07:31:54,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:54,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656609024] [2022-12-06 07:31:54,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:54,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:54,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-06 07:31:54,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:54,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656609024] [2022-12-06 07:31:54,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656609024] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:54,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:54,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:54,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541330303] [2022-12-06 07:31:54,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:54,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:54,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:54,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:54,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:54,072 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:54,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:54,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:54,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:54,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:54,112 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:54,112 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:54,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:54,113 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:54,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:54,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:54,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:54,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:54,113 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:54,113 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:54,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:54,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:54,114 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:54,114 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:54,114 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:54,114 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:54,114 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:54,115 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:54,115 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:54,115 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:54,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:54,117 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:54,117 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:54,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:54,117 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:54,117 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:54,191 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:54,192 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:54,192 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:54,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:54,193 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:54,193 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:54,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2046 [2022-12-06 07:31:54,193 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-06 07:31:54,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:54,193 INFO L85 PathProgramCache]: Analyzing trace with hash -145367098, now seen corresponding path program 1 times [2022-12-06 07:31:54,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:54,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988687651] [2022-12-06 07:31:54,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:54,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:54,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-06 07:31:54,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:54,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988687651] [2022-12-06 07:31:54,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988687651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:54,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:54,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:54,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913368612] [2022-12-06 07:31:54,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:54,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:54,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:54,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:54,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:54,257 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:54,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:54,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:54,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:54,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:54,304 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:54,304 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:54,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:54,305 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:54,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:54,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:54,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:54,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:54,306 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:54,306 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:54,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:54,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:54,306 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:54,306 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:54,307 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:54,307 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:54,307 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:54,307 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:54,307 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:54,307 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:54,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:54,309 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:54,309 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:54,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:54,310 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:54,310 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:54,384 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:54,385 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:54,385 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:54,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:54,385 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:54,385 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:54,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2047 [2022-12-06 07:31:54,385 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-06 07:31:54,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:54,385 INFO L85 PathProgramCache]: Analyzing trace with hash -118584989, now seen corresponding path program 1 times [2022-12-06 07:31:54,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:54,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994890164] [2022-12-06 07:31:54,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:54,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:54,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-06 07:31:54,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:54,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994890164] [2022-12-06 07:31:54,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994890164] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:54,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:54,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:54,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227284802] [2022-12-06 07:31:54,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:54,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:54,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:54,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:54,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:54,455 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:54,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:54,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:54,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:54,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:54,492 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:54,493 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:54,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:54,493 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:54,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:54,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:54,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:54,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:54,494 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:54,494 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:54,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:54,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:54,494 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:54,495 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:54,495 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:54,495 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:54,495 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:54,495 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:54,495 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:54,495 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:54,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:54,497 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:54,497 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:54,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:54,498 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:54,498 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:54,571 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:54,572 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:54,572 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:54,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:54,573 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:54,573 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:54,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2048 [2022-12-06 07:31:54,573 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-06 07:31:54,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:54,573 INFO L85 PathProgramCache]: Analyzing trace with hash -88108796, now seen corresponding path program 1 times [2022-12-06 07:31:54,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:54,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762276134] [2022-12-06 07:31:54,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:54,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:54,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-06 07:31:54,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:54,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762276134] [2022-12-06 07:31:54,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762276134] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:54,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:54,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:54,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759086507] [2022-12-06 07:31:54,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:54,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:54,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:54,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:54,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:54,658 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:54,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:54,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:54,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:54,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:54,706 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:54,706 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:54,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:54,706 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:54,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:54,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:54,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:54,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:54,707 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:54,707 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:54,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:54,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:54,708 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:54,708 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:54,708 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:54,708 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:54,708 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:54,708 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:54,708 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:54,708 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:54,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:54,710 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:54,710 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:54,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:54,711 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:54,711 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:54,784 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:54,785 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:54,785 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:54,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:54,785 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:54,785 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:54,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2049 [2022-12-06 07:31:54,785 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-06 07:31:54,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:54,785 INFO L85 PathProgramCache]: Analyzing trace with hash -61326687, now seen corresponding path program 1 times [2022-12-06 07:31:54,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:54,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973159665] [2022-12-06 07:31:54,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:54,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:54,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-06 07:31:54,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:54,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973159665] [2022-12-06 07:31:54,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973159665] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:54,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:54,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:54,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894209491] [2022-12-06 07:31:54,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:54,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:54,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:54,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:54,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:54,852 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:54,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:54,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:54,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:54,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:54,911 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:54,911 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:54,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:54,911 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:54,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:54,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:54,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:54,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:54,912 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:54,912 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:54,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:54,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:54,913 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:54,913 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:54,913 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:54,914 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:54,914 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:54,914 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:54,914 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:54,914 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:54,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:54,917 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:54,917 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:54,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:54,917 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:54,917 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:54,998 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:54,999 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 07:31:54,999 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:54,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:55,000 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:55,000 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:55,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2050 [2022-12-06 07:31:55,000 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-06 07:31:55,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:55,000 INFO L85 PathProgramCache]: Analyzing trace with hash -30850494, now seen corresponding path program 1 times [2022-12-06 07:31:55,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:55,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745374327] [2022-12-06 07:31:55,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:55,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31: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-06 07:31:55,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:55,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745374327] [2022-12-06 07:31:55,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745374327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:55,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:55,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:55,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865197672] [2022-12-06 07:31:55,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:55,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:55,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:55,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:55,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:55,066 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:55,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:55,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:55,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:55,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:55,108 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:55,108 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:55,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:55,108 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:55,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:55,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:55,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:55,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:55,109 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:55,109 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:55,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:55,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:55,110 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:55,110 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:55,110 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:55,110 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:55,110 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:55,110 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:55,110 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:55,110 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:55,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:55,112 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:55,112 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:55,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:55,113 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:55,113 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:55,187 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:55,188 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:55,188 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:55,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:55,188 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:55,188 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:55,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2051 [2022-12-06 07:31:55,188 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-06 07:31:55,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:55,189 INFO L85 PathProgramCache]: Analyzing trace with hash -4068385, now seen corresponding path program 1 times [2022-12-06 07:31:55,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:55,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771387431] [2022-12-06 07:31:55,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:55,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31: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-06 07:31:55,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:55,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771387431] [2022-12-06 07:31:55,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771387431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:55,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:55,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:55,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658984283] [2022-12-06 07:31:55,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:55,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:55,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:55,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:55,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:55,253 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:55,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:55,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:55,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:55,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:55,292 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:55,292 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:55,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:55,292 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:55,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:55,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:55,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:55,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:55,293 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:55,293 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:55,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:55,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:55,294 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:55,294 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:55,294 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:55,294 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:55,294 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:55,294 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:55,294 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:55,294 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:55,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:55,296 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:55,297 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:55,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:55,297 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:55,297 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:55,371 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:55,372 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:55,372 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:55,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:55,372 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:55,372 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:55,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2052 [2022-12-06 07:31:55,373 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-06 07:31:55,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:55,373 INFO L85 PathProgramCache]: Analyzing trace with hash 26407808, now seen corresponding path program 1 times [2022-12-06 07:31:55,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:55,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304603691] [2022-12-06 07:31:55,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:55,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:55,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:55,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-06 07:31:55,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:55,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304603691] [2022-12-06 07:31:55,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304603691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:55,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:55,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:55,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364396012] [2022-12-06 07:31:55,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:55,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:55,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:55,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:55,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:55,439 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:55,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:55,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:55,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:55,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:55,480 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:55,481 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:55,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:55,481 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:55,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:55,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:55,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:55,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:55,482 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:55,482 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:55,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:55,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:55,482 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:55,482 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:55,483 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:55,483 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:55,483 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:55,483 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:55,483 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:55,483 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:55,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:55,485 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:55,485 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:55,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:55,485 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:55,486 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:55,560 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:55,561 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:55,561 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:55,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:55,561 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:55,561 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:55,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2053 [2022-12-06 07:31:55,561 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-06 07:31:55,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:55,562 INFO L85 PathProgramCache]: Analyzing trace with hash 53189917, now seen corresponding path program 1 times [2022-12-06 07:31:55,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:55,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239985484] [2022-12-06 07:31:55,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:55,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:55,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-06 07:31:55,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:55,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239985484] [2022-12-06 07:31:55,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239985484] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:55,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:55,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:55,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442448420] [2022-12-06 07:31:55,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:55,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:55,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:55,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:55,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:55,628 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:55,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:55,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:55,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:55,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:55,670 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:55,670 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:55,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:55,671 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:55,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:55,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:55,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:55,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:55,671 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:55,671 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:55,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:55,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:55,672 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:55,672 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:55,672 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:55,672 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:55,672 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:55,673 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:55,673 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:55,673 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:55,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:55,675 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:55,675 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:55,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:55,675 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:55,675 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:55,749 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:55,750 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:55,750 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:55,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:55,750 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:55,750 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:55,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2054 [2022-12-06 07:31:55,751 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-06 07:31:55,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:55,751 INFO L85 PathProgramCache]: Analyzing trace with hash 83666110, now seen corresponding path program 1 times [2022-12-06 07:31:55,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:55,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495956150] [2022-12-06 07:31:55,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:55,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:55,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:31:55,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:55,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495956150] [2022-12-06 07:31:55,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495956150] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:55,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:55,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:55,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463454094] [2022-12-06 07:31:55,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:55,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:55,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:55,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:55,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:55,831 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:55,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:55,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:55,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:55,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:55,873 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:55,873 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:55,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:55,873 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:55,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:55,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:55,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:55,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:55,874 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:55,874 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:55,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:55,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:55,875 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:55,875 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:55,875 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:55,875 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:55,875 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:55,875 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:55,875 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:55,875 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:55,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:55,877 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:55,877 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:55,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:55,878 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:55,878 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:55,952 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:55,953 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:55,953 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:55,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:55,953 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:55,953 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:55,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2055 [2022-12-06 07:31:55,954 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-06 07:31:55,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:55,954 INFO L85 PathProgramCache]: Analyzing trace with hash 110448219, now seen corresponding path program 1 times [2022-12-06 07:31:55,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:55,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016978543] [2022-12-06 07:31:55,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:55,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:56,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-06 07:31:56,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:56,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016978543] [2022-12-06 07:31:56,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016978543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:56,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:56,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:56,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484201540] [2022-12-06 07:31:56,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:56,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:56,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:56,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:56,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:56,019 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:56,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:56,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:56,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:56,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:56,056 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:56,056 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:56,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:56,057 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:56,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:56,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:56,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:56,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:56,057 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:56,057 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:56,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:56,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:56,058 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:56,058 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:56,058 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:56,058 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:56,058 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:56,058 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:56,058 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:56,058 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:56,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:56,061 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:56,061 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:56,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:56,061 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:56,061 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:56,136 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:56,137 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:56,137 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:56,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:56,137 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:56,137 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:56,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2056 [2022-12-06 07:31:56,137 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-06 07:31:56,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:56,138 INFO L85 PathProgramCache]: Analyzing trace with hash 140924412, now seen corresponding path program 1 times [2022-12-06 07:31:56,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:56,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699133800] [2022-12-06 07:31:56,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:56,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:56,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:56,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-06 07:31:56,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:56,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699133800] [2022-12-06 07:31:56,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699133800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:56,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:56,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:56,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872907128] [2022-12-06 07:31:56,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:56,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:56,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:56,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:56,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:56,202 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:56,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:56,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:56,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:56,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:56,245 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:56,245 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:56,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:56,245 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:56,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:56,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:56,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:56,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:56,246 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:56,246 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:56,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:56,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:56,246 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:56,247 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:56,247 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:56,247 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:56,247 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:56,247 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:56,247 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:56,247 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:56,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:56,249 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:56,249 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:56,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 120 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:56,250 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:56,250 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:56,324 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:56,325 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:56,325 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:56,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:56,325 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:56,325 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:56,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2057 [2022-12-06 07:31:56,325 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-06 07:31:56,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:56,326 INFO L85 PathProgramCache]: Analyzing trace with hash 167706521, now seen corresponding path program 1 times [2022-12-06 07:31:56,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:56,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994445594] [2022-12-06 07:31:56,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:56,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:56,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-06 07:31:56,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:56,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994445594] [2022-12-06 07:31:56,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994445594] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:56,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:56,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:56,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647972086] [2022-12-06 07:31:56,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:56,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:56,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:56,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:56,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:56,394 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:56,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:56,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:56,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:56,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:56,430 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:56,430 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:56,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 372 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:56,430 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:56,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:56,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:56,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:56,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:56,431 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:56,431 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:56,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:56,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:56,432 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:56,432 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:56,432 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:56,432 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:56,432 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:56,432 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:56,432 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:56,432 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:56,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:56,434 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:56,434 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:56,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:56,435 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:56,435 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:56,510 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:56,511 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:56,511 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:56,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:56,511 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:56,511 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:56,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2058 [2022-12-06 07:31:56,511 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-06 07:31:56,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:56,512 INFO L85 PathProgramCache]: Analyzing trace with hash 198182714, now seen corresponding path program 1 times [2022-12-06 07:31:56,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:56,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915720739] [2022-12-06 07:31:56,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:56,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:56,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-06 07:31:56,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:56,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915720739] [2022-12-06 07:31:56,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915720739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:56,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:56,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:56,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464890736] [2022-12-06 07:31:56,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:56,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:56,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:56,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:56,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:56,578 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:56,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:56,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:56,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:56,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:56,614 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:56,614 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:56,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:56,614 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:56,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:56,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:56,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:56,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:56,615 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:56,615 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:56,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:56,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:56,615 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:56,616 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:56,616 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:56,616 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:56,616 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:56,616 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:56,616 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:56,616 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:56,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:56,618 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:56,618 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:56,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 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 116. Up to 16 conditions per place. [2022-12-06 07:31:56,618 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:56,619 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:56,694 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:56,695 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:56,695 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:56,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:56,695 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:56,695 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:56,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2059 [2022-12-06 07:31:56,695 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-06 07:31:56,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:56,695 INFO L85 PathProgramCache]: Analyzing trace with hash 224964823, now seen corresponding path program 1 times [2022-12-06 07:31:56,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:56,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312930325] [2022-12-06 07:31:56,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:56,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:56,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-06 07:31:56,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:56,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312930325] [2022-12-06 07:31:56,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312930325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:56,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:56,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:56,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58494398] [2022-12-06 07:31:56,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:56,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:56,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:56,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:56,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:56,764 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:56,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:56,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:56,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:56,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:56,806 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:56,806 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:56,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:56,807 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:56,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:56,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:56,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:56,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:56,807 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:56,807 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:56,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:56,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:56,808 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:56,808 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:56,808 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:56,808 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:56,808 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:56,809 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:56,809 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:56,809 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:56,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:56,811 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:56,811 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:56,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:56,811 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:56,811 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:56,886 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:56,887 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:31:56,887 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:56,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:56,888 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:56,888 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:56,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2060 [2022-12-06 07:31:56,888 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-06 07:31:56,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:56,888 INFO L85 PathProgramCache]: Analyzing trace with hash 255441016, now seen corresponding path program 1 times [2022-12-06 07:31:56,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:56,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83788274] [2022-12-06 07:31:56,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:56,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:56,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-06 07:31:56,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:56,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83788274] [2022-12-06 07:31:56,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83788274] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:56,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:56,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:56,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609305420] [2022-12-06 07:31:56,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:56,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:56,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:56,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:56,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:56,965 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:56,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:56,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:56,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:56,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:57,002 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:57,002 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:57,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:57,002 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:57,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:57,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:57,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:57,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:57,003 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:57,003 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:57,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:57,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:57,004 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:57,004 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:57,004 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:57,004 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:57,004 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:57,004 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:57,004 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:57,004 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:57,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:57,006 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:57,006 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:57,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:57,007 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:57,007 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:57,080 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:57,081 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:57,081 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:57,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:57,081 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:57,081 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:57,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2061 [2022-12-06 07:31:57,082 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-06 07:31:57,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:57,082 INFO L85 PathProgramCache]: Analyzing trace with hash 282223125, now seen corresponding path program 1 times [2022-12-06 07:31:57,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:57,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568717558] [2022-12-06 07:31:57,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:57,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:57,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-06 07:31:57,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:57,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568717558] [2022-12-06 07:31:57,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568717558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:57,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:57,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:57,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89548752] [2022-12-06 07:31:57,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:57,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:57,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:57,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:57,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:57,148 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:57,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:57,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:57,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:57,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:57,184 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:57,184 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:57,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 353 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:57,185 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:57,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:57,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:57,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:57,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:57,186 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:57,186 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:57,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:57,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:57,186 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:57,186 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:57,186 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:57,187 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:57,187 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:57,187 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:57,187 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:57,187 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:57,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:57,189 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:57,189 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:57,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:57,189 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:57,189 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:57,264 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:57,265 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:57,265 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:57,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:57,265 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:57,265 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:57,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2062 [2022-12-06 07:31:57,265 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-06 07:31:57,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:57,265 INFO L85 PathProgramCache]: Analyzing trace with hash 312699318, now seen corresponding path program 1 times [2022-12-06 07:31:57,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:57,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880333494] [2022-12-06 07:31:57,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:57,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:57,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-06 07:31:57,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:57,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880333494] [2022-12-06 07:31:57,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880333494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:57,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:57,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:57,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679162585] [2022-12-06 07:31:57,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:57,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:57,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:57,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:57,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:57,328 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:57,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:57,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:57,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:57,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:57,365 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:57,365 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:57,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:57,365 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:57,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:57,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:57,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:57,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:57,366 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:57,366 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:57,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:57,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:57,367 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:57,367 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:57,367 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:57,367 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:57,367 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:57,367 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:57,367 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:57,367 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:57,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:57,369 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:57,369 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:57,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:57,370 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:57,370 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:57,443 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:57,444 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:57,444 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:57,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:57,444 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:57,444 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:57,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2063 [2022-12-06 07:31:57,444 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-06 07:31:57,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:57,444 INFO L85 PathProgramCache]: Analyzing trace with hash 339481427, now seen corresponding path program 1 times [2022-12-06 07:31:57,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:57,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156152571] [2022-12-06 07:31:57,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:57,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31: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-06 07:31:57,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:57,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156152571] [2022-12-06 07:31:57,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156152571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:57,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:57,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:57,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043321008] [2022-12-06 07:31:57,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:57,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:57,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:57,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:57,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:57,511 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:57,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:57,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:57,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:57,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:57,547 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:57,547 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:57,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:57,548 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:57,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:57,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:57,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:57,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:57,548 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:57,548 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:57,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:57,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:57,549 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:57,549 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:57,549 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:57,549 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:57,549 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:57,549 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:57,549 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:57,549 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:57,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:57,552 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:57,552 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:57,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:57,552 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:57,552 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:57,625 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:57,626 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:57,626 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:57,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:57,626 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:57,626 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:57,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2064 [2022-12-06 07:31:57,626 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-06 07:31:57,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:57,626 INFO L85 PathProgramCache]: Analyzing trace with hash 369957620, now seen corresponding path program 1 times [2022-12-06 07:31:57,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:57,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684230417] [2022-12-06 07:31:57,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:57,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:57,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:31:57,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:57,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684230417] [2022-12-06 07:31:57,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684230417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:57,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:57,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:57,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569274655] [2022-12-06 07:31:57,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:57,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:57,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:57,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:57,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:57,690 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:57,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:57,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:57,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:57,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:57,733 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:57,733 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:57,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:57,734 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:57,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:57,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:57,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:57,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:57,735 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:57,735 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:57,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:57,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:57,735 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:57,735 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:57,735 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:57,736 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:57,736 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:57,736 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:57,736 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:57,736 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:57,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:57,738 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:57,738 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:57,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:57,738 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:57,738 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:57,812 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:57,813 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:57,813 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:57,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:57,814 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:57,814 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:57,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2065 [2022-12-06 07:31:57,814 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-06 07:31:57,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:57,814 INFO L85 PathProgramCache]: Analyzing trace with hash 396739729, now seen corresponding path program 1 times [2022-12-06 07:31:57,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:57,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583907840] [2022-12-06 07:31:57,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:57,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:57,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-06 07:31:57,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:57,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583907840] [2022-12-06 07:31:57,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583907840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:57,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:57,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:57,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654535361] [2022-12-06 07:31:57,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:57,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:57,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:57,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:57,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:57,882 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:57,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:57,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:57,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:57,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:57,921 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:57,921 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:57,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:57,921 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:57,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:57,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:57,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:57,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:57,922 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:57,922 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:57,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:57,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:57,923 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:57,923 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:57,923 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:57,923 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:57,923 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:57,923 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:57,923 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:57,923 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:57,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:57,925 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:57,925 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:57,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:57,926 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:57,926 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:58,000 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:58,001 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:58,001 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:58,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:58,001 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:58,001 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:58,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2066 [2022-12-06 07:31:58,001 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-06 07:31:58,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:58,001 INFO L85 PathProgramCache]: Analyzing trace with hash 427215922, now seen corresponding path program 1 times [2022-12-06 07:31:58,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:58,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592360481] [2022-12-06 07:31:58,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:58,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:58,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-06 07:31:58,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:58,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592360481] [2022-12-06 07:31:58,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592360481] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:58,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:58,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:58,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781992222] [2022-12-06 07:31:58,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:58,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:58,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:58,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:58,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:58,076 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:58,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:58,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:58,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:58,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:58,117 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:58,118 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:58,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:58,118 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:58,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:58,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:58,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:58,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:58,119 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:58,119 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:58,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:58,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:58,119 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:58,119 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:58,119 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:58,120 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:58,120 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:58,120 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:58,120 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:58,120 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:58,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:58,122 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:58,122 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:58,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:58,122 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:58,122 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:58,197 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:58,198 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:58,198 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:58,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:58,198 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:58,198 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:58,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2067 [2022-12-06 07:31:58,198 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-06 07:31:58,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:58,199 INFO L85 PathProgramCache]: Analyzing trace with hash 453998031, now seen corresponding path program 1 times [2022-12-06 07:31:58,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:58,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747949970] [2022-12-06 07:31:58,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:58,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:58,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-06 07:31:58,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:58,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747949970] [2022-12-06 07:31:58,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747949970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:58,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:58,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:58,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249401870] [2022-12-06 07:31:58,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:58,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:58,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:58,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:58,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:58,264 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:58,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:58,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:58,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:58,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:58,305 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:58,305 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:58,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:58,305 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:58,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:58,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:58,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:58,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:58,306 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:58,306 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:58,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:58,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:58,307 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:58,307 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:58,307 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:58,307 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:58,307 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:58,307 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:58,307 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:58,307 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:58,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:58,309 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:58,309 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:58,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:58,310 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:58,310 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:58,383 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:58,384 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:58,384 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:58,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:58,384 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:58,385 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:58,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2068 [2022-12-06 07:31:58,385 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-06 07:31:58,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:58,385 INFO L85 PathProgramCache]: Analyzing trace with hash 484474224, now seen corresponding path program 1 times [2022-12-06 07:31:58,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:58,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888715278] [2022-12-06 07:31:58,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:58,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:58,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-06 07:31:58,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:58,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888715278] [2022-12-06 07:31:58,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888715278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:58,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:58,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:58,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229193766] [2022-12-06 07:31:58,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:58,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:58,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:58,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:58,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:58,448 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:58,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:58,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:58,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:58,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:58,484 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:58,485 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:58,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:58,485 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:58,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:58,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:58,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:58,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:58,486 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:58,486 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:58,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:58,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:58,486 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:58,487 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:58,487 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:58,487 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:58,487 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:58,487 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:58,487 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:58,487 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:58,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:58,489 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:58,489 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:58,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:58,490 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:58,490 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:58,562 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:58,563 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:31:58,563 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:58,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:58,563 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:58,563 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:58,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2069 [2022-12-06 07:31:58,563 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-06 07:31:58,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:58,563 INFO L85 PathProgramCache]: Analyzing trace with hash 511256333, now seen corresponding path program 1 times [2022-12-06 07:31:58,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:58,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093756672] [2022-12-06 07:31:58,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:58,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:58,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-06 07:31:58,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:58,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093756672] [2022-12-06 07:31:58,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093756672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:58,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:58,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:58,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762690569] [2022-12-06 07:31:58,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:58,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:58,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:58,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:58,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:58,630 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:58,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:58,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:58,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:58,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:58,671 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:58,672 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:58,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:58,672 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:58,672 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:58,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:58,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:58,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:58,673 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:58,673 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:58,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:58,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:58,673 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:58,673 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:58,673 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:58,674 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:58,674 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:58,674 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:58,674 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:58,674 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:58,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:58,676 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:58,676 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:58,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:58,676 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:58,676 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:58,749 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:58,750 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:31:58,750 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:58,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:58,750 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:58,750 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:58,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2070 [2022-12-06 07:31:58,750 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-06 07:31:58,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:58,751 INFO L85 PathProgramCache]: Analyzing trace with hash 541732526, now seen corresponding path program 1 times [2022-12-06 07:31:58,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:58,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034241740] [2022-12-06 07:31:58,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:58,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:58,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-06 07:31:58,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:58,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034241740] [2022-12-06 07:31:58,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034241740] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:58,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:58,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:58,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011278745] [2022-12-06 07:31:58,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:58,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:58,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:58,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:58,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:58,814 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:58,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:58,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:58,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:58,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:58,856 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:58,857 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:58,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:58,857 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:58,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:58,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:58,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:58,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:58,858 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:58,858 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:58,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:58,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:58,858 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:58,858 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:58,859 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:58,859 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:58,859 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:58,859 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:58,859 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:58,859 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:58,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:58,861 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:58,861 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:58,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:58,861 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:58,861 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:58,934 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:58,935 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:31:58,935 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:58,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:58,935 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:58,935 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:58,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2071 [2022-12-06 07:31:58,935 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-06 07:31:58,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:58,935 INFO L85 PathProgramCache]: Analyzing trace with hash 568514635, now seen corresponding path program 1 times [2022-12-06 07:31:58,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:58,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302020635] [2022-12-06 07:31:58,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:58,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:59,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:31:59,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:59,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302020635] [2022-12-06 07:31:59,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302020635] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:59,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:59,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:59,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357649720] [2022-12-06 07:31:59,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:59,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:59,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:59,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:59,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:59,003 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:59,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:59,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:59,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:59,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:59,044 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:59,045 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:59,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:59,045 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:59,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:59,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:59,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:59,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:59,046 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:59,046 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:59,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:59,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:59,046 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:59,046 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:59,046 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:59,047 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:59,047 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:59,047 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:59,047 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:59,047 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:59,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:59,049 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:59,049 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:59,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:59,049 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:59,049 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:59,122 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:59,123 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:31:59,123 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:59,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:59,123 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:59,123 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:59,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2072 [2022-12-06 07:31:59,124 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-06 07:31:59,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:59,124 INFO L85 PathProgramCache]: Analyzing trace with hash 598990828, now seen corresponding path program 1 times [2022-12-06 07:31:59,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:59,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98793904] [2022-12-06 07:31:59,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:59,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:59,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-06 07:31:59,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:59,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98793904] [2022-12-06 07:31:59,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98793904] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:59,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:59,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:59,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124673045] [2022-12-06 07:31:59,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:59,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:59,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:59,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:59,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:59,195 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:59,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:59,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:59,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:59,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:59,238 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:59,238 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:59,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:59,239 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:59,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:59,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:59,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:59,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:59,239 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:59,239 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:59,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:59,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:59,240 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:59,240 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:59,240 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:59,240 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:59,240 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:59,240 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:59,240 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:59,240 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:59,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:59,243 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:59,243 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:59,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:59,243 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:59,243 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:59,317 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:59,318 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:31:59,318 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:59,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:59,318 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:59,318 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:59,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2073 [2022-12-06 07:31:59,318 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-06 07:31:59,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:59,318 INFO L85 PathProgramCache]: Analyzing trace with hash 625772937, now seen corresponding path program 1 times [2022-12-06 07:31:59,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:59,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032445113] [2022-12-06 07:31:59,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:59,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:59,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-06 07:31:59,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:59,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032445113] [2022-12-06 07:31:59,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032445113] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:59,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:59,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:59,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082336332] [2022-12-06 07:31:59,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:59,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:59,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:59,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:59,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:59,384 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:59,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:59,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:59,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:59,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:59,419 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:59,419 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:59,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:59,420 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:59,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:59,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:59,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:59,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:59,420 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:59,421 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:59,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:59,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:59,421 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:59,421 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:59,421 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:59,421 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:59,421 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:59,422 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:59,422 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:59,422 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:59,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:59,424 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:59,424 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:59,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:59,424 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:59,424 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:59,498 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:59,498 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:31:59,498 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:59,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:59,499 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:59,499 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:59,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2074 [2022-12-06 07:31:59,499 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-06 07:31:59,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:59,499 INFO L85 PathProgramCache]: Analyzing trace with hash 656249130, now seen corresponding path program 1 times [2022-12-06 07:31:59,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:59,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14964017] [2022-12-06 07:31:59,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:59,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:59,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-06 07:31:59,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:59,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14964017] [2022-12-06 07:31:59,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14964017] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:59,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:59,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:59,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303635523] [2022-12-06 07:31:59,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:59,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:59,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:59,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:59,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:59,564 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:59,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:59,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:59,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:59,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:59,601 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:59,601 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:31:59,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:59,601 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:59,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:59,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:59,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:59,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:59,602 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:59,602 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:59,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:59,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:59,603 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:59,603 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:59,603 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:59,603 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:59,603 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:59,603 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:59,603 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:59,603 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:59,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:59,605 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:59,605 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:59,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:59,606 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:59,606 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:31:59,682 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:59,683 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:31:59,683 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:31:59,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:59,683 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:59,684 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:59,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2075 [2022-12-06 07:31:59,684 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-06 07:31:59,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:59,684 INFO L85 PathProgramCache]: Analyzing trace with hash 683031239, now seen corresponding path program 1 times [2022-12-06 07:31:59,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:59,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015141261] [2022-12-06 07:31:59,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:59,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:59,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-06 07:31:59,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:59,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015141261] [2022-12-06 07:31:59,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015141261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:59,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:59,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:59,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652855603] [2022-12-06 07:31:59,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:59,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:59,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:59,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:59,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:59,750 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:59,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:59,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:59,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:59,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:59,784 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:31:59,784 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:31:59,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:31:59,784 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:31:59,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:59,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:59,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:59,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:59,785 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:59,785 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:59,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:59,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:59,786 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:59,786 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:59,786 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:59,786 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:59,786 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:59,786 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:59,786 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:59,786 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:59,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:59,788 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:31:59,788 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:31:59,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:31:59,789 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:59,789 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:31:59,866 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:59,866 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:31:59,866 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:31:59,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:59,867 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:59,867 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:59,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2076 [2022-12-06 07:31:59,867 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-06 07:31:59,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:59,867 INFO L85 PathProgramCache]: Analyzing trace with hash 713507432, now seen corresponding path program 1 times [2022-12-06 07:31:59,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:59,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933860784] [2022-12-06 07:31:59,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:59,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:59,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-06 07:31:59,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:59,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933860784] [2022-12-06 07:31:59,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933860784] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:59,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:59,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:31:59,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388887420] [2022-12-06 07:31:59,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:59,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:59,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:59,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:59,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:59,936 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:31:59,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:31:59,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:59,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:31:59,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:59,973 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:31:59,974 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:31:59,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:31:59,974 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:31:59,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:59,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:59,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:59,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:31:59,975 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:31:59,975 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:31:59,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:31:59,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:59,975 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:59,975 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:31:59,976 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:31:59,976 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:59,976 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:59,976 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:59,976 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:59,976 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:59,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:59,978 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:31:59,978 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:31:59,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:31:59,978 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:31:59,978 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:00,052 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:00,053 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:00,053 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:00,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:00,053 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:00,053 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:00,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2077 [2022-12-06 07:32:00,054 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-06 07:32:00,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:00,054 INFO L85 PathProgramCache]: Analyzing trace with hash 740289541, now seen corresponding path program 1 times [2022-12-06 07:32:00,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:00,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251211191] [2022-12-06 07:32:00,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:00,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:00,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-06 07:32:00,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:00,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251211191] [2022-12-06 07:32:00,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251211191] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:00,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:00,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:00,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133368046] [2022-12-06 07:32:00,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:00,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:00,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:00,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:00,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:00,121 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:00,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:00,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:00,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:00,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:00,161 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:00,162 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:00,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:00,162 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:00,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:00,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:00,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:00,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:00,163 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:00,163 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:00,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:00,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:00,163 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:00,164 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:00,164 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:00,164 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:00,164 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:00,164 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:00,164 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:00,164 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:00,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:00,166 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:00,166 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:00,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:00,167 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:00,167 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:00,251 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:00,252 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 07:32:00,252 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:00,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:00,252 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:00,252 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:00,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2078 [2022-12-06 07:32:00,252 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-06 07:32:00,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:00,252 INFO L85 PathProgramCache]: Analyzing trace with hash 770765734, now seen corresponding path program 1 times [2022-12-06 07:32:00,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:00,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738997246] [2022-12-06 07:32:00,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:00,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:00,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:00,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-06 07:32:00,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:00,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738997246] [2022-12-06 07:32:00,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738997246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:00,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:00,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:00,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502909475] [2022-12-06 07:32:00,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:00,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:00,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:00,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:00,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:00,317 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:00,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:00,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:00,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:00,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:00,359 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:00,359 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:00,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:00,359 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:00,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:00,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:00,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:00,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:00,360 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:00,360 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:00,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:00,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:00,361 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:00,361 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:00,361 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:00,361 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:00,361 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:00,361 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:00,361 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:00,361 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:00,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:00,363 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:00,363 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:00,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:00,364 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:00,364 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:00,438 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:00,439 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:00,439 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:00,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:00,439 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:00,439 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:00,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2079 [2022-12-06 07:32:00,439 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-06 07:32:00,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:00,439 INFO L85 PathProgramCache]: Analyzing trace with hash 797547843, now seen corresponding path program 1 times [2022-12-06 07:32:00,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:00,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794439583] [2022-12-06 07:32:00,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:00,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:00,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-06 07:32:00,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:00,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794439583] [2022-12-06 07:32:00,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794439583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:00,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:00,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:00,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739396399] [2022-12-06 07:32:00,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:00,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:00,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:00,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:00,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:00,501 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:00,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:00,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:00,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:00,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:00,541 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:00,541 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:00,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:00,542 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:00,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:00,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:00,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:00,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:00,542 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:00,542 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:00,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:00,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:00,543 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:00,543 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:00,543 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:00,543 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:00,543 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:00,544 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:00,544 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:00,544 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:00,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:00,546 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:00,546 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:00,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:00,546 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:00,546 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:00,619 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:00,620 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:00,620 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:00,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:00,620 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:00,620 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:00,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2080 [2022-12-06 07:32:00,620 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-06 07:32:00,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:00,620 INFO L85 PathProgramCache]: Analyzing trace with hash 828024036, now seen corresponding path program 1 times [2022-12-06 07:32:00,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:00,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068515576] [2022-12-06 07:32:00,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:00,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:00,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:00,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-06 07:32:00,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:00,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068515576] [2022-12-06 07:32:00,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068515576] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:00,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:00,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:00,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925205774] [2022-12-06 07:32:00,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:00,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:00,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:00,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:00,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:00,685 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:00,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:00,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:00,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:00,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:00,721 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:00,722 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:00,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:00,722 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:00,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:00,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:00,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:00,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:00,723 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:00,723 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:00,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:00,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:00,723 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:00,723 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:00,724 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:00,724 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:00,724 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:00,724 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:00,724 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:00,724 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:00,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:00,726 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:00,726 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:00,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:00,726 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:00,726 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:00,800 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:00,801 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:00,801 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:00,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:00,802 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:00,802 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:00,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2081 [2022-12-06 07:32:00,802 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-06 07:32:00,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:00,802 INFO L85 PathProgramCache]: Analyzing trace with hash 854806145, now seen corresponding path program 1 times [2022-12-06 07:32:00,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:00,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756260343] [2022-12-06 07:32:00,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:00,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:00,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-06 07:32:00,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:00,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756260343] [2022-12-06 07:32:00,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756260343] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:00,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:00,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:00,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289176138] [2022-12-06 07:32:00,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:00,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:00,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:00,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:00,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:00,870 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:00,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:00,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:00,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:00,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:00,906 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:00,906 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:00,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:00,907 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:00,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:00,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:00,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:00,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:00,907 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:00,907 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:00,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:00,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:00,908 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:00,908 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:00,908 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:00,908 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:00,908 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:00,909 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:00,909 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:00,909 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:00,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:00,911 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:00,911 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:00,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:00,911 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:00,911 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:00,985 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:00,986 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:00,986 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:00,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:00,986 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:00,986 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:00,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2082 [2022-12-06 07:32:00,986 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-06 07:32:00,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:00,987 INFO L85 PathProgramCache]: Analyzing trace with hash 885282338, now seen corresponding path program 1 times [2022-12-06 07:32:00,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:00,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445290219] [2022-12-06 07:32:00,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:00,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:01,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-06 07:32:01,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:01,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445290219] [2022-12-06 07:32:01,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445290219] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:01,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:01,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:01,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660756073] [2022-12-06 07:32:01,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:01,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:01,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:01,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:01,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:01,054 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:01,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:01,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:01,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:01,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:01,096 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:01,096 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:01,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:01,097 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:01,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:01,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:01,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:01,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:01,097 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:01,098 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:01,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:01,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:01,098 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:01,098 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:01,098 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:01,098 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:01,099 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:01,099 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:01,099 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:01,099 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:01,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:01,101 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:01,101 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:01,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:01,101 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:01,101 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:01,175 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:01,176 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:01,176 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:01,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:01,176 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:01,176 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:01,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2083 [2022-12-06 07:32:01,176 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-06 07:32:01,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:01,177 INFO L85 PathProgramCache]: Analyzing trace with hash 912064447, now seen corresponding path program 1 times [2022-12-06 07:32:01,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:01,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804761454] [2022-12-06 07:32:01,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:01,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:01,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-06 07:32:01,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:01,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804761454] [2022-12-06 07:32:01,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804761454] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:01,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:01,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:01,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663411107] [2022-12-06 07:32:01,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:01,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:01,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:01,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:01,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:01,244 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:01,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:01,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:01,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:01,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:01,288 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:01,289 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:01,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:01,289 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:01,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:01,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:01,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:01,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:01,290 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:01,290 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:01,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:01,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:01,291 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:01,291 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:01,291 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:01,291 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:01,291 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:01,291 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:01,291 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:01,291 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:01,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:01,293 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:01,293 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:01,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:01,294 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:01,294 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:01,366 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:01,367 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:32:01,367 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:01,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:01,367 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:01,367 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:01,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2084 [2022-12-06 07:32:01,368 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-06 07:32:01,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:01,368 INFO L85 PathProgramCache]: Analyzing trace with hash 942540640, now seen corresponding path program 1 times [2022-12-06 07:32:01,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:01,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890415899] [2022-12-06 07:32:01,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:01,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:01,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-06 07:32:01,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:01,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890415899] [2022-12-06 07:32:01,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890415899] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:01,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:01,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:01,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133769908] [2022-12-06 07:32:01,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:01,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:01,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:01,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:01,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:01,430 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:01,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:01,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:01,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:01,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:01,472 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:01,472 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:01,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:01,472 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:01,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:01,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:01,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:01,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:01,473 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:01,473 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:01,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:01,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:01,474 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:01,474 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:01,474 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:01,474 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:01,474 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:01,474 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:01,474 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:01,474 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:01,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:01,476 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:01,477 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:01,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:01,477 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:01,477 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:01,549 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:01,550 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:32:01,550 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:01,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:01,550 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:01,550 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:01,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2085 [2022-12-06 07:32:01,550 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-06 07:32:01,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:01,551 INFO L85 PathProgramCache]: Analyzing trace with hash 969322749, now seen corresponding path program 1 times [2022-12-06 07:32:01,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:01,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359825106] [2022-12-06 07:32:01,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:01,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:01,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-06 07:32:01,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:01,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359825106] [2022-12-06 07:32:01,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359825106] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:01,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:01,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:01,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498228800] [2022-12-06 07:32:01,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:01,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:01,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:01,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:01,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:01,616 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:01,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:01,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:01,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:01,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:01,657 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:01,657 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:01,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:01,658 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:01,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:01,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:01,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:01,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:01,658 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:01,658 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:01,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:01,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:01,659 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:01,659 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:01,659 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:01,659 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:01,659 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:01,659 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:01,659 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:01,659 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:01,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:01,662 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:01,662 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:01,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:01,662 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:01,662 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:01,735 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:01,736 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:01,736 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:01,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:01,736 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:01,736 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:01,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2086 [2022-12-06 07:32:01,736 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-06 07:32:01,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:01,736 INFO L85 PathProgramCache]: Analyzing trace with hash 999798942, now seen corresponding path program 1 times [2022-12-06 07:32:01,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:01,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784079562] [2022-12-06 07:32:01,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:01,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:01,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-06 07:32:01,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:01,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784079562] [2022-12-06 07:32:01,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784079562] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:01,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:01,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:01,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246379660] [2022-12-06 07:32:01,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:01,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:01,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:01,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:01,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:01,802 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:01,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:01,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:01,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:01,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:01,838 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:01,838 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:01,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:01,839 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:01,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:01,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:01,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:01,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:01,839 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:01,839 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:01,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:01,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:01,840 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:01,840 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:01,840 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:01,840 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:01,840 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:01,840 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:01,841 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:01,841 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:01,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:01,843 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:01,843 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:01,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:01,843 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:01,843 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:01,918 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:01,919 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:01,919 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:01,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:01,919 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:01,919 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:01,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2087 [2022-12-06 07:32:01,919 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-06 07:32:01,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:01,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1026581051, now seen corresponding path program 1 times [2022-12-06 07:32:01,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:01,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763837512] [2022-12-06 07:32:01,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:01,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:01,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-06 07:32:01,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:01,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763837512] [2022-12-06 07:32:01,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763837512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:01,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:01,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:01,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954243376] [2022-12-06 07:32:01,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:01,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:01,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:01,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:01,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:01,987 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:01,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:01,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:01,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:01,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:02,028 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:02,028 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:02,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:02,028 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:02,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:02,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:02,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:02,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:02,029 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:02,029 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:02,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:02,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:02,030 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:02,030 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:02,030 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:02,030 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:02,030 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:02,030 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:02,030 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:02,030 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:02,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:02,032 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:02,032 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:02,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:02,033 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:02,033 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:02,107 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:02,107 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:02,108 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:02,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:02,108 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:02,108 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:02,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2088 [2022-12-06 07:32:02,108 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-06 07:32:02,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:02,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1057057244, now seen corresponding path program 1 times [2022-12-06 07:32:02,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:02,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755627262] [2022-12-06 07:32:02,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:02,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:02,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-06 07:32:02,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:02,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755627262] [2022-12-06 07:32:02,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755627262] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:02,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:02,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:02,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503102149] [2022-12-06 07:32:02,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:02,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:02,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:02,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:02,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:02,174 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:02,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:02,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:02,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:02,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:02,215 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:02,216 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:02,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:02,216 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:02,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:02,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:02,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:02,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:02,217 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:02,217 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:02,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:02,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:02,217 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:02,217 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:02,218 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:02,218 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:02,218 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:02,218 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:02,218 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:02,218 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:02,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:02,220 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:02,220 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:02,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:02,220 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:02,221 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:02,294 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:02,295 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:02,295 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:02,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:02,295 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:02,296 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:02,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2089 [2022-12-06 07:32:02,296 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-06 07:32:02,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:02,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1083839353, now seen corresponding path program 1 times [2022-12-06 07:32:02,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:02,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616361358] [2022-12-06 07:32:02,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:02,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:02,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-06 07:32:02,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:02,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616361358] [2022-12-06 07:32:02,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616361358] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:02,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:02,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:02,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418977724] [2022-12-06 07:32:02,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:02,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:02,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:02,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:02,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:02,375 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:02,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:02,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:02,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:02,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:02,416 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:02,416 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:02,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:02,416 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:02,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:02,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:02,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:02,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:02,417 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:02,417 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:02,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:02,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:02,418 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:02,418 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:02,418 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:02,418 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:02,418 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:02,418 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:02,418 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:02,418 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:02,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:02,420 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:02,420 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:02,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:02,421 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:02,421 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:02,494 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:02,495 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:02,495 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:02,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:02,495 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:02,496 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:02,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2090 [2022-12-06 07:32:02,496 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-06 07:32:02,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:02,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1114315546, now seen corresponding path program 1 times [2022-12-06 07:32:02,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:02,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233935651] [2022-12-06 07:32:02,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:02,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:02,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-06 07:32:02,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:02,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233935651] [2022-12-06 07:32:02,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233935651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:02,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:02,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:02,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573870305] [2022-12-06 07:32:02,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:02,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:02,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:02,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:02,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:02,561 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:02,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:02,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:02,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:02,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:02,598 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:02,598 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:02,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:02,598 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:02,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:02,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:02,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:02,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:02,599 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:02,599 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:02,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:02,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:02,599 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:02,599 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:02,600 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:02,600 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:02,600 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:02,600 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:02,600 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:02,600 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:02,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:02,602 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:02,602 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:02,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:02,602 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:02,602 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:02,675 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:02,676 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:32:02,676 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:02,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:02,676 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:02,676 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:02,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2091 [2022-12-06 07:32:02,676 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-06 07:32:02,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:02,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1141097655, now seen corresponding path program 1 times [2022-12-06 07:32:02,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:02,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537886935] [2022-12-06 07:32:02,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:02,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:02,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-06 07:32:02,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:02,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537886935] [2022-12-06 07:32:02,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537886935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:02,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:02,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:02,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716577181] [2022-12-06 07:32:02,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:02,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:02,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:02,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:02,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:02,744 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:02,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:02,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:02,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:02,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:02,778 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:02,778 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:02,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 378 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:02,778 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:02,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:02,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:02,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:02,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:02,779 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:02,779 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:02,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:02,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:02,780 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:02,780 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:02,780 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:02,780 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:02,780 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:02,780 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:02,780 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:02,780 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:02,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:02,782 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:02,782 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:02,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:02,783 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:02,783 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:02,855 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:02,856 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:32:02,856 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:02,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:02,856 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:02,856 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:02,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2092 [2022-12-06 07:32:02,856 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-06 07:32:02,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:02,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1171573848, now seen corresponding path program 1 times [2022-12-06 07:32:02,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:02,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702713934] [2022-12-06 07:32:02,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:02,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:02,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:02,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:02,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:02,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702713934] [2022-12-06 07:32:02,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702713934] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:02,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:02,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:02,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850436270] [2022-12-06 07:32:02,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:02,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:02,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:02,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:02,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:02,920 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:02,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:02,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:02,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:02,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:02,956 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:02,956 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:02,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:02,957 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:02,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:02,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:02,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:02,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:02,957 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:02,957 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:02,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:02,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:02,958 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:02,958 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:02,958 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:02,958 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:02,958 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:02,958 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:02,958 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:02,958 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:02,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:02,960 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:02,961 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:02,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:02,961 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:02,961 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:03,035 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:03,036 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:03,036 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:03,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:03,036 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:03,036 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:03,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2093 [2022-12-06 07:32:03,036 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-06 07:32:03,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:03,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1198355957, now seen corresponding path program 1 times [2022-12-06 07:32:03,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:03,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066087351] [2022-12-06 07:32:03,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:03,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:03,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-06 07:32:03,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:03,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066087351] [2022-12-06 07:32:03,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066087351] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:03,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:03,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:03,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583911718] [2022-12-06 07:32:03,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:03,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:03,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:03,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:03,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:03,103 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:03,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:03,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:03,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:03,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:03,139 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:03,139 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:03,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:03,140 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:03,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:03,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:03,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:03,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:03,140 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:03,140 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:03,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:03,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:03,141 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:03,141 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:03,141 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:03,141 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:03,141 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:03,141 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:03,141 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:03,141 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:03,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:03,144 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:03,144 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:03,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:03,144 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:03,144 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:03,218 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:03,219 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:03,219 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:03,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:03,219 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:03,219 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:03,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2094 [2022-12-06 07:32:03,219 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-06 07:32:03,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:03,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1228832150, now seen corresponding path program 1 times [2022-12-06 07:32:03,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:03,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256852346] [2022-12-06 07:32:03,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:03,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:03,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-06 07:32:03,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:03,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256852346] [2022-12-06 07:32:03,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256852346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:03,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:03,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:03,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462662973] [2022-12-06 07:32:03,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:03,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:03,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:03,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:03,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:03,284 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:03,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:03,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:03,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:03,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:03,320 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:03,320 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:03,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:03,320 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:03,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:03,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:03,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:03,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:03,321 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:03,321 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:03,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:03,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:03,321 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:03,321 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:03,322 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:03,322 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:03,322 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:03,322 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:03,322 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:03,322 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:03,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:03,324 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:03,324 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:03,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:03,324 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:03,325 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:03,399 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:03,400 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:03,400 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:03,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:03,400 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:03,400 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:03,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2095 [2022-12-06 07:32:03,401 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-06 07:32:03,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:03,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1255614259, now seen corresponding path program 1 times [2022-12-06 07:32:03,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:03,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143795994] [2022-12-06 07:32:03,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:03,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:03,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-06 07:32:03,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:03,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143795994] [2022-12-06 07:32:03,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143795994] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:03,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:03,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:03,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930195899] [2022-12-06 07:32:03,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:03,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:03,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:03,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:03,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:03,480 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:03,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:03,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:03,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:03,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:03,521 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:03,521 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:03,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:03,522 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:03,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:03,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:03,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:03,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:03,522 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:03,522 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:03,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:03,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:03,523 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:03,523 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:03,523 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:03,523 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:03,523 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:03,524 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:03,524 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:03,524 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:03,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:03,526 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:03,526 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:03,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:03,526 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:03,526 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:03,601 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:03,602 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:03,602 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:03,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:03,602 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:03,602 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:03,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2096 [2022-12-06 07:32:03,602 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-06 07:32:03,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:03,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1286090452, now seen corresponding path program 1 times [2022-12-06 07:32:03,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:03,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289633996] [2022-12-06 07:32:03,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:03,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32: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-06 07:32:03,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:03,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289633996] [2022-12-06 07:32:03,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289633996] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:03,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:03,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:03,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262586027] [2022-12-06 07:32:03,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:03,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:03,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:03,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:03,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:03,668 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:03,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:03,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:03,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:03,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:03,704 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:03,704 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:03,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:03,705 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:03,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:03,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:03,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:03,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:03,705 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:03,705 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:03,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:03,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:03,706 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:03,706 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:03,706 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:03,706 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:03,706 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:03,706 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:03,706 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:03,706 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:03,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:03,708 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:03,709 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:03,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:03,709 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:03,709 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:03,782 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:03,783 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:03,783 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:03,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:03,783 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:03,783 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:03,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2097 [2022-12-06 07:32:03,783 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-06 07:32:03,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:03,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1312872561, now seen corresponding path program 1 times [2022-12-06 07:32:03,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:03,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134211441] [2022-12-06 07:32:03,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:03,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:03,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-06 07:32:03,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:03,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134211441] [2022-12-06 07:32:03,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134211441] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:03,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:03,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:03,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682295786] [2022-12-06 07:32:03,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:03,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:03,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:03,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:03,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:03,849 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:03,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:03,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:03,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:03,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:03,888 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:03,888 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:03,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:03,888 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:03,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:03,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:03,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:03,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:03,889 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:03,889 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:03,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:03,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:03,889 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:03,889 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:03,890 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:03,890 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:03,890 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:03,890 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:03,890 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:03,890 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:03,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:03,892 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:03,892 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:03,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:03,892 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:03,892 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:03,965 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:03,966 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:32:03,966 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:03,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:03,966 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:03,966 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:03,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2098 [2022-12-06 07:32:03,966 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-06 07:32:03,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:03,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1343348754, now seen corresponding path program 1 times [2022-12-06 07:32:03,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:03,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374066275] [2022-12-06 07:32:03,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:03,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:04,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:04,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:04,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374066275] [2022-12-06 07:32:04,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374066275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:04,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:04,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:04,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847209428] [2022-12-06 07:32:04,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:04,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:04,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:04,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:04,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:04,029 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:04,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:04,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:04,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:04,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:04,070 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:04,070 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:04,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:04,071 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:04,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:04,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:04,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:04,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:04,071 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:04,071 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:04,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:04,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:04,072 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:04,072 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:04,072 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:04,072 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:04,072 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:04,072 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:04,072 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:04,072 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:04,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:04,074 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:04,074 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:04,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:04,075 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:04,075 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:04,148 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:04,149 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:04,149 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:04,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:04,149 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:04,149 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:04,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2099 [2022-12-06 07:32:04,149 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-06 07:32:04,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:04,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1370130863, now seen corresponding path program 1 times [2022-12-06 07:32:04,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:04,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106178555] [2022-12-06 07:32:04,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:04,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:04,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-06 07:32:04,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:04,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106178555] [2022-12-06 07:32:04,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106178555] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:04,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:04,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:04,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185780432] [2022-12-06 07:32:04,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:04,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:04,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:04,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:04,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:04,229 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:04,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:04,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:04,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:04,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:04,266 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:04,266 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:04,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:04,266 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:04,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:04,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:04,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:04,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:04,267 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:04,267 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:04,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:04,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:04,268 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:04,268 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:04,268 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:04,268 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:04,268 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:04,268 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:04,268 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:04,268 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:04,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:04,270 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:04,271 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:04,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:04,271 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:04,271 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:04,344 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:04,345 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:04,345 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:04,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:04,345 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:04,345 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:04,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2100 [2022-12-06 07:32:04,345 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-06 07:32:04,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:04,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1400607056, now seen corresponding path program 1 times [2022-12-06 07:32:04,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:04,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721484717] [2022-12-06 07:32:04,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:04,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:04,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-06 07:32:04,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:04,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721484717] [2022-12-06 07:32:04,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721484717] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:04,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:04,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:04,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653576254] [2022-12-06 07:32:04,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:04,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:04,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:04,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:04,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:04,408 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:04,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:04,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:04,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:04,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:04,444 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:04,444 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:04,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:04,444 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:04,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:04,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:04,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:04,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:04,445 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:04,445 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:04,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:04,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:04,446 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:04,446 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:04,446 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:04,446 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:04,446 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:04,446 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:04,446 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:04,446 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:04,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:04,448 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:04,448 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:04,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:04,449 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:04,449 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:04,523 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:04,524 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:04,524 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:04,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:04,525 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:04,525 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:04,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2101 [2022-12-06 07:32:04,525 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-06 07:32:04,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:04,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1427389165, now seen corresponding path program 1 times [2022-12-06 07:32:04,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:04,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618545139] [2022-12-06 07:32:04,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:04,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:04,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-06 07:32:04,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:04,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618545139] [2022-12-06 07:32:04,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618545139] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:04,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:04,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:04,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67690672] [2022-12-06 07:32:04,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:04,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:04,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:04,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:04,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:04,604 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:04,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:04,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:04,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:04,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:04,639 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:04,639 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:04,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:04,640 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:04,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:04,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:04,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:04,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:04,640 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:04,640 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:04,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:04,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:04,641 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:04,641 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:04,641 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:04,641 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:04,641 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:04,642 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:04,642 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:04,642 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:04,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:04,644 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:04,644 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:04,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:04,644 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:04,644 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:04,715 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:04,716 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:32:04,716 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:04,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:04,716 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:04,716 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:04,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2102 [2022-12-06 07:32:04,717 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-06 07:32:04,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:04,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1457865358, now seen corresponding path program 1 times [2022-12-06 07:32:04,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:04,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402603494] [2022-12-06 07:32:04,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:04,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:04,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-06 07:32:04,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:04,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402603494] [2022-12-06 07:32:04,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402603494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:04,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:04,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:04,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123650890] [2022-12-06 07:32:04,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:04,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:04,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:04,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:04,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:04,781 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:04,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:04,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:04,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:04,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:04,817 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:04,817 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:04,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:04,818 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:04,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:04,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:04,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:04,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:04,818 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:04,818 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:04,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:04,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:04,819 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:04,819 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:04,819 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:04,819 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:04,819 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:04,820 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:04,820 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:04,820 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:04,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:04,822 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:04,822 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:04,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:04,822 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:04,822 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:04,897 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:04,897 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:04,897 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:04,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:04,898 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:04,898 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:04,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2103 [2022-12-06 07:32:04,898 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-06 07:32:04,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:04,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1484647467, now seen corresponding path program 1 times [2022-12-06 07:32:04,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:04,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504125622] [2022-12-06 07:32:04,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:04,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:04,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-06 07:32:04,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:04,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504125622] [2022-12-06 07:32:04,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504125622] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:04,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:04,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:04,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906905798] [2022-12-06 07:32:04,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:04,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:04,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:04,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:04,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:04,965 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:04,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:04,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:04,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:04,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:04,999 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:04,999 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:04,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:04,999 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:05,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:05,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:05,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:05,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:05,000 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:05,000 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:05,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:05,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:05,001 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:05,001 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:05,001 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:05,001 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:05,001 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:05,001 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:05,001 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:05,001 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:05,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:05,004 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:05,004 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:05,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:05,004 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:05,004 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:05,076 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:05,077 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:32:05,077 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:05,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:05,077 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:05,077 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:05,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2104 [2022-12-06 07:32:05,077 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-06 07:32:05,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:05,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1515123660, now seen corresponding path program 1 times [2022-12-06 07:32:05,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:05,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466554008] [2022-12-06 07:32:05,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:05,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:05,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:05,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:05,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466554008] [2022-12-06 07:32:05,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466554008] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:05,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:05,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:05,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095749937] [2022-12-06 07:32:05,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:05,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:05,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:05,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:05,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:05,142 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:05,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:05,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:05,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:05,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:05,182 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:05,182 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:05,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:05,183 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:05,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:05,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:05,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:05,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:05,183 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:05,183 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:05,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:05,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:05,184 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:05,184 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:05,184 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:05,184 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:05,184 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:05,185 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:05,185 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:05,185 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:05,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:05,187 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:05,187 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:05,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:05,187 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:05,187 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:05,258 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:05,259 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:32:05,259 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:05,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:05,259 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:05,259 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:05,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2105 [2022-12-06 07:32:05,259 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-06 07:32:05,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:05,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1541905769, now seen corresponding path program 1 times [2022-12-06 07:32:05,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:05,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033992561] [2022-12-06 07:32:05,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:05,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:05,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:05,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:05,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033992561] [2022-12-06 07:32:05,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033992561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:05,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:05,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:05,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418108782] [2022-12-06 07:32:05,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:05,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:05,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:05,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:05,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:05,323 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:05,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:05,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:05,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:05,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:05,363 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:05,363 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:05,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:05,363 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:05,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:05,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:05,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:05,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:05,364 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:05,364 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:05,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:05,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:05,365 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:05,365 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:05,365 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:05,365 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:05,365 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:05,365 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:05,365 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:05,365 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:05,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:05,367 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:05,367 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:05,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:05,368 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:05,368 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:05,439 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:05,439 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:32:05,440 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:05,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:05,440 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:05,440 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:05,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2106 [2022-12-06 07:32:05,440 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-06 07:32:05,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:05,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1572381962, now seen corresponding path program 1 times [2022-12-06 07:32:05,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:05,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280053990] [2022-12-06 07:32:05,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:05,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32: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-06 07:32:05,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:05,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280053990] [2022-12-06 07:32:05,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280053990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:05,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:05,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:05,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554899079] [2022-12-06 07:32:05,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:05,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:05,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:05,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:05,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:05,503 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:05,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:05,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:05,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:05,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:05,539 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:05,539 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:05,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:05,540 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:05,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:05,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:05,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:05,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:05,540 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:05,540 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:05,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:05,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:05,541 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:05,541 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:05,541 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:05,541 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:05,541 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:05,541 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:05,541 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:05,541 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:05,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:05,544 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:05,544 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:05,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:05,544 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:05,544 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:05,617 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:05,618 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:05,618 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:05,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:05,618 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:05,618 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:05,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2107 [2022-12-06 07:32:05,618 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-06 07:32:05,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:05,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1599164071, now seen corresponding path program 1 times [2022-12-06 07:32:05,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:05,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940786906] [2022-12-06 07:32:05,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:05,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:05,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-06 07:32:05,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:05,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940786906] [2022-12-06 07:32:05,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940786906] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:05,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:05,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:05,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652984377] [2022-12-06 07:32:05,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:05,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:05,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:05,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:05,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:05,696 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:05,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:05,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:05,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:05,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:05,737 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:05,737 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:05,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:05,738 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:05,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:05,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:05,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:05,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:05,738 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:05,738 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:05,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:05,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:05,739 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:05,739 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:05,739 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:05,739 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:05,739 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:05,739 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:05,739 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:05,740 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:05,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:05,742 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:05,742 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:05,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:05,742 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:05,742 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:05,814 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:05,815 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:32:05,815 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:05,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:05,815 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:05,815 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:05,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2108 [2022-12-06 07:32:05,816 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-06 07:32:05,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:05,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1629640264, now seen corresponding path program 1 times [2022-12-06 07:32:05,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:05,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998276615] [2022-12-06 07:32:05,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:05,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:05,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-06 07:32:05,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:05,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998276615] [2022-12-06 07:32:05,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998276615] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:05,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:05,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:05,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777155748] [2022-12-06 07:32:05,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:05,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:05,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:05,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:05,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:05,880 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:05,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:05,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:05,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:05,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:05,922 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:05,922 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:05,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:05,922 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:05,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:05,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:05,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:05,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:05,923 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:05,923 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:05,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:05,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:05,924 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:05,924 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:05,924 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:05,924 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:05,924 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:05,924 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:05,924 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:05,924 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:05,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:05,926 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:05,926 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:05,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:05,927 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:05,927 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:05,999 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:06,000 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:32:06,000 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:06,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:06,000 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:06,000 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:06,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2109 [2022-12-06 07:32:06,001 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-06 07:32:06,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:06,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1656422373, now seen corresponding path program 1 times [2022-12-06 07:32:06,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:06,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746711499] [2022-12-06 07:32:06,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:06,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:06,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-06 07:32:06,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:06,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746711499] [2022-12-06 07:32:06,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746711499] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:06,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:06,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:06,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88130032] [2022-12-06 07:32:06,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:06,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:06,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:06,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:06,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:06,075 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:06,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:06,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:06,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:06,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:06,112 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:06,112 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:06,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:06,112 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:06,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:06,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:06,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:06,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:06,113 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:06,113 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:06,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:06,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:06,114 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:06,114 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:06,114 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:06,114 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:06,114 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:06,114 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:06,114 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:06,114 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:06,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:06,116 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:06,117 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:06,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:06,117 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:06,117 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:06,190 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:06,191 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:06,191 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:06,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:06,192 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:06,192 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:06,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2110 [2022-12-06 07:32:06,192 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-06 07:32:06,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:06,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1686898566, now seen corresponding path program 1 times [2022-12-06 07:32:06,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:06,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340163339] [2022-12-06 07:32:06,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:06,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:06,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-06 07:32:06,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:06,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340163339] [2022-12-06 07:32:06,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340163339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:06,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:06,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:06,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876998836] [2022-12-06 07:32:06,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:06,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:06,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:06,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:06,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:06,265 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:06,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:06,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:06,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:06,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:06,302 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:06,302 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:06,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:06,302 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:06,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:06,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:06,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:06,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:06,303 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:06,303 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:06,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:06,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:06,303 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:06,303 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:06,303 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:06,303 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:06,304 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:06,304 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:06,304 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:06,304 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:06,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:06,306 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:06,306 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:06,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:06,306 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:06,306 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:06,379 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:06,380 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:06,380 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:06,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:06,380 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:06,380 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:06,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2111 [2022-12-06 07:32:06,380 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-06 07:32:06,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:06,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1713680675, now seen corresponding path program 1 times [2022-12-06 07:32:06,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:06,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255394493] [2022-12-06 07:32:06,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:06,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:06,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-06 07:32:06,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:06,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255394493] [2022-12-06 07:32:06,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255394493] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:06,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:06,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:06,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946370609] [2022-12-06 07:32:06,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:06,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:06,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:06,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:06,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:06,446 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:06,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:06,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:06,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:06,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:06,487 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:06,487 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:06,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:06,487 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:06,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:06,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:06,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:06,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:06,488 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:06,488 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:06,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:06,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:06,488 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:06,488 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:06,488 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:06,488 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:06,489 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:06,489 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:06,489 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:06,489 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:06,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:06,491 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:06,491 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:06,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 144 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:06,491 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:06,491 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:06,565 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:06,566 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:06,566 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:06,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:06,566 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:06,566 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:06,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2112 [2022-12-06 07:32:06,566 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-06 07:32:06,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:06,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1744156868, now seen corresponding path program 1 times [2022-12-06 07:32:06,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:06,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698757274] [2022-12-06 07:32:06,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:06,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:06,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-06 07:32:06,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:06,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698757274] [2022-12-06 07:32:06,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698757274] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:06,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:06,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:06,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672409789] [2022-12-06 07:32:06,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:06,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:06,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:06,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:06,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:06,637 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:06,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:06,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:06,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:06,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:06,674 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:06,674 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:06,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:06,675 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:06,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:06,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:06,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:06,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:06,675 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:06,675 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:06,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:06,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:06,676 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:06,676 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:06,676 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:06,676 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:06,676 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:06,676 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:06,676 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:06,676 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:06,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:06,679 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:06,679 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:06,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:06,679 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:06,679 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:06,752 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:06,753 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:06,753 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:06,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:06,753 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:06,753 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:06,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2113 [2022-12-06 07:32:06,753 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-06 07:32:06,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:06,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1770938977, now seen corresponding path program 1 times [2022-12-06 07:32:06,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:06,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680255973] [2022-12-06 07:32:06,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:06,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:06,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-06 07:32:06,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:06,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680255973] [2022-12-06 07:32:06,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680255973] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:06,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:06,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:06,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105860044] [2022-12-06 07:32:06,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:06,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:06,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:06,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:06,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:06,826 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:06,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:06,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:06,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:06,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:06,866 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:06,866 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:06,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:06,867 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:06,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:06,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:06,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:06,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:06,867 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:06,867 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:06,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:06,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:06,868 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:06,868 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:06,868 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:06,868 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:06,868 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:06,868 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:06,868 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:06,868 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:06,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:06,870 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:06,871 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:06,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:06,871 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:06,871 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:06,943 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:06,944 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:32:06,944 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:06,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:06,944 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:06,945 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:06,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2114 [2022-12-06 07:32:06,945 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-06 07:32:06,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:06,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1801415170, now seen corresponding path program 1 times [2022-12-06 07:32:06,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:06,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225611042] [2022-12-06 07:32:06,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:06,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:07,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-06 07:32:07,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:07,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225611042] [2022-12-06 07:32:07,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225611042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:07,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:07,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:07,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848323306] [2022-12-06 07:32:07,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:07,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:07,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:07,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:07,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:07,009 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:07,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:07,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:07,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:07,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:07,045 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:07,045 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:07,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:07,046 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:07,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:07,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:07,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:07,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:07,046 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:07,046 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:07,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:07,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:07,047 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:07,047 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:07,047 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:07,047 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:07,047 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:07,047 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:07,047 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:07,047 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:07,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:07,049 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:07,050 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:07,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:07,050 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:07,050 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:07,124 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:07,125 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:07,125 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:07,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:07,125 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:07,125 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:07,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2115 [2022-12-06 07:32:07,125 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-06 07:32:07,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:07,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1828197279, now seen corresponding path program 1 times [2022-12-06 07:32:07,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:07,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633850334] [2022-12-06 07:32:07,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:07,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:07,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-06 07:32:07,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:07,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633850334] [2022-12-06 07:32:07,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633850334] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:07,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:07,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:07,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913775005] [2022-12-06 07:32:07,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:07,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:07,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:07,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:07,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:07,186 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:07,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:07,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:07,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:07,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:07,228 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:07,228 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:07,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:07,228 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:07,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:07,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:07,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:07,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:07,229 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:07,229 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:07,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:07,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:07,229 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:07,229 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:07,230 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:07,230 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:07,230 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:07,230 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:07,230 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:07,230 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:07,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:07,232 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:07,232 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:07,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:07,232 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:07,232 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:07,307 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:07,308 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:07,308 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:07,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:07,308 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:07,308 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:07,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2116 [2022-12-06 07:32:07,308 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-06 07:32:07,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:07,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1858673472, now seen corresponding path program 1 times [2022-12-06 07:32:07,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:07,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137289215] [2022-12-06 07:32:07,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:07,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:07,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-06 07:32:07,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:07,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137289215] [2022-12-06 07:32:07,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137289215] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:07,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:07,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:07,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108514938] [2022-12-06 07:32:07,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:07,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:07,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:07,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:07,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:07,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:07,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:07,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:07,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:07,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:07,407 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:07,407 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:07,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:07,407 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:07,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:07,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:07,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:07,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:07,408 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:07,408 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:07,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:07,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:07,408 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:07,408 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:07,409 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:07,409 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:07,409 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:07,409 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:07,409 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:07,409 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:07,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:07,411 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:07,411 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:07,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:07,411 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:07,411 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:07,484 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:07,485 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:32:07,485 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:07,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:07,485 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:07,485 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:07,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2117 [2022-12-06 07:32:07,485 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-06 07:32:07,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:07,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1885455581, now seen corresponding path program 1 times [2022-12-06 07:32:07,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:07,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894850995] [2022-12-06 07:32:07,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:07,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:07,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:07,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-06 07:32:07,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:07,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894850995] [2022-12-06 07:32:07,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894850995] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:07,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:07,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:07,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717231575] [2022-12-06 07:32:07,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:07,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:07,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:07,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:07,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:07,551 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:07,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:07,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:07,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:07,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:07,591 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:07,592 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:07,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:07,592 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:07,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:07,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:07,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:07,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:07,592 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:07,592 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:07,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:07,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:07,593 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:07,593 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:07,593 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:07,593 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:07,593 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:07,594 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:07,594 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:07,594 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:07,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:07,596 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:07,596 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:07,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:07,596 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:07,596 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:07,670 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:07,671 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:07,671 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:07,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:07,671 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:07,671 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:07,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2118 [2022-12-06 07:32:07,671 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-06 07:32:07,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:07,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1915931774, now seen corresponding path program 1 times [2022-12-06 07:32:07,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:07,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131262385] [2022-12-06 07:32:07,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:07,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:07,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-06 07:32:07,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:07,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131262385] [2022-12-06 07:32:07,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131262385] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:07,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:07,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:07,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90794887] [2022-12-06 07:32:07,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:07,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:07,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:07,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:07,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:07,735 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:07,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:07,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:07,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:07,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:07,772 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:07,772 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:07,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:07,772 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:07,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:07,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:07,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:07,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:07,773 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:07,773 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:07,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:07,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:07,773 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:07,773 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:07,774 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:07,774 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:07,774 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:07,774 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:07,774 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:07,774 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:07,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:07,776 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:07,776 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:07,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:07,776 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:07,776 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:07,849 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:07,850 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:32:07,850 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:07,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:07,850 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:07,850 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:07,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2119 [2022-12-06 07:32:07,850 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-06 07:32:07,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:07,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1942713883, now seen corresponding path program 1 times [2022-12-06 07:32:07,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:07,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107413497] [2022-12-06 07:32:07,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:07,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:07,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-06 07:32:07,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:07,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107413497] [2022-12-06 07:32:07,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107413497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:07,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:07,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:07,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567296711] [2022-12-06 07:32:07,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:07,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:07,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:07,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:07,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:07,923 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:07,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:07,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:07,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:07,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:07,961 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:07,961 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:07,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:07,962 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:07,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:07,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:07,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:07,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:07,962 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:07,962 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:07,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:07,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:07,963 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:07,963 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:07,963 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:07,963 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:07,963 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:07,963 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:07,963 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:07,964 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:07,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:07,966 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:07,966 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:07,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:07,966 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:07,966 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:08,040 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:08,040 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:08,040 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:08,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:08,041 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:08,041 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:08,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2120 [2022-12-06 07:32:08,041 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-06 07:32:08,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:08,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1973190076, now seen corresponding path program 1 times [2022-12-06 07:32:08,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:08,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996536880] [2022-12-06 07:32:08,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:08,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:08,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-06 07:32:08,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:08,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996536880] [2022-12-06 07:32:08,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996536880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:08,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:08,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:08,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776881869] [2022-12-06 07:32:08,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:08,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:08,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:08,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:08,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:08,105 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:08,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:08,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:08,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:08,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:08,146 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:08,146 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:08,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:08,147 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:08,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:08,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:08,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:08,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:08,147 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:08,147 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:08,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:08,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:08,148 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:08,148 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:08,148 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:08,148 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:08,148 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:08,148 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:08,148 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:08,148 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:08,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:08,150 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:08,151 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:08,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:08,151 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:08,151 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:08,224 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:08,225 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:08,225 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:08,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:08,225 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:08,225 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:08,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2121 [2022-12-06 07:32:08,225 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-06 07:32:08,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:08,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1999972185, now seen corresponding path program 1 times [2022-12-06 07:32:08,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:08,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613513411] [2022-12-06 07:32:08,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:08,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:08,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-06 07:32:08,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:08,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613513411] [2022-12-06 07:32:08,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613513411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:08,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:08,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:08,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52321626] [2022-12-06 07:32:08,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:08,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:08,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:08,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:08,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:08,290 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:08,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:08,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:08,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:08,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:08,325 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:08,325 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:08,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:08,326 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:08,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:08,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:08,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:08,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:08,326 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:08,326 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:08,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:08,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:08,327 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:08,327 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:08,327 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:08,327 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:08,327 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:08,327 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:08,327 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:08,328 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:08,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:08,330 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:08,330 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:08,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:08,330 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:08,330 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:08,403 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:08,403 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:32:08,404 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:08,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:08,404 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:08,404 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:08,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2122 [2022-12-06 07:32:08,404 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-06 07:32:08,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:08,404 INFO L85 PathProgramCache]: Analyzing trace with hash 2030448378, now seen corresponding path program 1 times [2022-12-06 07:32:08,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:08,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871637981] [2022-12-06 07:32:08,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:08,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:08,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-06 07:32:08,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:08,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871637981] [2022-12-06 07:32:08,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871637981] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:08,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:08,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:08,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291763748] [2022-12-06 07:32:08,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:08,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:08,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:08,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:08,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:08,469 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:08,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:08,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:08,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:08,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:08,510 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:08,510 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:08,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:08,511 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:08,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:08,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:08,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:08,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:08,511 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:08,511 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:08,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:08,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:08,512 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:08,512 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:08,512 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:08,512 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:08,512 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:08,512 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:08,512 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:08,512 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:08,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:08,515 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:08,515 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:08,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:08,515 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:08,515 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:08,588 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:08,588 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:32:08,588 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:08,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:08,589 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:08,589 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:08,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2123 [2022-12-06 07:32:08,589 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-06 07:32:08,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:08,589 INFO L85 PathProgramCache]: Analyzing trace with hash 2057230487, now seen corresponding path program 1 times [2022-12-06 07:32:08,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:08,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093685498] [2022-12-06 07:32:08,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:08,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:08,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-06 07:32:08,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:08,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093685498] [2022-12-06 07:32:08,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093685498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:08,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:08,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:08,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542083204] [2022-12-06 07:32:08,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:08,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:08,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:08,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:08,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:08,656 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:08,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:08,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:08,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:08,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:08,696 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:08,696 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:08,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:08,696 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:08,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:08,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:08,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:08,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:08,697 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:08,697 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:08,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:08,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:08,697 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:08,697 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:08,698 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:08,698 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:08,698 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:08,698 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:08,698 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:08,698 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:08,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:08,700 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:08,700 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:08,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:08,700 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:08,700 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:08,773 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:08,773 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:32:08,773 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:08,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:08,774 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:08,774 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:08,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2124 [2022-12-06 07:32:08,774 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-06 07:32:08,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:08,774 INFO L85 PathProgramCache]: Analyzing trace with hash 2087706680, now seen corresponding path program 1 times [2022-12-06 07:32:08,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:08,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271520596] [2022-12-06 07:32:08,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:08,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:08,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-06 07:32:08,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:08,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271520596] [2022-12-06 07:32:08,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271520596] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:08,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:08,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:08,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909370069] [2022-12-06 07:32:08,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:08,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:08,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:08,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:08,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:08,848 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:08,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:08,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:08,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:08,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:08,884 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:08,884 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:08,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:08,885 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:08,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:08,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:08,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:08,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:08,885 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:08,885 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:08,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:08,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:08,895 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:08,895 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:08,896 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:08,896 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:08,896 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:08,896 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:08,896 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:08,896 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:08,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:08,898 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:08,898 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:08,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:08,899 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:08,899 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:08,970 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:08,971 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:32:08,971 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:08,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:08,971 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:08,971 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:08,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2125 [2022-12-06 07:32:08,972 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-06 07:32:08,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:08,972 INFO L85 PathProgramCache]: Analyzing trace with hash 2114488789, now seen corresponding path program 1 times [2022-12-06 07:32:08,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:08,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812329956] [2022-12-06 07:32:08,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:08,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:08,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:09,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-06 07:32:09,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:09,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812329956] [2022-12-06 07:32:09,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812329956] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:09,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:09,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:09,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920123775] [2022-12-06 07:32:09,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:09,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:09,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:09,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:09,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:09,037 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:09,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:09,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:09,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:09,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:09,078 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:09,078 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:09,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:09,079 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:09,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:09,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:09,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:09,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:09,079 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:09,079 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:09,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:09,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:09,080 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:09,080 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:09,080 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:09,080 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:09,080 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:09,080 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:09,081 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:09,081 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:09,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:09,083 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:09,083 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:09,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:09,083 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:09,083 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:09,156 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:09,157 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:09,157 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:09,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:09,157 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:09,157 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:09,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2126 [2022-12-06 07:32:09,157 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-06 07:32:09,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:09,157 INFO L85 PathProgramCache]: Analyzing trace with hash 2144964982, now seen corresponding path program 1 times [2022-12-06 07:32:09,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:09,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469104343] [2022-12-06 07:32:09,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:09,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:09,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:09,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:09,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:09,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469104343] [2022-12-06 07:32:09,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469104343] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:09,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:09,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:09,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583040426] [2022-12-06 07:32:09,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:09,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:09,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:09,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:09,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:09,218 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:09,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:09,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:09,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:09,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:09,259 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:09,259 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:09,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:09,259 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:09,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:09,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:09,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:09,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:09,260 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:09,260 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:09,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:09,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:09,261 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:09,261 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:09,261 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:09,261 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:09,261 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:09,261 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:09,261 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:09,261 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:09,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:09,263 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:09,263 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:09,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:09,264 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:09,264 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:09,337 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:09,338 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:09,338 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:09,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:09,338 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:09,338 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:09,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2127 [2022-12-06 07:32:09,338 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-06 07:32:09,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:09,338 INFO L85 PathProgramCache]: Analyzing trace with hash -2123220205, now seen corresponding path program 1 times [2022-12-06 07:32:09,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:09,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688802936] [2022-12-06 07:32:09,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:09,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:09,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-06 07:32:09,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:09,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688802936] [2022-12-06 07:32:09,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688802936] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:09,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:09,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:09,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439671039] [2022-12-06 07:32:09,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:09,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:09,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:09,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:09,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:09,403 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:09,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:09,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:09,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:09,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:09,440 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:09,440 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:09,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:09,441 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:09,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:09,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:09,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:09,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:09,441 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:09,441 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:09,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:09,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:09,442 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:09,442 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:09,442 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:09,442 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:09,442 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:09,442 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:09,442 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:09,442 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:09,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:09,445 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:09,445 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:09,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:09,445 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:09,445 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:09,517 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:09,518 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:32:09,518 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:09,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:09,518 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:09,518 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:09,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2128 [2022-12-06 07:32:09,518 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-06 07:32:09,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:09,518 INFO L85 PathProgramCache]: Analyzing trace with hash -2092744012, now seen corresponding path program 1 times [2022-12-06 07:32:09,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:09,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92075312] [2022-12-06 07:32:09,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:09,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:09,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-06 07:32:09,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:09,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92075312] [2022-12-06 07:32:09,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92075312] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:09,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:09,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:09,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898812036] [2022-12-06 07:32:09,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:09,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:09,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:09,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:09,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:09,582 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:09,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:09,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:09,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:09,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:09,618 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:09,618 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:09,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:09,619 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:09,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:09,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:09,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:09,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:09,619 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:09,619 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:09,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:09,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:09,620 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:09,620 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:09,620 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:09,620 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:09,620 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:09,621 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:09,621 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:09,621 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:09,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:09,623 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:09,623 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:09,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:09,623 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:09,623 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:09,697 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:09,698 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:09,698 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:09,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:09,698 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:09,698 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:09,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2129 [2022-12-06 07:32:09,698 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-06 07:32:09,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:09,699 INFO L85 PathProgramCache]: Analyzing trace with hash -2065961903, now seen corresponding path program 1 times [2022-12-06 07:32:09,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:09,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16486131] [2022-12-06 07:32:09,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:09,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:09,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:09,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:09,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16486131] [2022-12-06 07:32:09,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16486131] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:09,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:09,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:09,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003249521] [2022-12-06 07:32:09,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:09,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:09,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:09,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:09,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:09,765 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:09,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:09,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:09,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:09,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:09,806 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:09,807 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:09,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:09,807 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:09,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:09,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:09,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:09,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:09,808 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:09,808 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:09,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:09,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:09,808 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:09,809 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:09,809 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:09,809 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:09,809 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:09,809 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:09,809 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:09,809 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:09,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:09,811 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:09,811 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:09,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:09,812 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:09,812 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:09,884 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:09,885 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:32:09,885 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:09,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:09,885 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:09,885 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:09,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2130 [2022-12-06 07:32:09,885 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-06 07:32:09,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:09,885 INFO L85 PathProgramCache]: Analyzing trace with hash -2035485710, now seen corresponding path program 1 times [2022-12-06 07:32:09,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:09,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171114487] [2022-12-06 07:32:09,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:09,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:09,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-06 07:32:09,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:09,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171114487] [2022-12-06 07:32:09,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171114487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:09,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:09,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:09,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056714250] [2022-12-06 07:32:09,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:09,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:09,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:09,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:09,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:09,948 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:09,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:09,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:09,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:09,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:09,999 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:10,000 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:10,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:10,000 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:10,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:10,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:10,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:10,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:10,001 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:10,001 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:10,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:10,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:10,001 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:10,001 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:10,001 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:10,002 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:10,002 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:10,002 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:10,002 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:10,002 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:10,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:10,004 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:10,004 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:10,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:10,004 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:10,005 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:10,081 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:10,081 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:10,082 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:10,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:10,082 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:10,082 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:10,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2131 [2022-12-06 07:32:10,082 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-06 07:32:10,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:10,082 INFO L85 PathProgramCache]: Analyzing trace with hash -2008703601, now seen corresponding path program 1 times [2022-12-06 07:32:10,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:10,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992041030] [2022-12-06 07:32:10,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:10,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:10,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-06 07:32:10,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:10,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992041030] [2022-12-06 07:32:10,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992041030] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:10,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:10,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:10,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534624387] [2022-12-06 07:32:10,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:10,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:10,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:10,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:10,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:10,147 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:10,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:10,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:10,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:10,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:10,183 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:10,183 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:10,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:10,183 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:10,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:10,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:10,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:10,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:10,184 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:10,184 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:10,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:10,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:10,185 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:10,185 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:10,185 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:10,185 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:10,185 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:10,185 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:10,185 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:10,185 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:10,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:10,187 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:10,187 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:10,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:10,188 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:10,188 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:10,261 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:10,261 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:32:10,262 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:10,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:10,262 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:10,262 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:10,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2132 [2022-12-06 07:32:10,262 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-06 07:32:10,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:10,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1978227408, now seen corresponding path program 1 times [2022-12-06 07:32:10,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:10,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574937789] [2022-12-06 07:32:10,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:10,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:10,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:10,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-06 07:32:10,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:10,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574937789] [2022-12-06 07:32:10,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574937789] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:10,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:10,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:10,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414775193] [2022-12-06 07:32:10,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:10,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:10,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:10,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:10,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:10,338 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:10,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:10,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:10,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:10,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:10,386 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:10,386 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:10,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:10,387 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:10,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:10,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:10,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:10,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:10,388 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:10,388 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:10,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:10,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:10,389 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:10,389 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:10,389 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:10,389 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:10,389 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:10,389 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:10,389 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:10,389 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:10,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:10,392 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:10,392 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:10,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:10,393 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:10,393 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:10,471 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:10,472 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 07:32:10,472 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:10,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:10,472 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:10,472 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:10,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2133 [2022-12-06 07:32:10,472 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-06 07:32:10,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:10,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1951445299, now seen corresponding path program 1 times [2022-12-06 07:32:10,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:10,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67413813] [2022-12-06 07:32:10,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:10,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:10,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-06 07:32:10,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:10,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67413813] [2022-12-06 07:32:10,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67413813] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:10,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:10,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:10,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201672298] [2022-12-06 07:32:10,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:10,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:10,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:10,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:10,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:10,546 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:10,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:10,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:10,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:10,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:10,581 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:10,581 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:10,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:10,582 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:10,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:10,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:10,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:10,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:10,582 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:10,582 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:10,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:10,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:10,583 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:10,583 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:10,583 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:10,583 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:10,583 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:10,583 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:10,583 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:10,584 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:10,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:10,586 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:10,586 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:10,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:10,586 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:10,586 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:10,659 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:10,660 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:10,660 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:10,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:10,660 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:10,660 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:10,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2134 [2022-12-06 07:32:10,660 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-06 07:32:10,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:10,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1920969106, now seen corresponding path program 1 times [2022-12-06 07:32:10,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:10,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032560447] [2022-12-06 07:32:10,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:10,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:10,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-06 07:32:10,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:10,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032560447] [2022-12-06 07:32:10,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032560447] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:10,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:10,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:10,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577145656] [2022-12-06 07:32:10,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:10,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:10,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:10,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:10,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:10,724 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:10,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:10,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:10,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:10,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:10,766 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:10,766 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:10,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:10,767 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:10,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:10,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:10,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:10,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:10,767 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:10,767 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:10,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:10,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:10,768 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:10,768 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:10,768 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:10,768 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:10,768 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:10,768 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:10,768 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:10,768 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:10,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:10,771 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:10,771 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:10,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:10,771 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:10,771 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:10,846 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:10,847 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:10,847 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:10,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:10,847 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:10,847 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:10,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2135 [2022-12-06 07:32:10,847 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-06 07:32:10,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:10,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1894186997, now seen corresponding path program 1 times [2022-12-06 07:32:10,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:10,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138729790] [2022-12-06 07:32:10,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:10,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:10,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-06 07:32:10,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:10,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138729790] [2022-12-06 07:32:10,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138729790] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:10,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:10,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:10,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073266164] [2022-12-06 07:32:10,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:10,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:10,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:10,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:10,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:10,914 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:10,914 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:10,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:10,914 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:10,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:10,952 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:10,952 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:10,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:10,953 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:10,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:10,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:10,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:10,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:10,953 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:10,953 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:10,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:10,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:10,954 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:10,954 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:10,954 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:10,954 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:10,954 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:10,954 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:10,954 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:10,954 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:10,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:10,956 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:10,956 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:10,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:10,957 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:10,957 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:11,031 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:11,032 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:11,032 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:11,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:11,032 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:11,032 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:11,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2136 [2022-12-06 07:32:11,032 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-06 07:32:11,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:11,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1863710804, now seen corresponding path program 1 times [2022-12-06 07:32:11,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:11,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985850449] [2022-12-06 07:32:11,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:11,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:11,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-06 07:32:11,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:11,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985850449] [2022-12-06 07:32:11,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985850449] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:11,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:11,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:11,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492302869] [2022-12-06 07:32:11,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:11,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:11,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:11,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:11,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:11,117 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:11,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:11,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:11,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:11,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:11,155 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:11,155 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:11,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:11,156 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:11,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:11,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:11,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:11,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:11,156 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:11,156 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:11,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:11,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:11,157 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:11,157 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:11,157 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:11,157 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:11,157 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:11,158 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:11,158 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:11,158 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:11,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:11,160 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:11,160 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:11,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:11,160 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:11,160 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:11,234 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:11,235 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:11,235 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:11,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:11,235 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:11,235 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:11,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2137 [2022-12-06 07:32:11,235 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-06 07:32:11,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:11,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1836928695, now seen corresponding path program 1 times [2022-12-06 07:32:11,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:11,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445082953] [2022-12-06 07:32:11,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:11,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:11,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-06 07:32:11,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:11,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445082953] [2022-12-06 07:32:11,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445082953] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:11,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:11,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:11,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040049087] [2022-12-06 07:32:11,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:11,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:11,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:11,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:11,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:11,300 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:11,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:11,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:11,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:11,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:11,341 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:11,341 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:11,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:11,341 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:11,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:11,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:11,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:11,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:11,342 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:11,342 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:11,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:11,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:11,342 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:11,342 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:11,342 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:11,342 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:11,343 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:11,343 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:11,343 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:11,343 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:11,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:11,345 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:11,345 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:11,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:11,345 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:11,345 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:11,420 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:11,420 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:11,420 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:11,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:11,421 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:11,421 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:11,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2138 [2022-12-06 07:32:11,421 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-06 07:32:11,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:11,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1806452502, now seen corresponding path program 1 times [2022-12-06 07:32:11,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:11,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417155968] [2022-12-06 07:32:11,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:11,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:11,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-06 07:32:11,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:11,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417155968] [2022-12-06 07:32:11,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417155968] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:11,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:11,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:11,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685165068] [2022-12-06 07:32:11,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:11,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:11,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:11,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:11,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:11,485 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:11,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:11,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:11,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:11,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:11,528 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:11,528 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:11,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:11,529 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:11,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:11,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:11,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:11,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:11,529 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:11,529 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:11,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:11,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:11,530 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:11,530 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:11,530 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:11,530 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:11,530 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:11,531 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:11,531 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:11,531 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:11,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:11,533 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:11,533 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:11,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:11,533 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:11,533 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:11,606 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:11,606 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:32:11,606 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:11,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:11,606 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:11,607 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:11,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2139 [2022-12-06 07:32:11,607 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-06 07:32:11,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:11,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1779670393, now seen corresponding path program 1 times [2022-12-06 07:32:11,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:11,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820103143] [2022-12-06 07:32:11,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:11,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:11,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-06 07:32:11,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:11,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820103143] [2022-12-06 07:32:11,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820103143] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:11,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:11,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:11,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319367352] [2022-12-06 07:32:11,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:11,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:11,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:11,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:11,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:11,670 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:11,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:11,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:11,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:11,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:11,706 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:11,706 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:11,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:11,706 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:11,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:11,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:11,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:11,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:11,707 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:11,707 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:11,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:11,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:11,708 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:11,708 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:11,708 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:11,708 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:11,708 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:11,708 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:11,708 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:11,708 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:11,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:11,710 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:11,710 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:11,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:11,710 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:11,710 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:11,783 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:11,784 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:32:11,784 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:11,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:11,784 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:11,784 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:11,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2140 [2022-12-06 07:32:11,785 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-06 07:32:11,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:11,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1749194200, now seen corresponding path program 1 times [2022-12-06 07:32:11,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:11,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579103535] [2022-12-06 07:32:11,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:11,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:11,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-06 07:32:11,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:11,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579103535] [2022-12-06 07:32:11,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579103535] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:11,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:11,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:11,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123196730] [2022-12-06 07:32:11,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:11,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:11,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:11,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:11,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:11,847 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:11,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:11,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:11,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:11,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:11,888 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:11,889 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:11,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:11,889 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:11,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:11,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:11,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:11,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:11,889 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:11,889 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:11,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:11,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:11,890 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:11,890 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:11,890 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:11,890 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:11,890 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:11,891 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:11,891 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:11,891 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:11,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:11,893 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:11,893 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:11,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:11,893 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:11,893 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:11,968 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:11,968 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:11,968 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:11,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:11,969 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:11,969 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:11,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2141 [2022-12-06 07:32:11,969 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-06 07:32:11,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:11,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1722412091, now seen corresponding path program 1 times [2022-12-06 07:32:11,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:11,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450191887] [2022-12-06 07:32:11,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:11,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:12,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-06 07:32:12,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:12,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450191887] [2022-12-06 07:32:12,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450191887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:12,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:12,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:12,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749104180] [2022-12-06 07:32:12,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:12,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:12,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:12,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:12,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:12,034 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:12,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:12,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:12,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:12,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:12,071 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:12,071 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:12,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 355 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:12,071 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:12,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:12,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:12,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:12,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:12,072 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:12,072 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:12,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:12,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:12,072 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:12,073 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:12,073 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:12,073 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:12,073 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:12,073 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:12,073 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:12,073 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:12,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:12,075 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:12,075 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:12,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:12,076 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:12,076 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:12,149 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:12,150 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:12,150 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:12,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:12,150 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:12,150 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:12,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2142 [2022-12-06 07:32:12,150 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-06 07:32:12,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:12,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1691935898, now seen corresponding path program 1 times [2022-12-06 07:32:12,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:12,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301232311] [2022-12-06 07:32:12,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:12,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:12,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-06 07:32:12,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:12,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301232311] [2022-12-06 07:32:12,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301232311] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:12,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:12,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:12,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6021963] [2022-12-06 07:32:12,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:12,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:12,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:12,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:12,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:12,227 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:12,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:12,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:12,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:12,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:12,269 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:12,269 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:12,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:12,270 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:12,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:12,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:12,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:12,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:12,270 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:12,270 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:12,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:12,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:12,271 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:12,271 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:12,271 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:12,271 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:12,271 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:12,271 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:12,271 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:12,271 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:12,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:12,273 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:12,273 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:12,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:12,274 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:12,274 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:12,347 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:12,348 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:12,348 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:12,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:12,348 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:12,348 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:12,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2143 [2022-12-06 07:32:12,348 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-06 07:32:12,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:12,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1665153789, now seen corresponding path program 1 times [2022-12-06 07:32:12,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:12,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055307446] [2022-12-06 07:32:12,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:12,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:12,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:12,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-06 07:32:12,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:12,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055307446] [2022-12-06 07:32:12,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055307446] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:12,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:12,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:12,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573812292] [2022-12-06 07:32:12,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:12,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:12,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:12,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:12,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:12,413 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:12,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:12,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:12,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:12,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:12,454 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:12,454 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:12,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:12,455 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:12,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:12,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:12,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:12,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:12,455 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:12,455 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:12,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:12,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:12,456 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:12,456 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:12,456 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:12,456 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:12,456 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:12,456 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:12,456 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:12,456 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:12,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:12,459 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:12,459 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:12,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:12,459 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:12,459 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:12,533 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:12,533 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:12,533 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:12,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:12,534 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:12,534 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:12,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2144 [2022-12-06 07:32:12,534 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-06 07:32:12,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:12,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1634677596, now seen corresponding path program 1 times [2022-12-06 07:32:12,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:12,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573758935] [2022-12-06 07:32:12,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:12,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:12,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-06 07:32:12,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:12,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573758935] [2022-12-06 07:32:12,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573758935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:12,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:12,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:12,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735719742] [2022-12-06 07:32:12,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:12,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:12,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:12,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:12,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:12,597 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:12,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:12,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:12,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:12,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:12,635 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:12,635 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:12,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:12,635 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:12,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:12,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:12,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:12,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:12,636 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:12,636 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:12,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:12,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:12,636 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:12,636 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:12,636 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:12,637 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:12,637 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:12,637 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:12,637 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:12,637 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:12,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:12,639 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:12,639 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:12,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:12,639 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:12,639 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:12,713 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:12,714 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:12,714 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:12,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:12,714 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:12,714 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:12,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2145 [2022-12-06 07:32:12,715 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-06 07:32:12,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:12,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1607895487, now seen corresponding path program 1 times [2022-12-06 07:32:12,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:12,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122210429] [2022-12-06 07:32:12,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:12,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:12,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-06 07:32:12,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:12,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122210429] [2022-12-06 07:32:12,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122210429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:12,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:12,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:12,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349279171] [2022-12-06 07:32:12,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:12,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:12,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:12,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:12,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:12,781 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:12,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:12,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:12,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:12,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:12,820 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:12,820 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:12,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:12,821 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:12,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:12,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:12,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:12,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:12,821 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:12,821 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:12,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:12,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:12,822 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:12,822 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:12,822 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:12,822 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:12,822 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:12,822 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:12,822 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:12,823 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:12,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:12,825 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:12,825 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:12,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:12,825 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:12,825 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:12,898 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:12,899 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:12,899 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:12,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:12,899 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:12,899 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:12,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2146 [2022-12-06 07:32:12,899 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-06 07:32:12,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:12,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1577419294, now seen corresponding path program 1 times [2022-12-06 07:32:12,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:12,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942197851] [2022-12-06 07:32:12,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:12,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:12,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-06 07:32:12,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:12,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942197851] [2022-12-06 07:32:12,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942197851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:12,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:12,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:12,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288190321] [2022-12-06 07:32:12,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:12,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:12,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:12,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:12,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:12,962 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:12,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:12,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:12,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:12,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:13,004 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:13,004 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:13,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:13,004 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:13,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:13,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:13,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:13,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:13,005 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:13,005 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:13,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:13,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:13,005 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:13,005 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:13,006 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:13,006 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:13,006 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:13,006 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:13,006 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:13,006 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:13,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:13,008 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:13,008 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:13,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:13,008 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:13,008 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:13,082 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:13,083 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:13,083 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:13,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:13,083 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:13,083 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:13,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2147 [2022-12-06 07:32:13,083 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-06 07:32:13,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:13,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1550637185, now seen corresponding path program 1 times [2022-12-06 07:32:13,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:13,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364844337] [2022-12-06 07:32:13,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:13,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:13,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-06 07:32:13,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:13,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364844337] [2022-12-06 07:32:13,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364844337] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:13,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:13,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:13,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94069294] [2022-12-06 07:32:13,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:13,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:13,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:13,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:13,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:13,148 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:13,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:13,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:13,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:13,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:13,184 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:13,184 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:13,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:13,184 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:13,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:13,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:13,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:13,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:13,185 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:13,185 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:13,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:13,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:13,186 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:13,186 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:13,186 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:13,186 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:13,186 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:13,186 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:13,186 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:13,186 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:13,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:13,188 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:13,188 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:13,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:13,189 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:13,189 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:13,262 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:13,263 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:13,263 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:13,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:13,263 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:13,263 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:13,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2148 [2022-12-06 07:32:13,264 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-06 07:32:13,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:13,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1520160992, now seen corresponding path program 1 times [2022-12-06 07:32:13,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:13,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583865132] [2022-12-06 07:32:13,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:13,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:13,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-06 07:32:13,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:13,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583865132] [2022-12-06 07:32:13,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583865132] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:13,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:13,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:13,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580136469] [2022-12-06 07:32:13,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:13,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:13,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:13,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:13,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:13,341 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:13,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:13,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:13,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:13,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:13,383 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:13,383 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:13,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:13,383 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:13,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:13,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:13,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:13,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:13,384 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:13,384 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:13,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:13,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:13,385 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:13,385 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:13,385 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:13,385 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:13,385 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:13,385 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:13,385 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:13,385 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:13,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:13,387 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:13,387 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:13,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:13,387 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:13,388 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:13,462 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:13,463 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:13,463 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:13,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:13,463 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:13,463 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:13,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2149 [2022-12-06 07:32:13,463 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-06 07:32:13,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:13,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1493378883, now seen corresponding path program 1 times [2022-12-06 07:32:13,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:13,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516120714] [2022-12-06 07:32:13,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:13,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:13,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-06 07:32:13,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:13,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516120714] [2022-12-06 07:32:13,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516120714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:13,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:13,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:13,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722892205] [2022-12-06 07:32:13,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:13,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:13,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:13,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:13,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:13,534 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:13,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:13,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:13,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:13,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:13,575 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:13,575 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:13,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:13,575 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:13,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:13,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:13,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:13,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:13,576 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:13,576 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:13,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:13,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:13,577 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:13,577 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:13,577 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:13,577 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:13,577 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:13,577 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:13,577 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:13,577 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:13,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:13,579 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:13,579 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:13,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:13,580 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:13,580 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:13,654 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:13,655 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:13,655 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:13,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:13,655 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:13,655 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:13,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2150 [2022-12-06 07:32:13,655 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-06 07:32:13,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:13,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1462902690, now seen corresponding path program 1 times [2022-12-06 07:32:13,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:13,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815649396] [2022-12-06 07:32:13,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:13,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:13,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-06 07:32:13,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:13,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815649396] [2022-12-06 07:32:13,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815649396] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:13,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:13,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:13,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959207951] [2022-12-06 07:32:13,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:13,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:13,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:13,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:13,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:13,719 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:13,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:13,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:13,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:13,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:13,755 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:13,755 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:13,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:13,756 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:13,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:13,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:13,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:13,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:13,756 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:13,756 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:13,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:13,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:13,757 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:13,757 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:13,757 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:13,757 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:13,757 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:13,757 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:13,757 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:13,757 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:13,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:13,760 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:13,760 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:13,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:13,760 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:13,760 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:13,834 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:13,834 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:13,834 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:13,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:13,835 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:13,835 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:13,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2151 [2022-12-06 07:32:13,835 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-06 07:32:13,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:13,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1436120581, now seen corresponding path program 1 times [2022-12-06 07:32:13,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:13,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755366511] [2022-12-06 07:32:13,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:13,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:13,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-06 07:32:13,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:13,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755366511] [2022-12-06 07:32:13,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755366511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:13,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:13,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:13,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320857890] [2022-12-06 07:32:13,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:13,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:13,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:13,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:13,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:13,900 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:13,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:13,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:13,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:13,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:13,936 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:13,936 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:13,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:13,936 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:13,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:13,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:13,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:13,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:13,937 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:13,937 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:13,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:13,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:13,937 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:13,937 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:13,937 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:13,938 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:13,938 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:13,938 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:13,938 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:13,938 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:13,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:13,940 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:13,940 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:13,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:13,940 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:13,940 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:14,014 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:14,015 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:14,015 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:14,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:14,015 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:14,015 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:14,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2152 [2022-12-06 07:32:14,015 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-06 07:32:14,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:14,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1405644388, now seen corresponding path program 1 times [2022-12-06 07:32:14,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:14,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930879624] [2022-12-06 07:32:14,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:14,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:14,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-06 07:32:14,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:14,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930879624] [2022-12-06 07:32:14,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930879624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:14,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:14,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:14,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531735246] [2022-12-06 07:32:14,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:14,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:14,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:14,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:14,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:14,087 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:14,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:14,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:14,088 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:14,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:14,130 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:14,130 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:14,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:14,131 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:14,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:14,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:14,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:14,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:14,131 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:14,131 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:14,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:14,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:14,132 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:14,132 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:14,132 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:14,132 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:14,132 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:14,132 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:14,132 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:14,132 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:14,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:14,134 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:14,134 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:14,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:14,135 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:14,135 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:14,208 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:14,209 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:14,209 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:14,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:14,209 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:14,209 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:14,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2153 [2022-12-06 07:32:14,209 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-06 07:32:14,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:14,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1378862279, now seen corresponding path program 1 times [2022-12-06 07:32:14,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:14,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952622972] [2022-12-06 07:32:14,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:14,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:14,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-06 07:32:14,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:14,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952622972] [2022-12-06 07:32:14,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952622972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:14,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:14,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:14,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715177453] [2022-12-06 07:32:14,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:14,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:14,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:14,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:14,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:14,277 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:14,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:14,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:14,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:14,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:14,317 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:14,317 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:14,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:14,317 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:14,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:14,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:14,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:14,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:14,318 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:14,318 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:14,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:14,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:14,318 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:14,318 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:14,318 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:14,319 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:14,319 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:14,319 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:14,319 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:14,319 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:14,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:14,321 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:14,321 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:14,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:14,321 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:14,321 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:14,395 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:14,395 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:32:14,396 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:14,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:14,396 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:14,396 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:14,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2154 [2022-12-06 07:32:14,396 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-06 07:32:14,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:14,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1348386086, now seen corresponding path program 1 times [2022-12-06 07:32:14,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:14,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167304704] [2022-12-06 07:32:14,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:14,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:14,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-06 07:32:14,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:14,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167304704] [2022-12-06 07:32:14,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167304704] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:14,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:14,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:14,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311741957] [2022-12-06 07:32:14,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:14,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:14,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:14,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:14,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:14,471 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:14,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:14,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:14,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:14,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:14,506 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:14,506 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:14,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 349 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:14,507 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:14,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:14,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:14,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:14,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:14,507 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:14,507 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:14,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:14,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:14,508 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:14,508 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:14,508 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:14,508 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:14,508 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:14,508 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:14,508 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:14,508 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:14,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:14,510 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:14,510 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:14,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:14,511 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:14,511 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:14,585 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:14,586 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:14,586 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:14,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:14,586 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:14,586 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:14,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2155 [2022-12-06 07:32:14,586 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-06 07:32:14,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:14,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1321603977, now seen corresponding path program 1 times [2022-12-06 07:32:14,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:14,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265337226] [2022-12-06 07:32:14,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:14,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:14,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:14,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:14,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265337226] [2022-12-06 07:32:14,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265337226] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:14,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:14,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:14,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107957564] [2022-12-06 07:32:14,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:14,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:14,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:14,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:14,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:14,651 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:14,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:14,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:14,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:14,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:14,687 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:14,687 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:14,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:14,687 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:14,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:14,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:14,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:14,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:14,688 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:14,688 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:14,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:14,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:14,689 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:14,689 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:14,689 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:14,689 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:14,689 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:14,689 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:14,689 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:14,689 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:14,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:14,691 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:14,691 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:14,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:14,691 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:14,692 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:14,765 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:14,766 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:14,766 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:14,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:14,766 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:14,766 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:14,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2156 [2022-12-06 07:32:14,766 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-06 07:32:14,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:14,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1291127784, now seen corresponding path program 1 times [2022-12-06 07:32:14,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:14,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737552858] [2022-12-06 07:32:14,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:14,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32: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-06 07:32:14,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:14,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737552858] [2022-12-06 07:32:14,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737552858] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:14,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:14,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:14,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610161995] [2022-12-06 07:32:14,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:14,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:14,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:14,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:14,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:14,828 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:14,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:14,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:14,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:14,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:14,869 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:14,869 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:14,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:14,870 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:14,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:14,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:14,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:14,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:14,870 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:14,870 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:14,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:14,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:14,871 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:14,871 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:14,871 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:14,871 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:14,871 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:14,871 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:14,871 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:14,871 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:14,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:14,873 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:14,873 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:14,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:14,874 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:14,874 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:14,948 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:14,949 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:14,949 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:14,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:14,949 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:14,949 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:14,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2157 [2022-12-06 07:32:14,949 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-06 07:32:14,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:14,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1264345675, now seen corresponding path program 1 times [2022-12-06 07:32:14,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:14,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011357682] [2022-12-06 07:32:14,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:14,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:15,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-06 07:32:15,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:15,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011357682] [2022-12-06 07:32:15,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011357682] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:15,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:15,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:15,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237828276] [2022-12-06 07:32:15,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:15,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:15,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:15,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:15,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:15,014 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:15,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:15,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:15,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:15,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:15,054 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:15,054 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:15,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 356 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:15,055 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:15,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:15,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:15,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:15,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:15,055 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:15,055 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:15,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:15,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:15,056 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:15,056 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:15,056 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:15,056 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:15,056 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:15,056 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:15,056 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:15,056 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:15,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:15,058 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:15,059 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:15,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:15,059 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:15,059 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:15,131 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:15,132 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:32:15,132 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:15,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:15,132 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:15,132 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:15,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2158 [2022-12-06 07:32:15,132 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-06 07:32:15,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:15,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1233869482, now seen corresponding path program 1 times [2022-12-06 07:32:15,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:15,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393223012] [2022-12-06 07:32:15,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:15,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32: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-06 07:32:15,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:15,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393223012] [2022-12-06 07:32:15,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393223012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:15,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:15,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:15,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043886608] [2022-12-06 07:32:15,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:15,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:15,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:15,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:15,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:15,198 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:15,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:15,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:15,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:15,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:15,240 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:15,240 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:15,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:15,240 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:15,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:15,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:15,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:15,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:15,241 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:15,241 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:15,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:15,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:15,242 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:15,242 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:15,242 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:15,242 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:15,242 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:15,242 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:15,242 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:15,242 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:15,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:15,245 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:15,245 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:15,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:15,245 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:15,245 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:15,320 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:15,321 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:15,321 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:15,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:15,321 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:15,321 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:15,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2159 [2022-12-06 07:32:15,321 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-06 07:32:15,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:15,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1207087373, now seen corresponding path program 1 times [2022-12-06 07:32:15,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:15,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228734149] [2022-12-06 07:32:15,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:15,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:15,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-06 07:32:15,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:15,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228734149] [2022-12-06 07:32:15,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228734149] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:15,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:15,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:15,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953136037] [2022-12-06 07:32:15,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:15,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:15,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:15,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:15,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:15,389 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:15,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:15,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:15,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:15,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:15,430 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:15,431 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:15,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:15,431 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:15,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:15,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:15,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:15,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:15,432 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:15,432 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:15,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:15,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:15,432 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:15,432 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:15,433 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:15,433 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:15,433 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:15,433 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:15,433 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:15,433 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:15,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:15,435 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:15,435 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:15,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:15,435 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:15,435 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:15,510 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:15,511 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:15,511 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:15,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:15,511 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:15,511 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:15,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2160 [2022-12-06 07:32:15,511 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-06 07:32:15,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:15,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1176611180, now seen corresponding path program 1 times [2022-12-06 07:32:15,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:15,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551198795] [2022-12-06 07:32:15,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:15,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:15,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-06 07:32:15,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:15,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551198795] [2022-12-06 07:32:15,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551198795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:15,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:15,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:15,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118430069] [2022-12-06 07:32:15,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:15,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:15,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:15,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:15,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:15,586 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:15,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:15,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:15,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:15,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:15,623 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:15,623 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:15,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:15,624 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:15,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:15,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:15,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:15,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:15,624 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:15,624 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:15,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:15,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:15,625 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:15,625 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:15,625 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:15,625 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:15,625 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:15,625 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:15,625 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:15,625 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:15,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:15,628 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:15,628 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:15,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:15,628 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:15,628 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:15,703 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:15,704 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:15,704 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:15,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:15,704 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:15,704 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:15,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2161 [2022-12-06 07:32:15,704 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-06 07:32:15,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:15,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1149829071, now seen corresponding path program 1 times [2022-12-06 07:32:15,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:15,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521263354] [2022-12-06 07:32:15,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:15,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:15,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:15,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-06 07:32:15,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:15,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521263354] [2022-12-06 07:32:15,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521263354] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:15,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:15,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:15,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070611337] [2022-12-06 07:32:15,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:15,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:15,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:15,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:15,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:15,771 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:15,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:15,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:15,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:15,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:15,807 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:15,808 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:15,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:15,808 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:15,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:15,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:15,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:15,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:15,809 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:15,809 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:15,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:15,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:15,809 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:15,809 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:15,810 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:15,810 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:15,810 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:15,810 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:15,810 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:15,810 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:15,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:15,812 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:15,812 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:15,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:15,813 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:15,813 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:15,887 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:15,888 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:15,888 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:15,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:15,888 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:15,888 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:15,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2162 [2022-12-06 07:32:15,888 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-06 07:32:15,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:15,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1119352878, now seen corresponding path program 1 times [2022-12-06 07:32:15,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:15,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513421980] [2022-12-06 07:32:15,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:15,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:15,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-06 07:32:15,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:15,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513421980] [2022-12-06 07:32:15,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513421980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:15,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:15,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:15,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150729145] [2022-12-06 07:32:15,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:15,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:15,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:15,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:15,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:15,954 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:15,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:15,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:15,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:15,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:15,991 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:15,992 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:15,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:15,992 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:15,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:15,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:15,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:15,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:15,993 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:15,993 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:15,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:15,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:15,993 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:15,994 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:15,994 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:15,994 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:15,994 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:15,994 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:15,994 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:15,994 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:15,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:15,996 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:15,996 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:15,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:15,997 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:15,997 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:16,070 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:16,071 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:16,071 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:16,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:16,072 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:16,072 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:16,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2163 [2022-12-06 07:32:16,072 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-06 07:32:16,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:16,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1092570769, now seen corresponding path program 1 times [2022-12-06 07:32:16,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:16,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374418079] [2022-12-06 07:32:16,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:16,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:16,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-06 07:32:16,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:16,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374418079] [2022-12-06 07:32:16,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374418079] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:16,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:16,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:16,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626784738] [2022-12-06 07:32:16,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:16,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:16,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:16,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:16,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:16,139 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:16,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:16,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:16,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:16,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:16,180 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:16,180 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:16,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:16,181 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:16,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:16,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:16,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:16,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:16,181 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:16,181 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:16,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:16,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:16,182 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:16,182 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:16,182 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:16,182 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:16,182 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:16,182 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:16,182 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:16,182 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:16,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:16,184 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:16,185 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:16,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:16,185 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:16,185 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:16,259 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:16,260 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:16,260 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:16,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:16,260 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:16,260 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:16,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2164 [2022-12-06 07:32:16,260 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-06 07:32:16,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:16,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1062094576, now seen corresponding path program 1 times [2022-12-06 07:32:16,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:16,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67691398] [2022-12-06 07:32:16,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:16,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:16,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-06 07:32:16,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:16,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67691398] [2022-12-06 07:32:16,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67691398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:16,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:16,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:16,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596655807] [2022-12-06 07:32:16,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:16,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:16,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:16,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:16,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:16,324 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:16,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:16,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:16,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:16,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:16,366 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:16,366 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:16,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:16,367 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:16,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:16,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:16,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:16,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:16,367 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:16,367 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:16,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:16,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:16,368 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:16,368 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:16,368 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:16,368 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:16,368 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:16,369 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:16,369 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:16,369 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:16,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:16,371 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:16,371 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:16,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:16,371 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:16,371 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:16,455 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:16,456 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 07:32:16,456 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:16,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:16,456 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:16,456 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:16,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2165 [2022-12-06 07:32:16,456 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-06 07:32:16,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:16,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1035312467, now seen corresponding path program 1 times [2022-12-06 07:32:16,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:16,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764061857] [2022-12-06 07:32:16,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:16,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:16,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-06 07:32:16,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:16,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764061857] [2022-12-06 07:32:16,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764061857] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:16,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:16,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:16,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891433094] [2022-12-06 07:32:16,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:16,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:16,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:16,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:16,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:16,527 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:16,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:16,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:16,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:16,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:16,569 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:16,569 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:16,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:16,570 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:16,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:16,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:16,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:16,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:16,570 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:16,570 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:16,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:16,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:16,571 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:16,571 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:16,571 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:16,571 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:16,571 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:16,571 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:16,571 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:16,571 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:16,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:16,574 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:16,574 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:16,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:16,574 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:16,574 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:16,682 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:16,683 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-06 07:32:16,683 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:16,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:16,684 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:16,684 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:16,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2166 [2022-12-06 07:32:16,684 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-06 07:32:16,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:16,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1004836274, now seen corresponding path program 1 times [2022-12-06 07:32:16,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:16,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424069216] [2022-12-06 07:32:16,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:16,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:16,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-06 07:32:16,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:16,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424069216] [2022-12-06 07:32:16,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424069216] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:16,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:16,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:16,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688575242] [2022-12-06 07:32:16,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:16,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:16,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:16,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:16,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:16,760 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:16,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:16,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:16,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:16,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:16,802 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:16,802 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:16,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:16,802 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:16,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:16,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:16,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:16,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:16,803 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:16,803 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:16,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:16,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:16,804 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:16,804 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:16,804 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:16,804 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:16,804 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:16,804 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:16,804 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:16,804 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:16,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:16,806 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:16,806 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:16,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:16,807 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:16,807 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:16,882 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:16,883 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:16,883 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:16,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:16,883 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:16,883 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:16,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2167 [2022-12-06 07:32:16,883 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-06 07:32:16,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:16,884 INFO L85 PathProgramCache]: Analyzing trace with hash -978054165, now seen corresponding path program 1 times [2022-12-06 07:32:16,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:16,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039327063] [2022-12-06 07:32:16,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:16,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:16,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-06 07:32:16,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:16,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039327063] [2022-12-06 07:32:16,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039327063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:16,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:16,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:16,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161198423] [2022-12-06 07:32:16,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:16,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:16,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:16,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:16,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:16,953 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:16,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:16,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:16,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:16,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:16,989 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:16,990 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:16,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:16,990 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:16,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:16,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:16,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:16,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:16,991 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:16,991 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:16,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:16,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:16,991 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:16,991 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:16,992 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:16,992 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:16,992 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:16,992 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:16,992 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:16,992 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:16,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:16,994 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:16,994 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:16,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:16,994 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:16,994 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:17,070 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:17,071 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:17,071 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:17,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:17,071 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:17,071 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:17,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2168 [2022-12-06 07:32:17,071 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-06 07:32:17,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:17,071 INFO L85 PathProgramCache]: Analyzing trace with hash -947577972, now seen corresponding path program 1 times [2022-12-06 07:32:17,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:17,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27678541] [2022-12-06 07:32:17,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:17,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:17,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-06 07:32:17,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:17,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27678541] [2022-12-06 07:32:17,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27678541] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:17,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:17,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:17,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811636753] [2022-12-06 07:32:17,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:17,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:17,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:17,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:17,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:17,135 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:17,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:17,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:17,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:17,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:17,172 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:17,173 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:17,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:17,173 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:17,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:17,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:17,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:17,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:17,174 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:17,174 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:17,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:17,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:17,174 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:17,174 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:17,175 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:17,175 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:17,175 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:17,175 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:17,175 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:17,175 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:17,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:17,177 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:17,177 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:17,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:17,177 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:17,177 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:17,251 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:17,252 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:17,252 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:17,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:17,253 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:17,253 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:17,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2169 [2022-12-06 07:32:17,253 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-06 07:32:17,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:17,253 INFO L85 PathProgramCache]: Analyzing trace with hash -920795863, now seen corresponding path program 1 times [2022-12-06 07:32:17,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:17,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987614898] [2022-12-06 07:32:17,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:17,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:17,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:17,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-06 07:32:17,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:17,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987614898] [2022-12-06 07:32:17,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987614898] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:17,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:17,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:17,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548356245] [2022-12-06 07:32:17,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:17,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:17,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:17,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:17,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:17,319 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:17,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:17,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:17,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:17,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:17,354 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:17,354 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:17,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:17,355 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:17,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:17,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:17,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:17,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:17,355 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:17,355 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:17,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:17,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:17,356 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:17,356 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:17,356 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:17,356 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:17,356 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:17,357 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:17,357 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:17,357 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:17,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:17,359 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:17,359 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:17,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:17,359 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:17,359 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:17,436 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:17,436 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:32:17,436 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:17,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:17,437 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:17,437 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:17,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2170 [2022-12-06 07:32:17,437 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-06 07:32:17,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:17,437 INFO L85 PathProgramCache]: Analyzing trace with hash -890319670, now seen corresponding path program 1 times [2022-12-06 07:32:17,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:17,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819632284] [2022-12-06 07:32:17,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:17,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:17,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:17,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-06 07:32:17,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:17,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819632284] [2022-12-06 07:32:17,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819632284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:17,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:17,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:17,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396962061] [2022-12-06 07:32:17,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:17,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:17,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:17,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:17,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:17,502 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:17,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:17,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:17,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:17,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:17,544 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:17,544 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:17,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:17,545 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:17,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:17,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:17,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:17,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:17,545 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:17,545 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:17,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:17,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:17,546 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:17,546 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:17,546 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:17,546 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:17,546 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:17,546 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:17,546 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:17,546 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:17,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:17,549 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:17,549 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:17,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:17,549 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:17,549 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:17,623 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:17,624 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:17,624 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:17,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:17,624 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:17,624 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:17,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2171 [2022-12-06 07:32:17,625 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-06 07:32:17,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:17,625 INFO L85 PathProgramCache]: Analyzing trace with hash -863537561, now seen corresponding path program 1 times [2022-12-06 07:32:17,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:17,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045270969] [2022-12-06 07:32:17,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:17,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:17,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:17,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:17,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045270969] [2022-12-06 07:32:17,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045270969] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:17,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:17,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:17,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30755506] [2022-12-06 07:32:17,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:17,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:17,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:17,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:17,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:17,691 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:17,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:17,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:17,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:17,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:17,737 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:17,737 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:17,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:17,738 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:17,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:17,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:17,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:17,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:17,738 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:17,738 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:17,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:17,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:17,739 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:17,739 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:17,739 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:17,739 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:17,739 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:17,739 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:17,739 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:17,739 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:17,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:17,742 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:17,742 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:17,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:17,742 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:17,742 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:17,815 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:17,816 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:17,816 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:17,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:17,816 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:17,816 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:17,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2172 [2022-12-06 07:32:17,816 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-06 07:32:17,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:17,816 INFO L85 PathProgramCache]: Analyzing trace with hash -833061368, now seen corresponding path program 1 times [2022-12-06 07:32:17,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:17,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601134121] [2022-12-06 07:32:17,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:17,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:17,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-06 07:32:17,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:17,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601134121] [2022-12-06 07:32:17,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601134121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:17,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:17,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:17,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857534986] [2022-12-06 07:32:17,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:17,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:17,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:17,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:17,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:17,879 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:17,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:17,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:17,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:17,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:17,920 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:17,920 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:17,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:17,921 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:17,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:17,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:17,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:17,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:17,921 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:17,921 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:17,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:17,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:17,922 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:17,922 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:17,922 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:17,922 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:17,922 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:17,922 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:17,922 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:17,922 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:17,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:17,925 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:17,925 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:17,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:17,925 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:17,925 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:17,998 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:17,999 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:17,999 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:17,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:17,999 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:17,999 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:17,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2173 [2022-12-06 07:32:17,999 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-06 07:32:17,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:17,999 INFO L85 PathProgramCache]: Analyzing trace with hash -806279259, now seen corresponding path program 1 times [2022-12-06 07:32:17,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:17,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168429647] [2022-12-06 07:32:17,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:17,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:18,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:18,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:18,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168429647] [2022-12-06 07:32:18,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168429647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:18,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:18,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:18,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571509131] [2022-12-06 07:32:18,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:18,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:18,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:18,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:18,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:18,065 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:18,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:18,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:18,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:18,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:18,106 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:18,106 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:18,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:18,107 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:18,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:18,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:18,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:18,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:18,107 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:18,107 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:18,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:18,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:18,108 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:18,108 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:18,108 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:18,108 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:18,108 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:18,108 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:18,109 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:18,109 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:18,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:18,111 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:18,111 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:18,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:18,111 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:18,111 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:18,185 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:18,186 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:18,186 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:18,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:18,186 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:18,186 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:18,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2174 [2022-12-06 07:32:18,186 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-06 07:32:18,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:18,186 INFO L85 PathProgramCache]: Analyzing trace with hash -775803066, now seen corresponding path program 1 times [2022-12-06 07:32:18,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:18,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084538593] [2022-12-06 07:32:18,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:18,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32: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-06 07:32:18,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:18,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084538593] [2022-12-06 07:32:18,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084538593] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:18,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:18,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:18,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125350831] [2022-12-06 07:32:18,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:18,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:18,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:18,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:18,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:18,251 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:18,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:18,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:18,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:18,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:18,287 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:18,287 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:18,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:18,287 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:18,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:18,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:18,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:18,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:18,288 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:18,288 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:18,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:18,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:18,289 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:18,289 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:18,289 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:18,289 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:18,289 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:18,289 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:18,289 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:18,289 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:18,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:18,292 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:18,292 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:18,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:18,292 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:18,292 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:18,366 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:18,366 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:18,367 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:18,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:18,367 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:18,367 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:18,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2175 [2022-12-06 07:32:18,367 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-06 07:32:18,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:18,367 INFO L85 PathProgramCache]: Analyzing trace with hash -749020957, now seen corresponding path program 1 times [2022-12-06 07:32:18,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:18,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131095549] [2022-12-06 07:32:18,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:18,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:18,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-06 07:32:18,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:18,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131095549] [2022-12-06 07:32:18,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131095549] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:18,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:18,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:18,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807534915] [2022-12-06 07:32:18,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:18,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:18,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:18,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:18,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:18,433 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:18,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:18,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:18,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:18,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:18,475 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:18,476 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:18,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:18,476 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:18,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:18,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:18,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:18,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:18,477 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:18,477 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:18,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:18,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:18,478 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:18,478 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:18,478 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:18,478 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:18,478 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:18,478 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:18,478 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:18,478 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:18,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:18,480 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:18,480 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:18,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:18,481 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:18,481 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:18,555 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:18,556 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:18,556 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:18,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:18,556 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:18,556 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:18,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2176 [2022-12-06 07:32:18,556 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-06 07:32:18,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:18,556 INFO L85 PathProgramCache]: Analyzing trace with hash -718544764, now seen corresponding path program 1 times [2022-12-06 07:32:18,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:18,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551407] [2022-12-06 07:32:18,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:18,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32: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-06 07:32:18,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:18,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551407] [2022-12-06 07:32:18,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:18,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:18,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:18,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996507663] [2022-12-06 07:32:18,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:18,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:18,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:18,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:18,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:18,622 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:18,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:18,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:18,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:18,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:18,666 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:18,666 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:18,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:18,667 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:18,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:18,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:18,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:18,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:18,667 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:18,667 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:18,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:18,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:18,668 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:18,668 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:18,668 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:18,668 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:18,668 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:18,668 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:18,668 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:18,668 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:18,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:18,671 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:18,671 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:18,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:18,671 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:18,671 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:18,747 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:18,749 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:32:18,749 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:18,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:18,749 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:18,749 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:18,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2177 [2022-12-06 07:32:18,749 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-06 07:32:18,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:18,749 INFO L85 PathProgramCache]: Analyzing trace with hash -691762655, now seen corresponding path program 1 times [2022-12-06 07:32:18,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:18,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880009778] [2022-12-06 07:32:18,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:18,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:18,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-06 07:32:18,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:18,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880009778] [2022-12-06 07:32:18,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880009778] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:18,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:18,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:18,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755465866] [2022-12-06 07:32:18,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:18,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:18,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:18,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:18,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:18,830 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:18,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:18,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:18,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:18,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:18,870 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:18,870 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:18,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:18,870 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:18,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:18,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:18,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:18,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:18,871 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:18,871 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:18,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:18,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:18,872 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:18,872 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:18,872 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:18,872 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:18,872 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:18,872 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:18,872 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:18,872 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:18,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:18,874 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:18,875 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:18,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:18,875 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:18,875 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:18,949 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:18,949 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:18,950 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:18,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:18,950 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:18,950 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:18,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2178 [2022-12-06 07:32:18,950 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-06 07:32:18,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:18,950 INFO L85 PathProgramCache]: Analyzing trace with hash -661286462, now seen corresponding path program 1 times [2022-12-06 07:32:18,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:18,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666607936] [2022-12-06 07:32:18,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:18,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:19,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-06 07:32:19,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:19,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666607936] [2022-12-06 07:32:19,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666607936] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:19,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:19,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:19,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985838315] [2022-12-06 07:32:19,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:19,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:19,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:19,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:19,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:19,017 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:19,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:19,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:19,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:19,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:19,053 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:19,054 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:19,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:19,054 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:19,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:19,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:19,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:19,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:19,055 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:19,055 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:19,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:19,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:19,056 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:19,056 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:19,056 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:19,056 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:19,056 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:19,056 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:19,056 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:19,056 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:19,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:19,058 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:19,058 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:19,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:19,059 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:19,059 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:19,134 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:19,135 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:19,135 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:19,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:19,135 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:19,135 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:19,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2179 [2022-12-06 07:32:19,135 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-06 07:32:19,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:19,135 INFO L85 PathProgramCache]: Analyzing trace with hash -634504353, now seen corresponding path program 1 times [2022-12-06 07:32:19,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:19,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407784446] [2022-12-06 07:32:19,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:19,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:19,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-06 07:32:19,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:19,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407784446] [2022-12-06 07:32:19,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407784446] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:19,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:19,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:19,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264062431] [2022-12-06 07:32:19,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:19,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:19,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:19,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:19,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:19,203 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:19,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:19,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:19,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:19,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:19,239 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:19,240 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:19,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:19,240 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:19,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:19,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:19,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:19,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:19,241 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:19,241 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:19,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:19,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:19,241 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:19,242 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:19,242 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:19,242 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:19,242 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:19,242 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:19,242 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:19,242 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:19,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:19,244 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:19,244 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:19,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:19,245 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:19,245 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:19,319 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:19,320 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:19,320 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:19,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:19,320 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:19,320 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:19,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2180 [2022-12-06 07:32:19,320 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-06 07:32:19,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:19,320 INFO L85 PathProgramCache]: Analyzing trace with hash -604028160, now seen corresponding path program 1 times [2022-12-06 07:32:19,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:19,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207812864] [2022-12-06 07:32:19,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:19,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:19,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-06 07:32:19,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:19,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207812864] [2022-12-06 07:32:19,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207812864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:19,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:19,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:19,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147575465] [2022-12-06 07:32:19,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:19,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:19,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:19,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:19,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:19,385 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:19,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:19,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:19,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:19,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:19,422 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:19,422 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:19,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:19,422 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:19,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:19,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:19,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:19,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:19,423 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:19,423 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:19,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:19,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:19,424 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:19,424 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:19,424 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:19,424 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:19,424 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:19,424 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:19,424 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:19,424 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:19,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:19,426 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:19,426 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:19,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:19,427 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:19,427 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:19,502 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:19,503 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:19,503 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:19,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:19,503 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:19,503 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:19,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2181 [2022-12-06 07:32:19,503 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-06 07:32:19,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:19,503 INFO L85 PathProgramCache]: Analyzing trace with hash -577246051, now seen corresponding path program 1 times [2022-12-06 07:32:19,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:19,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575301031] [2022-12-06 07:32:19,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:19,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:19,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-06 07:32:19,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:19,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575301031] [2022-12-06 07:32:19,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575301031] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:19,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:19,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:19,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84304285] [2022-12-06 07:32:19,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:19,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:19,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:19,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:19,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:19,573 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:19,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:19,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:19,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:19,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:19,613 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:19,613 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:19,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:19,614 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:19,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:19,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:19,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:19,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:19,614 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:19,615 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:19,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:19,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:19,615 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:19,615 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:19,615 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:19,615 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:19,616 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:19,616 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:19,616 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:19,616 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:19,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:19,618 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:19,618 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:19,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:19,618 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:19,618 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:19,693 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:19,694 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:19,694 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:19,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:19,694 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:19,694 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:19,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2182 [2022-12-06 07:32:19,694 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-06 07:32:19,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:19,695 INFO L85 PathProgramCache]: Analyzing trace with hash -546769858, now seen corresponding path program 1 times [2022-12-06 07:32:19,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:19,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311290142] [2022-12-06 07:32:19,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:19,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:19,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-06 07:32:19,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:19,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311290142] [2022-12-06 07:32:19,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311290142] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:19,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:19,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:19,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70396341] [2022-12-06 07:32:19,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:19,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:19,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:19,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:19,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:19,760 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:19,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:19,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:19,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:19,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:19,797 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:19,798 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:19,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:19,798 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:19,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:19,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:19,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:19,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:19,799 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:19,799 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:19,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:19,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:19,799 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:19,800 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:19,800 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:19,800 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:19,800 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:19,800 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:19,800 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:19,800 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:19,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:19,802 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:19,802 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:19,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:19,803 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:19,803 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:19,877 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:19,878 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:19,878 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:19,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:19,878 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:19,878 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:19,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2183 [2022-12-06 07:32:19,878 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-06 07:32:19,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:19,879 INFO L85 PathProgramCache]: Analyzing trace with hash -519987749, now seen corresponding path program 1 times [2022-12-06 07:32:19,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:19,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732101837] [2022-12-06 07:32:19,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:19,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:19,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-06 07:32:19,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:19,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732101837] [2022-12-06 07:32:19,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732101837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:19,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:19,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:19,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556920456] [2022-12-06 07:32:19,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:19,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:19,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:19,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:19,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:19,961 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:19,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:19,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:19,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:19,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:20,000 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:20,000 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:20,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:20,000 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:20,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:20,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:20,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:20,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:20,001 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:20,001 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:20,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:20,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:20,002 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:20,002 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:20,002 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:20,002 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:20,002 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:20,002 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:20,002 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:20,002 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:20,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:20,005 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:20,005 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:20,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:20,005 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:20,005 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:20,079 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:20,080 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:20,080 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:20,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:20,080 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:20,080 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:20,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2184 [2022-12-06 07:32:20,081 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-06 07:32:20,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:20,081 INFO L85 PathProgramCache]: Analyzing trace with hash -489511556, now seen corresponding path program 1 times [2022-12-06 07:32:20,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:20,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985338787] [2022-12-06 07:32:20,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:20,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:20,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-06 07:32:20,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:20,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985338787] [2022-12-06 07:32:20,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985338787] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:20,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:20,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:20,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399695377] [2022-12-06 07:32:20,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:20,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:20,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:20,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:20,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:20,145 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:20,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:20,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:20,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:20,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:20,182 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:20,183 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:20,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:20,183 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:20,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:20,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:20,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:20,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:20,184 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:20,184 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:20,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:20,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:20,184 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:20,184 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:20,184 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:20,185 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:20,185 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:20,185 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:20,185 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:20,185 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:20,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:20,187 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:20,187 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:20,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:20,187 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:20,187 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:20,261 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:20,262 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:20,262 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:20,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:20,262 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:20,262 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:20,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2185 [2022-12-06 07:32:20,262 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-06 07:32:20,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:20,262 INFO L85 PathProgramCache]: Analyzing trace with hash -462729447, now seen corresponding path program 1 times [2022-12-06 07:32:20,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:20,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71791604] [2022-12-06 07:32:20,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:20,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:20,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:20,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-06 07:32:20,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:20,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71791604] [2022-12-06 07:32:20,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71791604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:20,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:20,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:20,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41875636] [2022-12-06 07:32:20,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:20,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:20,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:20,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:20,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:20,331 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:20,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:20,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:20,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:20,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:20,367 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:20,367 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:20,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 371 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:20,367 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:20,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:20,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:20,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:20,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:20,368 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:20,368 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:20,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:20,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:20,369 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:20,369 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:20,369 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:20,369 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:20,369 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:20,369 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:20,369 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:20,369 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:20,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:20,371 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:20,372 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:20,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:20,372 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:20,372 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:20,445 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:20,446 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:20,446 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:20,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:20,446 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:20,446 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:20,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2186 [2022-12-06 07:32:20,446 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-06 07:32:20,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:20,447 INFO L85 PathProgramCache]: Analyzing trace with hash -432253254, now seen corresponding path program 1 times [2022-12-06 07:32:20,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:20,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697260094] [2022-12-06 07:32:20,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:20,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:20,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-06 07:32:20,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:20,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697260094] [2022-12-06 07:32:20,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697260094] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:20,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:20,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:20,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069396841] [2022-12-06 07:32:20,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:20,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:20,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:20,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:20,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:20,512 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:20,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:20,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:20,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:20,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:20,548 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:20,548 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:20,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:20,548 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:20,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:20,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:20,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:20,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:20,549 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:20,549 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:20,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:20,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:20,549 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:20,550 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:20,550 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:20,550 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:20,550 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:20,550 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:20,550 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:20,550 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:20,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:20,552 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:20,552 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:20,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:20,553 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:20,553 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:20,626 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:20,627 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:20,627 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:20,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:20,628 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:20,628 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:20,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2187 [2022-12-06 07:32:20,628 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-06 07:32:20,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:20,628 INFO L85 PathProgramCache]: Analyzing trace with hash -405471145, now seen corresponding path program 1 times [2022-12-06 07:32:20,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:20,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635569212] [2022-12-06 07:32:20,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:20,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:20,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-06 07:32:20,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:20,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635569212] [2022-12-06 07:32:20,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635569212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:20,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:20,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:20,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462196587] [2022-12-06 07:32:20,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:20,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:20,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:20,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:20,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:20,696 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:20,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:20,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:20,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:20,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:20,737 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:20,737 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:20,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:20,738 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:20,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:20,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:20,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:20,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:20,738 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:20,738 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:20,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:20,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:20,739 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:20,739 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:20,739 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:20,739 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:20,739 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:20,739 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:20,739 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:20,739 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:20,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:20,741 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:20,742 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:20,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:20,742 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:20,742 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:20,818 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:20,819 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:32:20,819 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:20,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:20,819 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:20,819 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:20,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2188 [2022-12-06 07:32:20,819 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-06 07:32:20,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:20,819 INFO L85 PathProgramCache]: Analyzing trace with hash -374994952, now seen corresponding path program 1 times [2022-12-06 07:32:20,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:20,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617278249] [2022-12-06 07:32:20,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:20,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:20,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-06 07:32:20,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:20,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617278249] [2022-12-06 07:32:20,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617278249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:20,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:20,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:20,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591323413] [2022-12-06 07:32:20,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:20,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:20,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:20,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:20,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:20,884 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:20,885 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:20,885 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:20,885 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:20,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:20,921 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:20,922 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:20,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:20,922 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:20,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:20,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:20,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:20,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:20,923 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:20,923 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:20,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:20,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:20,923 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:20,924 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:20,924 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:20,924 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:20,924 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:20,924 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:20,924 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:20,924 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:20,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:20,926 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:20,926 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:20,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:20,926 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:20,927 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:21,002 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:21,003 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:21,003 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:21,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:21,003 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:21,003 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:21,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2189 [2022-12-06 07:32:21,003 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-06 07:32:21,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:21,003 INFO L85 PathProgramCache]: Analyzing trace with hash -348212843, now seen corresponding path program 1 times [2022-12-06 07:32:21,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:21,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771335934] [2022-12-06 07:32:21,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:21,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:21,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-06 07:32:21,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:21,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771335934] [2022-12-06 07:32:21,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771335934] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:21,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:21,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:21,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517569565] [2022-12-06 07:32:21,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:21,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:21,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:21,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:21,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:21,083 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:21,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:21,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:21,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:21,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:21,119 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:21,120 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:21,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:21,120 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:21,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:21,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:21,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:21,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:21,121 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:21,121 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:21,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:21,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:21,121 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:21,121 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:21,122 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:21,122 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:21,122 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:21,122 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:21,122 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:21,122 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:21,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:21,124 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:21,124 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:21,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:21,124 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:21,125 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:21,213 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:21,214 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-06 07:32:21,214 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:21,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:21,214 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:21,214 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:21,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2190 [2022-12-06 07:32:21,214 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-06 07:32:21,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:21,214 INFO L85 PathProgramCache]: Analyzing trace with hash -317736650, now seen corresponding path program 1 times [2022-12-06 07:32:21,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:21,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026231703] [2022-12-06 07:32:21,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:21,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:21,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-06 07:32:21,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:21,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026231703] [2022-12-06 07:32:21,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026231703] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:21,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:21,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:21,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3219798] [2022-12-06 07:32:21,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:21,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:21,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:21,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:21,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:21,282 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:21,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:21,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:21,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:21,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:21,328 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:21,328 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:21,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:21,329 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:21,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:21,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:21,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:21,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:21,329 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:21,329 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:21,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:21,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:21,330 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:21,330 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:21,330 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:21,330 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:21,330 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:21,330 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:21,330 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:21,330 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:21,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:21,333 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:21,333 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:21,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:21,333 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:21,333 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:21,407 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:21,408 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:21,408 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:21,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:21,409 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:21,409 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:21,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2191 [2022-12-06 07:32:21,409 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-06 07:32:21,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:21,409 INFO L85 PathProgramCache]: Analyzing trace with hash -290954541, now seen corresponding path program 1 times [2022-12-06 07:32:21,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:21,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774583] [2022-12-06 07:32:21,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:21,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:21,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-06 07:32:21,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:21,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774583] [2022-12-06 07:32:21,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:21,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:21,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:21,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224015471] [2022-12-06 07:32:21,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:21,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:21,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:21,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:21,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:21,476 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:21,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:21,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:21,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:21,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:21,513 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:21,513 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:21,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:21,514 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:21,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:21,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:21,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:21,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:21,514 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:21,514 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:21,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:21,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:21,515 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:21,515 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:21,515 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:21,515 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:21,515 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:21,515 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:21,515 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:21,515 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:21,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:21,518 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:21,518 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:21,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:21,518 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:21,518 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:21,593 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:21,594 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:21,594 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:21,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:21,594 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:21,594 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:21,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2192 [2022-12-06 07:32:21,594 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-06 07:32:21,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:21,594 INFO L85 PathProgramCache]: Analyzing trace with hash -260478348, now seen corresponding path program 1 times [2022-12-06 07:32:21,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:21,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926037928] [2022-12-06 07:32:21,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:21,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:21,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-06 07:32:21,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:21,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926037928] [2022-12-06 07:32:21,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926037928] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:21,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:21,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:21,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446188686] [2022-12-06 07:32:21,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:21,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:21,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:21,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:21,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:21,661 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:21,661 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:21,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:21,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:21,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:21,698 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:21,699 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:21,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:21,699 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:21,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:21,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:21,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:21,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:21,700 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:21,700 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:21,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:21,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:21,701 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:21,701 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:21,701 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:21,701 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:21,701 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:21,701 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:21,701 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:21,701 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:21,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:21,703 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:21,704 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:21,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:21,704 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:21,704 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:21,781 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:21,782 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:32:21,782 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:21,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:21,782 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:21,782 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:21,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2193 [2022-12-06 07:32:21,782 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-06 07:32:21,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:21,782 INFO L85 PathProgramCache]: Analyzing trace with hash -233696239, now seen corresponding path program 1 times [2022-12-06 07:32:21,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:21,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179098223] [2022-12-06 07:32:21,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:21,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:21,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-06 07:32:21,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:21,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179098223] [2022-12-06 07:32:21,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179098223] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:21,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:21,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:21,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680821604] [2022-12-06 07:32:21,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:21,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:21,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:21,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:21,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:21,848 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:21,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:21,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:21,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:21,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:21,889 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:21,889 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:21,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:21,890 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:21,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:21,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:21,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:21,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:21,890 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:21,890 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:21,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:21,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:21,891 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:21,891 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:21,891 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:21,891 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:21,891 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:21,891 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:21,892 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:21,892 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:21,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:21,894 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:21,894 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:21,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:21,894 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:21,894 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:21,968 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:21,969 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:21,969 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:21,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:21,969 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:21,970 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:21,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2194 [2022-12-06 07:32:21,970 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-06 07:32:21,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:21,970 INFO L85 PathProgramCache]: Analyzing trace with hash -203220046, now seen corresponding path program 1 times [2022-12-06 07:32:21,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:21,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460944282] [2022-12-06 07:32:21,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:21,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:22,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-06 07:32:22,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:22,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460944282] [2022-12-06 07:32:22,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460944282] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:22,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:22,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:22,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797182569] [2022-12-06 07:32:22,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:22,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:22,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:22,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:22,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:22,034 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:22,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:22,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:22,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:22,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:22,070 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:22,070 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:22,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:22,071 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:22,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:22,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:22,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:22,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:22,071 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:22,072 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:22,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:22,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:22,072 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:22,072 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:22,072 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:22,072 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:22,072 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:22,073 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:22,073 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:22,073 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:22,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:22,075 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:22,075 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:22,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:22,075 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:22,075 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:22,149 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:22,149 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:22,150 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:22,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:22,150 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:22,150 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:22,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2195 [2022-12-06 07:32:22,150 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-06 07:32:22,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:22,150 INFO L85 PathProgramCache]: Analyzing trace with hash -176437937, now seen corresponding path program 1 times [2022-12-06 07:32:22,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:22,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172893106] [2022-12-06 07:32:22,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:22,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:22,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-06 07:32:22,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:22,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172893106] [2022-12-06 07:32:22,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172893106] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:22,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:22,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:22,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677493762] [2022-12-06 07:32:22,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:22,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:22,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:22,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:22,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:22,228 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:22,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:22,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:22,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:22,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:22,264 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:22,264 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:22,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:22,265 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:22,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:22,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:22,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:22,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:22,265 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:22,266 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:22,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:22,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:22,266 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:22,266 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:22,266 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:22,266 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:22,267 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:22,267 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:22,267 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:22,267 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:22,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:22,269 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:22,269 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:22,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:22,269 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:22,269 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:22,345 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:22,346 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:32:22,346 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:22,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:22,346 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:22,346 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:22,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2196 [2022-12-06 07:32:22,346 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-06 07:32:22,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:22,346 INFO L85 PathProgramCache]: Analyzing trace with hash -145961744, now seen corresponding path program 1 times [2022-12-06 07:32:22,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:22,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084602781] [2022-12-06 07:32:22,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:22,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:22,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-06 07:32:22,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:22,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084602781] [2022-12-06 07:32:22,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084602781] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:22,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:22,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:22,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085547051] [2022-12-06 07:32:22,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:22,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:22,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:22,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:22,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:22,411 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:22,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:22,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:22,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:22,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:22,453 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:22,453 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:22,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:22,453 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:22,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:22,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:22,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:22,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:22,454 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:22,454 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:22,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:22,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:22,454 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:22,455 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:22,455 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:22,455 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:22,455 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:22,455 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:22,455 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:22,455 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:22,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:22,457 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:22,457 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:22,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:22,458 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:22,458 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:22,532 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:22,533 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:22,533 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:22,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:22,533 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:22,533 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:22,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2197 [2022-12-06 07:32:22,533 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-06 07:32:22,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:22,534 INFO L85 PathProgramCache]: Analyzing trace with hash -119179635, now seen corresponding path program 1 times [2022-12-06 07:32:22,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:22,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029070807] [2022-12-06 07:32:22,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:22,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:22,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-06 07:32:22,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:22,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029070807] [2022-12-06 07:32:22,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029070807] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:22,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:22,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:22,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338516257] [2022-12-06 07:32:22,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:22,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:22,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:22,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:22,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:22,600 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:22,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:22,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:22,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:22,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:22,641 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:22,641 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:22,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:22,642 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:22,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:22,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:22,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:22,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:22,642 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:22,642 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:22,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:22,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:22,643 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:22,643 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:22,643 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:22,643 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:22,643 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:22,643 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:22,644 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:22,644 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:22,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:22,646 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:22,646 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:22,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:22,646 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:22,646 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:22,722 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:22,723 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:32:22,723 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:22,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:22,723 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:22,723 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:22,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2198 [2022-12-06 07:32:22,723 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-06 07:32:22,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:22,723 INFO L85 PathProgramCache]: Analyzing trace with hash -88703442, now seen corresponding path program 1 times [2022-12-06 07:32:22,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:22,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630138799] [2022-12-06 07:32:22,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:22,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:22,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-06 07:32:22,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:22,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630138799] [2022-12-06 07:32:22,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630138799] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:22,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:22,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:22,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323996522] [2022-12-06 07:32:22,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:22,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:22,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:22,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:22,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:22,791 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:22,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:22,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:22,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:22,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:22,833 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:22,833 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:22,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:22,834 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:22,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:22,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:22,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:22,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:22,834 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:22,834 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:22,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:22,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:22,835 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:22,835 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:22,835 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:22,835 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:22,835 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:22,836 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:22,836 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:22,836 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:22,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:22,838 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:22,838 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:22,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:22,838 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:22,838 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:22,913 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:22,914 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:22,914 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:22,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:22,914 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:22,914 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:22,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2199 [2022-12-06 07:32:22,915 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-06 07:32:22,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:22,915 INFO L85 PathProgramCache]: Analyzing trace with hash -61921333, now seen corresponding path program 1 times [2022-12-06 07:32:22,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:22,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504479552] [2022-12-06 07:32:22,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:22,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:22,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-06 07:32:22,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:22,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504479552] [2022-12-06 07:32:22,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504479552] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:22,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:22,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:22,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009163581] [2022-12-06 07:32:22,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:22,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:22,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:22,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:22,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:22,991 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:22,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:22,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:22,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:22,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:23,029 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:23,030 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:23,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:23,030 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:23,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:23,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:23,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:23,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:23,031 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:23,031 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:23,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:23,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:23,032 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:23,032 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:23,032 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:23,032 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:23,032 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:23,032 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:23,032 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:23,032 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:23,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:23,035 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:23,035 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:23,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:23,035 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:23,036 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:23,113 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:23,114 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:32:23,114 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:23,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:23,114 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:23,114 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:23,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2200 [2022-12-06 07:32:23,114 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-06 07:32:23,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:23,115 INFO L85 PathProgramCache]: Analyzing trace with hash -31445140, now seen corresponding path program 1 times [2022-12-06 07:32:23,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:23,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436679722] [2022-12-06 07:32:23,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:23,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:23,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-06 07:32:23,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:23,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436679722] [2022-12-06 07:32:23,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436679722] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:23,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:23,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:23,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048243207] [2022-12-06 07:32:23,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:23,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:23,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:23,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:23,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:23,181 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:23,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:23,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:23,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:23,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:23,223 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:23,224 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:23,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:23,224 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:23,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:23,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:23,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:23,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:23,225 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:23,225 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:23,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:23,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:23,225 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:23,225 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:23,226 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:23,226 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:23,226 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:23,226 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:23,226 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:23,226 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:23,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:23,228 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:23,228 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:23,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:23,229 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:23,229 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:23,315 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:23,316 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-06 07:32:23,316 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:23,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:23,316 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:23,316 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:23,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2201 [2022-12-06 07:32:23,316 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-06 07:32:23,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:23,316 INFO L85 PathProgramCache]: Analyzing trace with hash -4663031, now seen corresponding path program 1 times [2022-12-06 07:32:23,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:23,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423230200] [2022-12-06 07:32:23,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:23,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:23,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-06 07:32:23,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:23,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423230200] [2022-12-06 07:32:23,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423230200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:23,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:23,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:23,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436686412] [2022-12-06 07:32:23,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:23,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:23,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:23,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:23,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:23,384 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:23,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:23,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:23,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:23,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:23,420 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:23,421 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:23,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:23,421 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:23,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:23,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:23,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:23,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:23,422 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:23,422 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:23,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:23,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:23,423 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:23,423 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:23,423 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:23,423 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:23,423 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:23,423 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:23,423 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:23,423 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:23,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:23,425 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:23,425 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:23,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:23,426 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:23,426 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:23,499 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:23,500 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:23,500 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:23,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:23,501 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:23,501 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:23,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2202 [2022-12-06 07:32:23,501 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-06 07:32:23,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:23,501 INFO L85 PathProgramCache]: Analyzing trace with hash 25813162, now seen corresponding path program 1 times [2022-12-06 07:32:23,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:23,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981459625] [2022-12-06 07:32:23,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:23,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:23,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-06 07:32:23,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:23,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981459625] [2022-12-06 07:32:23,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981459625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:23,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:23,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:23,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273649698] [2022-12-06 07:32:23,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:23,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:23,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:23,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:23,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:23,569 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:23,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:23,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:23,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:23,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:23,610 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:23,610 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:23,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:23,611 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:23,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:23,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:23,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:23,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:23,611 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:23,612 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:23,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:23,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:23,612 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:23,612 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:23,612 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:23,613 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:23,613 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:23,613 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:23,613 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:23,613 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:23,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:23,615 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:23,615 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:23,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:23,615 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:23,616 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:23,689 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:23,690 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:23,690 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:23,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:23,690 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:23,690 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:23,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2203 [2022-12-06 07:32:23,690 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-06 07:32:23,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:23,690 INFO L85 PathProgramCache]: Analyzing trace with hash 52595271, now seen corresponding path program 1 times [2022-12-06 07:32:23,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:23,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479397897] [2022-12-06 07:32:23,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:23,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32: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-06 07:32:23,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:23,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479397897] [2022-12-06 07:32:23,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479397897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:23,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:23,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:23,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148124058] [2022-12-06 07:32:23,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:23,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:23,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:23,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:23,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:23,758 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:23,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:23,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:23,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:23,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:23,794 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:23,794 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:23,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:23,795 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:23,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:23,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:23,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:23,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:23,795 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:23,795 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:23,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:23,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:23,796 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:23,796 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:23,796 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:23,796 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:23,796 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:23,796 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:23,797 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:23,797 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:23,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:23,799 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:23,799 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:23,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:23,799 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:23,799 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:23,873 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:23,874 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:23,874 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:23,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:23,874 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:23,874 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:23,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2204 [2022-12-06 07:32:23,874 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-06 07:32:23,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:23,874 INFO L85 PathProgramCache]: Analyzing trace with hash 83071464, now seen corresponding path program 1 times [2022-12-06 07:32:23,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:23,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500108643] [2022-12-06 07:32:23,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:23,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:23,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-06 07:32:23,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:23,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500108643] [2022-12-06 07:32:23,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500108643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:23,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:23,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:23,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901211216] [2022-12-06 07:32:23,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:23,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:23,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:23,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:23,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:23,943 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:23,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:23,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:23,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:23,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:23,986 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:23,987 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:23,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:23,987 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:23,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:23,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:23,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:23,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:23,988 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:23,988 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:23,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:23,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:23,989 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:23,989 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:23,989 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:23,989 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:23,989 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:23,989 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:23,989 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:23,989 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:23,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:23,992 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:23,992 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:23,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:23,992 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:23,992 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:24,066 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:24,067 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:24,067 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:24,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:24,067 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:24,067 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:24,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2205 [2022-12-06 07:32:24,067 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-06 07:32:24,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:24,067 INFO L85 PathProgramCache]: Analyzing trace with hash 109853573, now seen corresponding path program 1 times [2022-12-06 07:32:24,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:24,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702705857] [2022-12-06 07:32:24,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:24,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:24,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:24,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-06 07:32:24,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:24,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702705857] [2022-12-06 07:32:24,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702705857] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:24,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:24,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:24,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154827421] [2022-12-06 07:32:24,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:24,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:24,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:24,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:24,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:24,136 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:24,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:24,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:24,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:24,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:24,171 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:24,171 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:24,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:24,171 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:24,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:24,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:24,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:24,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:24,172 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:24,172 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:24,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:24,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:24,172 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:24,173 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:24,173 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:24,173 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:24,173 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:24,173 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:24,173 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:24,173 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:24,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:24,175 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:24,175 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:24,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:24,176 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:24,176 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:24,249 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:24,250 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:24,250 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:24,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:24,250 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:24,250 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:24,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2206 [2022-12-06 07:32:24,251 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-06 07:32:24,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:24,251 INFO L85 PathProgramCache]: Analyzing trace with hash 140329766, now seen corresponding path program 1 times [2022-12-06 07:32:24,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:24,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444577664] [2022-12-06 07:32:24,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:24,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:24,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-06 07:32:24,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:24,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444577664] [2022-12-06 07:32:24,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444577664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:24,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:24,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:24,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972352663] [2022-12-06 07:32:24,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:24,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:24,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:24,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:24,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:24,316 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:24,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:24,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:24,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:24,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:24,363 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:24,363 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:24,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:24,363 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:24,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:24,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:24,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:24,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:24,364 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:24,364 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:24,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:24,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:24,365 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:24,365 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:24,365 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:24,365 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:24,365 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:24,365 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:24,365 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:24,365 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:24,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:24,367 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:24,367 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:24,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:24,368 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:24,368 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:24,441 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:24,442 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:24,442 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:24,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:24,442 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:24,442 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:24,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2207 [2022-12-06 07:32:24,442 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-06 07:32:24,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:24,443 INFO L85 PathProgramCache]: Analyzing trace with hash 167111875, now seen corresponding path program 1 times [2022-12-06 07:32:24,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:24,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129127634] [2022-12-06 07:32:24,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:24,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:24,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-06 07:32:24,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:24,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129127634] [2022-12-06 07:32:24,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129127634] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:24,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:24,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:24,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215404973] [2022-12-06 07:32:24,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:24,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:24,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:24,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:24,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:24,505 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:24,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:24,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:24,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:24,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:24,547 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:24,547 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:24,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:24,548 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:24,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:24,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:24,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:24,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:24,548 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:24,548 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:24,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:24,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:24,549 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:24,549 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:24,549 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:24,549 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:24,549 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:24,549 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:24,549 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:24,549 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:24,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:24,552 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:24,552 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:24,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:24,552 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:24,552 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:24,627 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:24,628 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:24,628 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:24,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:24,628 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:24,628 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:24,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2208 [2022-12-06 07:32:24,628 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-06 07:32:24,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:24,628 INFO L85 PathProgramCache]: Analyzing trace with hash 197588068, now seen corresponding path program 1 times [2022-12-06 07:32:24,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:24,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362478687] [2022-12-06 07:32:24,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:24,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:24,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:24,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-06 07:32:24,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:24,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362478687] [2022-12-06 07:32:24,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362478687] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:24,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:24,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:24,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576053984] [2022-12-06 07:32:24,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:24,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:24,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:24,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:24,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:24,693 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:24,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:24,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:24,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:24,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:24,729 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:24,730 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:24,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:24,730 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:24,730 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:24,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:24,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:24,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:24,731 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:24,731 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:24,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:24,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:24,732 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:24,732 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:24,732 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:24,732 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:24,732 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:24,732 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:24,732 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:24,732 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:24,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:24,734 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:24,734 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:24,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:24,735 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:24,735 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:24,813 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:24,814 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:32:24,814 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:24,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:24,814 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:24,814 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:24,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2209 [2022-12-06 07:32:24,814 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-06 07:32:24,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:24,814 INFO L85 PathProgramCache]: Analyzing trace with hash 224370177, now seen corresponding path program 1 times [2022-12-06 07:32:24,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:24,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948215121] [2022-12-06 07:32:24,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:24,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:24,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-06 07:32:24,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:24,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948215121] [2022-12-06 07:32:24,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948215121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:24,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:24,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:24,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99932549] [2022-12-06 07:32:24,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:24,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:24,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:24,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:24,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:24,881 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:24,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:24,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:24,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:24,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:24,917 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:24,917 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:24,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:24,918 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:24,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:24,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:24,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:24,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:24,918 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:24,918 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:24,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:24,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:24,919 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:24,919 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:24,919 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:24,919 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:24,919 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:24,919 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:24,919 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:24,920 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:24,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:24,922 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:24,922 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:24,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:24,922 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:24,922 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:24,998 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:24,999 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:32:24,999 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:24,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:24,999 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:24,999 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:24,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2210 [2022-12-06 07:32:24,999 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-06 07:32:24,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:24,999 INFO L85 PathProgramCache]: Analyzing trace with hash 254846370, now seen corresponding path program 1 times [2022-12-06 07:32:24,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:24,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655932116] [2022-12-06 07:32:24,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:24,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:25,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-06 07:32:25,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:25,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655932116] [2022-12-06 07:32:25,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655932116] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:25,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:25,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:25,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217231036] [2022-12-06 07:32:25,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:25,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:25,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:25,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:25,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:25,064 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:25,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:25,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:25,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:25,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:25,107 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:25,107 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:25,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:25,107 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:25,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:25,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:25,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:25,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:25,108 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:25,108 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:25,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:25,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:25,109 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:25,109 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:25,109 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:25,109 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:25,109 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:25,109 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:25,109 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:25,109 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:25,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:25,111 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:25,111 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:25,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:25,112 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:25,112 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:25,187 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:25,187 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:25,187 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:25,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:25,188 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:25,188 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:25,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2211 [2022-12-06 07:32:25,188 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-06 07:32:25,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:25,188 INFO L85 PathProgramCache]: Analyzing trace with hash 281628479, now seen corresponding path program 1 times [2022-12-06 07:32:25,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:25,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127685919] [2022-12-06 07:32:25,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:25,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:25,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-06 07:32:25,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:25,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127685919] [2022-12-06 07:32:25,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127685919] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:25,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:25,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:25,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146492191] [2022-12-06 07:32:25,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:25,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:25,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:25,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:25,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:25,255 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:25,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:25,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:25,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:25,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:25,296 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:25,296 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:25,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:25,296 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:25,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:25,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:25,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:25,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:25,297 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:25,297 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:25,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:25,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:25,298 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:25,298 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:25,298 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:25,298 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:25,298 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:25,298 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:25,298 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:25,298 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:25,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:25,300 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:25,300 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:25,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:25,301 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:25,301 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:25,375 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:25,376 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:25,376 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:25,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:25,376 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:25,376 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:25,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2212 [2022-12-06 07:32:25,376 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-06 07:32:25,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:25,376 INFO L85 PathProgramCache]: Analyzing trace with hash 312104672, now seen corresponding path program 1 times [2022-12-06 07:32:25,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:25,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144576076] [2022-12-06 07:32:25,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:25,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:25,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-06 07:32:25,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:25,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144576076] [2022-12-06 07:32:25,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144576076] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:25,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:25,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:25,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320417858] [2022-12-06 07:32:25,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:25,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:25,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:25,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:25,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:25,460 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:25,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:25,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:25,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:25,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:25,502 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:25,502 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:25,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 354 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:25,503 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:25,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:25,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:25,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:25,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:25,503 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:25,503 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:25,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:25,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:25,504 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:25,504 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:25,504 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:25,504 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:25,504 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:25,504 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:25,504 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:25,504 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:25,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:25,507 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:25,507 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:25,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:25,507 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:25,507 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:25,583 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:25,583 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:25,584 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:25,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:25,584 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:25,584 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:25,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2213 [2022-12-06 07:32:25,584 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-06 07:32:25,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:25,584 INFO L85 PathProgramCache]: Analyzing trace with hash 338886781, now seen corresponding path program 1 times [2022-12-06 07:32:25,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:25,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322117628] [2022-12-06 07:32:25,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:25,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:25,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-06 07:32:25,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:25,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322117628] [2022-12-06 07:32:25,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322117628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:25,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:25,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:25,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576005934] [2022-12-06 07:32:25,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:25,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:25,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:25,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:25,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:25,650 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:25,650 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:25,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:25,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:25,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:25,690 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:25,690 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:25,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:25,691 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:25,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:25,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:25,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:25,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:25,691 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:25,692 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:25,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:25,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:25,692 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:25,692 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:25,692 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:25,692 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:25,692 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:25,693 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:25,693 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:25,693 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:25,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:25,695 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:25,695 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:25,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:25,695 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:25,695 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:25,769 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:25,770 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:25,770 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:25,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:25,771 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:25,771 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:25,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2214 [2022-12-06 07:32:25,771 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-06 07:32:25,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:25,771 INFO L85 PathProgramCache]: Analyzing trace with hash 369362974, now seen corresponding path program 1 times [2022-12-06 07:32:25,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:25,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548653899] [2022-12-06 07:32:25,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:25,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:25,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:25,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-06 07:32:25,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:25,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548653899] [2022-12-06 07:32:25,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548653899] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:25,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:25,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:25,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620283172] [2022-12-06 07:32:25,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:25,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:25,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:25,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:25,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:25,834 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:25,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:25,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:25,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:25,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:25,876 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:25,876 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:25,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:25,877 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:25,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:25,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:25,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:25,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:25,877 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:25,877 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:25,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:25,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:25,878 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:25,878 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:25,878 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:25,878 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:25,878 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:25,878 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:25,879 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:25,879 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:25,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:25,881 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:25,881 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:25,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:25,881 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:25,881 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:25,958 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:25,959 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:32:25,959 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:25,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:25,959 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:25,959 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:25,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2215 [2022-12-06 07:32:25,959 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-06 07:32:25,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:25,959 INFO L85 PathProgramCache]: Analyzing trace with hash 396145083, now seen corresponding path program 1 times [2022-12-06 07:32:25,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:25,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116788945] [2022-12-06 07:32:25,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:25,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:26,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-06 07:32:26,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:26,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116788945] [2022-12-06 07:32:26,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116788945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:26,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:26,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:26,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307269228] [2022-12-06 07:32:26,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:26,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:26,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:26,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:26,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:26,028 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:26,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:26,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:26,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:26,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:26,063 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:26,063 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:26,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 370 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:26,064 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:26,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:26,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:26,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:26,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:26,064 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:26,064 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:26,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:26,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:26,065 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:26,065 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:26,065 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:26,065 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:26,065 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:26,065 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:26,066 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:26,066 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:26,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:26,068 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:26,068 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:26,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:26,068 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:26,068 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:26,144 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:26,145 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:32:26,145 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:26,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:26,145 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:26,145 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:26,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2216 [2022-12-06 07:32:26,145 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-06 07:32:26,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:26,146 INFO L85 PathProgramCache]: Analyzing trace with hash 426621276, now seen corresponding path program 1 times [2022-12-06 07:32:26,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:26,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062977074] [2022-12-06 07:32:26,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:26,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32: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-06 07:32:26,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:26,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062977074] [2022-12-06 07:32:26,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062977074] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:26,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:26,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:26,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444560791] [2022-12-06 07:32:26,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:26,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:26,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:26,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:26,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:26,210 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:26,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:26,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:26,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:26,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:26,253 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:26,253 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:26,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 349 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:26,253 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:26,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:26,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:26,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:26,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:26,254 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:26,254 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:26,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:26,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:26,255 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:26,255 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:26,255 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:26,255 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:26,255 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:26,255 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:26,255 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:26,255 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:26,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:26,257 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:26,258 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:26,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:26,258 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:26,258 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:26,331 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:26,332 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:26,332 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:26,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:26,332 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:26,332 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:26,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2217 [2022-12-06 07:32:26,332 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-06 07:32:26,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:26,333 INFO L85 PathProgramCache]: Analyzing trace with hash 453403385, now seen corresponding path program 1 times [2022-12-06 07:32:26,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:26,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123878074] [2022-12-06 07:32:26,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:26,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:26,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-06 07:32:26,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:26,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123878074] [2022-12-06 07:32:26,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123878074] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:26,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:26,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:26,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644951572] [2022-12-06 07:32:26,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:26,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:26,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:26,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:26,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:26,399 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:26,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:26,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:26,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:26,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:26,441 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:26,441 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:26,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:26,441 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:26,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:26,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:26,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:26,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:26,442 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:26,442 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:26,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:26,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:26,443 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:26,443 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:26,443 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:26,443 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:26,443 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:26,443 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:26,443 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:26,443 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:26,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:26,445 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:26,446 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:26,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:26,446 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:26,446 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:26,523 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:26,524 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:32:26,524 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:26,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:26,524 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:26,524 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:26,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2218 [2022-12-06 07:32:26,524 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-06 07:32:26,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:26,524 INFO L85 PathProgramCache]: Analyzing trace with hash 483879578, now seen corresponding path program 1 times [2022-12-06 07:32:26,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:26,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250852228] [2022-12-06 07:32:26,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:26,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:26,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:26,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:26,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:26,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250852228] [2022-12-06 07:32:26,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250852228] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:26,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:26,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:26,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677180] [2022-12-06 07:32:26,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:26,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:26,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:26,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:26,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:26,605 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:26,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:26,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:26,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:26,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:26,648 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:26,649 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:26,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:26,649 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:26,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:26,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:26,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:26,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:26,650 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:26,650 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:26,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:26,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:26,650 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:26,650 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:26,651 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:26,651 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:26,651 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:26,651 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:26,651 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:26,651 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:26,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:26,653 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:26,653 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:26,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:26,654 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:26,654 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:26,728 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:26,729 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:26,729 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:26,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:26,729 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:26,729 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:26,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2219 [2022-12-06 07:32:26,729 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-06 07:32:26,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:26,729 INFO L85 PathProgramCache]: Analyzing trace with hash 510661687, now seen corresponding path program 1 times [2022-12-06 07:32:26,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:26,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241464710] [2022-12-06 07:32:26,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:26,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:26,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-06 07:32:26,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:26,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241464710] [2022-12-06 07:32:26,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241464710] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:26,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:26,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:26,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560632134] [2022-12-06 07:32:26,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:26,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:26,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:26,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:26,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:26,796 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:26,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:26,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:26,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:26,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:26,835 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:26,835 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:26,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 374 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:26,835 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:26,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:26,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:26,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:26,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:26,836 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:26,836 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:26,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:26,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:26,837 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:26,837 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:26,837 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:26,837 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:26,837 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:26,837 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:26,837 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:26,837 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:26,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:26,839 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:26,839 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:26,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:26,840 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:26,840 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:26,919 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:26,920 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 07:32:26,920 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:26,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:26,921 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:26,921 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:26,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2220 [2022-12-06 07:32:26,921 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-06 07:32:26,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:26,921 INFO L85 PathProgramCache]: Analyzing trace with hash 541137880, now seen corresponding path program 1 times [2022-12-06 07:32:26,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:26,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29361452] [2022-12-06 07:32:26,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:26,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:26,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:26,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-06 07:32:26,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:26,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29361452] [2022-12-06 07:32:26,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29361452] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:26,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:26,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:26,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894919326] [2022-12-06 07:32:26,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:26,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:26,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:26,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:26,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:26,985 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:26,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:26,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:26,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:26,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:27,026 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:27,027 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:27,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:27,027 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:27,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:27,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:27,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:27,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:27,028 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:27,028 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:27,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:27,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:27,028 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:27,028 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:27,029 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:27,029 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:27,029 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:27,029 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:27,029 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:27,029 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:27,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:27,031 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:27,031 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:27,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:27,032 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:27,032 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:27,112 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:27,113 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:32:27,113 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:27,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:27,113 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:27,113 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:27,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2221 [2022-12-06 07:32:27,113 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-06 07:32:27,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:27,113 INFO L85 PathProgramCache]: Analyzing trace with hash 567919989, now seen corresponding path program 1 times [2022-12-06 07:32:27,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:27,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445687864] [2022-12-06 07:32:27,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:27,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:27,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-06 07:32:27,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:27,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445687864] [2022-12-06 07:32:27,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445687864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:27,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:27,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:27,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664937384] [2022-12-06 07:32:27,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:27,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:27,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:27,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:27,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:27,182 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:27,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:27,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:27,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:27,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:27,224 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:27,224 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:27,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:27,224 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:27,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:27,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:27,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:27,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:27,225 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:27,225 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:27,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:27,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:27,226 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:27,226 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:27,226 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:27,226 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:27,226 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:27,226 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:27,226 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:27,226 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:27,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:27,229 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:27,229 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:27,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:27,229 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:27,229 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:27,302 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:27,303 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:27,303 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:27,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:27,303 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:27,303 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:27,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2222 [2022-12-06 07:32:27,303 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-06 07:32:27,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:27,303 INFO L85 PathProgramCache]: Analyzing trace with hash 598396182, now seen corresponding path program 1 times [2022-12-06 07:32:27,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:27,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425752937] [2022-12-06 07:32:27,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:27,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:27,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-06 07:32:27,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:27,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425752937] [2022-12-06 07:32:27,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425752937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:27,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:27,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:27,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383771832] [2022-12-06 07:32:27,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:27,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:27,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:27,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:27,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:27,370 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:27,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:27,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:27,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:27,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:27,412 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:27,413 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:27,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:27,413 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:27,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:27,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:27,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:27,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:27,414 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:27,414 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:27,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:27,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:27,414 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:27,414 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:27,415 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:27,415 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:27,415 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:27,415 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:27,415 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:27,415 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:27,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:27,417 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:27,417 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:27,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:27,417 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:27,417 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:27,492 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:27,493 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:27,493 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:27,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:27,493 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:27,493 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:27,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2223 [2022-12-06 07:32:27,493 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-06 07:32:27,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:27,494 INFO L85 PathProgramCache]: Analyzing trace with hash 625178291, now seen corresponding path program 1 times [2022-12-06 07:32:27,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:27,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268443160] [2022-12-06 07:32:27,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:27,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:27,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-06 07:32:27,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:27,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268443160] [2022-12-06 07:32:27,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268443160] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:27,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:27,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:27,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580949] [2022-12-06 07:32:27,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:27,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:27,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:27,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:27,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:27,560 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:27,560 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:27,560 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:27,560 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:27,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:27,595 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:27,595 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:27,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 370 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:27,596 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:27,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:27,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:27,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:27,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:27,596 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:27,596 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:27,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:27,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:27,597 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:27,597 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:27,597 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:27,597 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:27,597 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:27,597 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:27,597 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:27,597 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:27,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:27,600 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:27,600 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:27,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:27,600 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:27,600 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:27,675 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:27,676 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:27,676 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:27,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:27,676 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:27,676 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:27,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2224 [2022-12-06 07:32:27,676 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-06 07:32:27,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:27,676 INFO L85 PathProgramCache]: Analyzing trace with hash 655654484, now seen corresponding path program 1 times [2022-12-06 07:32:27,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:27,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35317853] [2022-12-06 07:32:27,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:27,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:27,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-06 07:32:27,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:27,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35317853] [2022-12-06 07:32:27,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35317853] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:27,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:27,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:27,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283438481] [2022-12-06 07:32:27,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:27,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:27,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:27,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:27,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:27,754 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:27,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:27,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:27,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:27,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:27,796 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:27,797 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:27,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:27,797 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:27,797 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:27,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:27,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:27,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:27,798 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:27,798 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:27,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:27,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:27,798 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:27,798 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:27,798 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:27,799 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:27,799 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:27,799 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:27,799 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:27,799 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:27,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:27,801 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:27,801 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:27,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:27,801 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:27,801 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:27,876 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:27,877 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:27,877 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:27,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:27,877 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:27,877 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:27,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2225 [2022-12-06 07:32:27,877 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-06 07:32:27,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:27,878 INFO L85 PathProgramCache]: Analyzing trace with hash 682436593, now seen corresponding path program 1 times [2022-12-06 07:32:27,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:27,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564272769] [2022-12-06 07:32:27,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:27,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:27,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-06 07:32:27,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:27,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564272769] [2022-12-06 07:32:27,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564272769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:27,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:27,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:27,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703652274] [2022-12-06 07:32:27,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:27,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:27,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:27,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:27,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:27,946 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:27,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:27,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:27,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:27,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:27,986 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:27,986 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:27,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:27,987 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:27,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:27,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:27,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:27,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:27,988 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:27,988 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:27,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:27,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:27,988 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:27,988 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:27,989 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:27,989 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:27,989 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:27,989 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:27,989 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:27,989 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:27,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:27,991 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:27,991 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:27,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:27,992 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:27,992 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:28,068 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:28,069 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:32:28,069 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:28,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:28,069 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:28,069 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:28,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2226 [2022-12-06 07:32:28,069 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-06 07:32:28,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:28,069 INFO L85 PathProgramCache]: Analyzing trace with hash 712912786, now seen corresponding path program 1 times [2022-12-06 07:32:28,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:28,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209676166] [2022-12-06 07:32:28,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:28,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:28,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:28,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:28,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209676166] [2022-12-06 07:32:28,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209676166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:28,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:28,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:28,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269166317] [2022-12-06 07:32:28,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:28,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:28,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:28,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:28,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:28,136 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:28,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:28,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:28,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:28,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:28,172 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:28,173 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:28,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:28,173 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:28,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:28,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:28,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:28,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:28,174 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:28,174 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:28,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:28,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:28,174 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:28,174 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:28,174 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:28,175 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:28,175 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:28,175 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:28,175 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:28,175 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:28,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:28,177 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:28,177 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:28,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:28,177 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:28,177 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:28,260 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:28,261 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-06 07:32:28,261 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:28,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:28,261 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:28,261 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:28,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2227 [2022-12-06 07:32:28,261 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-06 07:32:28,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:28,262 INFO L85 PathProgramCache]: Analyzing trace with hash 739694895, now seen corresponding path program 1 times [2022-12-06 07:32:28,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:28,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066976672] [2022-12-06 07:32:28,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:28,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:28,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:28,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:28,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066976672] [2022-12-06 07:32:28,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066976672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:28,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:28,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:28,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407144868] [2022-12-06 07:32:28,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:28,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:28,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:28,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:28,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:28,329 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:28,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:28,329 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:28,329 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:28,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:28,370 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:28,371 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:28,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:28,371 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:28,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:28,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:28,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:28,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:28,372 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:28,372 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:28,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:28,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:28,372 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:28,372 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:28,373 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:28,373 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:28,373 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:28,373 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:28,373 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:28,373 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:28,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:28,375 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:28,375 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:28,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:28,375 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:28,376 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:28,451 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:28,452 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:28,452 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:28,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:28,452 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:28,452 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:28,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2228 [2022-12-06 07:32:28,452 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-06 07:32:28,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:28,452 INFO L85 PathProgramCache]: Analyzing trace with hash 770171088, now seen corresponding path program 1 times [2022-12-06 07:32:28,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:28,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174271659] [2022-12-06 07:32:28,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:28,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:28,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-06 07:32:28,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:28,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174271659] [2022-12-06 07:32:28,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174271659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:28,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:28,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:28,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614649524] [2022-12-06 07:32:28,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:28,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:28,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:28,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:28,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:28,516 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:28,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:28,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:28,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:28,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:28,552 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:28,553 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:28,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:28,553 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:28,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:28,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:28,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:28,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:28,553 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:28,554 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:28,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:28,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:28,554 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:28,554 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:28,554 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:28,554 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:28,555 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:28,555 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:28,555 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:28,555 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:28,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:28,557 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:28,557 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:28,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:28,557 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:28,557 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:28,632 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:28,633 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:28,633 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:28,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:28,633 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:28,633 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:28,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2229 [2022-12-06 07:32:28,633 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-06 07:32:28,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:28,633 INFO L85 PathProgramCache]: Analyzing trace with hash 796953197, now seen corresponding path program 1 times [2022-12-06 07:32:28,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:28,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687102391] [2022-12-06 07:32:28,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:28,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:28,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-06 07:32:28,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:28,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687102391] [2022-12-06 07:32:28,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687102391] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:28,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:28,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:28,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475794578] [2022-12-06 07:32:28,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:28,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:28,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:28,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:28,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:28,703 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:28,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:28,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:28,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:28,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:28,739 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:28,739 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:28,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 371 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:28,740 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:28,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:28,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:28,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:28,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:28,740 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:28,740 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:28,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:28,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:28,741 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:28,741 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:28,741 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:28,741 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:28,741 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:28,741 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:28,741 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:28,741 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:28,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:28,744 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:28,744 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:28,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:28,744 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:28,744 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:28,819 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:28,820 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:28,820 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:28,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:28,820 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:28,820 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:28,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2230 [2022-12-06 07:32:28,820 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-06 07:32:28,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:28,820 INFO L85 PathProgramCache]: Analyzing trace with hash 827429390, now seen corresponding path program 1 times [2022-12-06 07:32:28,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:28,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399465460] [2022-12-06 07:32:28,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:28,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:28,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-06 07:32:28,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:28,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399465460] [2022-12-06 07:32:28,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399465460] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:28,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:28,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:28,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783050606] [2022-12-06 07:32:28,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:28,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:28,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:28,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:28,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:28,892 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:28,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:28,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:28,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:28,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:28,929 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:28,929 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:28,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:28,929 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:28,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:28,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:28,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:28,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:28,930 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:28,930 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:28,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:28,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:28,930 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:28,930 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:28,931 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:28,931 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:28,931 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:28,931 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:28,931 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:28,931 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:28,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:28,933 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:28,933 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:28,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:28,933 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:28,934 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:29,008 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:29,008 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:29,008 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:29,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:29,009 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:29,009 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:29,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2231 [2022-12-06 07:32:29,009 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-06 07:32:29,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:29,009 INFO L85 PathProgramCache]: Analyzing trace with hash 854211499, now seen corresponding path program 1 times [2022-12-06 07:32:29,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:29,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904459235] [2022-12-06 07:32:29,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:29,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:29,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-06 07:32:29,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:29,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904459235] [2022-12-06 07:32:29,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904459235] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:29,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:29,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:29,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731393127] [2022-12-06 07:32:29,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:29,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:29,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:29,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:29,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:29,074 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:29,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:29,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:29,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:29,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:29,110 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:29,110 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:29,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:29,111 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:29,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:29,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:29,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:29,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:29,111 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:29,111 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:29,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:29,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:29,112 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:29,112 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:29,112 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:29,112 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:29,112 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:29,112 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:29,112 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:29,113 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:29,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:29,115 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:29,115 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:29,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:29,115 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:29,115 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:29,189 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:29,190 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:29,190 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:29,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:29,190 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:29,190 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:29,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2232 [2022-12-06 07:32:29,190 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-06 07:32:29,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:29,190 INFO L85 PathProgramCache]: Analyzing trace with hash 884687692, now seen corresponding path program 1 times [2022-12-06 07:32:29,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:29,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526469664] [2022-12-06 07:32:29,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:29,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:29,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-06 07:32:29,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:29,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526469664] [2022-12-06 07:32:29,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526469664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:29,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:29,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:29,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479061720] [2022-12-06 07:32:29,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:29,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:29,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:29,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:29,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:29,254 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:29,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:29,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:29,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:29,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:29,290 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:29,290 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:29,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 351 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:29,291 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:29,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:29,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:29,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:29,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:29,291 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:29,291 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:29,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:29,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:29,292 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:29,292 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:29,292 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:29,292 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:29,292 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:29,293 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:29,293 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:29,293 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:29,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:29,295 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:29,295 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:29,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:29,295 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:29,295 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:29,370 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:29,371 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:29,371 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:29,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:29,371 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:29,371 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:29,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2233 [2022-12-06 07:32:29,371 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-06 07:32:29,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:29,371 INFO L85 PathProgramCache]: Analyzing trace with hash 911469801, now seen corresponding path program 1 times [2022-12-06 07:32:29,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:29,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746878260] [2022-12-06 07:32:29,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:29,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:29,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:29,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-06 07:32:29,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:29,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746878260] [2022-12-06 07:32:29,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746878260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:29,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:29,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:29,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052303953] [2022-12-06 07:32:29,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:29,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:29,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:29,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:29,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:29,440 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:29,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:29,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:29,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:29,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:29,482 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:29,483 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:29,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:29,483 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:29,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:29,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:29,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:29,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:29,484 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:29,484 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:29,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:29,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:29,485 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:29,485 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:29,485 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:29,485 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:29,485 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:29,485 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:29,485 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:29,485 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:29,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:29,487 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:29,487 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:29,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:29,488 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:29,488 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:29,563 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:29,563 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:29,564 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:29,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:29,564 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:29,564 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:29,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2234 [2022-12-06 07:32:29,564 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-06 07:32:29,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:29,564 INFO L85 PathProgramCache]: Analyzing trace with hash 941945994, now seen corresponding path program 1 times [2022-12-06 07:32:29,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:29,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497366877] [2022-12-06 07:32:29,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:29,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:29,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-06 07:32:29,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:29,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497366877] [2022-12-06 07:32:29,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497366877] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:29,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:29,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:29,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407990266] [2022-12-06 07:32:29,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:29,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:29,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:29,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:29,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:29,630 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:29,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:29,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:29,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:29,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:29,671 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:29,671 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:29,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:29,672 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:29,672 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:29,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:29,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:29,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:29,672 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:29,672 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:29,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:29,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:29,673 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:29,673 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:29,673 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:29,673 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:29,673 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:29,674 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:29,674 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:29,674 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:29,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:29,676 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:29,676 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:29,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:29,676 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:29,676 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:29,750 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:29,751 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:29,751 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:29,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:29,751 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:29,751 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:29,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2235 [2022-12-06 07:32:29,751 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-06 07:32:29,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:29,751 INFO L85 PathProgramCache]: Analyzing trace with hash 968728103, now seen corresponding path program 1 times [2022-12-06 07:32:29,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:29,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632764223] [2022-12-06 07:32:29,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:29,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:29,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:29,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:29,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632764223] [2022-12-06 07:32:29,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632764223] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:29,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:29,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:29,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888969284] [2022-12-06 07:32:29,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:29,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:29,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:29,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:29,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:29,818 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:29,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:29,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:29,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:29,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:29,860 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:29,860 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:29,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:29,861 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:29,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:29,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:29,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:29,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:29,861 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:29,862 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:29,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:29,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:29,862 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:29,862 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:29,862 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:29,863 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:29,863 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:29,863 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:29,863 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:29,863 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:29,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:29,865 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:29,865 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:29,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:29,865 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:29,866 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:29,951 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:29,952 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 07:32:29,952 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:29,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:29,952 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:29,952 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:29,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2236 [2022-12-06 07:32:29,952 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-06 07:32:29,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:29,952 INFO L85 PathProgramCache]: Analyzing trace with hash 999204296, now seen corresponding path program 1 times [2022-12-06 07:32:29,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:29,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575257047] [2022-12-06 07:32:29,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:29,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:30,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-06 07:32:30,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:30,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575257047] [2022-12-06 07:32:30,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575257047] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:30,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:30,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:30,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228616125] [2022-12-06 07:32:30,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:30,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:30,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:30,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:30,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:30,014 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:30,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:30,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:30,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:30,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:30,056 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:30,057 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:30,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:30,057 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:30,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:30,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:30,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:30,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:30,058 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:30,058 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:30,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:30,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:30,058 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:30,058 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:30,058 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:30,059 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:30,059 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:30,059 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:30,059 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:30,059 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:30,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:30,061 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:30,061 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:30,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:30,061 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:30,061 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:30,136 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:30,137 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:30,137 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:30,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:30,137 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:30,137 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:30,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2237 [2022-12-06 07:32:30,138 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-06 07:32:30,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:30,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1025986405, now seen corresponding path program 1 times [2022-12-06 07:32:30,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:30,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511956783] [2022-12-06 07:32:30,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:30,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:30,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-06 07:32:30,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:30,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511956783] [2022-12-06 07:32:30,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511956783] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:30,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:30,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:30,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582536450] [2022-12-06 07:32:30,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:30,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:30,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:30,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:30,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:30,225 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:30,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:30,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:30,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:30,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:30,275 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:30,276 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:30,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:30,276 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:30,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:30,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:30,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:30,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:30,277 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:30,277 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:30,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:30,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:30,278 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:30,278 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:30,278 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:30,278 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:30,278 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:30,278 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:30,278 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:30,279 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:30,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:30,282 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:30,282 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:30,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:30,282 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:30,282 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:30,362 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:30,362 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:32:30,362 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:30,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:30,363 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:30,363 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:30,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2238 [2022-12-06 07:32:30,363 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-06 07:32:30,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:30,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1056462598, now seen corresponding path program 1 times [2022-12-06 07:32:30,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:30,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499267320] [2022-12-06 07:32:30,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:30,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:30,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:30,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:30,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499267320] [2022-12-06 07:32:30,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499267320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:30,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:30,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:30,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408127575] [2022-12-06 07:32:30,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:30,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:30,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:30,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:30,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:30,426 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:30,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:30,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:30,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:30,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:30,469 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:30,469 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:30,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:30,470 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:30,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:30,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:30,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:30,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:30,470 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:30,470 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:30,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:30,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:30,471 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:30,471 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:30,471 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:30,471 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:30,471 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:30,471 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:30,471 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:30,471 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:30,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:30,474 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:30,474 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:30,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:30,474 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:30,474 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:30,551 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:30,552 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:32:30,552 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:30,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:30,552 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:30,552 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:30,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2239 [2022-12-06 07:32:30,552 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-06 07:32:30,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:30,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1083244707, now seen corresponding path program 1 times [2022-12-06 07:32:30,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:30,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655037543] [2022-12-06 07:32:30,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:30,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:30,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-06 07:32:30,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:30,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655037543] [2022-12-06 07:32:30,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655037543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:30,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:30,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:30,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154655119] [2022-12-06 07:32:30,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:30,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:30,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:30,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:30,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:30,622 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:30,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:30,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:30,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:30,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:30,659 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:30,659 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:30,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:30,660 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:30,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:30,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:30,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:30,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:30,660 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:30,660 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:30,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:30,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:30,661 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:30,661 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:30,661 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:30,661 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:30,661 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:30,662 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:30,662 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:30,662 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:30,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:30,664 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:30,664 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:30,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:30,664 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:30,664 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:30,738 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:30,739 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:30,739 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:30,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:30,739 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:30,739 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:30,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2240 [2022-12-06 07:32:30,739 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-06 07:32:30,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:30,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1113720900, now seen corresponding path program 1 times [2022-12-06 07:32:30,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:30,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077259431] [2022-12-06 07:32:30,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:30,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:30,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-06 07:32:30,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:30,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077259431] [2022-12-06 07:32:30,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077259431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:30,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:30,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:30,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852960880] [2022-12-06 07:32:30,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:30,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:30,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:30,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:30,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:30,806 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:30,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:30,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:30,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:30,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:30,850 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:30,850 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:30,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:30,850 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:30,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:30,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:30,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:30,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:30,851 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:30,851 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:30,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:30,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:30,852 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:30,852 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:30,852 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:30,852 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:30,852 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:30,852 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:30,852 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:30,852 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:30,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:30,854 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:30,855 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:30,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:30,855 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:30,855 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:30,930 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:30,931 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:30,931 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:30,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:30,931 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:30,931 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:30,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2241 [2022-12-06 07:32:30,931 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-06 07:32:30,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:30,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1140503009, now seen corresponding path program 1 times [2022-12-06 07:32:30,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:30,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749377748] [2022-12-06 07:32:30,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:30,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:30,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-06 07:32:30,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:30,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749377748] [2022-12-06 07:32:30,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749377748] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:30,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:30,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:30,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28349922] [2022-12-06 07:32:30,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:30,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:30,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:30,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:30,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:30,998 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:30,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:30,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:30,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:30,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:31,049 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:31,050 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:31,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 373 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:31,050 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:31,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:31,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:31,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:31,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:31,051 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:31,051 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:31,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:31,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:31,051 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:31,051 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:31,052 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:31,052 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:31,052 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:31,052 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:31,052 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:31,052 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:31,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:31,054 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:31,054 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:31,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:31,054 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:31,054 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:31,130 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:31,131 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:31,131 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:31,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:31,131 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:31,131 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:31,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2242 [2022-12-06 07:32:31,131 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-06 07:32:31,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:31,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1170979202, now seen corresponding path program 1 times [2022-12-06 07:32:31,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:31,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011964990] [2022-12-06 07:32:31,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:31,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:31,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-06 07:32:31,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:31,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011964990] [2022-12-06 07:32:31,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011964990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:31,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:31,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:31,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800120650] [2022-12-06 07:32:31,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:31,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:31,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:31,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:31,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:31,196 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:31,196 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:31,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:31,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:31,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:31,237 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:31,237 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:31,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:31,237 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:31,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:31,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:31,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:31,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:31,238 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:31,238 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:31,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:31,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:31,239 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:31,239 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:31,239 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:31,239 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:31,239 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:31,239 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:31,239 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:31,239 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:31,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:31,241 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:31,241 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:31,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:31,242 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:31,242 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:31,317 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:31,318 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:31,318 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:31,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:31,318 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:31,318 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:31,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2243 [2022-12-06 07:32:31,318 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-06 07:32:31,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:31,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1197761311, now seen corresponding path program 1 times [2022-12-06 07:32:31,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:31,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635078333] [2022-12-06 07:32:31,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:31,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:31,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-06 07:32:31,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:31,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635078333] [2022-12-06 07:32:31,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635078333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:31,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:31,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:31,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967647649] [2022-12-06 07:32:31,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:31,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:31,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:31,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:31,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:31,386 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:31,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:31,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:31,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:31,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:31,422 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:31,422 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:31,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:31,423 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:31,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:31,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:31,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:31,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:31,423 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:31,423 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:31,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:31,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:31,424 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:31,424 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:31,424 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:31,424 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:31,424 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:31,424 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:31,424 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:31,424 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:31,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:31,427 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:31,427 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:31,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:31,427 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:31,427 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:31,502 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:31,503 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:31,503 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:31,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:31,503 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:31,503 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:31,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2244 [2022-12-06 07:32:31,503 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-06 07:32:31,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:31,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1228237504, now seen corresponding path program 1 times [2022-12-06 07:32:31,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:31,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732173503] [2022-12-06 07:32:31,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:31,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:31,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-06 07:32:31,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:31,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732173503] [2022-12-06 07:32:31,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732173503] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:31,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:31,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:31,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771488635] [2022-12-06 07:32:31,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:31,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:31,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:31,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:31,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:31,570 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:31,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:31,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:31,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:31,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:31,612 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:31,612 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:31,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:31,613 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:31,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:31,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:31,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:31,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:31,613 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:31,614 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:31,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:31,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:31,614 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:31,614 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:31,614 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:31,614 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:31,615 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:31,615 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:31,615 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:31,615 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:31,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:31,617 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:31,617 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:31,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:31,617 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:31,617 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:31,691 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:31,692 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:31,692 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:31,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:31,692 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:31,692 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:31,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2245 [2022-12-06 07:32:31,692 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-06 07:32:31,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:31,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1255019613, now seen corresponding path program 1 times [2022-12-06 07:32:31,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:31,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250054345] [2022-12-06 07:32:31,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:31,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:31,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-06 07:32:31,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:31,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250054345] [2022-12-06 07:32:31,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250054345] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:31,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:31,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:31,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041271859] [2022-12-06 07:32:31,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:31,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:31,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:31,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:31,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:31,762 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:31,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:31,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:31,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:31,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:31,802 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:31,802 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:31,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:31,802 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:31,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:31,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:31,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:31,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:31,803 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:31,803 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:31,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:31,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:31,804 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:31,804 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:31,804 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:31,804 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:31,804 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:31,804 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:31,804 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:31,804 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:31,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:31,807 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:31,807 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:31,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:31,807 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:31,807 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:31,881 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:31,882 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:31,882 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:31,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:31,883 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:31,883 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:31,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2246 [2022-12-06 07:32:31,883 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-06 07:32:31,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:31,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1285495806, now seen corresponding path program 1 times [2022-12-06 07:32:31,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:31,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468119327] [2022-12-06 07:32:31,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:31,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:31,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-06 07:32:31,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:31,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468119327] [2022-12-06 07:32:31,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468119327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:31,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:31,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:31,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010703056] [2022-12-06 07:32:31,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:31,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:31,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:31,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:31,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:31,947 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:31,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:31,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:31,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:31,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:31,988 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:31,988 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:31,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:31,989 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:31,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:31,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:31,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:31,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:31,989 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:31,990 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:31,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:31,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:31,990 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:31,990 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:31,990 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:31,990 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:31,991 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:31,991 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:31,991 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:31,991 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:31,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:31,993 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:31,993 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:31,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:31,993 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:31,993 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:32,067 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:32,068 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:32,068 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:32,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:32,068 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:32,068 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:32,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2247 [2022-12-06 07:32:32,068 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-06 07:32:32,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:32,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1312277915, now seen corresponding path program 1 times [2022-12-06 07:32:32,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:32,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907252615] [2022-12-06 07:32:32,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:32,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:32,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:32,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-06 07:32:32,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:32,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907252615] [2022-12-06 07:32:32,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907252615] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:32,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:32,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:32,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977838013] [2022-12-06 07:32:32,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:32,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:32,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:32,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:32,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:32,148 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:32,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:32,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:32,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:32,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:32,190 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:32,190 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:32,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:32,191 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:32,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:32,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:32,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:32,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:32,191 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:32,191 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:32,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:32,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:32,192 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:32,192 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:32,192 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:32,192 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:32,192 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:32,192 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:32,192 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:32,192 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:32,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:32,195 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:32,195 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:32,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:32,195 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:32,195 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:32,287 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:32,288 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:32:32,288 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:32,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:32,289 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:32,289 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:32,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2248 [2022-12-06 07:32:32,289 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-06 07:32:32,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:32,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1342754108, now seen corresponding path program 1 times [2022-12-06 07:32:32,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:32,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720637875] [2022-12-06 07:32:32,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:32,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:32,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-06 07:32:32,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:32,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720637875] [2022-12-06 07:32:32,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720637875] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:32,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:32,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:32,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830218606] [2022-12-06 07:32:32,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:32,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:32,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:32,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:32,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:32,357 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:32,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:32,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:32,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:32,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:32,393 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:32,393 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:32,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:32,394 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:32,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:32,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:32,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:32,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:32,394 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:32,394 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:32,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:32,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:32,395 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:32,395 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:32,395 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:32,395 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:32,395 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:32,395 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:32,395 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:32,395 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:32,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:32,398 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:32,398 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:32,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:32,398 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:32,398 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:32,473 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:32,473 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:32,474 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:32,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:32,474 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:32,474 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:32,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2249 [2022-12-06 07:32:32,474 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-06 07:32:32,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:32,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1369536217, now seen corresponding path program 1 times [2022-12-06 07:32:32,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:32,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955853105] [2022-12-06 07:32:32,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:32,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:32,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-06 07:32:32,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:32,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955853105] [2022-12-06 07:32:32,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955853105] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:32,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:32,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:32,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193401998] [2022-12-06 07:32:32,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:32,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:32,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:32,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:32,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:32,540 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:32,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:32,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:32,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:32,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:32,575 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:32,576 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:32,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:32,576 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:32,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:32,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:32,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:32,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:32,577 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:32,577 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:32,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:32,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:32,577 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:32,578 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:32,578 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:32,578 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:32,578 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:32,578 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:32,578 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:32,578 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:32,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:32,580 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:32,580 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:32,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:32,581 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:32,581 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:32,654 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:32,655 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:32,655 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:32,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:32,655 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:32,655 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:32,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2250 [2022-12-06 07:32:32,656 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-06 07:32:32,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:32,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1400012410, now seen corresponding path program 1 times [2022-12-06 07:32:32,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:32,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118841245] [2022-12-06 07:32:32,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:32,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:32,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-06 07:32:32,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:32,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118841245] [2022-12-06 07:32:32,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118841245] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:32,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:32,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:32,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030792344] [2022-12-06 07:32:32,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:32,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:32,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:32,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:32,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:32,723 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:32,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:32,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:32,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:32,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:32,760 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:32,760 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:32,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:32,761 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:32,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:32,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:32,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:32,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:32,761 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:32,761 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:32,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:32,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:32,762 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:32,762 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:32,762 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:32,762 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:32,762 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:32,762 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:32,762 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:32,763 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:32,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:32,765 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:32,765 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:32,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:32,765 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:32,765 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:32,841 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:32,842 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:32:32,842 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:32,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:32,842 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:32,842 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:32,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2251 [2022-12-06 07:32:32,842 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-06 07:32:32,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:32,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1426794519, now seen corresponding path program 1 times [2022-12-06 07:32:32,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:32,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799035664] [2022-12-06 07:32:32,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:32,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:32,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:32,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-06 07:32:32,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:32,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799035664] [2022-12-06 07:32:32,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799035664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:32,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:32,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:32,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248575945] [2022-12-06 07:32:32,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:32,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:32,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:32,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:32,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:32,909 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:32,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:32,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:32,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:32,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:32,945 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:32,945 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:32,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:32,946 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:32,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:32,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:32,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:32,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:32,946 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:32,946 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:32,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:32,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:32,947 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:32,947 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:32,947 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:32,947 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:32,947 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:32,947 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:32,947 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:32,947 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:32,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:32,949 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:32,950 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:32,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:32,950 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:32,950 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:33,023 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:33,024 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:33,024 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:33,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:33,024 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:33,024 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:33,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2252 [2022-12-06 07:32:33,024 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-06 07:32:33,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:33,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1457270712, now seen corresponding path program 1 times [2022-12-06 07:32:33,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:33,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366468161] [2022-12-06 07:32:33,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:33,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:33,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-06 07:32:33,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:33,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366468161] [2022-12-06 07:32:33,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366468161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:33,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:33,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:33,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690304308] [2022-12-06 07:32:33,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:33,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:33,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:33,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:33,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:33,089 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:33,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:33,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:33,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:33,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:33,132 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:33,132 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:33,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:33,132 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:33,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:33,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:33,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:33,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:33,133 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:33,133 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:33,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:33,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:33,134 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:33,134 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:33,134 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:33,134 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:33,134 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:33,134 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:33,134 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:33,134 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:33,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:33,136 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:33,136 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:33,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:33,137 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:33,137 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:33,210 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:33,211 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:33,211 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:33,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:33,211 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:33,211 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:33,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2253 [2022-12-06 07:32:33,211 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-06 07:32:33,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:33,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1484052821, now seen corresponding path program 1 times [2022-12-06 07:32:33,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:33,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992792185] [2022-12-06 07:32:33,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:33,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:33,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-06 07:32:33,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:33,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992792185] [2022-12-06 07:32:33,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992792185] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:33,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:33,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:33,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476164896] [2022-12-06 07:32:33,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:33,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:33,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:33,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:33,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:33,297 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:33,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:33,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:33,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:33,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:33,337 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:33,337 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:33,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:33,338 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:33,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:33,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:33,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:33,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:33,338 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:33,338 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:33,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:33,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:33,339 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:33,339 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:33,339 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:33,339 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:33,339 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:33,339 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:33,340 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:33,340 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:33,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:33,342 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:33,342 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:33,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:33,342 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:33,342 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:33,417 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:33,418 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:33,418 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:33,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:33,418 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:33,418 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:33,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2254 [2022-12-06 07:32:33,418 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-06 07:32:33,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:33,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1514529014, now seen corresponding path program 1 times [2022-12-06 07:32:33,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:33,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121771005] [2022-12-06 07:32:33,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:33,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32: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-06 07:32:33,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:33,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121771005] [2022-12-06 07:32:33,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121771005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:33,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:33,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:33,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18023975] [2022-12-06 07:32:33,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:33,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:33,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:33,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:33,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:33,482 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:33,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:33,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:33,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:33,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:33,524 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:33,525 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:33,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:33,525 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:33,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:33,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:33,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:33,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:33,526 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:33,526 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:33,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:33,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:33,526 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:33,527 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:33,527 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:33,527 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:33,527 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:33,527 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:33,527 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:33,527 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:33,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:33,529 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:33,529 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:33,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:33,530 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:33,530 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:33,604 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:33,605 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:33,605 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:33,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:33,605 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:33,605 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:33,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2255 [2022-12-06 07:32:33,605 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-06 07:32:33,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:33,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1541311123, now seen corresponding path program 1 times [2022-12-06 07:32:33,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:33,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016196487] [2022-12-06 07:32:33,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:33,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:33,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-06 07:32:33,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:33,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016196487] [2022-12-06 07:32:33,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016196487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:33,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:33,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:33,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996391227] [2022-12-06 07:32:33,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:33,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:33,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:33,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:33,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:33,673 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:33,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:33,674 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:33,674 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:33,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:33,710 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:33,710 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:33,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:33,711 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:33,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:33,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:33,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:33,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:33,711 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:33,711 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:33,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:33,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:33,712 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:33,712 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:33,712 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:33,712 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:33,712 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:33,712 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:33,712 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:33,712 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:33,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:33,715 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:33,715 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:33,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:33,715 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:33,715 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:33,796 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:33,797 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 07:32:33,797 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:33,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:33,797 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:33,797 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:33,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2256 [2022-12-06 07:32:33,798 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-06 07:32:33,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:33,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1571787316, now seen corresponding path program 1 times [2022-12-06 07:32:33,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:33,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547072603] [2022-12-06 07:32:33,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:33,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:33,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:33,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-06 07:32:33,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:33,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547072603] [2022-12-06 07:32:33,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547072603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:33,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:33,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:33,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224429168] [2022-12-06 07:32:33,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:33,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:33,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:33,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:33,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:33,869 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:33,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:33,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:33,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:33,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:33,908 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:33,908 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:33,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:33,908 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:33,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:33,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:33,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:33,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:33,909 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:33,909 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:33,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:33,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:33,910 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:33,910 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:33,910 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:33,910 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:33,910 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:33,910 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:33,910 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:33,910 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:33,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:33,912 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:33,912 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:33,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:33,913 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:33,913 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:33,990 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:33,990 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:32:33,990 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:33,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:33,991 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:33,991 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:33,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2257 [2022-12-06 07:32:33,991 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-06 07:32:33,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:33,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1598569425, now seen corresponding path program 1 times [2022-12-06 07:32:33,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:33,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887967786] [2022-12-06 07:32:33,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:33,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:34,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-06 07:32:34,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:34,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887967786] [2022-12-06 07:32:34,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887967786] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:34,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:34,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:34,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094409030] [2022-12-06 07:32:34,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:34,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:34,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:34,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:34,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:34,060 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:34,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:34,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:34,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:34,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:34,096 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:34,096 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:34,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:34,097 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:34,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:34,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:34,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:34,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:34,097 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:34,097 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:34,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:34,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:34,098 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:34,098 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:34,098 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:34,098 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:34,098 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:34,098 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:34,098 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:34,098 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:34,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:34,100 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:34,101 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:34,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:34,101 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:34,101 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:34,176 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:34,176 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:34,177 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:34,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:34,177 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:34,177 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:34,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2258 [2022-12-06 07:32:34,177 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-06 07:32:34,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:34,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1629045618, now seen corresponding path program 1 times [2022-12-06 07:32:34,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:34,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634701144] [2022-12-06 07:32:34,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:34,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:34,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-06 07:32:34,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:34,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634701144] [2022-12-06 07:32:34,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634701144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:34,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:34,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:34,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828468984] [2022-12-06 07:32:34,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:34,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:34,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:34,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:34,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:34,240 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:34,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:34,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:34,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:34,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:34,283 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:34,284 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:34,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:34,284 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:34,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:34,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:34,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:34,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:34,285 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:34,285 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:34,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:34,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:34,285 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:34,286 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:34,286 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:34,286 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:34,286 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:34,286 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:34,286 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:34,286 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:34,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:34,288 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:34,288 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:34,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:34,289 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:34,289 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:34,363 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:34,364 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:34,364 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:34,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:34,364 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:34,364 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:34,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2259 [2022-12-06 07:32:34,364 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-06 07:32:34,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:34,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1655827727, now seen corresponding path program 1 times [2022-12-06 07:32:34,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:34,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984874827] [2022-12-06 07:32:34,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:34,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:34,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-06 07:32:34,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:34,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984874827] [2022-12-06 07:32:34,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984874827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:34,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:34,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:34,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244646959] [2022-12-06 07:32:34,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:34,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:34,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:34,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:34,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:34,438 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:34,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:34,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:34,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:34,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:34,477 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:34,477 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:34,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:34,478 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:34,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:34,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:34,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:34,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:34,478 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:34,478 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:34,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:34,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:34,479 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:34,479 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:34,479 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:34,479 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:34,479 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:34,479 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:34,479 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:34,479 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:34,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:34,482 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:34,482 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:34,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:34,482 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:34,482 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:34,556 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:34,557 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:34,557 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:34,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:34,557 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:34,557 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:34,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2260 [2022-12-06 07:32:34,557 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-06 07:32:34,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:34,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1686303920, now seen corresponding path program 1 times [2022-12-06 07:32:34,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:34,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120286848] [2022-12-06 07:32:34,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:34,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:34,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-06 07:32:34,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:34,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120286848] [2022-12-06 07:32:34,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120286848] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:34,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:34,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:34,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105378950] [2022-12-06 07:32:34,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:34,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:34,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:34,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:34,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:34,622 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:34,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:34,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:34,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:34,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:34,658 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:34,658 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:34,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:34,659 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:34,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:34,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:34,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:34,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:34,659 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:34,659 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:34,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:34,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:34,660 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:34,660 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:34,660 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:34,660 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:34,660 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:34,660 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:34,660 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:34,660 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:34,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:34,663 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:34,663 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:34,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:34,663 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:34,663 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:34,736 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:34,737 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:34,737 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:34,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:34,737 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:34,737 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:34,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2261 [2022-12-06 07:32:34,738 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-06 07:32:34,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:34,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1713086029, now seen corresponding path program 1 times [2022-12-06 07:32:34,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:34,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405765245] [2022-12-06 07:32:34,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:34,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:34,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-06 07:32:34,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:34,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405765245] [2022-12-06 07:32:34,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405765245] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:34,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:34,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:34,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101881784] [2022-12-06 07:32:34,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:34,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:34,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:34,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:34,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:34,805 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:34,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:34,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:34,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:34,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:34,846 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:34,846 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:34,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:34,847 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:34,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:34,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:34,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:34,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:34,848 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:34,848 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:34,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:34,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:34,848 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:34,848 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:34,848 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:34,849 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:34,849 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:34,849 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:34,849 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:34,849 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:34,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:34,851 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:34,851 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:34,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:34,851 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:34,851 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:34,926 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:34,927 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:34,927 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:34,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:34,927 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:34,927 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:34,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2262 [2022-12-06 07:32:34,928 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-06 07:32:34,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:34,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1743562222, now seen corresponding path program 1 times [2022-12-06 07:32:34,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:34,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743426115] [2022-12-06 07:32:34,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:34,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:34,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-06 07:32:34,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:34,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743426115] [2022-12-06 07:32:34,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743426115] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:34,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:34,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:34,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483410816] [2022-12-06 07:32:34,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:34,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:34,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:34,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:34,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:34,992 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:34,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:34,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:34,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:34,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:35,035 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:35,035 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:35,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:35,035 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:35,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:35,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:35,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:35,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:35,036 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:35,036 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:35,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:35,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:35,037 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:35,037 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:35,037 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:35,037 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:35,037 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:35,037 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:35,037 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:35,037 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:35,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:35,039 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:35,039 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:35,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:35,040 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:35,040 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:35,112 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:35,113 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:32:35,113 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:35,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:35,113 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:35,113 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:35,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2263 [2022-12-06 07:32:35,113 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-06 07:32:35,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:35,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1770344331, now seen corresponding path program 1 times [2022-12-06 07:32:35,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:35,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842948307] [2022-12-06 07:32:35,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:35,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:35,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:35,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-06 07:32:35,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:35,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842948307] [2022-12-06 07:32:35,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842948307] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:35,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:35,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:35,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499057008] [2022-12-06 07:32:35,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:35,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:35,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:35,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:35,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:35,178 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:35,178 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:35,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:35,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:35,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:35,214 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:35,214 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:35,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:35,214 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:35,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:35,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:35,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:35,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:35,215 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:35,215 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:35,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:35,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:35,215 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:35,216 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:35,216 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:35,216 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:35,216 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:35,216 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:35,216 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:35,216 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:35,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:35,218 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:35,218 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:35,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 145 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:35,218 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:35,219 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:35,291 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:35,292 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:32:35,292 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:35,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:35,292 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:35,292 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:35,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2264 [2022-12-06 07:32:35,292 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-06 07:32:35,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:35,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1800820524, now seen corresponding path program 1 times [2022-12-06 07:32:35,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:35,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566435717] [2022-12-06 07:32:35,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:35,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:35,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-06 07:32:35,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:35,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566435717] [2022-12-06 07:32:35,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566435717] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:35,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:35,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:35,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623787005] [2022-12-06 07:32:35,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:35,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:35,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:35,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:35,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:35,357 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:35,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:35,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:35,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:35,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:35,393 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:35,394 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:35,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:35,394 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:35,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:35,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:35,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:35,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:35,395 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:35,395 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:35,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:35,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:35,395 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:35,396 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:35,396 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:35,396 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:35,396 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:35,396 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:35,396 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:35,396 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:35,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:35,398 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:35,398 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:35,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:35,399 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:35,399 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:35,484 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:35,485 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 07:32:35,485 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:35,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:35,485 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:35,485 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:35,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2265 [2022-12-06 07:32:35,485 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-06 07:32:35,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:35,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1827602633, now seen corresponding path program 1 times [2022-12-06 07:32:35,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:35,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483346816] [2022-12-06 07:32:35,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:35,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:35,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-06 07:32:35,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:35,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483346816] [2022-12-06 07:32:35,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483346816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:35,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:35,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:35,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197198673] [2022-12-06 07:32:35,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:35,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:35,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:35,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:35,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:35,553 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:35,553 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:35,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:35,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:35,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:35,589 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:35,589 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:35,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:35,590 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:35,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:35,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:35,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:35,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:35,590 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:35,590 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:35,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:35,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:35,591 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:35,591 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:35,591 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:35,591 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:35,591 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:35,592 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:35,592 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:35,592 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:35,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:35,594 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:35,594 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:35,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:35,594 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:35,594 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:35,671 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:35,672 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:32:35,672 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:35,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:35,673 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:35,673 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:35,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2266 [2022-12-06 07:32:35,673 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-06 07:32:35,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:35,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1858078826, now seen corresponding path program 1 times [2022-12-06 07:32:35,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:35,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455549993] [2022-12-06 07:32:35,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:35,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:35,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:35,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-06 07:32:35,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:35,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455549993] [2022-12-06 07:32:35,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455549993] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:35,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:35,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:35,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353889716] [2022-12-06 07:32:35,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:35,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:35,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:35,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:35,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:35,736 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:35,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:35,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:35,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:35,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:35,778 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:35,778 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:35,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:35,779 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:35,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:35,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:35,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:35,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:35,779 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:35,779 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:35,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:35,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:35,780 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:35,780 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:35,780 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:35,780 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:35,780 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:35,780 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:35,781 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:35,781 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:35,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:35,783 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:35,783 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:35,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:35,783 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:35,783 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:35,862 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:35,863 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 07:32:35,863 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:35,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:35,864 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:35,864 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:35,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2267 [2022-12-06 07:32:35,864 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-06 07:32:35,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:35,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1884860935, now seen corresponding path program 1 times [2022-12-06 07:32:35,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:35,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574578343] [2022-12-06 07:32:35,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:35,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:35,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-06 07:32:35,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:35,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574578343] [2022-12-06 07:32:35,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574578343] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:35,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:35,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:35,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203939660] [2022-12-06 07:32:35,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:35,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:35,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:35,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:35,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:35,932 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:35,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:35,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:35,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:35,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:35,968 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:35,968 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:35,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:35,969 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:35,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:35,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:35,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:35,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:35,969 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:35,969 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:35,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:35,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:35,970 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:35,970 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:35,970 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:35,970 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:35,970 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:35,971 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:35,971 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:35,971 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:35,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:35,973 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:35,973 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:35,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:35,973 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:35,973 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:36,053 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:36,054 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:32:36,054 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:36,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:36,054 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:36,054 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:36,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2268 [2022-12-06 07:32:36,055 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-06 07:32:36,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:36,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1915337128, now seen corresponding path program 1 times [2022-12-06 07:32:36,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:36,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001022377] [2022-12-06 07:32:36,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:36,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:36,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:36,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-06 07:32:36,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:36,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001022377] [2022-12-06 07:32:36,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001022377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:36,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:36,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:36,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159582819] [2022-12-06 07:32:36,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:36,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:36,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:36,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:36,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:36,120 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:36,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:36,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:36,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:36,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:36,158 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:36,158 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:36,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:36,159 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:36,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:36,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:36,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:36,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:36,159 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:36,159 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:36,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:36,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:36,160 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:36,160 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:36,160 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:36,160 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:36,160 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:36,160 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:36,160 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:36,160 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:36,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:36,163 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:36,163 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:36,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:36,163 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:36,163 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:36,237 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:36,238 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:36,238 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:36,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:36,238 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:36,238 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:36,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2269 [2022-12-06 07:32:36,238 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-06 07:32:36,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:36,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1942119237, now seen corresponding path program 1 times [2022-12-06 07:32:36,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:36,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136186917] [2022-12-06 07:32:36,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:36,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:36,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-06 07:32:36,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:36,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136186917] [2022-12-06 07:32:36,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136186917] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:36,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:36,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:36,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298021000] [2022-12-06 07:32:36,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:36,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:36,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:36,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:36,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:36,306 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:36,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:36,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:36,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:36,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:36,347 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:36,348 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:36,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:36,348 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:36,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:36,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:36,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:36,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:36,349 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:36,349 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:36,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:36,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:36,349 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:36,349 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:36,349 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:36,350 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:36,350 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:36,350 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:36,350 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:36,350 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:36,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:36,352 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:36,352 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:36,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:36,352 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:36,352 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:36,426 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:36,427 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:36,427 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:36,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:36,427 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:36,427 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:36,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2270 [2022-12-06 07:32:36,427 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-06 07:32:36,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:36,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1972595430, now seen corresponding path program 1 times [2022-12-06 07:32:36,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:36,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130892902] [2022-12-06 07:32:36,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:36,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:36,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:36,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-06 07:32:36,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:36,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130892902] [2022-12-06 07:32:36,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130892902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:36,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:36,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:36,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476657294] [2022-12-06 07:32:36,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:36,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:36,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:36,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:36,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:36,508 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:36,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:36,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:36,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:36,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:36,550 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:36,550 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:36,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:36,551 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:36,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:36,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:36,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:36,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:36,551 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:36,551 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:36,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:36,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:36,552 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:36,552 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:36,552 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:36,552 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:36,552 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:36,552 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:36,553 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:36,553 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:36,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:36,555 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:36,555 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:36,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:36,555 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:36,555 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:36,629 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:36,630 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:36,630 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:36,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:36,630 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:36,630 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:36,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2271 [2022-12-06 07:32:36,631 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-06 07:32:36,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:36,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1999377539, now seen corresponding path program 1 times [2022-12-06 07:32:36,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:36,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816098103] [2022-12-06 07:32:36,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:36,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:36,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-06 07:32:36,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:36,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816098103] [2022-12-06 07:32:36,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816098103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:36,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:36,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:36,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459880181] [2022-12-06 07:32:36,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:36,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:36,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:36,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:36,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:36,697 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:36,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:36,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:36,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:36,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:36,732 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:36,733 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:36,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:36,733 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:36,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:36,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:36,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:36,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:36,734 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:36,734 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:36,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:36,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:36,734 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:36,735 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:36,735 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:36,735 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:36,735 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:36,735 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:36,735 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:36,735 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:36,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:36,737 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:36,737 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:36,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:36,738 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:36,738 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:36,812 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:36,813 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:36,813 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:36,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:36,813 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:36,813 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:36,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2272 [2022-12-06 07:32:36,814 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-06 07:32:36,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:36,814 INFO L85 PathProgramCache]: Analyzing trace with hash 2029853732, now seen corresponding path program 1 times [2022-12-06 07:32:36,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:36,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998755390] [2022-12-06 07:32:36,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:36,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32: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-06 07:32:36,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:36,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998755390] [2022-12-06 07:32:36,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998755390] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:36,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:36,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:36,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020083620] [2022-12-06 07:32:36,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:36,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:36,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:36,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:36,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:36,879 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:36,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:36,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:36,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:36,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:36,921 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:36,921 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:36,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:36,922 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:36,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:36,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:36,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:36,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:36,922 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:36,922 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:36,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:36,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:36,923 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:36,923 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:36,923 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:36,923 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:36,923 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:36,923 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:36,923 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:36,923 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:36,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:36,926 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:36,926 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:36,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:36,926 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:36,926 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:36,999 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:37,000 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:37,000 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:37,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:37,000 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:37,000 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:37,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2273 [2022-12-06 07:32:37,001 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-06 07:32:37,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:37,001 INFO L85 PathProgramCache]: Analyzing trace with hash 2056635841, now seen corresponding path program 1 times [2022-12-06 07:32:37,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:37,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660729271] [2022-12-06 07:32:37,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:37,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:37,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-06 07:32:37,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:37,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660729271] [2022-12-06 07:32:37,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660729271] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:37,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:37,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:37,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617036945] [2022-12-06 07:32:37,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:37,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:37,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:37,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:37,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:37,069 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:37,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:37,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:37,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:37,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:37,104 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:37,104 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:37,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:37,104 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:37,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:37,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:37,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:37,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:37,105 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:37,105 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:37,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:37,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:37,106 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:37,106 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:37,106 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:37,106 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:37,106 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:37,106 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:37,106 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:37,106 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:37,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:37,108 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:37,108 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:37,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:37,109 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:37,109 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:37,182 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:37,183 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:37,183 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:37,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:37,183 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:37,183 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:37,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2274 [2022-12-06 07:32:37,183 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-06 07:32:37,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:37,183 INFO L85 PathProgramCache]: Analyzing trace with hash 2087112034, now seen corresponding path program 1 times [2022-12-06 07:32:37,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:37,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8265934] [2022-12-06 07:32:37,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:37,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:37,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:37,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-06 07:32:37,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:37,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8265934] [2022-12-06 07:32:37,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8265934] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:37,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:37,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:37,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834048] [2022-12-06 07:32:37,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:37,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:37,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:37,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:37,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:37,250 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:37,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:37,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:37,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:37,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:37,287 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:37,288 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:37,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:37,288 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:37,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:37,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:37,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:37,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:37,289 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:37,289 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:37,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:37,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:37,289 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:37,289 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:37,289 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:37,290 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:37,290 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:37,290 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:37,290 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:37,290 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:37,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:37,292 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:37,292 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:37,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:37,292 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:37,292 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:37,366 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:37,367 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:37,367 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:37,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:37,368 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:37,368 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:37,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2275 [2022-12-06 07:32:37,368 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-06 07:32:37,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:37,368 INFO L85 PathProgramCache]: Analyzing trace with hash 2113894143, now seen corresponding path program 1 times [2022-12-06 07:32:37,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:37,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233225520] [2022-12-06 07:32:37,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:37,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:37,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-06 07:32:37,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:37,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233225520] [2022-12-06 07:32:37,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233225520] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:37,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:37,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:37,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901953572] [2022-12-06 07:32:37,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:37,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:37,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:37,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:37,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:37,435 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:37,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:37,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:37,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:37,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:37,476 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:37,476 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:37,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:37,477 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:37,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:37,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:37,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:37,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:37,477 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:37,477 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:37,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:37,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:37,478 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:37,478 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:37,478 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:37,478 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:37,478 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:37,478 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:37,478 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:37,478 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:37,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:37,481 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:37,481 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:37,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:37,481 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:37,481 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:37,554 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:37,555 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:37,555 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:37,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:37,555 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:37,555 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:37,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2276 [2022-12-06 07:32:37,555 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-06 07:32:37,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:37,556 INFO L85 PathProgramCache]: Analyzing trace with hash 2144370336, now seen corresponding path program 1 times [2022-12-06 07:32:37,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:37,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806612895] [2022-12-06 07:32:37,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:37,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:37,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-06 07:32:37,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:37,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806612895] [2022-12-06 07:32:37,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806612895] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:37,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:37,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:37,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608061522] [2022-12-06 07:32:37,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:37,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:37,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:37,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:37,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:37,636 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:37,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:37,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:37,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:37,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:37,679 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:37,679 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:37,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:37,679 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:37,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:37,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:37,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:37,680 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:37,680 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:37,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:37,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:37,681 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:37,681 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:37,681 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:37,681 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:37,681 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:37,681 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:37,681 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:37,681 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:37,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:37,683 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:37,684 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:37,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:37,684 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:37,684 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:37,758 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:37,759 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:37,759 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:37,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:37,759 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:37,759 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:37,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2277 [2022-12-06 07:32:37,759 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-06 07:32:37,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:37,759 INFO L85 PathProgramCache]: Analyzing trace with hash -2123814851, now seen corresponding path program 1 times [2022-12-06 07:32:37,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:37,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115649648] [2022-12-06 07:32:37,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:37,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:37,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-06 07:32:37,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:37,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115649648] [2022-12-06 07:32:37,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115649648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:37,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:37,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:37,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172359906] [2022-12-06 07:32:37,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:37,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:37,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:37,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:37,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:37,827 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:37,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:37,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:37,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:37,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:37,862 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:37,862 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:37,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:37,863 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:37,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:37,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:37,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:37,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:37,863 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:37,863 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:37,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:37,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:37,864 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:37,864 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:37,864 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:37,864 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:37,864 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:37,864 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:37,864 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:37,864 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:37,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:37,867 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:37,867 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:37,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:37,867 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:37,867 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:37,942 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:37,943 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:37,943 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:37,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:37,943 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:37,943 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:37,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2278 [2022-12-06 07:32:37,943 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-06 07:32:37,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:37,943 INFO L85 PathProgramCache]: Analyzing trace with hash -2093338658, now seen corresponding path program 1 times [2022-12-06 07:32:37,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:37,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119645903] [2022-12-06 07:32:37,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:37,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:38,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-06 07:32:38,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:38,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119645903] [2022-12-06 07:32:38,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119645903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:38,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:38,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:38,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41774808] [2022-12-06 07:32:38,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:38,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:38,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:38,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:38,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:38,008 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:38,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:38,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:38,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:38,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:38,050 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:38,051 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:38,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:38,051 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:38,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:38,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:38,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:38,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:38,052 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:38,052 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:38,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:38,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:38,052 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:38,052 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:38,053 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:38,053 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:38,053 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:38,053 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:38,053 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:38,053 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:38,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:38,055 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:38,055 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:38,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:38,055 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:38,055 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:38,130 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:38,131 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:38,131 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:38,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:38,131 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:38,131 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:38,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2279 [2022-12-06 07:32:38,131 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-06 07:32:38,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:38,131 INFO L85 PathProgramCache]: Analyzing trace with hash -2066556549, now seen corresponding path program 1 times [2022-12-06 07:32:38,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:38,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094155718] [2022-12-06 07:32:38,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:38,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:38,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:38,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-06 07:32:38,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:38,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094155718] [2022-12-06 07:32:38,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094155718] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:38,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:38,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:38,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981046365] [2022-12-06 07:32:38,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:38,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:38,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:38,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:38,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:38,199 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:38,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:38,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:38,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:38,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:38,238 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:38,238 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:38,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:38,239 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:38,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:38,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:38,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:38,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:38,239 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:38,239 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:38,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:38,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:38,240 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:38,240 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:38,240 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:38,240 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:38,240 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:38,240 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:38,241 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:38,241 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:38,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:38,243 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:38,243 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:38,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:38,243 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:38,243 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:38,317 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:38,318 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:38,318 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:38,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:38,318 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:38,318 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:38,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2280 [2022-12-06 07:32:38,318 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-06 07:32:38,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:38,319 INFO L85 PathProgramCache]: Analyzing trace with hash -2036080356, now seen corresponding path program 1 times [2022-12-06 07:32:38,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:38,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885521434] [2022-12-06 07:32:38,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:38,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:38,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-06 07:32:38,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:38,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885521434] [2022-12-06 07:32:38,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885521434] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:38,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:38,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:38,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961024698] [2022-12-06 07:32:38,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:38,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:38,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:38,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:38,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:38,385 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:38,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:38,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:38,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:38,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:38,421 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:38,421 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:38,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:38,422 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:38,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:38,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:38,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:38,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:38,422 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:38,422 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:38,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:38,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:38,423 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:38,423 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:38,423 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:38,423 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:38,423 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:38,423 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:38,423 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:38,423 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:38,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:38,425 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:38,426 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:38,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:38,426 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:38,426 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:38,501 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:38,501 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:38,502 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:38,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:38,502 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:38,502 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:38,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2281 [2022-12-06 07:32:38,502 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-06 07:32:38,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:38,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2009298247, now seen corresponding path program 1 times [2022-12-06 07:32:38,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:38,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888854606] [2022-12-06 07:32:38,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:38,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:38,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:38,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-06 07:32:38,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:38,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888854606] [2022-12-06 07:32:38,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888854606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:38,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:38,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:38,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746244796] [2022-12-06 07:32:38,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:38,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:38,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:38,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:38,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:38,572 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:38,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:38,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:38,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:38,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:38,609 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:38,609 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:38,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:38,609 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:38,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:38,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:38,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:38,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:38,610 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:38,610 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:38,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:38,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:38,611 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:38,611 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:38,611 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:38,611 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:38,611 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:38,611 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:38,611 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:38,611 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:38,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:38,614 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:38,614 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:38,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:38,614 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:38,614 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:38,688 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:38,689 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:38,689 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:38,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:38,689 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:38,689 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:38,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2282 [2022-12-06 07:32:38,689 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-06 07:32:38,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:38,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1978822054, now seen corresponding path program 1 times [2022-12-06 07:32:38,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:38,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904914304] [2022-12-06 07:32:38,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:38,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:38,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-06 07:32:38,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:38,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904914304] [2022-12-06 07:32:38,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904914304] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:38,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:38,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:38,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963122410] [2022-12-06 07:32:38,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:38,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:38,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:38,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:38,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:38,764 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:38,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:38,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:38,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:38,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:38,807 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:38,807 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:38,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 350 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:38,808 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:38,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:38,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:38,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:38,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:38,808 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:38,808 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:38,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:38,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:38,809 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:38,809 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:38,809 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:38,809 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:38,809 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:38,810 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:38,810 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:38,810 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:38,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:38,812 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:38,812 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:38,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:38,812 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:38,812 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:38,892 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:38,893 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:32:38,893 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:38,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:38,893 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:38,893 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:38,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2283 [2022-12-06 07:32:38,894 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-06 07:32:38,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:38,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1952039945, now seen corresponding path program 1 times [2022-12-06 07:32:38,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:38,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350801694] [2022-12-06 07:32:38,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:38,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:38,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-06 07:32:38,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:38,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350801694] [2022-12-06 07:32:38,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350801694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:38,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:38,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:38,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97680280] [2022-12-06 07:32:38,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:38,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:38,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:38,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:38,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:38,960 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:38,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:38,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:38,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:38,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:38,996 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:38,996 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:38,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:38,997 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:38,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:38,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:38,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:38,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:38,997 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:38,998 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:38,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:38,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:38,998 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:38,998 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:38,998 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:38,998 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:38,999 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:38,999 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:38,999 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:38,999 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:38,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:39,001 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:39,001 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:39,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:39,001 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:39,001 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:39,076 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:39,077 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:39,077 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:39,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:39,077 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:39,077 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:39,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2284 [2022-12-06 07:32:39,077 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-06 07:32:39,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:39,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1921563752, now seen corresponding path program 1 times [2022-12-06 07:32:39,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:39,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534903031] [2022-12-06 07:32:39,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:39,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:39,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:39,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:39,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534903031] [2022-12-06 07:32:39,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534903031] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:39,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:39,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:39,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266909549] [2022-12-06 07:32:39,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:39,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:39,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:39,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:39,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:39,142 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:39,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:39,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:39,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:39,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:39,183 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:39,184 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:39,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:39,184 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:39,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:39,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:39,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:39,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:39,185 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:39,185 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:39,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:39,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:39,185 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:39,185 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:39,186 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:39,186 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:39,186 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:39,186 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:39,186 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:39,186 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:39,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:39,188 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:39,188 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:39,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:39,188 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:39,189 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:39,263 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:39,264 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:39,264 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:39,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:39,264 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:39,264 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:39,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2285 [2022-12-06 07:32:39,264 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-06 07:32:39,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:39,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1894781643, now seen corresponding path program 1 times [2022-12-06 07:32:39,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:39,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754757300] [2022-12-06 07:32:39,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:39,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:39,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-06 07:32:39,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:39,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754757300] [2022-12-06 07:32:39,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754757300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:39,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:39,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:39,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126119016] [2022-12-06 07:32:39,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:39,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:39,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:39,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:39,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:39,332 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:39,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:39,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:39,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:39,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:39,373 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:39,373 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:39,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:39,374 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:39,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:39,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:39,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:39,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:39,374 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:39,375 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:39,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:39,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:39,375 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:39,375 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:39,375 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:39,375 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:39,376 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:39,376 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:39,376 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:39,376 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:39,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:39,378 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:39,378 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:39,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:39,378 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:39,378 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:39,452 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:39,453 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:39,453 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:39,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:39,453 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:39,453 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:39,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2286 [2022-12-06 07:32:39,454 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-06 07:32:39,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:39,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1864305450, now seen corresponding path program 1 times [2022-12-06 07:32:39,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:39,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731554862] [2022-12-06 07:32:39,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:39,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:39,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-06 07:32:39,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:39,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731554862] [2022-12-06 07:32:39,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731554862] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:39,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:39,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:39,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641703696] [2022-12-06 07:32:39,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:39,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:39,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:39,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:39,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:39,518 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:39,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:39,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:39,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:39,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:39,559 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:39,559 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:39,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:39,560 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:39,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:39,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:39,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:39,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:39,560 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:39,560 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:39,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:39,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:39,561 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:39,561 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:39,561 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:39,561 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:39,561 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:39,561 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:39,561 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:39,561 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:39,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:39,564 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:39,564 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:39,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:39,564 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:39,564 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:39,636 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:39,637 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:32:39,637 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:39,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:39,637 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:39,637 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:39,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2287 [2022-12-06 07:32:39,638 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-06 07:32:39,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:39,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1837523341, now seen corresponding path program 1 times [2022-12-06 07:32:39,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:39,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189979173] [2022-12-06 07:32:39,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:39,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:39,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:39,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-06 07:32:39,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:39,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189979173] [2022-12-06 07:32:39,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189979173] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:39,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:39,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:39,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312245608] [2022-12-06 07:32:39,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:39,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:39,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:39,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:39,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:39,704 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:39,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:39,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:39,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:39,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:39,739 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:39,739 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:39,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:39,740 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:39,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:39,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:39,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:39,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:39,740 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:39,740 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:39,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:39,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:39,741 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:39,741 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:39,741 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:39,741 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:39,741 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:39,741 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:39,741 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:39,741 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:39,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:39,744 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:39,744 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:39,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:39,744 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:39,744 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:39,829 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:39,830 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 07:32:39,830 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:39,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:39,830 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:39,830 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:39,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2288 [2022-12-06 07:32:39,830 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-06 07:32:39,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:39,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1807047148, now seen corresponding path program 1 times [2022-12-06 07:32:39,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:39,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768243606] [2022-12-06 07:32:39,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:39,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:39,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-06 07:32:39,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:39,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768243606] [2022-12-06 07:32:39,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768243606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:39,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:39,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:39,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611851877] [2022-12-06 07:32:39,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:39,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:39,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:39,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:39,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:39,897 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:39,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:39,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:39,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:39,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:39,939 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:39,939 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:39,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:39,940 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:39,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:39,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:39,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:39,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:39,940 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:39,941 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:39,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:39,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:39,941 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:39,941 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:39,941 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:39,941 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:39,942 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:39,942 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:39,942 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:39,942 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:39,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:39,944 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:39,944 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:39,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:39,944 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:39,944 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:40,019 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:40,020 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:40,020 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:40,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:40,020 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:40,020 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:40,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2289 [2022-12-06 07:32:40,020 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-06 07:32:40,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:40,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1780265039, now seen corresponding path program 1 times [2022-12-06 07:32:40,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:40,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125953483] [2022-12-06 07:32:40,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:40,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:40,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-06 07:32:40,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:40,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125953483] [2022-12-06 07:32:40,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125953483] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:40,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:40,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:40,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654166943] [2022-12-06 07:32:40,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:40,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:40,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:40,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:40,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:40,089 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:40,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:40,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:40,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:40,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:40,124 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:40,124 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:40,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 372 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:40,124 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:40,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:40,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:40,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:40,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:40,125 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:40,125 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:40,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:40,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:40,126 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:40,126 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:40,126 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:40,126 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:40,126 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:40,126 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:40,126 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:40,126 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:40,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:40,128 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:40,129 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:40,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:40,129 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:40,129 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:40,203 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:40,204 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:40,204 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:40,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:40,204 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:40,204 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:40,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2290 [2022-12-06 07:32:40,204 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-06 07:32:40,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:40,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1749788846, now seen corresponding path program 1 times [2022-12-06 07:32:40,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:40,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619113601] [2022-12-06 07:32:40,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:40,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:40,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-06 07:32:40,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:40,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619113601] [2022-12-06 07:32:40,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619113601] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:40,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:40,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:40,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346866598] [2022-12-06 07:32:40,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:40,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:40,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:40,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:40,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:40,269 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:40,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:40,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:40,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:40,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:40,306 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:40,307 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:40,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:40,307 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:40,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:40,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:40,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:40,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:40,308 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:40,308 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:40,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:40,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:40,308 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:40,308 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:40,309 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:40,309 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:40,309 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:40,309 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:40,309 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:40,309 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:40,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:40,311 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:40,311 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:40,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:40,312 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:40,312 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:40,385 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:40,386 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:40,386 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:40,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:40,386 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:40,386 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:40,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2291 [2022-12-06 07:32:40,386 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-06 07:32:40,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:40,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1723006737, now seen corresponding path program 1 times [2022-12-06 07:32:40,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:40,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678681310] [2022-12-06 07:32:40,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:40,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:40,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-06 07:32:40,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:40,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678681310] [2022-12-06 07:32:40,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678681310] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:40,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:40,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:40,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981747608] [2022-12-06 07:32:40,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:40,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:40,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:40,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:40,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:40,453 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:40,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:40,453 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:40,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:40,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:40,492 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:40,493 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:40,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:40,493 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:40,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:40,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:40,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:40,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:40,494 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:40,494 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:40,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:40,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:40,494 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:40,494 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:40,495 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:40,495 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:40,495 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:40,495 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:40,495 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:40,495 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:40,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:40,497 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:40,497 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:40,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:40,497 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:40,497 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:40,571 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:40,572 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:40,572 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:40,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:40,572 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:40,572 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:40,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2292 [2022-12-06 07:32:40,572 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-06 07:32:40,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:40,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1692530544, now seen corresponding path program 1 times [2022-12-06 07:32:40,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:40,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642519465] [2022-12-06 07:32:40,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:40,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:40,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-06 07:32:40,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:40,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642519465] [2022-12-06 07:32:40,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642519465] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:40,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:40,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:40,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787429100] [2022-12-06 07:32:40,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:40,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:40,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:40,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:40,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:40,639 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:40,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:40,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:40,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:40,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:40,675 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:40,676 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:40,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:40,676 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:40,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:40,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:40,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:40,677 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:40,677 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:40,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:40,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:40,677 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:40,677 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:40,678 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:40,678 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:40,678 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:40,678 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:40,678 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:40,678 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:40,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:40,680 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:40,680 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:40,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:40,680 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:40,681 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:40,753 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:40,754 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:32:40,754 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:40,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:40,754 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:40,754 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:40,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2293 [2022-12-06 07:32:40,754 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-06 07:32:40,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:40,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1665748435, now seen corresponding path program 1 times [2022-12-06 07:32:40,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:40,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731909583] [2022-12-06 07:32:40,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:40,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:40,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-06 07:32:40,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:40,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731909583] [2022-12-06 07:32:40,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731909583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:40,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:40,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:40,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758923351] [2022-12-06 07:32:40,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:40,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:40,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:40,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:40,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:40,824 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:40,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:40,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:40,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:40,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:40,874 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:40,875 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:40,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:40,875 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:40,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:40,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:40,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:40,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:40,876 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:40,876 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:40,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:40,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:40,876 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:40,876 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:40,876 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:40,876 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:40,877 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:40,877 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:40,877 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:40,877 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:40,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:40,879 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:40,879 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:40,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:40,879 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:40,879 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:40,957 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:40,958 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:32:40,958 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:40,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:40,958 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:40,958 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:40,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2294 [2022-12-06 07:32:40,959 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-06 07:32:40,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:40,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1635272242, now seen corresponding path program 1 times [2022-12-06 07:32:40,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:40,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610936622] [2022-12-06 07:32:40,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:40,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:41,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-06 07:32:41,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:41,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610936622] [2022-12-06 07:32:41,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610936622] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:41,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:41,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:41,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030743716] [2022-12-06 07:32:41,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:41,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:41,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:41,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:41,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:41,022 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:41,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:41,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:41,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:41,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:41,059 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:41,060 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:41,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:41,060 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:41,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:41,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:41,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:41,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:41,061 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:41,061 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:41,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:41,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:41,061 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:41,061 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:41,062 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:41,062 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:41,062 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:41,062 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:41,062 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:41,062 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:41,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:41,064 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:41,064 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:41,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:41,064 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:41,065 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:41,138 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:41,139 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:41,139 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:41,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:41,139 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:41,139 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:41,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2295 [2022-12-06 07:32:41,139 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-06 07:32:41,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:41,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1608490133, now seen corresponding path program 1 times [2022-12-06 07:32:41,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:41,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998011434] [2022-12-06 07:32:41,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:41,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:41,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:41,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:41,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998011434] [2022-12-06 07:32:41,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998011434] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:41,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:41,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:41,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945681822] [2022-12-06 07:32:41,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:41,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:41,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:41,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:41,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:41,208 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:41,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:41,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:41,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:41,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:41,244 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:41,245 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:41,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:41,245 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:41,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:41,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:41,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:41,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:41,246 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:41,246 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:41,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:41,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:41,246 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:41,246 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:41,247 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:41,247 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:41,247 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:41,247 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:41,247 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:41,247 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:41,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:41,249 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:41,249 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:41,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:41,249 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:41,249 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:41,323 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:41,324 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:41,324 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:41,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:41,324 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:41,324 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:41,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2296 [2022-12-06 07:32:41,324 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-06 07:32:41,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:41,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1578013940, now seen corresponding path program 1 times [2022-12-06 07:32:41,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:41,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717415759] [2022-12-06 07:32:41,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:41,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:41,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-06 07:32:41,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:41,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717415759] [2022-12-06 07:32:41,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717415759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:41,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:41,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:41,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239027140] [2022-12-06 07:32:41,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:41,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:41,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:41,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:41,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:41,388 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:41,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:41,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:41,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:41,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:41,430 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:41,430 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:41,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:41,431 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:41,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:41,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:41,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:41,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:41,432 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:41,432 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:41,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:41,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:41,432 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:41,432 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:41,432 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:41,432 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:41,433 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:41,433 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:41,433 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:41,433 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:41,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:41,435 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:41,435 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:41,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:41,435 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:41,435 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:41,509 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:41,510 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:41,510 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:41,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:41,510 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:41,511 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:41,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2297 [2022-12-06 07:32:41,511 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-06 07:32:41,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:41,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1551231831, now seen corresponding path program 1 times [2022-12-06 07:32:41,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:41,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085864201] [2022-12-06 07:32:41,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:41,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:41,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-06 07:32:41,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:41,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085864201] [2022-12-06 07:32:41,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085864201] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:41,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:41,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:41,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787768898] [2022-12-06 07:32:41,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:41,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:41,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:41,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:41,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:41,577 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:41,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:41,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:41,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:41,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:41,619 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:41,619 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:41,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:41,619 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:41,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:41,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:41,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:41,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:41,620 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:41,620 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:41,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:41,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:41,621 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:41,621 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:41,621 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:41,621 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:41,621 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:41,621 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:41,621 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:41,621 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:41,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:41,623 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:41,623 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:41,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:41,624 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:41,624 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:41,711 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:41,712 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-06 07:32:41,712 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:41,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:41,712 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:41,712 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:41,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2298 [2022-12-06 07:32:41,712 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-06 07:32:41,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:41,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1520755638, now seen corresponding path program 1 times [2022-12-06 07:32:41,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:41,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980054940] [2022-12-06 07:32:41,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:41,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:41,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-06 07:32:41,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:41,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980054940] [2022-12-06 07:32:41,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980054940] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:41,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:41,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:41,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848128806] [2022-12-06 07:32:41,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:41,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:41,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:41,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:41,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:41,777 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:41,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:41,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:41,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:41,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:41,818 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:41,818 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:41,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:41,819 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:41,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:41,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:41,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:41,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:41,819 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:41,819 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:41,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:41,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:41,820 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:41,820 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:41,820 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:41,820 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:41,820 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:41,821 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:41,821 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:41,821 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:41,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:41,823 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:41,823 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:41,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:41,823 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:41,823 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:41,899 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:41,900 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:32:41,900 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:41,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:41,900 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:41,900 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:41,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2299 [2022-12-06 07:32:41,900 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-06 07:32:41,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:41,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1493973529, now seen corresponding path program 1 times [2022-12-06 07:32:41,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:41,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093378399] [2022-12-06 07:32:41,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:41,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:41,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-06 07:32:41,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:41,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093378399] [2022-12-06 07:32:41,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093378399] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:41,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:41,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:41,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68209446] [2022-12-06 07:32:41,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:41,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:41,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:41,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:41,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:41,983 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:41,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:41,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:41,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:41,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:42,019 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:42,019 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:42,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 380 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:42,019 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:42,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:42,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:42,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:42,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:42,020 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:42,020 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:42,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:42,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:42,021 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:42,021 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:42,021 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:42,021 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:42,021 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:42,021 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:42,021 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:42,021 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:42,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:42,023 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:42,024 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:42,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:42,024 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:42,024 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:42,097 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:42,098 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:42,098 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:42,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:42,098 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:42,098 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:42,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2300 [2022-12-06 07:32:42,099 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-06 07:32:42,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:42,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1463497336, now seen corresponding path program 1 times [2022-12-06 07:32:42,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:42,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005688758] [2022-12-06 07:32:42,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:42,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:42,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-06 07:32:42,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:42,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005688758] [2022-12-06 07:32:42,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005688758] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:42,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:42,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:42,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192169768] [2022-12-06 07:32:42,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:42,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:42,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:42,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:42,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:42,165 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:42,165 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:42,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:42,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:42,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:42,202 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:42,202 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:42,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:42,203 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:42,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:42,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:42,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:42,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:42,203 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:42,203 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:42,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:42,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:42,204 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:42,204 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:42,204 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:42,204 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:42,204 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:42,204 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:42,204 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:42,204 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:42,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:42,207 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:42,207 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:42,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:42,207 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:42,207 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:42,281 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:42,282 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:42,282 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:42,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:42,282 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:42,282 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:42,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2301 [2022-12-06 07:32:42,282 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-06 07:32:42,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:42,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1436715227, now seen corresponding path program 1 times [2022-12-06 07:32:42,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:42,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737690401] [2022-12-06 07:32:42,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:42,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:42,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-06 07:32:42,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:42,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737690401] [2022-12-06 07:32:42,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737690401] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:42,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:42,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:42,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963212680] [2022-12-06 07:32:42,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:42,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:42,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:42,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:42,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:42,350 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:42,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:42,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:42,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:42,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:42,392 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:42,392 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:42,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:42,392 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:42,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:42,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:42,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:42,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:42,393 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:42,393 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:42,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:42,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:42,394 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:42,394 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:42,394 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:42,394 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:42,394 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:42,394 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:42,394 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:42,394 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:42,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:42,396 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:42,396 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:42,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:42,397 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:42,397 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:42,468 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:42,469 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:32:42,469 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:42,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:42,469 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:42,469 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:42,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2302 [2022-12-06 07:32:42,470 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-06 07:32:42,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:42,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1406239034, now seen corresponding path program 1 times [2022-12-06 07:32:42,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:42,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644462767] [2022-12-06 07:32:42,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:42,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32: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-06 07:32:42,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:42,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644462767] [2022-12-06 07:32:42,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644462767] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:42,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:42,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:42,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964012596] [2022-12-06 07:32:42,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:42,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:42,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:42,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:42,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:42,532 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:42,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:42,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:42,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:42,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:42,575 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:42,575 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:42,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:42,576 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:42,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:42,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:42,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:42,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:42,576 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:42,576 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:42,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:42,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:42,577 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:42,577 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:42,577 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:42,577 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:42,577 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:42,577 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:42,577 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:42,577 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:42,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:42,580 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:42,580 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:42,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 122 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:42,580 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:42,580 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:42,654 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:42,655 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:42,655 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:42,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:42,655 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:42,655 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:42,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2303 [2022-12-06 07:32:42,655 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-06 07:32:42,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:42,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1379456925, now seen corresponding path program 1 times [2022-12-06 07:32:42,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:42,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128946218] [2022-12-06 07:32:42,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:42,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:42,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-06 07:32:42,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:42,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128946218] [2022-12-06 07:32:42,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128946218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:42,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:42,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:42,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183357136] [2022-12-06 07:32:42,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:42,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:42,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:42,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:42,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:42,721 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:42,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:42,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:42,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:42,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:42,760 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:42,761 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:42,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:42,761 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:42,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:42,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:42,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:42,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:42,762 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:42,762 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:42,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:42,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:42,763 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:42,763 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:42,763 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:42,763 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:42,763 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:42,763 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:42,763 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:42,763 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:42,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:42,765 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:42,765 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:42,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:42,766 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:42,766 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:42,838 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:42,839 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:32:42,839 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:42,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:42,839 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:42,839 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:42,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2304 [2022-12-06 07:32:42,839 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-06 07:32:42,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:42,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1348980732, now seen corresponding path program 1 times [2022-12-06 07:32:42,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:42,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584970785] [2022-12-06 07:32:42,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:42,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:42,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-06 07:32:42,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:42,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584970785] [2022-12-06 07:32:42,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584970785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:42,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:42,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:42,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343604730] [2022-12-06 07:32:42,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:42,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:42,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:42,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:42,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:42,904 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:42,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:42,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:42,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:42,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:42,945 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:42,945 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:42,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:42,946 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:42,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:42,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:42,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:42,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:42,947 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:42,947 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:42,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:42,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:42,947 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:42,947 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:42,948 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:42,948 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:42,948 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:42,948 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:42,948 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:42,948 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:42,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:42,950 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:42,950 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:42,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:42,950 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:42,950 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:43,026 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:43,027 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:43,027 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:43,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:43,027 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:43,027 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:43,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2305 [2022-12-06 07:32:43,027 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-06 07:32:43,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:43,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1322198623, now seen corresponding path program 1 times [2022-12-06 07:32:43,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:43,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666542288] [2022-12-06 07:32:43,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:43,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32: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-06 07:32:43,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:43,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666542288] [2022-12-06 07:32:43,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666542288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:43,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:43,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:43,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717824301] [2022-12-06 07:32:43,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:43,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:43,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:43,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:43,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:43,113 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:43,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:43,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:43,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:43,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:43,149 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:43,149 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:43,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:43,150 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:43,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:43,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:43,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:43,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:43,150 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:43,150 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:43,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:43,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:43,151 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:43,151 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:43,151 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:43,151 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:43,151 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:43,151 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:43,152 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:43,152 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:43,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:43,154 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:43,154 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:43,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:43,154 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:43,154 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:43,229 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:43,230 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:43,230 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:43,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:43,230 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:43,230 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:43,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2306 [2022-12-06 07:32:43,230 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-06 07:32:43,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:43,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1291722430, now seen corresponding path program 1 times [2022-12-06 07:32:43,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:43,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10584691] [2022-12-06 07:32:43,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:43,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:43,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-06 07:32:43,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:43,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10584691] [2022-12-06 07:32:43,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10584691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:43,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:43,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:43,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123028012] [2022-12-06 07:32:43,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:43,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:43,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:43,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:43,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:43,295 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:43,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:43,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:43,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:43,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:43,332 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:43,332 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:43,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:43,333 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:43,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:43,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:43,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:43,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:43,333 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:43,333 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:43,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:43,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:43,334 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:43,334 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:43,334 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:43,334 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:43,334 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:43,334 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:43,335 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:43,335 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:43,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:43,337 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:43,337 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:43,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:43,337 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:43,337 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:43,412 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:43,413 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:43,413 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:43,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:43,414 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:43,414 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:43,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2307 [2022-12-06 07:32:43,414 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-06 07:32:43,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:43,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1264940321, now seen corresponding path program 1 times [2022-12-06 07:32:43,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:43,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401919295] [2022-12-06 07:32:43,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:43,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:43,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-06 07:32:43,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:43,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401919295] [2022-12-06 07:32:43,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401919295] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:43,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:43,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:43,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617361373] [2022-12-06 07:32:43,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:43,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:43,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:43,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:43,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:43,482 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:43,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:43,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:43,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:43,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:43,520 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:43,520 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:43,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:43,520 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:43,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:43,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:43,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:43,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:43,521 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:43,521 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:43,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:43,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:43,522 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:43,522 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:43,522 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:43,522 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:43,522 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:43,522 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:43,522 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:43,522 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:43,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:43,525 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:43,525 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:43,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:43,525 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:43,525 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:43,602 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:43,603 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:32:43,603 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:43,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:43,603 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:43,603 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:43,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2308 [2022-12-06 07:32:43,603 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-06 07:32:43,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:43,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1234464128, now seen corresponding path program 1 times [2022-12-06 07:32:43,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:43,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587897745] [2022-12-06 07:32:43,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:43,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:43,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:43,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-06 07:32:43,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:43,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587897745] [2022-12-06 07:32:43,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587897745] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:43,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:43,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:43,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643434280] [2022-12-06 07:32:43,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:43,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:43,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:43,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:43,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:43,667 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:43,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:43,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:43,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:43,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:43,704 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:43,704 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:43,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:43,705 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:43,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:43,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:43,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:43,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:43,705 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:43,705 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:43,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:43,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:43,706 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:43,706 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:43,706 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:43,706 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:43,706 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:43,706 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:43,706 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:43,707 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:43,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:43,709 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:43,709 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:43,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:43,709 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:43,709 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:43,785 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:43,786 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:32:43,786 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:43,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:43,786 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:43,786 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:43,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2309 [2022-12-06 07:32:43,786 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-06 07:32:43,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:43,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1207682019, now seen corresponding path program 1 times [2022-12-06 07:32:43,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:43,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451227288] [2022-12-06 07:32:43,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:43,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:43,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-06 07:32:43,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:43,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451227288] [2022-12-06 07:32:43,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451227288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:43,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:43,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:43,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677667729] [2022-12-06 07:32:43,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:43,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:43,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:43,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:43,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:43,853 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:43,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:43,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:43,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:43,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:43,890 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:43,890 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:43,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:43,890 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:43,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:43,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:43,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:43,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:43,891 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:43,891 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:43,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:43,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:43,892 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:43,892 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:43,892 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:43,892 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:43,892 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:43,892 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:43,892 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:43,892 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:43,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:43,894 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:43,894 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:43,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:43,895 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:43,895 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:43,970 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:43,971 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:43,971 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:43,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:43,971 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:43,971 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:43,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2310 [2022-12-06 07:32:43,972 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-06 07:32:43,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:43,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1177205826, now seen corresponding path program 1 times [2022-12-06 07:32:43,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:43,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560431477] [2022-12-06 07:32:43,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:43,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:43,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:44,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-06 07:32:44,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:44,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560431477] [2022-12-06 07:32:44,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560431477] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:44,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:44,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:44,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996004975] [2022-12-06 07:32:44,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:44,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:44,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:44,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:44,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:44,036 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:44,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:44,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:44,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:44,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:44,073 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:44,073 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:44,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:44,074 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:44,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:44,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:44,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:44,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:44,074 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:44,074 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:44,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:44,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:44,075 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:44,075 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:44,075 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:44,075 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:44,075 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:44,076 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:44,076 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:44,076 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:44,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:44,078 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:44,078 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:44,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:44,078 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:44,078 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:44,152 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:44,153 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:44,153 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:44,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:44,153 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:44,153 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:44,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2311 [2022-12-06 07:32:44,153 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-06 07:32:44,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:44,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1150423717, now seen corresponding path program 1 times [2022-12-06 07:32:44,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:44,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466760598] [2022-12-06 07:32:44,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:44,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:44,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-06 07:32:44,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:44,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466760598] [2022-12-06 07:32:44,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466760598] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:44,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:44,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:44,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897582006] [2022-12-06 07:32:44,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:44,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:44,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:44,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:44,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:44,232 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:44,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:44,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:44,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:44,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:44,273 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:44,273 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:44,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:44,274 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:44,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:44,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:44,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:44,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:44,274 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:44,274 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:44,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:44,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:44,275 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:44,275 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:44,275 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:44,275 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:44,275 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:44,275 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:44,275 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:44,275 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:44,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:44,277 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:44,278 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:44,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:44,278 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:44,278 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:44,352 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:44,353 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:44,353 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:44,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:44,353 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:44,353 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:44,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2312 [2022-12-06 07:32:44,354 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-06 07:32:44,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:44,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1119947524, now seen corresponding path program 1 times [2022-12-06 07:32:44,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:44,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262073558] [2022-12-06 07:32:44,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:44,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:44,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-06 07:32:44,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:44,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262073558] [2022-12-06 07:32:44,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262073558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:44,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:44,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:44,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374283248] [2022-12-06 07:32:44,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:44,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:44,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:44,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:44,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:44,420 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:44,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:44,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:44,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:44,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:44,457 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:44,457 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:44,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:44,458 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:44,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:44,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:44,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:44,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:44,458 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:44,459 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:44,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:44,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:44,459 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:44,459 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:44,459 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:44,459 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:44,460 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:44,460 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:44,460 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:44,460 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:44,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:44,462 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:44,462 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:44,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:44,462 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:44,462 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:44,537 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:44,538 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:44,538 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:44,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:44,539 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:44,539 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:44,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2313 [2022-12-06 07:32:44,539 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-06 07:32:44,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:44,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1093165415, now seen corresponding path program 1 times [2022-12-06 07:32:44,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:44,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063453691] [2022-12-06 07:32:44,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:44,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:44,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-06 07:32:44,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:44,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063453691] [2022-12-06 07:32:44,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063453691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:44,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:44,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:44,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110649956] [2022-12-06 07:32:44,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:44,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:44,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:44,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:44,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:44,608 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:44,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:44,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:44,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:44,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:44,650 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:44,650 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:44,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:44,651 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:44,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:44,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:44,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:44,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:44,651 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:44,651 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:44,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:44,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:44,652 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:44,652 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:44,652 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:44,652 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:44,652 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:44,652 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:44,652 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:44,652 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:44,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:44,655 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:44,655 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:44,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:44,655 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:44,655 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:44,729 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:44,730 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:44,730 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:44,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:44,730 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:44,730 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:44,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2314 [2022-12-06 07:32:44,730 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-06 07:32:44,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:44,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1062689222, now seen corresponding path program 1 times [2022-12-06 07:32:44,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:44,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035159336] [2022-12-06 07:32:44,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:44,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:44,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-06 07:32:44,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:44,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035159336] [2022-12-06 07:32:44,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035159336] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:44,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:44,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:44,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738292428] [2022-12-06 07:32:44,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:44,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:44,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:44,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:44,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:44,816 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:44,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:44,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:44,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:44,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:44,859 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:44,859 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:44,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:44,859 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:44,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:44,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:44,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:44,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:44,860 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:44,860 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:44,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:44,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:44,861 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:44,861 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:44,861 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:44,861 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:44,861 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:44,861 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:44,861 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:44,861 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:44,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:44,863 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:44,863 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:44,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:44,864 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:44,864 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:44,938 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:44,939 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:44,939 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:44,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:44,939 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:44,939 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:44,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2315 [2022-12-06 07:32:44,940 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-06 07:32:44,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:44,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1035907113, now seen corresponding path program 1 times [2022-12-06 07:32:44,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:44,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272697005] [2022-12-06 07:32:44,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:44,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:45,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-06 07:32:45,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:45,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272697005] [2022-12-06 07:32:45,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272697005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:45,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:45,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:45,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252369730] [2022-12-06 07:32:45,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:45,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:45,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:45,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:45,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:45,007 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:45,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:45,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:45,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:45,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:45,044 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:45,044 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:45,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:45,044 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:45,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:45,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:45,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:45,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:45,045 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:45,045 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:45,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:45,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:45,046 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:45,046 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:45,046 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:45,046 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:45,046 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:45,046 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:45,046 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:45,046 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:45,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:45,048 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:45,048 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:45,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:45,049 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:45,049 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:45,124 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:45,125 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:45,125 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:45,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:45,125 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:45,125 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:45,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2316 [2022-12-06 07:32:45,125 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-06 07:32:45,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:45,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1005430920, now seen corresponding path program 1 times [2022-12-06 07:32:45,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:45,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263433210] [2022-12-06 07:32:45,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:45,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32: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-06 07:32:45,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:45,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263433210] [2022-12-06 07:32:45,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263433210] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:45,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:45,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:45,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073382551] [2022-12-06 07:32:45,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:45,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:45,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:45,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:45,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:45,190 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:45,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:45,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:45,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:45,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:45,228 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:45,228 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:45,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:45,228 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:45,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:45,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:45,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:45,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:45,229 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:45,229 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:45,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:45,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:45,230 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:45,230 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:45,230 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:45,230 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:45,230 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:45,230 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:45,230 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:45,230 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:45,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:45,232 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:45,232 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:45,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:45,233 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:45,233 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:45,318 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:45,319 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 07:32:45,319 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:45,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:45,319 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:45,319 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:45,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2317 [2022-12-06 07:32:45,319 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-06 07:32:45,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:45,319 INFO L85 PathProgramCache]: Analyzing trace with hash -978648811, now seen corresponding path program 1 times [2022-12-06 07:32:45,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:45,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756642152] [2022-12-06 07:32:45,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:45,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:45,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-06 07:32:45,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:45,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756642152] [2022-12-06 07:32:45,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756642152] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:45,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:45,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:45,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860583341] [2022-12-06 07:32:45,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:45,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:45,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:45,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:45,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:45,386 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:45,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:45,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:45,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:45,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:45,425 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:45,425 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:45,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:45,426 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:45,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:45,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:45,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:45,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:45,426 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:45,426 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:45,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:45,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:45,427 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:45,427 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:45,427 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:45,427 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:45,427 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:45,427 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:45,427 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:45,427 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:45,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:45,430 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:45,430 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:45,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:45,430 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:45,430 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:45,504 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:45,505 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:45,505 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:45,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:45,505 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:45,505 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:45,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2318 [2022-12-06 07:32:45,505 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-06 07:32:45,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:45,505 INFO L85 PathProgramCache]: Analyzing trace with hash -948172618, now seen corresponding path program 1 times [2022-12-06 07:32:45,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:45,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444408798] [2022-12-06 07:32:45,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:45,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:45,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-06 07:32:45,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:45,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444408798] [2022-12-06 07:32:45,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444408798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:45,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:45,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:45,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518769434] [2022-12-06 07:32:45,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:45,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:45,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:45,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:45,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:45,569 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:45,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:45,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:45,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:45,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:45,611 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:45,611 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:45,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:45,611 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:45,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:45,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:45,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:45,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:45,612 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:45,612 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:45,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:45,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:45,613 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:45,613 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:45,613 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:45,613 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:45,613 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:45,613 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:45,613 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:45,613 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:45,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:45,615 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:45,616 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:45,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:45,616 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:45,616 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:45,689 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:45,690 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:45,690 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:45,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:45,690 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:45,690 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:45,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2319 [2022-12-06 07:32:45,691 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-06 07:32:45,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:45,691 INFO L85 PathProgramCache]: Analyzing trace with hash -921390509, now seen corresponding path program 1 times [2022-12-06 07:32:45,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:45,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116721558] [2022-12-06 07:32:45,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:45,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:45,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-06 07:32:45,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:45,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116721558] [2022-12-06 07:32:45,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116721558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:45,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:45,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:45,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693037858] [2022-12-06 07:32:45,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:45,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:45,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:45,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:45,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:45,758 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:45,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:45,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:45,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:45,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:45,799 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:45,799 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:45,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:45,799 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:45,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:45,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:45,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:45,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:45,800 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:45,800 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:45,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:45,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:45,801 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:45,801 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:45,801 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:45,801 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:45,801 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:45,801 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:45,801 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:45,801 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:45,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:45,804 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:45,804 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:45,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:45,804 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:45,804 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:45,878 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:45,879 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:45,879 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:45,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:45,879 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:45,879 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:45,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2320 [2022-12-06 07:32:45,879 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-06 07:32:45,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:45,879 INFO L85 PathProgramCache]: Analyzing trace with hash -890914316, now seen corresponding path program 1 times [2022-12-06 07:32:45,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:45,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691747877] [2022-12-06 07:32:45,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:45,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:45,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-06 07:32:45,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:45,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691747877] [2022-12-06 07:32:45,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691747877] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:45,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:45,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:45,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612900158] [2022-12-06 07:32:45,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:45,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:45,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:45,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:45,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:45,946 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:45,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:45,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:45,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:45,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:45,982 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:45,982 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:45,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:45,983 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:45,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:45,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:45,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:45,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:45,983 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:45,983 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:45,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:45,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:45,984 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:45,984 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:45,984 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:45,984 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:45,984 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:45,984 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:45,984 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:45,984 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:45,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:45,986 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:45,987 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:45,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:45,987 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:45,987 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:46,061 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:46,062 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:46,062 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:46,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:46,062 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:46,062 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:46,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2321 [2022-12-06 07:32:46,062 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-06 07:32:46,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:46,062 INFO L85 PathProgramCache]: Analyzing trace with hash -864132207, now seen corresponding path program 1 times [2022-12-06 07:32:46,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:46,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946901800] [2022-12-06 07:32:46,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:46,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:46,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-06 07:32:46,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:46,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946901800] [2022-12-06 07:32:46,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946901800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:46,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:46,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:46,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627298043] [2022-12-06 07:32:46,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:46,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:46,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:46,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:46,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:46,128 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:46,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:46,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:46,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:46,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:46,163 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:46,163 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:46,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:46,164 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:46,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:46,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:46,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:46,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:46,164 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:46,164 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:46,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:46,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:46,165 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:46,165 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:46,165 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:46,165 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:46,165 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:46,165 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:46,165 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:46,165 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:46,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:46,168 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:46,168 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:46,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:46,168 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:46,168 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:46,242 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:46,243 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:46,243 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:46,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:46,243 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:46,243 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:46,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2322 [2022-12-06 07:32:46,244 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-06 07:32:46,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:46,244 INFO L85 PathProgramCache]: Analyzing trace with hash -833656014, now seen corresponding path program 1 times [2022-12-06 07:32:46,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:46,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936374952] [2022-12-06 07:32:46,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:46,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:46,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-06 07:32:46,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:46,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936374952] [2022-12-06 07:32:46,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936374952] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:46,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:46,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:46,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11548466] [2022-12-06 07:32:46,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:46,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:46,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:46,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:46,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:46,309 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:46,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:46,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:46,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:46,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:46,355 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:46,355 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:46,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:46,356 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:46,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:46,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:46,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:46,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:46,356 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:46,356 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:46,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:46,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:46,357 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:46,357 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:46,357 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:46,357 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:46,357 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:46,357 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:46,358 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:46,358 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:46,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:46,360 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:46,360 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:46,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:46,360 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:46,360 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:46,432 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:46,433 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:32:46,433 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:46,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:46,433 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:46,433 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:46,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2323 [2022-12-06 07:32:46,433 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-06 07:32:46,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:46,433 INFO L85 PathProgramCache]: Analyzing trace with hash -806873905, now seen corresponding path program 1 times [2022-12-06 07:32:46,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:46,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823537330] [2022-12-06 07:32:46,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:46,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:46,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-06 07:32:46,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:46,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823537330] [2022-12-06 07:32:46,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823537330] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:46,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:46,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:46,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646532983] [2022-12-06 07:32:46,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:46,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:46,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:46,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:46,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:46,503 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:46,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:46,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:46,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:46,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:46,539 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:46,539 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:46,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:46,539 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:46,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:46,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:46,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:46,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:46,540 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:46,540 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:46,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:46,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:46,541 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:46,541 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:46,541 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:46,541 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:46,541 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:46,541 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:46,541 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:46,541 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:46,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:46,543 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:46,543 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:46,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:46,544 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:46,544 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:46,617 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:46,618 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:46,618 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:46,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:46,618 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:46,618 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:46,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2324 [2022-12-06 07:32:46,619 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-06 07:32:46,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:46,619 INFO L85 PathProgramCache]: Analyzing trace with hash -776397712, now seen corresponding path program 1 times [2022-12-06 07:32:46,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:46,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502146142] [2022-12-06 07:32:46,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:46,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:46,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-06 07:32:46,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:46,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502146142] [2022-12-06 07:32:46,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502146142] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:46,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:46,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:46,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149342671] [2022-12-06 07:32:46,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:46,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:46,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:46,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:46,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:46,683 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:46,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:46,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:46,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:46,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:46,718 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:46,718 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:46,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:46,719 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:46,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:46,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:46,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:46,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:46,719 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:46,719 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:46,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:46,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:46,720 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:46,720 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:46,720 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:46,720 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:46,720 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:46,720 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:46,720 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:46,720 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:46,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:46,722 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:46,723 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:46,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:46,723 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:46,723 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:46,796 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:46,797 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:46,797 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:46,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:46,797 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:46,797 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:46,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2325 [2022-12-06 07:32:46,797 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-06 07:32:46,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:46,797 INFO L85 PathProgramCache]: Analyzing trace with hash -749615603, now seen corresponding path program 1 times [2022-12-06 07:32:46,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:46,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781858862] [2022-12-06 07:32:46,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:46,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:46,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-06 07:32:46,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:46,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781858862] [2022-12-06 07:32:46,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781858862] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:46,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:46,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:46,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314258972] [2022-12-06 07:32:46,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:46,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:46,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:46,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:46,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:46,865 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:46,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:46,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:46,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:46,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:46,905 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:46,906 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:46,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:46,906 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:46,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:46,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:46,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:46,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:46,907 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:46,907 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:46,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:46,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:46,907 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:46,907 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:46,908 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:46,908 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:46,908 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:46,908 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:46,908 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:46,908 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:46,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:46,910 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:46,910 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:46,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:46,910 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:46,910 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:46,986 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:46,987 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:46,987 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:46,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:46,987 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:46,987 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:46,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2326 [2022-12-06 07:32:46,987 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-06 07:32:46,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:46,988 INFO L85 PathProgramCache]: Analyzing trace with hash -719139410, now seen corresponding path program 1 times [2022-12-06 07:32:46,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:46,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980410235] [2022-12-06 07:32:46,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:46,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:47,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-06 07:32:47,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:47,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980410235] [2022-12-06 07:32:47,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980410235] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:47,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:47,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:47,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032583098] [2022-12-06 07:32:47,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:47,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:47,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:47,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:47,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:47,056 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:47,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:47,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:47,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:47,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:47,098 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:47,098 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:47,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 349 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:47,099 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:47,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:47,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:47,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:47,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:47,099 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:47,099 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:47,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:47,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:47,100 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:47,100 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:47,100 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:47,100 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:47,100 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:47,100 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:47,100 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:47,100 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:47,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:47,103 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:47,103 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:47,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:47,103 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:47,103 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:47,178 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:47,179 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:47,179 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:47,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:47,179 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:47,179 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:47,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2327 [2022-12-06 07:32:47,179 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-06 07:32:47,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:47,179 INFO L85 PathProgramCache]: Analyzing trace with hash -692357301, now seen corresponding path program 1 times [2022-12-06 07:32:47,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:47,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643471811] [2022-12-06 07:32:47,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:47,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:47,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:47,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:47,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643471811] [2022-12-06 07:32:47,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643471811] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:47,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:47,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:47,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838499207] [2022-12-06 07:32:47,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:47,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:47,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:47,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:47,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:47,247 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:47,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:47,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:47,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:47,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:47,287 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:47,287 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:47,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 372 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:47,288 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:47,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:47,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:47,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:47,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:47,288 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:47,288 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:47,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:47,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:47,289 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:47,289 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:47,289 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:47,289 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:47,289 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:47,289 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:47,290 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:47,290 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:47,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:47,292 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:47,292 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:47,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:47,292 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:47,292 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:47,365 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:47,365 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:32:47,366 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:47,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:47,366 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:47,366 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:47,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2328 [2022-12-06 07:32:47,366 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-06 07:32:47,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:47,366 INFO L85 PathProgramCache]: Analyzing trace with hash -661881108, now seen corresponding path program 1 times [2022-12-06 07:32:47,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:47,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119258477] [2022-12-06 07:32:47,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:47,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:47,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-06 07:32:47,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:47,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119258477] [2022-12-06 07:32:47,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119258477] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:47,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:47,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:47,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649425527] [2022-12-06 07:32:47,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:47,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:47,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:47,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:47,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:47,444 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:47,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:47,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:47,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:47,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:47,485 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:47,485 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:47,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 349 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:47,486 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:47,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:47,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:47,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:47,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:47,486 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:47,486 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:47,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:47,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:47,487 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:47,487 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:47,487 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:47,487 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:47,487 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:47,487 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:47,487 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:47,487 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:47,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:47,489 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:47,490 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:47,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:47,490 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:47,490 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:47,564 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:47,565 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:47,565 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:47,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:47,565 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:47,565 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:47,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2329 [2022-12-06 07:32:47,565 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-06 07:32:47,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:47,566 INFO L85 PathProgramCache]: Analyzing trace with hash -635098999, now seen corresponding path program 1 times [2022-12-06 07:32:47,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:47,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127068759] [2022-12-06 07:32:47,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:47,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:47,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-06 07:32:47,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:47,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127068759] [2022-12-06 07:32:47,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127068759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:47,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:47,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:47,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11664341] [2022-12-06 07:32:47,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:47,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:47,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:47,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:47,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:47,635 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:47,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:47,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:47,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:47,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:47,671 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:47,671 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:47,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:47,672 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:47,672 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:47,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:47,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:47,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:47,672 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:47,672 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:47,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:47,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:47,673 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:47,673 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:47,673 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:47,673 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:47,673 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:47,673 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:47,673 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:47,673 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:47,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:47,676 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:47,676 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:47,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:47,676 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:47,676 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:47,749 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:47,750 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:47,750 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:47,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:47,751 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:47,751 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:47,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2330 [2022-12-06 07:32:47,751 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-06 07:32:47,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:47,751 INFO L85 PathProgramCache]: Analyzing trace with hash -604622806, now seen corresponding path program 1 times [2022-12-06 07:32:47,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:47,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679445517] [2022-12-06 07:32:47,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:47,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:47,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-06 07:32:47,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:47,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679445517] [2022-12-06 07:32:47,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679445517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:47,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:47,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:47,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693137341] [2022-12-06 07:32:47,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:47,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:47,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:47,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:47,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:47,814 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:47,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:47,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:47,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:47,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:47,849 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:47,849 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:47,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:47,849 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:47,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:47,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:47,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:47,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:47,850 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:47,850 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:47,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:47,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:47,851 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:47,851 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:47,851 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:47,851 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:47,851 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:47,851 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:47,851 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:47,851 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:47,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:47,853 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:47,853 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:47,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:47,854 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:47,854 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:47,927 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:47,928 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:47,928 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:47,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:47,928 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:47,928 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:47,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2331 [2022-12-06 07:32:47,928 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-06 07:32:47,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:47,929 INFO L85 PathProgramCache]: Analyzing trace with hash -577840697, now seen corresponding path program 1 times [2022-12-06 07:32:47,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:47,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042452575] [2022-12-06 07:32:47,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:47,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:47,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-06 07:32:47,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:47,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042452575] [2022-12-06 07:32:47,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042452575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:47,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:47,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:47,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178817914] [2022-12-06 07:32:47,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:47,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:47,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:47,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:47,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:47,997 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:47,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:47,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:47,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:47,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:48,038 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:48,038 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:48,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:48,039 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:48,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:48,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:48,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:48,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:48,039 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:48,039 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:48,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:48,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:48,040 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:48,040 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:48,040 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:48,040 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:48,040 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:48,040 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:48,040 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:48,040 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:48,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:48,043 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:48,043 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:48,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:48,043 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:48,043 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:48,116 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:48,117 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:48,117 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:48,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:48,117 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:48,118 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:48,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2332 [2022-12-06 07:32:48,118 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-06 07:32:48,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:48,118 INFO L85 PathProgramCache]: Analyzing trace with hash -547364504, now seen corresponding path program 1 times [2022-12-06 07:32:48,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:48,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293366203] [2022-12-06 07:32:48,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:48,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:48,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-06 07:32:48,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:48,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293366203] [2022-12-06 07:32:48,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293366203] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:48,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:48,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:48,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38419530] [2022-12-06 07:32:48,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:48,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:48,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:48,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:48,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:48,186 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:48,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:48,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:48,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:48,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:48,228 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:48,228 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:48,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:48,229 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:48,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:48,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:48,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:48,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:48,229 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:48,229 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:48,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:48,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:48,230 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:48,230 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:48,230 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:48,230 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:48,230 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:48,230 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:48,231 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:48,231 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:48,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:48,233 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:48,233 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:48,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:48,233 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:48,233 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:48,306 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:48,307 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:48,307 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:48,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:48,308 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:48,308 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:48,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2333 [2022-12-06 07:32:48,308 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-06 07:32:48,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:48,308 INFO L85 PathProgramCache]: Analyzing trace with hash -520582395, now seen corresponding path program 1 times [2022-12-06 07:32:48,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:48,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841703890] [2022-12-06 07:32:48,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:48,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:48,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-06 07:32:48,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:48,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841703890] [2022-12-06 07:32:48,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841703890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:48,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:48,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:48,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634950050] [2022-12-06 07:32:48,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:48,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:48,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:48,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:48,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:48,376 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:48,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:48,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:48,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:48,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:48,416 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:48,417 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:48,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:48,417 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:48,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:48,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:48,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:48,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:48,418 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:48,418 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:48,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:48,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:48,418 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:48,418 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:48,419 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:48,419 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:48,419 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:48,419 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:48,419 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:48,419 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:48,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:48,421 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:48,421 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:48,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:48,421 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:48,422 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:48,494 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:48,495 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:32:48,495 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:48,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:48,495 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:48,495 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:48,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2334 [2022-12-06 07:32:48,495 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-06 07:32:48,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:48,496 INFO L85 PathProgramCache]: Analyzing trace with hash -490106202, now seen corresponding path program 1 times [2022-12-06 07:32:48,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:48,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40440584] [2022-12-06 07:32:48,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:48,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:48,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:48,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-06 07:32:48,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:48,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40440584] [2022-12-06 07:32:48,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40440584] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:48,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:48,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:48,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393246196] [2022-12-06 07:32:48,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:48,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:48,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:48,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:48,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:48,569 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:48,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:48,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:48,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:48,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:48,605 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:48,605 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:48,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:48,606 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:48,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:48,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:48,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:48,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:48,606 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:48,606 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:48,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:48,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:48,607 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:48,607 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:48,607 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:48,607 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:48,607 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:48,607 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:48,607 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:48,608 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:48,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:48,610 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:48,610 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:48,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:48,610 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:48,610 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:48,682 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:48,683 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:32:48,683 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:48,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:48,683 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:48,683 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:48,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2335 [2022-12-06 07:32:48,683 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-06 07:32:48,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:48,683 INFO L85 PathProgramCache]: Analyzing trace with hash -463324093, now seen corresponding path program 1 times [2022-12-06 07:32:48,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:48,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115714683] [2022-12-06 07:32:48,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:48,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:48,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-06 07:32:48,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:48,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115714683] [2022-12-06 07:32:48,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115714683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:48,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:48,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:48,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014613961] [2022-12-06 07:32:48,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:48,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:48,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:48,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:48,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:48,751 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:48,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:48,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:48,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:48,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:48,791 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:48,792 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:48,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:48,792 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:48,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:48,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:48,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:48,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:48,793 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:48,793 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:48,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:48,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:48,793 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:48,793 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:48,794 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:48,794 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:48,794 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:48,794 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:48,794 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:48,794 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:48,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:48,796 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:48,796 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:48,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:48,796 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:48,796 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:48,871 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:48,872 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:48,872 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:48,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:48,872 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:48,872 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:48,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2336 [2022-12-06 07:32:48,872 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-06 07:32:48,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:48,873 INFO L85 PathProgramCache]: Analyzing trace with hash -432847900, now seen corresponding path program 1 times [2022-12-06 07:32:48,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:48,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705343126] [2022-12-06 07:32:48,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:48,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:48,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-06 07:32:48,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:48,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705343126] [2022-12-06 07:32:48,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705343126] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:48,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:48,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:48,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61959552] [2022-12-06 07:32:48,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:48,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:48,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:48,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:48,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:48,943 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:48,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:48,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:48,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:48,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:48,979 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:48,979 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:48,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:48,979 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:48,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:48,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:48,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:48,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:48,980 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:48,980 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:48,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:48,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:48,981 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:48,981 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:48,981 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:48,981 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:48,981 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:48,981 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:48,981 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:48,981 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:48,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:48,984 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:48,984 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:48,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:48,984 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:48,984 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:49,056 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:49,057 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:32:49,057 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:49,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:49,057 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:49,057 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:49,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2337 [2022-12-06 07:32:49,057 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-06 07:32:49,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:49,057 INFO L85 PathProgramCache]: Analyzing trace with hash -406065791, now seen corresponding path program 1 times [2022-12-06 07:32:49,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:49,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676732734] [2022-12-06 07:32:49,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:49,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:49,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-06 07:32:49,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:49,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676732734] [2022-12-06 07:32:49,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676732734] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:49,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:49,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:49,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513959426] [2022-12-06 07:32:49,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:49,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:49,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:49,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:49,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:49,125 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:49,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:49,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:49,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:49,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:49,161 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:49,161 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:49,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:49,162 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:49,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:49,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:49,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:49,162 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:49,162 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:49,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:49,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:49,163 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:49,163 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:49,163 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:49,163 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:49,163 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:49,163 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:49,163 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:49,163 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:49,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:49,166 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:49,166 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:49,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:49,166 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:49,166 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:49,240 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:49,241 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:49,241 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:49,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:49,241 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:49,242 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:49,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2338 [2022-12-06 07:32:49,242 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-06 07:32:49,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:49,242 INFO L85 PathProgramCache]: Analyzing trace with hash -375589598, now seen corresponding path program 1 times [2022-12-06 07:32:49,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:49,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840391062] [2022-12-06 07:32:49,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:49,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:49,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-06 07:32:49,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:49,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840391062] [2022-12-06 07:32:49,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840391062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:49,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:49,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:49,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236099782] [2022-12-06 07:32:49,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:49,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:49,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:49,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:49,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:49,306 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:49,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:49,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:49,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:49,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:49,349 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:49,349 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:49,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:49,349 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:49,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:49,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:49,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:49,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:49,350 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:49,350 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:49,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:49,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:49,351 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:49,351 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:49,351 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:49,351 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:49,351 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:49,351 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:49,351 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:49,351 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:49,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:49,353 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:49,353 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:49,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:49,354 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:49,354 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:49,427 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:49,428 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:49,428 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:49,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:49,428 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:49,428 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:49,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2339 [2022-12-06 07:32:49,429 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-06 07:32:49,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:49,429 INFO L85 PathProgramCache]: Analyzing trace with hash -348807489, now seen corresponding path program 1 times [2022-12-06 07:32:49,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:49,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247617168] [2022-12-06 07:32:49,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:49,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:49,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-06 07:32:49,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:49,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247617168] [2022-12-06 07:32:49,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247617168] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:49,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:49,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:49,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352816429] [2022-12-06 07:32:49,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:49,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:49,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:49,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:49,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:49,513 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:49,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:49,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:49,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:49,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:49,557 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:49,557 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:49,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:49,558 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:49,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:49,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:49,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:49,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:49,559 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:49,559 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:49,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:49,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:49,560 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:49,560 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:49,560 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:49,560 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:49,560 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:49,560 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:49,561 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:49,561 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:49,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:49,564 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:49,564 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:49,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:49,564 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:49,564 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:49,651 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:49,652 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-06 07:32:49,652 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:49,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:49,652 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:49,652 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:49,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2340 [2022-12-06 07:32:49,652 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-06 07:32:49,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:49,653 INFO L85 PathProgramCache]: Analyzing trace with hash -318331296, now seen corresponding path program 1 times [2022-12-06 07:32:49,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:49,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527869174] [2022-12-06 07:32:49,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:49,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:49,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:49,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:49,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527869174] [2022-12-06 07:32:49,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527869174] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:49,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:49,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:49,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025990782] [2022-12-06 07:32:49,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:49,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:49,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:49,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:49,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:49,718 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:49,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:49,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:49,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:49,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:49,755 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:49,755 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:49,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:49,756 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:49,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:49,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:49,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:49,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:49,756 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:49,756 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:49,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:49,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:49,757 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:49,757 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:49,757 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:49,757 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:49,757 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:49,757 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:49,757 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:49,758 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:49,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:49,760 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:49,760 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:49,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:49,760 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:49,760 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:49,834 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:49,835 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:49,835 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:49,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:49,836 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:49,836 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:49,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2341 [2022-12-06 07:32:49,836 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-06 07:32:49,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:49,836 INFO L85 PathProgramCache]: Analyzing trace with hash -291549187, now seen corresponding path program 1 times [2022-12-06 07:32:49,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:49,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73620713] [2022-12-06 07:32:49,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:49,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:49,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-06 07:32:49,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:49,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73620713] [2022-12-06 07:32:49,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73620713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:49,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:49,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:49,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507524293] [2022-12-06 07:32:49,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:49,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:49,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:49,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:49,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:49,903 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:49,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:49,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:49,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:49,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:49,944 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:49,944 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:49,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:49,945 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:49,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:49,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:49,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:49,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:49,945 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:49,945 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:49,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:49,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:49,946 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:49,946 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:49,946 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:49,946 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:49,946 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:49,946 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:49,947 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:49,947 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:49,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:49,949 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:49,949 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:49,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:49,949 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:49,949 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:50,023 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:50,024 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:50,024 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:50,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:50,024 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:50,024 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:50,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2342 [2022-12-06 07:32:50,024 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-06 07:32:50,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:50,024 INFO L85 PathProgramCache]: Analyzing trace with hash -261072994, now seen corresponding path program 1 times [2022-12-06 07:32:50,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:50,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809632861] [2022-12-06 07:32:50,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:50,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:50,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-06 07:32:50,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:50,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809632861] [2022-12-06 07:32:50,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809632861] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:50,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:50,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:50,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947916382] [2022-12-06 07:32:50,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:50,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:50,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:50,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:50,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:50,089 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:50,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:50,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:50,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:50,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:50,126 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:50,126 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:50,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:50,126 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:50,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:50,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:50,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:50,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:50,127 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:50,127 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:50,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:50,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:50,128 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:50,128 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:50,128 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:50,128 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:50,128 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:50,128 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:50,128 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:50,128 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:50,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:50,130 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:50,130 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:50,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:50,131 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:50,131 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:50,206 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:50,207 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:50,207 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:50,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:50,207 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:50,207 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:50,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2343 [2022-12-06 07:32:50,207 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-06 07:32:50,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:50,207 INFO L85 PathProgramCache]: Analyzing trace with hash -234290885, now seen corresponding path program 1 times [2022-12-06 07:32:50,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:50,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699548970] [2022-12-06 07:32:50,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:50,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:50,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-06 07:32:50,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:50,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699548970] [2022-12-06 07:32:50,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699548970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:50,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:50,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:50,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37928919] [2022-12-06 07:32:50,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:50,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:50,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:50,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:50,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:50,277 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:50,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:50,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:50,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:50,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:50,312 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:50,312 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:50,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 372 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:50,313 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:50,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:50,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:50,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:50,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:50,313 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:50,313 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:50,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:50,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:50,314 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:50,314 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:50,314 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:50,314 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:50,314 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:50,314 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:50,314 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:50,314 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:50,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:50,317 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:50,317 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:50,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:50,317 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:50,317 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:50,391 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:50,392 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:50,392 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:50,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:50,392 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:50,393 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:50,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2344 [2022-12-06 07:32:50,393 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-06 07:32:50,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:50,393 INFO L85 PathProgramCache]: Analyzing trace with hash -203814692, now seen corresponding path program 1 times [2022-12-06 07:32:50,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:50,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389340006] [2022-12-06 07:32:50,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:50,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:50,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-06 07:32:50,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:50,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389340006] [2022-12-06 07:32:50,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389340006] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:50,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:50,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:50,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342573558] [2022-12-06 07:32:50,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:50,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:50,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:50,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:50,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:50,460 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:50,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:50,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:50,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:50,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:50,496 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:50,496 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:50,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:50,497 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:50,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:50,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:50,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:50,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:50,497 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:50,497 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:50,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:50,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:50,498 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:50,498 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:50,498 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:50,498 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:50,498 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:50,498 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:50,499 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:50,499 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:50,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:50,501 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:50,501 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:50,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:50,501 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:50,501 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:50,576 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:50,577 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:50,577 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:50,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:50,577 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:50,577 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:50,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2345 [2022-12-06 07:32:50,577 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-06 07:32:50,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:50,577 INFO L85 PathProgramCache]: Analyzing trace with hash -177032583, now seen corresponding path program 1 times [2022-12-06 07:32:50,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:50,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107771859] [2022-12-06 07:32:50,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:50,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:50,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-06 07:32:50,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:50,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107771859] [2022-12-06 07:32:50,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107771859] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:50,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:50,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:50,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410332410] [2022-12-06 07:32:50,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:50,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:50,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:50,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:50,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:50,647 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:50,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:50,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:50,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:50,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:50,694 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:50,694 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:50,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:50,694 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:50,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:50,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:50,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:50,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:50,695 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:50,695 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:50,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:50,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:50,696 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:50,696 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:50,696 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:50,696 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:50,696 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:50,696 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:50,696 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:50,696 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:50,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:50,698 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:50,698 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:50,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:50,699 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:50,699 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:50,772 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:50,773 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:50,773 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:50,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:50,773 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:50,773 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:50,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2346 [2022-12-06 07:32:50,773 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-06 07:32:50,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:50,773 INFO L85 PathProgramCache]: Analyzing trace with hash -146556390, now seen corresponding path program 1 times [2022-12-06 07:32:50,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:50,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265666129] [2022-12-06 07:32:50,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:50,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:50,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:50,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:50,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265666129] [2022-12-06 07:32:50,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265666129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:50,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:50,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:50,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244003524] [2022-12-06 07:32:50,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:50,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:50,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:50,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:50,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:50,836 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:50,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:50,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:50,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:50,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:50,878 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:50,878 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:50,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:50,878 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:50,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:50,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:50,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:50,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:50,879 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:50,879 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:50,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:50,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:50,879 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:50,880 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:50,880 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:50,880 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:50,880 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:50,880 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:50,880 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:50,880 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:50,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:50,882 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:50,882 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:50,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:50,883 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:50,883 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:50,957 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:50,958 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:50,958 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:50,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:50,958 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:50,959 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:50,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2347 [2022-12-06 07:32:50,959 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-06 07:32:50,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:50,959 INFO L85 PathProgramCache]: Analyzing trace with hash -119774281, now seen corresponding path program 1 times [2022-12-06 07:32:50,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:50,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860709804] [2022-12-06 07:32:50,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:50,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:51,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-06 07:32:51,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:51,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860709804] [2022-12-06 07:32:51,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860709804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:51,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:51,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:51,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717893156] [2022-12-06 07:32:51,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:51,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:51,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:51,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:51,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:51,030 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:51,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:51,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:51,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:51,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:51,072 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:51,073 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:51,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:51,073 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:51,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:51,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:51,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:51,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:51,074 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:51,074 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:51,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:51,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:51,074 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:51,074 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:51,075 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:51,075 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:51,075 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:51,075 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:51,075 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:51,075 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:51,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:51,077 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:51,077 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:51,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:51,077 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:51,077 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:51,151 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:51,152 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:51,152 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:51,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:51,152 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:51,152 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:51,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2348 [2022-12-06 07:32:51,152 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-06 07:32:51,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:51,153 INFO L85 PathProgramCache]: Analyzing trace with hash -89298088, now seen corresponding path program 1 times [2022-12-06 07:32:51,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:51,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686987898] [2022-12-06 07:32:51,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:51,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:51,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-06 07:32:51,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:51,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686987898] [2022-12-06 07:32:51,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686987898] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:51,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:51,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:51,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71166159] [2022-12-06 07:32:51,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:51,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:51,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:51,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:51,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:51,220 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:51,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:51,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:51,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:51,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:51,262 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:51,262 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:51,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:51,263 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:51,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:51,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:51,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:51,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:51,263 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:51,263 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:51,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:51,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:51,264 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:51,264 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:51,264 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:51,264 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:51,264 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:51,264 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:51,264 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:51,264 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:51,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:51,266 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:51,267 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:51,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:51,267 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:51,267 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:51,341 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:51,342 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:51,342 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:51,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:51,342 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:51,342 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:51,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2349 [2022-12-06 07:32:51,342 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-06 07:32:51,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:51,343 INFO L85 PathProgramCache]: Analyzing trace with hash -62515979, now seen corresponding path program 1 times [2022-12-06 07:32:51,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:51,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383328173] [2022-12-06 07:32:51,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:51,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:51,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-06 07:32:51,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:51,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383328173] [2022-12-06 07:32:51,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383328173] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:51,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:51,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:51,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22001892] [2022-12-06 07:32:51,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:51,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:51,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:51,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:51,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:51,411 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:51,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:51,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:51,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:51,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:51,447 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:51,447 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:51,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:51,448 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:51,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:51,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:51,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:51,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:51,448 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:51,448 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:51,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:51,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:51,449 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:51,449 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:51,449 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:51,449 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:51,449 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:51,450 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:51,450 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:51,450 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:51,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:51,452 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:51,452 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:51,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:51,452 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:51,452 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:51,528 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:51,529 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:32:51,529 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:51,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:51,529 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:51,529 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:51,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2350 [2022-12-06 07:32:51,530 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-06 07:32:51,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:51,530 INFO L85 PathProgramCache]: Analyzing trace with hash -32039786, now seen corresponding path program 1 times [2022-12-06 07:32:51,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:51,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286886394] [2022-12-06 07:32:51,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:51,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:51,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-06 07:32:51,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:51,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286886394] [2022-12-06 07:32:51,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286886394] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:51,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:51,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:51,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121447770] [2022-12-06 07:32:51,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:51,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:51,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:51,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:51,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:51,593 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:51,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:51,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:51,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:51,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:51,636 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:51,636 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:51,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:51,636 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:51,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:51,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:51,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:51,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:51,637 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:51,637 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:51,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:51,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:51,638 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:51,638 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:51,638 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:51,638 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:51,638 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:51,638 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:51,638 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:51,638 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:51,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:51,640 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:51,640 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:51,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:51,641 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:51,641 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:51,716 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:51,717 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:51,717 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:51,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:51,717 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:51,717 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:51,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2351 [2022-12-06 07:32:51,717 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-06 07:32:51,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:51,717 INFO L85 PathProgramCache]: Analyzing trace with hash -5257677, now seen corresponding path program 1 times [2022-12-06 07:32:51,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:51,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357431284] [2022-12-06 07:32:51,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:51,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:51,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-06 07:32:51,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:51,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357431284] [2022-12-06 07:32:51,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357431284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:51,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:51,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:51,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465141700] [2022-12-06 07:32:51,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:51,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:51,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:51,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:51,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:51,800 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:51,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:51,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:51,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:51,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:51,842 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:51,842 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:51,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:51,842 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:51,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:51,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:51,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:51,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:51,843 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:51,843 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:51,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:51,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:51,844 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:51,844 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:51,844 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:51,844 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:51,844 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:51,844 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:51,844 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:51,844 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:51,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:51,846 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:51,846 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:51,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:51,847 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:51,847 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:51,920 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:51,921 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:51,921 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:51,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:51,921 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:51,921 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:51,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2352 [2022-12-06 07:32:51,921 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-06 07:32:51,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:51,921 INFO L85 PathProgramCache]: Analyzing trace with hash 25218516, now seen corresponding path program 1 times [2022-12-06 07:32:51,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:51,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865583892] [2022-12-06 07:32:51,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:51,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32: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-06 07:32:51,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:51,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865583892] [2022-12-06 07:32:51,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865583892] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:51,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:51,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:51,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910167989] [2022-12-06 07:32:51,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:51,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:51,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:51,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:51,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:51,987 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:51,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:51,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:51,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:51,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:52,023 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:52,024 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:52,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:52,024 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:52,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:52,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:52,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:52,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:52,025 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:52,025 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:52,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:52,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:52,025 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:52,025 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:52,026 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:52,026 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:52,026 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:52,026 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:52,026 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:52,026 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:52,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:52,028 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:52,028 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:52,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:52,028 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:52,028 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:52,103 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:52,104 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:52,104 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:52,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:52,104 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:52,104 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:52,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2353 [2022-12-06 07:32:52,104 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-06 07:32:52,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:52,105 INFO L85 PathProgramCache]: Analyzing trace with hash 52000625, now seen corresponding path program 1 times [2022-12-06 07:32:52,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:52,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609254393] [2022-12-06 07:32:52,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:52,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:52,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-06 07:32:52,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:52,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609254393] [2022-12-06 07:32:52,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609254393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:52,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:52,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:52,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638770929] [2022-12-06 07:32:52,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:52,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:52,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:52,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:52,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:52,173 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:52,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:52,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:52,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:52,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:52,212 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:52,213 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:52,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:52,213 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:52,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:52,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:52,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:52,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:52,214 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:52,214 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:52,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:52,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:52,214 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:52,214 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:52,215 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:52,215 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:52,215 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:52,215 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:52,215 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:52,215 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:52,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:52,217 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:52,217 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:52,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:52,217 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:52,218 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:52,290 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:52,291 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:32:52,291 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:52,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:52,291 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:52,291 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:52,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2354 [2022-12-06 07:32:52,292 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-06 07:32:52,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:52,292 INFO L85 PathProgramCache]: Analyzing trace with hash 82476818, now seen corresponding path program 1 times [2022-12-06 07:32:52,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:52,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770598252] [2022-12-06 07:32:52,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:52,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:52,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-06 07:32:52,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:52,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770598252] [2022-12-06 07:32:52,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770598252] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:52,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:52,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:52,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990461389] [2022-12-06 07:32:52,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:52,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:52,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:52,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:52,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:52,358 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:52,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:52,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:52,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:52,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:52,395 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:52,395 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:52,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:52,395 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:52,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:52,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:52,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:52,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:52,396 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:52,396 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:52,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:52,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:52,397 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:52,397 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:52,397 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:52,397 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:52,397 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:52,397 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:52,397 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:52,397 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:52,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:52,400 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:52,400 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:52,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:52,400 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:52,400 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:52,474 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:52,475 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:52,475 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:52,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:52,475 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:52,475 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:52,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2355 [2022-12-06 07:32:52,475 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-06 07:32:52,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:52,476 INFO L85 PathProgramCache]: Analyzing trace with hash 109258927, now seen corresponding path program 1 times [2022-12-06 07:32:52,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:52,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839221613] [2022-12-06 07:32:52,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:52,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:52,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:52,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-06 07:32:52,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:52,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839221613] [2022-12-06 07:32:52,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839221613] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:52,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:52,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:52,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120532866] [2022-12-06 07:32:52,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:52,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:52,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:52,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:52,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:52,548 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:52,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:52,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:52,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:52,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:52,589 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:52,589 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:52,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:52,590 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:52,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:52,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:52,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:52,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:52,590 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:52,591 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:52,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:52,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:52,591 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:52,591 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:52,591 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:52,592 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:52,592 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:52,592 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:52,592 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:52,592 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:52,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:52,594 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:52,594 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:52,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:52,594 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:52,594 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:52,669 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:52,670 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:52,670 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:52,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:52,670 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:52,670 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:52,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2356 [2022-12-06 07:32:52,670 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-06 07:32:52,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:52,671 INFO L85 PathProgramCache]: Analyzing trace with hash 139735120, now seen corresponding path program 1 times [2022-12-06 07:32:52,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:52,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079241413] [2022-12-06 07:32:52,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:52,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:52,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-06 07:32:52,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:52,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079241413] [2022-12-06 07:32:52,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079241413] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:52,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:52,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:52,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326518873] [2022-12-06 07:32:52,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:52,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:52,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:52,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:52,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:52,735 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:52,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:52,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:52,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:52,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:52,776 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:52,776 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:52,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 351 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:52,776 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:52,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:52,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:52,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:52,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:52,777 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:52,777 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:52,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:52,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:52,777 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:52,778 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:52,778 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:52,778 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:52,778 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:52,778 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:52,778 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:52,778 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:52,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:52,780 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:52,780 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:52,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:52,781 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:52,781 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:52,854 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:52,854 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:32:52,854 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:52,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:52,855 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:52,855 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:52,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2357 [2022-12-06 07:32:52,855 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-06 07:32:52,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:52,855 INFO L85 PathProgramCache]: Analyzing trace with hash 166517229, now seen corresponding path program 1 times [2022-12-06 07:32:52,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:52,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951336615] [2022-12-06 07:32:52,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:52,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:52,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-06 07:32:52,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:52,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951336615] [2022-12-06 07:32:52,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951336615] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:52,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:52,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:52,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047744590] [2022-12-06 07:32:52,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:52,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:52,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:52,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:52,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:52,936 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:52,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:52,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:52,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:52,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:52,976 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:52,977 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:52,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:52,977 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:52,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:52,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:52,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:52,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:52,978 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:52,978 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:52,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:52,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:52,978 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:52,978 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:52,979 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:52,979 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:52,979 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:52,979 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:52,979 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:52,979 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:52,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:52,981 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:52,981 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:52,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:52,981 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:52,982 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:53,055 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:53,056 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:53,056 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:53,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:53,056 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:53,056 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:53,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2358 [2022-12-06 07:32:53,056 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-06 07:32:53,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:53,057 INFO L85 PathProgramCache]: Analyzing trace with hash 196993422, now seen corresponding path program 1 times [2022-12-06 07:32:53,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:53,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632529173] [2022-12-06 07:32:53,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:53,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:53,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-06 07:32:53,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:53,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632529173] [2022-12-06 07:32:53,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632529173] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:53,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:53,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:53,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448035352] [2022-12-06 07:32:53,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:53,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:53,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:53,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:53,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:53,121 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:53,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:53,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:53,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:53,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:53,165 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:53,165 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:53,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:53,166 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:53,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:53,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:53,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:53,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:53,166 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:53,166 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:53,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:53,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:53,167 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:53,167 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:53,167 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:53,167 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:53,167 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:53,167 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:53,167 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:53,168 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:53,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:53,170 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:53,170 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:53,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:53,170 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:53,170 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:53,245 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:53,246 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:53,247 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:53,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:53,247 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:53,247 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:53,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2359 [2022-12-06 07:32:53,247 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-06 07:32:53,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:53,247 INFO L85 PathProgramCache]: Analyzing trace with hash 223775531, now seen corresponding path program 1 times [2022-12-06 07:32:53,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:53,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848360439] [2022-12-06 07:32:53,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:53,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:53,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-06 07:32:53,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:53,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848360439] [2022-12-06 07:32:53,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848360439] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:53,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:53,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:53,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880438273] [2022-12-06 07:32:53,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:53,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:53,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:53,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:53,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:53,314 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:53,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:53,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:53,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:53,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:53,355 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:53,355 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:53,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:53,356 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:53,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:53,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:53,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:53,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:53,356 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:53,356 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:53,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:53,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:53,357 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:53,357 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:53,357 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:53,357 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:53,357 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:53,358 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:53,358 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:53,358 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:53,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:53,360 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:53,360 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:53,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:53,360 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:53,360 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:53,434 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:53,435 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:53,435 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:53,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:53,435 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:53,436 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:53,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2360 [2022-12-06 07:32:53,436 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-06 07:32:53,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:53,436 INFO L85 PathProgramCache]: Analyzing trace with hash 254251724, now seen corresponding path program 1 times [2022-12-06 07:32:53,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:53,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070510163] [2022-12-06 07:32:53,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:53,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:53,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-06 07:32:53,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:53,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070510163] [2022-12-06 07:32:53,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070510163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:53,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:53,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:53,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678992651] [2022-12-06 07:32:53,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:53,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:53,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:53,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:53,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:53,506 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:53,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:53,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:53,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:53,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:53,548 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:53,548 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:53,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:53,548 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:53,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:53,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:53,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:53,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:53,549 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:53,549 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:53,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:53,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:53,550 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:53,550 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:53,550 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:53,550 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:53,550 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:53,550 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:53,550 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:53,550 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:53,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:53,552 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:53,552 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:53,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:53,553 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:53,553 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:53,625 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:53,626 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:32:53,626 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:53,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:53,627 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:53,627 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:53,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2361 [2022-12-06 07:32:53,627 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-06 07:32:53,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:53,627 INFO L85 PathProgramCache]: Analyzing trace with hash 281033833, now seen corresponding path program 1 times [2022-12-06 07:32:53,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:53,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563612615] [2022-12-06 07:32:53,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:53,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:53,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-06 07:32:53,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:53,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563612615] [2022-12-06 07:32:53,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563612615] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:53,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:53,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:53,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339722586] [2022-12-06 07:32:53,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:53,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:53,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:53,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:53,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:53,697 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:53,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:53,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:53,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:53,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:53,731 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:53,732 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:53,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 372 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:53,732 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:53,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:53,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:53,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:53,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:53,733 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:53,733 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:53,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:53,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:53,733 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:53,733 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:53,733 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:53,734 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:53,734 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:53,734 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:53,734 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:53,734 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:53,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:53,736 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:53,736 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:53,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:53,736 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:53,736 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:53,810 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:53,811 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:53,811 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:53,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:53,811 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:53,811 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:53,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2362 [2022-12-06 07:32:53,812 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-06 07:32:53,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:53,812 INFO L85 PathProgramCache]: Analyzing trace with hash 311510026, now seen corresponding path program 1 times [2022-12-06 07:32:53,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:53,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323071813] [2022-12-06 07:32:53,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:53,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:53,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-06 07:32:53,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:53,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323071813] [2022-12-06 07:32:53,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323071813] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:53,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:53,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:53,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660660410] [2022-12-06 07:32:53,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:53,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:53,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:53,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:53,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:53,879 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:53,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:53,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:53,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:53,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:53,921 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:53,921 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:53,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:53,922 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:53,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:53,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:53,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:53,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:53,922 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:53,922 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:53,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:53,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:53,923 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:53,923 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:53,923 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:53,923 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:53,923 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:53,923 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:53,924 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:53,924 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:53,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:53,926 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:53,926 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:53,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:53,926 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:53,926 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:54,013 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:54,014 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-06 07:32:54,014 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:54,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:54,014 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:54,014 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:54,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2363 [2022-12-06 07:32:54,014 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-06 07:32:54,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:54,014 INFO L85 PathProgramCache]: Analyzing trace with hash 338292135, now seen corresponding path program 1 times [2022-12-06 07:32:54,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:54,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848932681] [2022-12-06 07:32:54,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:54,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:54,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:54,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:54,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848932681] [2022-12-06 07:32:54,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848932681] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:54,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:54,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:54,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324698723] [2022-12-06 07:32:54,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:54,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:54,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:54,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:54,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:54,081 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:54,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:54,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:54,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:54,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:54,123 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:54,123 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:54,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:54,124 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:54,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:54,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:54,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:54,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:54,124 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:54,124 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:54,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:54,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:54,125 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:54,125 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:54,125 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:54,125 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:54,125 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:54,125 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:54,125 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:54,125 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:54,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:54,128 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:54,128 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:54,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:54,128 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:54,128 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:54,203 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:54,204 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:54,204 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:54,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:54,204 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:54,204 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:54,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2364 [2022-12-06 07:32:54,204 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-06 07:32:54,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:54,205 INFO L85 PathProgramCache]: Analyzing trace with hash 368768328, now seen corresponding path program 1 times [2022-12-06 07:32:54,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:54,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387125565] [2022-12-06 07:32:54,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:54,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:54,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-06 07:32:54,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:54,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387125565] [2022-12-06 07:32:54,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387125565] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:54,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:54,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:54,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636021911] [2022-12-06 07:32:54,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:54,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:54,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:54,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:54,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:54,269 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:54,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:54,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:54,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:54,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:54,305 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:54,305 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:54,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:54,306 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:54,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:54,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:54,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:54,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:54,306 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:54,306 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:54,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:54,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:54,307 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:54,307 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:54,307 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:54,307 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:54,307 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:54,308 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:54,308 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:54,308 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:54,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:54,310 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:54,310 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:54,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:54,310 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:54,310 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:54,385 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:54,386 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:54,386 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:54,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:54,386 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:54,386 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:54,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2365 [2022-12-06 07:32:54,386 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-06 07:32:54,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:54,387 INFO L85 PathProgramCache]: Analyzing trace with hash 395550437, now seen corresponding path program 1 times [2022-12-06 07:32:54,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:54,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296859292] [2022-12-06 07:32:54,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:54,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:54,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-06 07:32:54,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:54,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296859292] [2022-12-06 07:32:54,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296859292] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:54,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:54,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:54,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467454340] [2022-12-06 07:32:54,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:54,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:54,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:54,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:54,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:54,454 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:54,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:54,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:54,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:54,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:54,489 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:54,490 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:54,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:54,490 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:54,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:54,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:54,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:54,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:54,491 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:54,491 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:54,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:54,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:54,491 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:54,491 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:54,492 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:54,492 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:54,492 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:54,492 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:54,492 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:54,492 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:54,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:54,494 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:54,494 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:54,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:54,494 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:54,494 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:54,568 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:54,569 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:54,569 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:54,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:54,569 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:54,569 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:54,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2366 [2022-12-06 07:32:54,569 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-06 07:32:54,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:54,570 INFO L85 PathProgramCache]: Analyzing trace with hash 426026630, now seen corresponding path program 1 times [2022-12-06 07:32:54,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:54,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893859502] [2022-12-06 07:32:54,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:54,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:54,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-06 07:32:54,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:54,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893859502] [2022-12-06 07:32:54,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893859502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:54,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:54,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:54,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130853055] [2022-12-06 07:32:54,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:54,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:54,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:54,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:54,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:54,635 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:54,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:54,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:54,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:54,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:54,677 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:54,677 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:54,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:54,678 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:54,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:54,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:54,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:54,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:54,679 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:54,679 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:54,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:54,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:54,679 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:54,679 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:54,680 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:54,680 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:54,680 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:54,680 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:54,680 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:54,680 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:54,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:54,682 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:54,682 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:54,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:54,683 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:54,683 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:54,757 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:54,758 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:54,758 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:54,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:54,758 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:54,758 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:54,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2367 [2022-12-06 07:32:54,758 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-06 07:32:54,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:54,758 INFO L85 PathProgramCache]: Analyzing trace with hash 452808739, now seen corresponding path program 1 times [2022-12-06 07:32:54,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:54,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327294072] [2022-12-06 07:32:54,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:54,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:54,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-06 07:32:54,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:54,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327294072] [2022-12-06 07:32:54,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327294072] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:54,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:54,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:54,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251145611] [2022-12-06 07:32:54,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:54,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:54,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:54,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:54,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:54,827 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:54,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:54,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:54,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:54,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:54,863 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:54,863 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:54,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:54,863 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:54,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:54,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:54,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:54,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:54,864 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:54,864 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:54,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:54,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:54,865 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:54,865 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:54,865 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:54,865 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:54,865 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:54,865 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:54,865 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:54,865 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:54,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:54,868 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:54,868 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:54,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:54,868 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:54,868 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:54,941 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:54,942 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:54,942 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:54,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:54,942 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:54,942 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:54,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2368 [2022-12-06 07:32:54,942 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-06 07:32:54,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:54,943 INFO L85 PathProgramCache]: Analyzing trace with hash 483284932, now seen corresponding path program 1 times [2022-12-06 07:32:54,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:54,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467325529] [2022-12-06 07:32:54,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:54,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:55,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-06 07:32:55,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:55,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467325529] [2022-12-06 07:32:55,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467325529] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:55,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:55,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:55,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886156808] [2022-12-06 07:32:55,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:55,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:55,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:55,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:55,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:55,008 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:55,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:55,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:55,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:55,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:55,060 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:55,060 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:55,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:55,060 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:55,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:55,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:55,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:55,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:55,061 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:55,061 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:55,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:55,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:55,062 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:55,062 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:55,062 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:55,062 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:55,062 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:55,062 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:55,062 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:55,062 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:55,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:55,064 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:55,064 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:55,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:55,065 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:55,065 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:55,139 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:55,140 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:55,140 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:55,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:55,140 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:55,140 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:55,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2369 [2022-12-06 07:32:55,140 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-06 07:32:55,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:55,141 INFO L85 PathProgramCache]: Analyzing trace with hash 510067041, now seen corresponding path program 1 times [2022-12-06 07:32:55,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:55,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227069998] [2022-12-06 07:32:55,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:55,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:55,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:55,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:55,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227069998] [2022-12-06 07:32:55,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227069998] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:55,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:55,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:55,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394051465] [2022-12-06 07:32:55,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:55,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:55,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:55,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:55,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:55,208 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:55,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:55,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:55,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:55,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:55,248 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:55,248 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:55,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:55,249 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:55,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:55,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:55,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:55,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:55,249 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:55,249 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:55,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:55,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:55,250 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:55,250 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:55,250 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:55,250 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:55,250 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:55,251 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:55,251 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:55,251 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:55,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:55,253 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:55,253 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:55,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:55,253 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:55,253 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:55,342 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:55,343 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-06 07:32:55,343 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:55,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:55,343 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:55,343 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:55,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2370 [2022-12-06 07:32:55,343 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-06 07:32:55,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:55,343 INFO L85 PathProgramCache]: Analyzing trace with hash 540543234, now seen corresponding path program 1 times [2022-12-06 07:32:55,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:55,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956513086] [2022-12-06 07:32:55,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:55,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:55,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-06 07:32:55,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:55,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956513086] [2022-12-06 07:32:55,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956513086] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:55,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:55,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:55,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627365576] [2022-12-06 07:32:55,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:55,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:55,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:55,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:55,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:55,410 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:55,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:55,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:55,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:55,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:55,447 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:55,447 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:32:55,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:55,448 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:55,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:55,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:55,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:55,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:55,449 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:55,449 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:55,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:55,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:55,449 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:55,449 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:55,449 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:55,450 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:55,450 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:55,450 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:55,450 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:55,450 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:55,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:55,452 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:55,452 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:55,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:55,453 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:55,453 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:55,526 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:55,527 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:55,527 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:55,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:55,528 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:55,528 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:55,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2371 [2022-12-06 07:32:55,528 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-06 07:32:55,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:55,528 INFO L85 PathProgramCache]: Analyzing trace with hash 567325343, now seen corresponding path program 1 times [2022-12-06 07:32:55,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:55,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137814748] [2022-12-06 07:32:55,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:55,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:55,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-06 07:32:55,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:55,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137814748] [2022-12-06 07:32:55,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137814748] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:55,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:55,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:55,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692991117] [2022-12-06 07:32:55,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:55,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:55,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:55,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:55,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:55,597 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:55,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:55,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:55,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:55,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:55,632 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:55,633 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:55,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:55,633 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:55,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:55,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:55,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:55,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:55,634 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:55,634 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:55,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:55,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:55,634 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:55,635 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:55,635 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:55,635 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:55,635 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:55,635 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:55,635 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:55,635 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:55,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:55,637 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:55,637 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:55,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:55,638 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:55,638 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:55,711 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:55,711 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:32:55,712 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:55,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:55,712 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:55,712 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:55,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2372 [2022-12-06 07:32:55,712 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-06 07:32:55,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:55,712 INFO L85 PathProgramCache]: Analyzing trace with hash 597801536, now seen corresponding path program 1 times [2022-12-06 07:32:55,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:55,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681067014] [2022-12-06 07:32:55,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:55,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:55,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-06 07:32:55,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:55,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681067014] [2022-12-06 07:32:55,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681067014] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:55,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:55,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:55,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341074054] [2022-12-06 07:32:55,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:55,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:55,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:55,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:55,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:55,777 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:55,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:55,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:55,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:55,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:55,819 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:55,819 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:55,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:55,819 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:55,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:55,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:55,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:55,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:55,820 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:55,820 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:55,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:55,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:55,821 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:55,821 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:55,821 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:55,821 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:55,821 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:55,821 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:55,821 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:55,821 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:55,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:55,823 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:55,823 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:55,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:55,824 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:55,824 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:55,897 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:55,898 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:55,898 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:55,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:55,898 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:55,898 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:55,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2373 [2022-12-06 07:32:55,898 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-06 07:32:55,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:55,898 INFO L85 PathProgramCache]: Analyzing trace with hash 624583645, now seen corresponding path program 1 times [2022-12-06 07:32:55,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:55,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504540377] [2022-12-06 07:32:55,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:55,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32: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-06 07:32:55,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:55,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504540377] [2022-12-06 07:32:55,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504540377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:55,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:55,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:55,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916191086] [2022-12-06 07:32:55,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:55,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:55,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:55,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:55,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:55,970 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:55,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:55,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:55,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:55,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:56,006 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:56,006 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:56,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:56,006 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:56,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:56,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:56,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:56,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:56,007 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:56,007 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:56,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:56,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:56,008 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:56,008 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:56,008 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:56,008 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:56,008 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:56,008 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:56,008 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:56,008 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:56,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:56,010 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:56,010 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:56,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:56,011 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:56,011 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:56,085 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:56,086 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:56,086 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:56,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:56,086 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:56,086 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:56,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2374 [2022-12-06 07:32:56,086 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-06 07:32:56,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:56,086 INFO L85 PathProgramCache]: Analyzing trace with hash 655059838, now seen corresponding path program 1 times [2022-12-06 07:32:56,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:56,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628613780] [2022-12-06 07:32:56,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:56,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:56,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-06 07:32:56,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:56,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628613780] [2022-12-06 07:32:56,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628613780] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:56,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:56,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:56,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195479728] [2022-12-06 07:32:56,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:56,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:56,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:56,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:56,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:56,168 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:56,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:56,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:56,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:56,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:56,212 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:56,212 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:56,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:56,213 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:56,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:56,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:56,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:56,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:56,214 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:56,214 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:56,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:56,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:56,214 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:56,214 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:56,215 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:56,215 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:56,215 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:56,215 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:56,215 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:56,215 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:56,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:56,217 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:56,217 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:56,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:56,218 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:56,218 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:56,292 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:56,293 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:56,293 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:56,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:56,293 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:56,293 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:56,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2375 [2022-12-06 07:32:56,293 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-06 07:32:56,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:56,293 INFO L85 PathProgramCache]: Analyzing trace with hash 681841947, now seen corresponding path program 1 times [2022-12-06 07:32:56,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:56,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330183811] [2022-12-06 07:32:56,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:56,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:56,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-06 07:32:56,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:56,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330183811] [2022-12-06 07:32:56,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330183811] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:56,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:56,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:56,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298916060] [2022-12-06 07:32:56,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:56,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:56,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:56,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:56,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:56,362 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:56,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:56,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:56,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:56,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:56,397 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:56,398 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:56,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:56,398 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:56,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:56,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:56,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:56,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:56,399 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:56,399 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:56,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:56,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:56,399 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:56,400 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:56,400 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:56,400 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:56,400 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:56,400 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:56,400 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:56,400 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:56,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:56,402 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:56,402 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:56,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:56,403 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:56,403 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:56,476 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:56,477 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:56,477 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:56,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:56,477 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:56,477 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:56,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2376 [2022-12-06 07:32:56,478 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-06 07:32:56,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:56,478 INFO L85 PathProgramCache]: Analyzing trace with hash 712318140, now seen corresponding path program 1 times [2022-12-06 07:32:56,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:56,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847157789] [2022-12-06 07:32:56,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:56,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:56,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-06 07:32:56,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:56,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847157789] [2022-12-06 07:32:56,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847157789] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:56,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:56,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:56,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92407216] [2022-12-06 07:32:56,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:56,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:56,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:56,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:56,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:56,542 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:56,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:56,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:56,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:56,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:56,577 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:56,577 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:56,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:56,578 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:56,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:56,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:56,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:56,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:56,578 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:56,578 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:56,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:56,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:56,579 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:56,579 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:56,579 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:56,579 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:56,579 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:56,579 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:56,579 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:56,579 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:56,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:56,582 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:56,582 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:56,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:56,582 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:56,582 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:56,662 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:56,663 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:32:56,663 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:56,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:56,663 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:56,663 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:56,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2377 [2022-12-06 07:32:56,664 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-06 07:32:56,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:56,664 INFO L85 PathProgramCache]: Analyzing trace with hash 739100249, now seen corresponding path program 1 times [2022-12-06 07:32:56,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:56,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824268508] [2022-12-06 07:32:56,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:56,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:56,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:56,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-06 07:32:56,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:56,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824268508] [2022-12-06 07:32:56,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824268508] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:56,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:56,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:56,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843301054] [2022-12-06 07:32:56,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:56,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:56,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:56,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:56,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:56,731 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:56,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:56,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:56,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:56,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:56,772 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:56,772 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:56,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:56,773 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:56,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:56,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:56,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:56,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:56,773 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:56,773 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:56,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:56,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:56,774 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:56,774 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:56,774 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:56,774 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:56,774 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:56,774 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:56,774 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:56,774 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:56,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:56,776 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:56,777 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:56,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:56,777 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:56,777 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:56,851 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:56,852 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:56,852 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:56,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:56,852 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:56,852 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:56,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2378 [2022-12-06 07:32:56,852 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-06 07:32:56,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:56,852 INFO L85 PathProgramCache]: Analyzing trace with hash 769576442, now seen corresponding path program 1 times [2022-12-06 07:32:56,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:56,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749500713] [2022-12-06 07:32:56,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:56,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:56,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-06 07:32:56,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:56,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749500713] [2022-12-06 07:32:56,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749500713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:56,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:56,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:56,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928135592] [2022-12-06 07:32:56,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:56,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:56,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:56,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:56,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:56,927 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:56,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:56,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:56,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:56,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:56,965 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:56,965 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:56,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:56,966 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:56,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:56,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:56,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:56,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:56,966 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:56,966 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:56,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:56,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:56,967 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:56,967 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:56,967 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:56,967 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:56,967 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:56,967 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:56,968 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:56,968 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:56,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:56,970 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:56,970 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:56,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:56,970 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:56,970 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:57,046 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:57,047 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:32:57,047 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:57,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:57,047 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:57,047 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:57,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2379 [2022-12-06 07:32:57,047 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-06 07:32:57,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:57,047 INFO L85 PathProgramCache]: Analyzing trace with hash 796358551, now seen corresponding path program 1 times [2022-12-06 07:32:57,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:57,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504656057] [2022-12-06 07:32:57,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:57,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:57,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-06 07:32:57,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:57,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504656057] [2022-12-06 07:32:57,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504656057] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:57,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:57,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:57,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782934274] [2022-12-06 07:32:57,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:57,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:57,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:57,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:57,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:57,116 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:57,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:57,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:57,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:57,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:57,151 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:57,152 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:57,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:57,152 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:57,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:57,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:57,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:57,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:57,153 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:57,153 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:57,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:57,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:57,153 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:57,153 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:57,154 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:57,154 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:57,154 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:57,154 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:57,154 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:57,154 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:57,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:57,156 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:57,156 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:57,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:57,156 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:57,156 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:57,230 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:57,230 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:32:57,231 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:57,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:57,231 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:57,231 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:57,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2380 [2022-12-06 07:32:57,231 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-06 07:32:57,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:57,231 INFO L85 PathProgramCache]: Analyzing trace with hash 826834744, now seen corresponding path program 1 times [2022-12-06 07:32:57,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:57,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29113454] [2022-12-06 07:32:57,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:57,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:57,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-06 07:32:57,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:57,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29113454] [2022-12-06 07:32:57,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29113454] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:57,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:57,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:57,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250184732] [2022-12-06 07:32:57,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:57,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:57,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:57,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:57,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:57,308 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:57,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:57,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:57,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:57,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:57,344 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:57,345 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:57,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:57,345 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:57,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:57,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:57,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:57,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:57,346 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:57,346 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:57,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:57,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:57,346 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:57,346 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:57,347 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:57,347 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:57,347 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:57,347 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:57,347 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:57,347 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:57,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:57,349 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:57,349 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:57,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:57,349 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:57,349 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:57,421 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:57,422 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:32:57,422 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:57,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:57,422 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:57,422 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:57,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2381 [2022-12-06 07:32:57,422 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-06 07:32:57,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:57,423 INFO L85 PathProgramCache]: Analyzing trace with hash 853616853, now seen corresponding path program 1 times [2022-12-06 07:32:57,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:57,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259855275] [2022-12-06 07:32:57,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:57,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:57,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:57,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:57,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259855275] [2022-12-06 07:32:57,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259855275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:57,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:57,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:57,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329688820] [2022-12-06 07:32:57,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:57,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:57,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:57,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:57,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:57,491 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:57,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:57,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:57,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:57,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:57,526 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:57,526 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:57,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 370 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:57,527 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:57,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:57,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:57,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:57,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:57,527 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:57,527 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:57,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:57,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:57,528 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:57,528 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:57,528 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:57,528 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:57,528 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:57,528 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:57,528 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:57,528 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:57,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:57,530 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:57,531 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:57,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:57,531 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:57,531 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:57,604 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:57,605 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:57,605 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:57,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:57,605 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:57,606 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:57,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2382 [2022-12-06 07:32:57,606 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-06 07:32:57,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:57,606 INFO L85 PathProgramCache]: Analyzing trace with hash 884093046, now seen corresponding path program 1 times [2022-12-06 07:32:57,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:57,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25866414] [2022-12-06 07:32:57,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:57,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:57,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-06 07:32:57,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:57,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25866414] [2022-12-06 07:32:57,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25866414] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:57,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:57,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:57,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535165077] [2022-12-06 07:32:57,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:57,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:57,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:57,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:57,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:57,671 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:57,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:57,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:57,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:57,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:57,708 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:57,708 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:57,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:57,709 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:57,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:57,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:57,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:57,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:57,709 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:57,709 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:57,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:57,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:57,710 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:57,710 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:57,710 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:57,710 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:57,710 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:57,711 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:57,711 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:57,711 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:57,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:57,713 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:57,713 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:57,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:57,713 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:57,713 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:57,789 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:57,790 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:32:57,790 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:57,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:57,790 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:57,790 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:57,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2383 [2022-12-06 07:32:57,790 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-06 07:32:57,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:57,790 INFO L85 PathProgramCache]: Analyzing trace with hash 910875155, now seen corresponding path program 1 times [2022-12-06 07:32:57,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:57,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416856736] [2022-12-06 07:32:57,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:57,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:57,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:57,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:57,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416856736] [2022-12-06 07:32:57,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416856736] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:57,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:57,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:57,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908686747] [2022-12-06 07:32:57,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:57,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:57,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:57,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:57,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:57,859 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:57,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:57,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:57,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:57,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:57,899 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:57,899 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:57,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:57,900 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:57,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:57,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:57,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:57,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:57,900 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:57,900 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:57,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:57,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:57,901 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:57,901 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:57,901 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:57,901 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:57,901 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:57,902 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:57,902 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:57,902 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:57,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:57,904 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:57,904 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:57,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 144 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:57,904 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:57,904 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:57,977 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:57,978 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:57,978 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:57,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:57,978 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:57,978 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:57,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2384 [2022-12-06 07:32:57,978 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-06 07:32:57,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:57,978 INFO L85 PathProgramCache]: Analyzing trace with hash 941351348, now seen corresponding path program 1 times [2022-12-06 07:32:57,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:57,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663343683] [2022-12-06 07:32:57,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:57,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:58,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-06 07:32:58,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:58,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663343683] [2022-12-06 07:32:58,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663343683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:58,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:58,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:58,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122741401] [2022-12-06 07:32:58,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:58,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:58,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:58,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:58,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:58,045 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:58,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:58,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:58,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:58,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:58,087 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:58,087 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:58,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:58,087 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:58,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:58,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:58,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:58,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:58,088 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:58,088 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:58,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:58,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:58,089 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:58,089 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:58,089 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:58,089 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:58,089 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:58,089 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:58,089 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:58,089 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:58,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:58,091 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:58,091 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:58,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:58,092 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:58,092 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:58,165 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:58,166 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:58,166 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:58,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:58,166 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:58,166 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:58,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2385 [2022-12-06 07:32:58,167 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-06 07:32:58,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:58,167 INFO L85 PathProgramCache]: Analyzing trace with hash 968133457, now seen corresponding path program 1 times [2022-12-06 07:32:58,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:58,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256062050] [2022-12-06 07:32:58,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:58,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:58,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-06 07:32:58,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:58,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256062050] [2022-12-06 07:32:58,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256062050] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:58,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:58,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:58,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946685615] [2022-12-06 07:32:58,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:58,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:58,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:58,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:58,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:58,236 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:58,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:58,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:58,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:58,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:58,272 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:58,272 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:58,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:58,272 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:58,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:58,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:58,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:58,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:58,273 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:58,273 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:58,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:58,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:58,274 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:58,274 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:58,274 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:58,274 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:58,274 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:58,274 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:58,274 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:58,275 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:58,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:58,277 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:58,278 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:58,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:58,278 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:58,278 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:58,365 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:58,366 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-06 07:32:58,366 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:58,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:58,367 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:58,367 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:58,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2386 [2022-12-06 07:32:58,367 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-06 07:32:58,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:58,367 INFO L85 PathProgramCache]: Analyzing trace with hash 998609650, now seen corresponding path program 1 times [2022-12-06 07:32:58,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:58,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469677616] [2022-12-06 07:32:58,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:58,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:58,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-06 07:32:58,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:58,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469677616] [2022-12-06 07:32:58,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469677616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:58,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:58,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:58,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136680945] [2022-12-06 07:32:58,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:58,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:58,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:58,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:58,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:58,433 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:58,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:58,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:58,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:58,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:58,476 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:58,476 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:58,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 336 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:58,477 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:58,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:58,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:58,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:58,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:58,478 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:58,478 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:58,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:58,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:58,478 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:58,478 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:58,479 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:58,479 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:58,479 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:58,479 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:58,479 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:58,479 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:58,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:58,481 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:58,481 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:58,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:58,482 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:58,482 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:58,556 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:58,557 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:32:58,557 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:58,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:58,557 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:58,557 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:58,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2387 [2022-12-06 07:32:58,557 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-06 07:32:58,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:58,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1025391759, now seen corresponding path program 1 times [2022-12-06 07:32:58,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:58,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941939500] [2022-12-06 07:32:58,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:58,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:58,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-06 07:32:58,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:58,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941939500] [2022-12-06 07:32:58,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941939500] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:58,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:58,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:58,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314026936] [2022-12-06 07:32:58,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:58,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:58,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:58,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:58,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:58,626 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:58,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:58,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:58,626 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:58,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:58,679 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:58,679 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:58,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:58,679 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:58,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:58,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:58,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:58,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:58,680 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:58,680 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:58,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:58,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:58,681 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:58,681 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:58,681 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:58,681 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:58,681 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:58,681 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:58,681 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:58,681 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:58,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:58,684 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:58,684 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:58,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 145 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:58,684 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:58,684 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:58,759 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:58,760 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:58,760 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:58,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:58,760 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:58,760 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:58,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2388 [2022-12-06 07:32:58,760 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-06 07:32:58,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:58,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1055867952, now seen corresponding path program 1 times [2022-12-06 07:32:58,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:58,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742042039] [2022-12-06 07:32:58,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:58,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:58,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-06 07:32:58,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:58,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742042039] [2022-12-06 07:32:58,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742042039] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:58,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:58,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:58,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119404894] [2022-12-06 07:32:58,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:58,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:58,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:58,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:58,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:58,827 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:58,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:58,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:58,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:58,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:58,863 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:58,863 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:58,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:58,864 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:58,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:58,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:58,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:58,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:58,864 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:58,864 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:58,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:58,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:58,865 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:58,865 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:58,865 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:58,865 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:58,865 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:58,865 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:58,865 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:58,865 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:58,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:58,868 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:58,868 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:58,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:58,868 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:58,868 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:58,944 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:58,945 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:32:58,945 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:58,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:58,945 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:58,945 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:58,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2389 [2022-12-06 07:32:58,945 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-06 07:32:58,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:58,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1082650061, now seen corresponding path program 1 times [2022-12-06 07:32:58,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:58,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764196511] [2022-12-06 07:32:58,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:58,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:59,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-06 07:32:59,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:59,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764196511] [2022-12-06 07:32:59,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764196511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:59,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:59,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:59,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93678240] [2022-12-06 07:32:59,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:59,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:59,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:59,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:59,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:59,013 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:59,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:59,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:59,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:59,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:59,055 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:59,055 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:59,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:59,055 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:59,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:59,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:59,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:59,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:59,056 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:59,056 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:59,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:59,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:59,056 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:59,057 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:59,057 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:59,057 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:59,057 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:59,057 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:59,057 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:59,057 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:59,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:59,059 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:59,059 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:59,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:59,060 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:59,060 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:59,133 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:59,134 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:59,134 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:59,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:59,134 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:59,134 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:59,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2390 [2022-12-06 07:32:59,134 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-06 07:32:59,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:59,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1113126254, now seen corresponding path program 1 times [2022-12-06 07:32:59,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:59,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971357523] [2022-12-06 07:32:59,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:59,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:59,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-06 07:32:59,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:59,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971357523] [2022-12-06 07:32:59,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971357523] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:59,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:59,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:59,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976541422] [2022-12-06 07:32:59,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:59,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:59,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:59,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:59,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:59,202 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:59,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:59,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:59,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:59,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:59,238 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:59,238 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:59,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:59,239 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:59,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:59,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:59,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:59,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:59,239 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:59,239 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:59,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:59,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:59,240 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:59,240 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:59,240 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:59,240 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:59,240 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:59,241 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:59,241 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:59,241 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:59,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:59,243 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:59,243 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:59,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:59,243 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:59,243 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:59,318 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:59,319 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:59,319 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:59,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:59,319 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:59,319 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:59,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2391 [2022-12-06 07:32:59,319 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-06 07:32:59,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:59,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1139908363, now seen corresponding path program 1 times [2022-12-06 07:32:59,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:59,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244804432] [2022-12-06 07:32:59,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:59,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:59,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:59,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:59,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244804432] [2022-12-06 07:32:59,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244804432] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:59,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:59,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:59,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497685115] [2022-12-06 07:32:59,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:59,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:59,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:59,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:59,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:59,401 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:59,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:59,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:59,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:59,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:59,442 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:59,443 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:59,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:59,443 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:59,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:59,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:59,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:59,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:59,444 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:59,444 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:59,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:59,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:59,444 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:59,444 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:59,445 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:59,445 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:59,445 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:59,445 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:59,445 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:59,445 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:59,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:59,447 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:59,447 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:59,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:59,448 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:59,448 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:59,523 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:59,524 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:32:59,524 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:59,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:59,524 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:59,524 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:59,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2392 [2022-12-06 07:32:59,524 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-06 07:32:59,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:59,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1170384556, now seen corresponding path program 1 times [2022-12-06 07:32:59,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:59,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674686262] [2022-12-06 07:32:59,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:59,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:59,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-06 07:32:59,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:59,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674686262] [2022-12-06 07:32:59,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674686262] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:59,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:59,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:59,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516598008] [2022-12-06 07:32:59,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:59,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:59,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:59,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:59,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:59,590 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:59,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:59,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:59,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:59,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:59,631 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:32:59,632 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:32:59,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:32:59,632 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:32:59,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:59,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:59,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:59,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:59,633 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:59,633 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:59,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:59,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:59,633 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:59,633 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:59,634 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:59,634 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:59,634 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:59,634 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:59,634 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:59,634 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:59,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:59,636 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:32:59,636 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:32:59,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:32:59,636 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:59,637 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:32:59,710 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:59,711 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:59,711 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:32:59,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:59,711 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:59,711 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:59,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2393 [2022-12-06 07:32:59,711 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-06 07:32:59,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:59,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1197166665, now seen corresponding path program 1 times [2022-12-06 07:32:59,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:59,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894880721] [2022-12-06 07:32:59,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:59,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:59,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-06 07:32:59,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:59,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894880721] [2022-12-06 07:32:59,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894880721] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:59,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:59,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:59,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564708707] [2022-12-06 07:32:59,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:59,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:59,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:59,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:59,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:59,779 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:59,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:59,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:59,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:59,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:59,820 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:32:59,821 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:32:59,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:32:59,821 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:32:59,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:59,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:59,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:59,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:32:59,821 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:32:59,822 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:32:59,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:32:59,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:59,822 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:59,822 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:32:59,822 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:32:59,823 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:59,823 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:59,823 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:59,823 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:59,823 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:59,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:59,825 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:32:59,825 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:32:59,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:32:59,825 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:32:59,825 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:32:59,899 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:59,900 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:32:59,900 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:32:59,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:59,900 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:59,900 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:59,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2394 [2022-12-06 07:32:59,900 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-06 07:32:59,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:59,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1227642858, now seen corresponding path program 1 times [2022-12-06 07:32:59,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:59,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055597641] [2022-12-06 07:32:59,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:59,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:59,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-06 07:32:59,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:59,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055597641] [2022-12-06 07:32:59,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055597641] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:59,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:59,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:32:59,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665588023] [2022-12-06 07:32:59,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:59,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:59,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:59,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:59,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:59,965 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:32:59,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:59,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:59,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:32:59,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:00,001 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:00,001 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:00,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:00,001 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:00,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:00,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:00,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:00,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:00,002 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:00,002 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:00,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:00,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:00,003 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:00,003 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:00,003 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:00,003 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:00,003 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:00,003 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:00,003 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:00,003 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:00,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:00,005 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:00,006 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:00,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:00,006 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:00,006 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:00,081 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:00,082 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:00,082 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:00,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:00,082 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:00,082 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:00,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2395 [2022-12-06 07:33:00,082 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-06 07:33:00,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:00,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1254424967, now seen corresponding path program 1 times [2022-12-06 07:33:00,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:00,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138758303] [2022-12-06 07:33:00,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:00,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:00,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:00,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-06 07:33:00,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:00,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138758303] [2022-12-06 07:33:00,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138758303] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:00,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:00,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:00,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131215373] [2022-12-06 07:33:00,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:00,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:00,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:00,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:00,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:00,150 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:00,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:00,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:00,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:00,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:00,192 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:00,192 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:00,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:00,193 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:00,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:00,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:00,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:00,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:00,193 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:00,193 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:00,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:00,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:00,194 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:00,194 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:00,194 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:00,194 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:00,194 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:00,195 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:00,195 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:00,195 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:00,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:00,197 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:00,197 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:00,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:00,197 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:00,197 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:00,272 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:00,273 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:00,273 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:00,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:00,273 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:00,273 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:00,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2396 [2022-12-06 07:33:00,274 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-06 07:33:00,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:00,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1284901160, now seen corresponding path program 1 times [2022-12-06 07:33:00,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:00,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150709324] [2022-12-06 07:33:00,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:00,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:00,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:00,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-06 07:33:00,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:00,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150709324] [2022-12-06 07:33:00,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150709324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:00,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:00,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:00,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196950889] [2022-12-06 07:33:00,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:00,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:00,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:00,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:00,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:00,341 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:00,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:00,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:00,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:00,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:00,382 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:00,382 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:00,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:00,383 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:00,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:00,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:00,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:00,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:00,383 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:00,384 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:00,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:00,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:00,384 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:00,384 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:00,384 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:00,385 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:00,385 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:00,385 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:00,385 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:00,385 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:00,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:00,387 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:00,387 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:00,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:00,388 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:00,388 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:00,462 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:00,463 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:00,463 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:00,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:00,463 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:00,463 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:00,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2397 [2022-12-06 07:33:00,463 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-06 07:33:00,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:00,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1311683269, now seen corresponding path program 1 times [2022-12-06 07:33:00,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:00,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129062258] [2022-12-06 07:33:00,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:00,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:00,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-06 07:33:00,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:00,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129062258] [2022-12-06 07:33:00,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129062258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:00,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:00,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:00,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014361630] [2022-12-06 07:33:00,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:00,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:00,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:00,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:00,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:00,545 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:00,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:00,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:00,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:00,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:00,586 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:00,586 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:00,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 356 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:00,586 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:00,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:00,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:00,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:00,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:00,587 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:00,587 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:00,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:00,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:00,588 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:00,588 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:00,588 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:00,588 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:00,588 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:00,588 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:00,588 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:00,588 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:00,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:00,590 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:00,591 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:00,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:00,591 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:00,591 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:00,665 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:00,666 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:00,666 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:00,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:00,666 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:00,666 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:00,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2398 [2022-12-06 07:33:00,667 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-06 07:33:00,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:00,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1342159462, now seen corresponding path program 1 times [2022-12-06 07:33:00,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:00,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786260291] [2022-12-06 07:33:00,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:00,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:00,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-06 07:33:00,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:00,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786260291] [2022-12-06 07:33:00,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786260291] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:00,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:00,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:00,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086270239] [2022-12-06 07:33:00,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:00,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:00,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:00,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:00,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:00,731 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:00,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:00,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:00,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:00,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:00,772 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:00,772 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:00,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 350 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:00,772 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:00,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:00,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:00,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:00,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:00,773 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:00,773 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:00,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:00,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:00,774 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:00,774 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:00,774 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:00,774 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:00,774 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:00,774 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:00,774 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:00,774 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:00,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:00,776 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:00,776 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:00,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:00,777 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:00,777 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:00,849 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:00,850 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:33:00,851 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:00,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:00,851 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:00,851 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:00,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2399 [2022-12-06 07:33:00,851 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-06 07:33:00,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:00,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1368941571, now seen corresponding path program 1 times [2022-12-06 07:33:00,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:00,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058486439] [2022-12-06 07:33:00,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:00,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:00,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-06 07:33:00,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:00,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058486439] [2022-12-06 07:33:00,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058486439] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:00,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:00,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:00,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160652956] [2022-12-06 07:33:00,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:00,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:00,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:00,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:00,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:00,919 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:00,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:00,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:00,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:00,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:00,961 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:00,961 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:00,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:00,961 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:00,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:00,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:00,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:00,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:00,962 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:00,962 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:00,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:00,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:00,963 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:00,963 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:00,963 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:00,963 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:00,963 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:00,963 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:00,963 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:00,963 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:00,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:00,965 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:00,965 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:00,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:00,966 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:00,966 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:01,040 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:01,041 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:01,042 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:01,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:01,042 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:01,042 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:01,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2400 [2022-12-06 07:33:01,042 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-06 07:33:01,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:01,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1399417764, now seen corresponding path program 1 times [2022-12-06 07:33:01,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:01,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052616800] [2022-12-06 07:33:01,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:01,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:01,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:01,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:01,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052616800] [2022-12-06 07:33:01,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052616800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:01,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:01,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:01,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419438020] [2022-12-06 07:33:01,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:01,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:01,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:01,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:01,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:01,108 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:01,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:01,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:01,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:01,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:01,143 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:01,143 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:01,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:01,144 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:01,144 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:01,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:01,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:01,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:01,144 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:01,144 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:01,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:01,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:01,145 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:01,145 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:01,145 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:01,145 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:01,145 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:01,146 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:01,146 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:01,146 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:01,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:01,148 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:01,148 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:01,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:01,148 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:01,148 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:01,221 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:01,222 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:01,222 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:01,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:01,222 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:01,222 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:01,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2401 [2022-12-06 07:33:01,222 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-06 07:33:01,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:01,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1426199873, now seen corresponding path program 1 times [2022-12-06 07:33:01,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:01,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556665435] [2022-12-06 07:33:01,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:01,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:01,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-06 07:33:01,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:01,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556665435] [2022-12-06 07:33:01,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556665435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:01,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:01,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:01,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299436091] [2022-12-06 07:33:01,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:01,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:01,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:01,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:01,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:01,293 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:01,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:01,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:01,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:01,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:01,328 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:01,328 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:01,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:01,329 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:01,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:01,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:01,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:01,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:01,329 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:01,330 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:01,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:01,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:01,330 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:01,330 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:01,330 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:01,330 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:01,331 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:01,331 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:01,331 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:01,331 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:01,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:01,333 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:01,333 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:01,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:01,333 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:01,333 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:01,406 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:01,407 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:01,407 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:01,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:01,407 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:01,407 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:01,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2402 [2022-12-06 07:33:01,407 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-06 07:33:01,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:01,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1456676066, now seen corresponding path program 1 times [2022-12-06 07:33:01,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:01,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702457210] [2022-12-06 07:33:01,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:01,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:01,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-06 07:33:01,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:01,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702457210] [2022-12-06 07:33:01,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702457210] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:01,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:01,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:01,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440148580] [2022-12-06 07:33:01,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:01,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:01,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:01,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:01,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:01,473 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:01,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:01,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:01,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:01,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:01,509 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:01,510 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:01,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:01,510 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:01,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:01,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:01,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:01,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:01,511 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:01,511 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:01,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:01,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:01,511 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:01,511 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:01,511 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:01,512 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:01,512 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:01,512 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:01,512 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:01,512 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:01,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:01,514 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:01,514 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:01,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:01,514 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:01,514 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:01,589 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:01,590 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:01,590 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:01,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:01,590 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:01,590 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:01,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2403 [2022-12-06 07:33:01,591 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-06 07:33:01,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:01,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1483458175, now seen corresponding path program 1 times [2022-12-06 07:33:01,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:01,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299901358] [2022-12-06 07:33:01,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:01,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:01,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-06 07:33:01,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:01,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299901358] [2022-12-06 07:33:01,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299901358] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:01,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:01,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:01,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391004513] [2022-12-06 07:33:01,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:01,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:01,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:01,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:01,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:01,669 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:01,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:01,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:01,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:01,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:01,711 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:01,711 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:01,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:01,711 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:01,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:01,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:01,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:01,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:01,712 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:01,712 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:01,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:01,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:01,713 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:01,713 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:01,713 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:01,713 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:01,713 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:01,713 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:01,713 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:01,713 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:01,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:01,715 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:01,716 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:01,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:01,716 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:01,716 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:01,791 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:01,792 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:01,792 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:01,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:01,792 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:01,792 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:01,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2404 [2022-12-06 07:33:01,793 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-06 07:33:01,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:01,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1513934368, now seen corresponding path program 1 times [2022-12-06 07:33:01,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:01,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650931662] [2022-12-06 07:33:01,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:01,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33: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-06 07:33:01,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:01,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650931662] [2022-12-06 07:33:01,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650931662] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:01,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:01,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:01,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292828220] [2022-12-06 07:33:01,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:01,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:01,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:01,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:01,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:01,857 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:01,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:01,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:01,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:01,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:01,899 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:01,899 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:01,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:01,900 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:01,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:01,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:01,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:01,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:01,900 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:01,901 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:01,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:01,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:01,901 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:01,901 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:01,901 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:01,901 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:01,901 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:01,902 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:01,902 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:01,902 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:01,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:01,904 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:01,904 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:01,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:01,904 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:01,904 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:01,977 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:01,978 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:01,978 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:01,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:01,979 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:01,979 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:01,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2405 [2022-12-06 07:33:01,979 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-06 07:33:01,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:01,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1540716477, now seen corresponding path program 1 times [2022-12-06 07:33:01,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:01,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206081671] [2022-12-06 07:33:01,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:01,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:02,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-06 07:33:02,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:02,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206081671] [2022-12-06 07:33:02,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206081671] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:02,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:02,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:02,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142742926] [2022-12-06 07:33:02,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:02,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:02,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:02,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:02,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:02,047 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:02,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:02,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:02,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:02,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:02,083 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:02,083 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:02,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:02,083 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:02,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:02,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:02,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:02,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:02,084 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:02,084 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:02,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:02,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:02,085 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:02,085 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:02,085 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:02,085 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:02,085 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:02,085 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:02,085 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:02,085 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:02,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:02,087 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:02,087 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:02,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:02,088 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:02,088 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:02,162 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:02,163 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:02,163 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:02,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:02,163 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:02,163 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:02,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2406 [2022-12-06 07:33:02,163 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-06 07:33:02,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:02,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1571192670, now seen corresponding path program 1 times [2022-12-06 07:33:02,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:02,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812143022] [2022-12-06 07:33:02,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:02,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:02,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-06 07:33:02,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:02,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812143022] [2022-12-06 07:33:02,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812143022] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:02,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:02,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:02,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333752696] [2022-12-06 07:33:02,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:02,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:02,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:02,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:02,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:02,228 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:02,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:02,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:02,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:02,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:02,269 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:02,269 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:02,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:02,270 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:02,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:02,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:02,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:02,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:02,270 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:02,270 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:02,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:02,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:02,271 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:02,271 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:02,271 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:02,271 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:02,271 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:02,271 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:02,271 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:02,271 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:02,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:02,274 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:02,274 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:02,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:02,274 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:02,274 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:02,347 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:02,348 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:02,348 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:02,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:02,348 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:02,348 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:02,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2407 [2022-12-06 07:33:02,348 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-06 07:33:02,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:02,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1597974779, now seen corresponding path program 1 times [2022-12-06 07:33:02,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:02,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417200424] [2022-12-06 07:33:02,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:02,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:02,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:02,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-06 07:33:02,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:02,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417200424] [2022-12-06 07:33:02,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417200424] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:02,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:02,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:02,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847324592] [2022-12-06 07:33:02,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:02,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:02,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:02,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:02,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:02,417 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:02,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:02,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:02,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:02,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:02,453 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:02,453 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:02,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:02,453 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:02,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:02,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:02,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:02,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:02,454 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:02,454 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:02,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:02,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:02,455 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:02,455 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:02,455 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:02,455 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:02,455 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:02,455 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:02,455 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:02,455 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:02,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:02,457 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:02,458 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:02,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:02,458 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:02,458 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:02,531 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:02,532 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:02,532 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:02,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:02,533 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:02,533 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:02,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2408 [2022-12-06 07:33:02,533 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-06 07:33:02,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:02,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1628450972, now seen corresponding path program 1 times [2022-12-06 07:33:02,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:02,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110506343] [2022-12-06 07:33:02,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:02,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:02,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-06 07:33:02,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:02,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110506343] [2022-12-06 07:33:02,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110506343] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:02,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:02,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:02,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116253533] [2022-12-06 07:33:02,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:02,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:02,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:02,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:02,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:02,601 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:02,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:02,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:02,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:02,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:02,638 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:02,638 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:02,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:02,638 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:02,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:02,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:02,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:02,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:02,639 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:02,639 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:02,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:02,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:02,640 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:02,640 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:02,640 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:02,640 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:02,640 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:02,640 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:02,640 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:02,640 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:02,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:02,652 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:02,652 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:02,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:02,653 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:02,653 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:02,729 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:02,730 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-06 07:33:02,730 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:02,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:02,730 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:02,730 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:02,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2409 [2022-12-06 07:33:02,730 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-06 07:33:02,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:02,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1655233081, now seen corresponding path program 1 times [2022-12-06 07:33:02,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:02,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479152071] [2022-12-06 07:33:02,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:02,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:02,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-06 07:33:02,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:02,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479152071] [2022-12-06 07:33:02,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479152071] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:02,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:02,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:02,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436519317] [2022-12-06 07:33:02,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:02,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:02,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:02,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:02,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:02,799 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:02,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:02,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:02,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:02,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:02,838 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:02,839 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:02,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:02,839 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:02,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:02,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:02,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:02,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:02,840 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:02,840 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:02,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:02,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:02,840 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:02,840 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:02,841 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:02,841 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:02,841 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:02,841 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:02,841 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:02,841 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:02,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:02,843 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:02,843 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:02,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:02,844 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:02,844 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:02,918 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:02,919 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:02,919 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:02,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:02,920 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:02,920 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:02,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2410 [2022-12-06 07:33:02,920 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-06 07:33:02,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:02,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1685709274, now seen corresponding path program 1 times [2022-12-06 07:33:02,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:02,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511322013] [2022-12-06 07:33:02,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:02,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:02,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-06 07:33:02,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:02,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511322013] [2022-12-06 07:33:02,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511322013] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:02,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:02,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:02,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334055126] [2022-12-06 07:33:02,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:02,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:02,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:02,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:02,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:02,986 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:02,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:02,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:02,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:02,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:03,029 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:03,029 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:03,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:03,030 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:03,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:03,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:03,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:03,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:03,030 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:03,030 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:03,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:03,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:03,031 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:03,031 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:03,031 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:03,031 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:03,031 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:03,031 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:03,031 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:03,032 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:03,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:03,034 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:03,034 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:03,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:03,034 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:03,034 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:03,108 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:03,109 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:03,109 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:03,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:03,109 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:03,109 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:03,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2411 [2022-12-06 07:33:03,110 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-06 07:33:03,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:03,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1712491383, now seen corresponding path program 1 times [2022-12-06 07:33:03,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:03,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150066303] [2022-12-06 07:33:03,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:03,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:03,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-06 07:33:03,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:03,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150066303] [2022-12-06 07:33:03,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150066303] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:03,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:03,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:03,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013636973] [2022-12-06 07:33:03,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:03,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:03,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:03,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:03,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:03,178 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:03,178 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:03,178 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:03,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:03,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:03,215 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:03,216 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:03,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:03,216 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:03,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:03,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:03,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:03,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:03,217 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:03,217 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:03,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:03,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:03,217 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:03,217 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:03,218 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:03,218 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:03,218 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:03,218 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:03,218 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:03,218 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:03,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:03,220 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:03,220 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:03,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 144 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:03,221 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:03,221 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:03,297 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:03,298 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:33:03,298 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:03,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:03,298 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:03,298 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:03,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2412 [2022-12-06 07:33:03,298 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-06 07:33:03,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:03,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1742967576, now seen corresponding path program 1 times [2022-12-06 07:33:03,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:03,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27598643] [2022-12-06 07:33:03,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:03,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:03,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-06 07:33:03,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:03,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27598643] [2022-12-06 07:33:03,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27598643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:03,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:03,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:03,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240010535] [2022-12-06 07:33:03,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:03,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:03,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:03,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:03,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:03,363 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:03,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:03,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:03,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:03,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:03,406 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:03,407 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:03,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:03,407 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:03,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:03,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:03,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:03,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:03,408 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:03,408 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:03,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:03,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:03,409 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:03,409 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:03,409 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:03,409 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:03,409 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:03,409 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:03,409 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:03,409 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:03,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:03,411 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:03,411 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:03,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:03,412 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:03,412 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:03,486 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:03,487 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:03,487 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:03,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:03,488 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:03,488 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:03,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2413 [2022-12-06 07:33:03,488 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-06 07:33:03,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:03,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1769749685, now seen corresponding path program 1 times [2022-12-06 07:33:03,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:03,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493640600] [2022-12-06 07:33:03,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:03,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:03,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-06 07:33:03,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:03,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493640600] [2022-12-06 07:33:03,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493640600] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:03,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:03,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:03,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679894368] [2022-12-06 07:33:03,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:03,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:03,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:03,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:03,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:03,558 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:03,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:03,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:03,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:03,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:03,597 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:03,597 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:03,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 371 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:03,598 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:03,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:03,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:03,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:03,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:03,599 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:03,599 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:03,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:03,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:03,599 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:03,599 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:03,600 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:03,600 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:03,600 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:03,600 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:03,600 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:03,600 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:03,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:03,602 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:03,602 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:03,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:03,602 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:03,602 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:03,677 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:03,678 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:03,678 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:03,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:03,679 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:03,679 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:03,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2414 [2022-12-06 07:33:03,679 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-06 07:33:03,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:03,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1800225878, now seen corresponding path program 1 times [2022-12-06 07:33:03,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:03,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730718260] [2022-12-06 07:33:03,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:03,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:03,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-06 07:33:03,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:03,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730718260] [2022-12-06 07:33:03,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730718260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:03,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:03,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:03,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018860591] [2022-12-06 07:33:03,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:03,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:03,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:03,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:03,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:03,764 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:03,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:03,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:03,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:03,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:03,808 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:03,808 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:03,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:03,809 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:03,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:03,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:03,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:03,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:03,809 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:03,809 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:03,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:03,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:03,810 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:03,810 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:03,810 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:03,810 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:03,810 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:03,810 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:03,810 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:03,810 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:03,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:03,813 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:03,813 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:03,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:03,813 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:03,813 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:03,888 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:03,888 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:03,889 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:03,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:03,889 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:03,889 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:03,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2415 [2022-12-06 07:33:03,889 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-06 07:33:03,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:03,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1827007987, now seen corresponding path program 1 times [2022-12-06 07:33:03,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:03,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071935142] [2022-12-06 07:33:03,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:03,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:03,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-06 07:33:03,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:03,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071935142] [2022-12-06 07:33:03,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071935142] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:03,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:03,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:03,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177650384] [2022-12-06 07:33:03,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:03,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:03,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:03,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:03,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:03,959 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:03,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:03,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:03,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:03,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:03,995 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:03,995 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:03,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 375 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:03,995 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:03,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:03,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:03,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:03,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:03,996 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:03,996 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:03,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:03,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:03,996 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:03,997 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:03,997 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:03,997 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:03,997 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:03,997 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:03,997 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:03,997 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:03,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:03,999 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:03,999 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:03,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:04,000 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:04,000 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:04,075 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:04,075 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:04,076 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:04,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:04,076 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:04,076 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:04,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2416 [2022-12-06 07:33:04,076 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-06 07:33:04,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:04,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1857484180, now seen corresponding path program 1 times [2022-12-06 07:33:04,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:04,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960070374] [2022-12-06 07:33:04,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:04,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:04,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:04,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-06 07:33:04,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:04,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960070374] [2022-12-06 07:33:04,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960070374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:04,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:04,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:04,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040063104] [2022-12-06 07:33:04,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:04,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:04,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:04,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:04,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:04,140 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:04,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:04,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:04,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:04,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:04,177 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:04,177 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:04,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:04,178 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:04,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:04,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:04,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:04,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:04,178 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:04,178 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:04,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:04,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:04,179 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:04,179 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:04,179 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:04,179 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:04,179 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:04,180 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:04,180 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:04,180 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:04,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:04,182 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:04,182 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:04,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:04,182 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:04,182 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:04,256 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:04,257 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:04,257 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:04,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:04,257 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:04,257 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:04,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2417 [2022-12-06 07:33:04,257 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-06 07:33:04,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:04,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1884266289, now seen corresponding path program 1 times [2022-12-06 07:33:04,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:04,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090606697] [2022-12-06 07:33:04,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:04,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:04,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-06 07:33:04,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:04,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090606697] [2022-12-06 07:33:04,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090606697] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:04,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:04,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:04,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761382642] [2022-12-06 07:33:04,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:04,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:04,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:04,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:04,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:04,325 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:04,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:04,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:04,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:04,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:04,360 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:04,360 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:04,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:04,361 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:04,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:04,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:04,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:04,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:04,361 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:04,361 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:04,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:04,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:04,362 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:04,362 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:04,362 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:04,362 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:04,362 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:04,363 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:04,363 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:04,363 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:04,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:04,365 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:04,365 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:04,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:04,365 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:04,365 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:04,440 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:04,441 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:04,441 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:04,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:04,441 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:04,441 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:04,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2418 [2022-12-06 07:33:04,441 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-06 07:33:04,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:04,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1914742482, now seen corresponding path program 1 times [2022-12-06 07:33:04,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:04,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183449677] [2022-12-06 07:33:04,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:04,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:04,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-06 07:33:04,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:04,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183449677] [2022-12-06 07:33:04,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183449677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:04,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:04,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:04,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879927550] [2022-12-06 07:33:04,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:04,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:04,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:04,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:04,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:04,507 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:04,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:04,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:04,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:04,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:04,544 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:04,544 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:04,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:04,544 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:04,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:04,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:04,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:04,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:04,545 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:04,545 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:04,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:04,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:04,545 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:04,545 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:04,546 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:04,546 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:04,546 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:04,546 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:04,546 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:04,546 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:04,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:04,548 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:04,548 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:04,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:04,548 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:04,548 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:04,622 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:04,623 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:04,623 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:04,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:04,623 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:04,623 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:04,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2419 [2022-12-06 07:33:04,623 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-06 07:33:04,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:04,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1941524591, now seen corresponding path program 1 times [2022-12-06 07:33:04,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:04,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720884102] [2022-12-06 07:33:04,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:04,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:04,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-06 07:33:04,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:04,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720884102] [2022-12-06 07:33:04,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720884102] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:04,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:04,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:04,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510342763] [2022-12-06 07:33:04,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:04,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:04,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:04,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:04,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:04,692 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:04,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:04,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:04,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:04,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:04,729 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:04,729 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:04,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:04,730 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:04,730 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:04,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:04,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:04,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:04,730 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:04,730 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:04,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:04,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:04,731 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:04,731 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:04,731 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:04,731 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:04,731 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:04,731 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:04,731 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:04,732 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:04,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:04,734 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:04,734 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:04,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:04,734 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:04,734 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:04,809 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:04,810 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:04,810 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:04,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:04,811 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:04,811 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:04,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2420 [2022-12-06 07:33:04,811 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-06 07:33:04,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:04,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1972000784, now seen corresponding path program 1 times [2022-12-06 07:33:04,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:04,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320990755] [2022-12-06 07:33:04,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:04,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:04,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:04,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-06 07:33:04,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:04,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320990755] [2022-12-06 07:33:04,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320990755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:04,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:04,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:04,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913597455] [2022-12-06 07:33:04,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:04,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:04,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:04,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:04,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:04,888 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:04,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:04,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:04,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:04,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:04,929 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:04,929 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:04,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:04,930 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:04,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:04,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:04,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:04,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:04,930 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:04,930 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:04,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:04,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:04,931 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:04,931 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:04,931 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:04,931 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:04,931 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:04,931 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:04,931 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:04,931 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:04,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:04,934 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:04,934 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:04,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:04,934 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:04,934 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:05,008 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:05,008 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:05,009 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:05,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:05,009 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:05,009 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:05,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2421 [2022-12-06 07:33:05,009 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-06 07:33:05,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:05,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1998782893, now seen corresponding path program 1 times [2022-12-06 07:33:05,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:05,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487392756] [2022-12-06 07:33:05,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:05,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:05,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-06 07:33:05,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:05,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487392756] [2022-12-06 07:33:05,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487392756] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:05,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:05,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:05,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117453883] [2022-12-06 07:33:05,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:05,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:05,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:05,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:05,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:05,077 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:05,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:05,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:05,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:05,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:05,119 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:05,119 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:05,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:05,119 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:05,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:05,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:05,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:05,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:05,120 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:05,120 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:05,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:05,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:05,121 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:05,121 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:05,121 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:05,121 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:05,121 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:05,121 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:05,121 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:05,121 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:05,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:05,124 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:05,124 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:05,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:05,124 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:05,124 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:05,198 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:05,199 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:05,199 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:05,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:05,199 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:05,199 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:05,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2422 [2022-12-06 07:33:05,200 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-06 07:33:05,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:05,200 INFO L85 PathProgramCache]: Analyzing trace with hash 2029259086, now seen corresponding path program 1 times [2022-12-06 07:33:05,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:05,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142518027] [2022-12-06 07:33:05,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:05,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:05,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-06 07:33:05,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:05,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142518027] [2022-12-06 07:33:05,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142518027] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:05,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:05,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:05,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563687326] [2022-12-06 07:33:05,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:05,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:05,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:05,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:05,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:05,265 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:05,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:05,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:05,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:05,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:05,306 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:05,306 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:05,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:05,306 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:05,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:05,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:05,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:05,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:05,307 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:05,307 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:05,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:05,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:05,307 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:05,307 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:05,308 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:05,308 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:05,308 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:05,308 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:05,308 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:05,308 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:05,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:05,310 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:05,310 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:05,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:05,310 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:05,311 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:05,386 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:05,386 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:05,387 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:05,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:05,387 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:05,387 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:05,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2423 [2022-12-06 07:33:05,387 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-06 07:33:05,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:05,387 INFO L85 PathProgramCache]: Analyzing trace with hash 2056041195, now seen corresponding path program 1 times [2022-12-06 07:33:05,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:05,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501516343] [2022-12-06 07:33:05,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:05,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:05,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:05,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-06 07:33:05,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:05,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501516343] [2022-12-06 07:33:05,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501516343] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:05,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:05,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:05,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151751958] [2022-12-06 07:33:05,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:05,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:05,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:05,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:05,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:05,455 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:05,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:05,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:05,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:05,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:05,496 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:05,496 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:05,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:05,497 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:05,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:05,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:05,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:05,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:05,497 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:05,497 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:05,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:05,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:05,498 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:05,498 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:05,498 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:05,498 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:05,498 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:05,498 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:05,498 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:05,498 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:05,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:05,501 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:05,501 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:05,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:05,501 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:05,501 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:05,576 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:05,578 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:33:05,578 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:05,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:05,578 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:05,578 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:05,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2424 [2022-12-06 07:33:05,578 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-06 07:33:05,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:05,578 INFO L85 PathProgramCache]: Analyzing trace with hash 2086517388, now seen corresponding path program 1 times [2022-12-06 07:33:05,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:05,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103464018] [2022-12-06 07:33:05,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:05,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:05,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:05,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-06 07:33:05,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:05,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103464018] [2022-12-06 07:33:05,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103464018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:05,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:05,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:05,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420014951] [2022-12-06 07:33:05,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:05,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:05,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:05,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:05,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:05,643 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:05,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:05,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:05,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:05,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:05,679 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:05,679 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:05,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:05,680 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:05,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:05,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:05,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:05,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:05,680 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:05,680 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:05,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:05,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:05,681 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:05,681 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:05,681 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:05,681 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:05,681 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:05,681 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:05,681 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:05,681 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:05,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:05,683 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:05,684 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:05,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:05,684 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:05,684 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:05,759 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:05,760 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:05,760 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:05,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:05,760 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:05,760 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:05,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2425 [2022-12-06 07:33:05,760 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-06 07:33:05,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:05,760 INFO L85 PathProgramCache]: Analyzing trace with hash 2113299497, now seen corresponding path program 1 times [2022-12-06 07:33:05,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:05,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945349953] [2022-12-06 07:33:05,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:05,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:05,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-06 07:33:05,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:05,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945349953] [2022-12-06 07:33:05,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945349953] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:05,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:05,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:05,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993932146] [2022-12-06 07:33:05,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:05,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:05,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:05,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:05,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:05,829 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:05,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:05,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:05,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:05,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:05,869 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:05,869 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:05,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:05,870 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:05,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:05,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:05,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:05,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:05,870 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:05,870 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:05,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:05,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:05,871 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:05,871 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:05,871 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:05,871 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:05,871 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:05,871 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:05,871 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:05,871 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:05,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:05,874 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:05,874 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:05,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:05,874 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:05,874 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:05,976 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:05,977 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-06 07:33:05,977 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:05,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:05,977 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:05,977 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:05,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2426 [2022-12-06 07:33:05,977 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-06 07:33:05,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:05,977 INFO L85 PathProgramCache]: Analyzing trace with hash 2143775690, now seen corresponding path program 1 times [2022-12-06 07:33:05,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:05,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956740940] [2022-12-06 07:33:05,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:05,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:05,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:06,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-06 07:33:06,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:06,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956740940] [2022-12-06 07:33:06,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956740940] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:06,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:06,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:06,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709682456] [2022-12-06 07:33:06,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:06,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:06,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:06,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:06,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:06,065 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:06,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:06,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:06,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:06,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:06,106 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:06,107 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:06,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:06,107 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:06,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:06,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:06,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:06,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:06,108 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:06,108 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:06,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:06,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:06,108 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:06,108 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:06,108 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:06,109 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:06,109 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:06,109 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:06,109 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:06,109 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:06,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:06,111 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:06,111 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:06,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:06,111 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:06,111 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:06,187 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:06,188 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:06,188 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:06,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:06,188 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:06,188 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:06,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2427 [2022-12-06 07:33:06,188 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-06 07:33:06,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:06,188 INFO L85 PathProgramCache]: Analyzing trace with hash -2124409497, now seen corresponding path program 1 times [2022-12-06 07:33:06,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:06,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167941845] [2022-12-06 07:33:06,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:06,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:06,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-06 07:33:06,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:06,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167941845] [2022-12-06 07:33:06,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167941845] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:06,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:06,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:06,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450211873] [2022-12-06 07:33:06,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:06,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:06,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:06,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:06,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:06,268 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:06,268 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:06,268 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:06,268 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:06,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:06,309 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:06,309 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:06,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:06,310 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:06,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:06,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:06,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:06,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:06,310 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:06,310 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:06,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:06,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:06,311 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:06,311 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:06,311 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:06,311 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:06,311 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:06,311 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:06,311 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:06,312 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:06,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:06,314 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:06,314 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:06,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:06,314 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:06,314 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:06,389 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:06,390 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:06,390 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:06,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:06,390 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:06,390 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:06,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2428 [2022-12-06 07:33:06,390 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-06 07:33:06,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:06,390 INFO L85 PathProgramCache]: Analyzing trace with hash -2093933304, now seen corresponding path program 1 times [2022-12-06 07:33:06,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:06,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686370472] [2022-12-06 07:33:06,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:06,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:06,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-06 07:33:06,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:06,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686370472] [2022-12-06 07:33:06,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686370472] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:06,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:06,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:06,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716516306] [2022-12-06 07:33:06,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:06,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:06,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:06,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:06,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:06,457 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:06,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:06,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:06,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:06,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:06,499 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:06,499 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:06,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:06,500 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:06,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:06,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:06,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:06,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:06,500 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:06,500 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:06,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:06,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:06,501 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:06,501 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:06,501 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:06,501 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:06,501 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:06,501 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:06,501 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:06,501 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:06,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:06,504 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:06,504 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:06,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:06,504 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:06,504 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:06,578 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:06,579 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:06,579 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:06,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:06,580 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:06,580 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:06,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2429 [2022-12-06 07:33:06,580 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-06 07:33:06,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:06,580 INFO L85 PathProgramCache]: Analyzing trace with hash -2067151195, now seen corresponding path program 1 times [2022-12-06 07:33:06,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:06,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048600286] [2022-12-06 07:33:06,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:06,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:06,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-06 07:33:06,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:06,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048600286] [2022-12-06 07:33:06,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048600286] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:06,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:06,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:06,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487785496] [2022-12-06 07:33:06,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:06,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:06,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:06,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:06,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:06,649 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:06,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:06,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:06,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:06,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:06,689 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:06,690 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:06,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:06,690 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:06,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:06,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:06,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:06,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:06,691 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:06,691 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:06,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:06,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:06,691 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:06,691 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:06,691 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:06,692 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:06,692 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:06,692 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:06,692 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:06,692 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:06,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:06,694 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:06,694 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:06,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:06,694 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:06,694 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:06,767 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:06,768 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:33:06,768 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:06,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:06,768 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:06,768 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:06,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2430 [2022-12-06 07:33:06,769 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-06 07:33:06,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:06,769 INFO L85 PathProgramCache]: Analyzing trace with hash -2036675002, now seen corresponding path program 1 times [2022-12-06 07:33:06,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:06,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462947315] [2022-12-06 07:33:06,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:06,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:06,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-06 07:33:06,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:06,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462947315] [2022-12-06 07:33:06,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462947315] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:06,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:06,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:06,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333389883] [2022-12-06 07:33:06,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:06,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:06,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:06,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:06,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:06,834 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:06,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:06,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:06,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:06,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:06,870 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:06,870 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:06,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:06,871 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:06,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:06,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:06,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:06,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:06,871 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:06,872 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:06,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:06,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:06,872 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:06,872 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:06,872 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:06,872 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:06,873 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:06,873 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:06,873 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:06,873 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:06,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:06,875 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:06,875 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:06,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:06,875 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:06,875 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:06,948 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:06,949 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:06,949 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:06,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:06,950 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:06,950 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:06,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2431 [2022-12-06 07:33:06,950 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-06 07:33:06,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:06,950 INFO L85 PathProgramCache]: Analyzing trace with hash -2009892893, now seen corresponding path program 1 times [2022-12-06 07:33:06,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:06,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972718787] [2022-12-06 07:33:06,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:06,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:07,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-06 07:33:07,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:07,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972718787] [2022-12-06 07:33:07,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972718787] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:07,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:07,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:07,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778114460] [2022-12-06 07:33:07,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:07,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:07,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:07,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:07,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:07,032 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:07,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:07,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:07,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:07,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:07,068 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:07,068 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:07,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:07,069 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:07,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:07,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:07,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:07,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:07,070 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:07,070 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:07,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:07,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:07,070 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:07,070 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:07,071 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:07,071 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:07,071 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:07,071 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:07,071 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:07,071 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:07,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:07,073 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:07,073 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:07,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:07,074 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:07,074 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:07,149 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:07,150 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:07,150 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:07,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:07,150 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:07,150 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:07,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2432 [2022-12-06 07:33:07,150 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-06 07:33:07,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:07,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1979416700, now seen corresponding path program 1 times [2022-12-06 07:33:07,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:07,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149622033] [2022-12-06 07:33:07,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:07,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:07,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-06 07:33:07,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:07,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149622033] [2022-12-06 07:33:07,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149622033] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:07,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:07,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:07,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028959605] [2022-12-06 07:33:07,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:07,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:07,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:07,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:07,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:07,215 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:07,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:07,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:07,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:07,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:07,270 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:07,270 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:07,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:07,271 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:07,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:07,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:07,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:07,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:07,271 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:07,271 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:07,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:07,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:07,272 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:07,272 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:07,272 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:07,272 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:07,273 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:07,273 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:07,273 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:07,273 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:07,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:07,275 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:07,276 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:07,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:07,276 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:07,276 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:07,365 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:07,366 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 07:33:07,366 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:07,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:07,366 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:07,366 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:07,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2433 [2022-12-06 07:33:07,366 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-06 07:33:07,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:07,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1952634591, now seen corresponding path program 1 times [2022-12-06 07:33:07,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:07,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238611984] [2022-12-06 07:33:07,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:07,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33: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-06 07:33:07,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:07,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238611984] [2022-12-06 07:33:07,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238611984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:07,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:07,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:07,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163958395] [2022-12-06 07:33:07,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:07,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:07,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:07,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:07,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:07,447 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:07,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:07,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:07,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:07,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:07,499 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:07,500 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:07,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 356 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:07,500 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:07,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:07,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:07,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:07,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:07,501 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:07,501 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:07,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:07,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:07,502 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:07,502 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:07,502 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:07,502 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:07,502 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:07,502 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:07,502 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:07,503 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:07,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:07,505 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:07,505 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:07,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:07,506 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:07,506 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:07,583 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:07,583 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:33:07,584 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:07,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:07,584 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:07,584 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:07,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2434 [2022-12-06 07:33:07,584 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-06 07:33:07,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:07,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1922158398, now seen corresponding path program 1 times [2022-12-06 07:33:07,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:07,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297731664] [2022-12-06 07:33:07,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:07,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:07,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-06 07:33:07,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:07,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297731664] [2022-12-06 07:33:07,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297731664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:07,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:07,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:07,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039465257] [2022-12-06 07:33:07,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:07,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:07,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:07,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:07,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:07,650 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:07,650 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:07,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:07,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:07,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:07,688 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:07,688 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:07,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:07,688 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:07,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:07,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:07,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:07,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:07,689 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:07,689 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:07,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:07,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:07,690 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:07,690 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:07,690 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:07,690 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:07,690 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:07,690 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:07,690 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:07,690 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:07,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:07,693 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:07,693 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:07,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:07,693 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:07,693 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:07,767 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:07,768 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:07,768 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:07,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:07,768 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:07,768 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:07,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2435 [2022-12-06 07:33:07,768 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-06 07:33:07,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:07,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1895376289, now seen corresponding path program 1 times [2022-12-06 07:33:07,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:07,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390052255] [2022-12-06 07:33:07,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:07,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:07,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-06 07:33:07,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:07,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390052255] [2022-12-06 07:33:07,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390052255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:07,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:07,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:07,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199416398] [2022-12-06 07:33:07,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:07,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:07,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:07,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:07,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:07,836 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:07,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:07,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:07,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:07,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:07,874 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:07,874 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:07,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:07,875 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:07,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:07,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:07,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:07,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:07,875 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:07,875 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:07,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:07,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:07,876 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:07,876 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:07,876 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:07,876 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:07,876 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:07,877 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:07,877 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:07,877 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:07,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:07,879 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:07,879 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:07,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:07,879 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:07,879 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:07,954 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:07,955 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:07,955 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:07,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:07,955 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:07,955 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:07,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2436 [2022-12-06 07:33:07,955 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-06 07:33:07,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:07,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1864900096, now seen corresponding path program 1 times [2022-12-06 07:33:07,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:07,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714380925] [2022-12-06 07:33:07,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:07,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:08,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-06 07:33:08,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:08,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714380925] [2022-12-06 07:33:08,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714380925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:08,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:08,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:08,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005658767] [2022-12-06 07:33:08,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:08,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:08,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:08,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:08,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:08,023 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:08,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:08,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:08,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:08,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:08,059 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:08,060 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:08,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:08,060 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:08,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:08,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:08,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:08,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:08,061 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:08,061 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:08,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:08,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:08,061 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:08,061 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:08,062 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:08,062 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:08,062 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:08,062 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:08,062 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:08,062 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:08,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:08,064 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:08,064 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:08,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:08,064 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:08,064 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:08,138 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:08,139 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:08,139 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:08,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:08,139 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:08,139 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:08,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2437 [2022-12-06 07:33:08,139 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-06 07:33:08,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:08,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1838117987, now seen corresponding path program 1 times [2022-12-06 07:33:08,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:08,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470424230] [2022-12-06 07:33:08,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:08,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:08,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-06 07:33:08,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:08,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470424230] [2022-12-06 07:33:08,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470424230] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:08,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:08,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:08,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901426425] [2022-12-06 07:33:08,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:08,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:08,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:08,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:08,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:08,223 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:08,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:08,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:08,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:08,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:08,260 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:08,260 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:08,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:08,260 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:08,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:08,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:08,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:08,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:08,261 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:08,261 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:08,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:08,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:08,262 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:08,262 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:08,262 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:08,262 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:08,262 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:08,262 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:08,262 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:08,262 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:08,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:08,265 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:08,265 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:08,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:08,265 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:08,265 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:08,338 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:08,339 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:08,339 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:08,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:08,339 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:08,339 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:08,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2438 [2022-12-06 07:33:08,339 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-06 07:33:08,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:08,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1807641794, now seen corresponding path program 1 times [2022-12-06 07:33:08,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:08,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166798034] [2022-12-06 07:33:08,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:08,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:08,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-06 07:33:08,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:08,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166798034] [2022-12-06 07:33:08,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166798034] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:08,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:08,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:08,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181716475] [2022-12-06 07:33:08,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:08,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:08,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:08,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:08,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:08,402 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:08,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:08,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:08,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:08,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:08,445 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:08,445 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:08,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:08,445 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:08,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:08,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:08,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:08,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:08,446 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:08,446 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:08,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:08,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:08,446 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:08,446 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:08,447 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:08,447 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:08,447 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:08,447 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:08,447 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:08,447 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:08,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:08,449 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:08,449 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:08,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:08,449 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:08,449 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:08,523 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:08,524 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:08,524 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:08,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:08,524 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:08,524 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:08,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2439 [2022-12-06 07:33:08,524 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-06 07:33:08,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:08,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1780859685, now seen corresponding path program 1 times [2022-12-06 07:33:08,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:08,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073126823] [2022-12-06 07:33:08,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:08,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:08,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-06 07:33:08,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:08,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073126823] [2022-12-06 07:33:08,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073126823] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:08,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:08,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:08,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959085460] [2022-12-06 07:33:08,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:08,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:08,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:08,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:08,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:08,591 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:08,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:08,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:08,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:08,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:08,626 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:08,627 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:08,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:08,627 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:08,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:08,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:08,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:08,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:08,628 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:08,628 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:08,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:08,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:08,628 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:08,628 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:08,628 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:08,629 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:08,629 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:08,629 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:08,629 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:08,629 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:08,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:08,631 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:08,631 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:08,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:08,631 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:08,631 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:08,704 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:08,705 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:33:08,705 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:08,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:08,705 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:08,705 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:08,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2440 [2022-12-06 07:33:08,706 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-06 07:33:08,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:08,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1750383492, now seen corresponding path program 1 times [2022-12-06 07:33:08,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:08,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633955058] [2022-12-06 07:33:08,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:08,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:08,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-06 07:33:08,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:08,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633955058] [2022-12-06 07:33:08,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633955058] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:08,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:08,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:08,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439062056] [2022-12-06 07:33:08,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:08,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:08,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:08,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:08,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:08,774 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:08,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:08,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:08,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:08,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:08,810 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:08,810 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:08,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:08,811 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:08,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:08,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:08,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:08,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:08,811 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:08,811 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:08,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:08,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:08,812 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:08,812 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:08,812 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:08,812 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:08,812 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:08,812 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:08,812 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:08,812 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:08,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:08,815 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:08,815 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:08,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:08,815 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:08,815 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:08,896 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:08,897 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 07:33:08,897 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:08,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:08,897 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:08,897 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:08,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2441 [2022-12-06 07:33:08,897 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-06 07:33:08,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:08,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1723601383, now seen corresponding path program 1 times [2022-12-06 07:33:08,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:08,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340826383] [2022-12-06 07:33:08,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:08,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:08,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-06 07:33:08,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:08,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340826383] [2022-12-06 07:33:08,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340826383] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:08,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:08,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:08,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896819764] [2022-12-06 07:33:08,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:08,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:08,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:08,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:08,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:08,965 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:08,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:08,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:08,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:08,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:09,007 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:09,007 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:09,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:09,007 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:09,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:09,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:09,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:09,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:09,008 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:09,008 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:09,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:09,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:09,008 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:09,009 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:09,009 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:09,009 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:09,009 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:09,009 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:09,009 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:09,009 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:09,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:09,011 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:09,011 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:09,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:09,011 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:09,012 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:09,085 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:09,085 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:33:09,086 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:09,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:09,086 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:09,086 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:09,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2442 [2022-12-06 07:33:09,086 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-06 07:33:09,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:09,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1693125190, now seen corresponding path program 1 times [2022-12-06 07:33:09,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:09,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462290823] [2022-12-06 07:33:09,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:09,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:09,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:09,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:09,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462290823] [2022-12-06 07:33:09,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462290823] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:09,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:09,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:09,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007624086] [2022-12-06 07:33:09,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:09,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:09,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:09,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:09,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:09,154 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:09,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:09,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:09,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:09,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:09,195 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:09,196 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:09,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:09,196 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:09,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:09,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:09,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:09,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:09,197 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:09,197 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:09,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:09,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:09,197 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:09,197 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:09,198 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:09,198 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:09,198 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:09,198 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:09,198 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:09,198 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:09,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:09,200 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:09,200 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:09,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:09,200 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:09,201 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:09,272 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:09,273 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:33:09,273 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:09,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:09,274 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:09,274 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:09,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2443 [2022-12-06 07:33:09,274 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-06 07:33:09,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:09,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1666343081, now seen corresponding path program 1 times [2022-12-06 07:33:09,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:09,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814927772] [2022-12-06 07:33:09,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:09,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:09,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-06 07:33:09,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:09,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814927772] [2022-12-06 07:33:09,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814927772] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:09,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:09,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:09,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271394911] [2022-12-06 07:33:09,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:09,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:09,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:09,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:09,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:09,352 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:09,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:09,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:09,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:09,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:09,393 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:09,393 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:09,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:09,394 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:09,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:09,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:09,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:09,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:09,394 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:09,394 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:09,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:09,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:09,395 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:09,395 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:09,395 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:09,395 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:09,395 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:09,396 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:09,396 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:09,396 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:09,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:09,398 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:09,398 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:09,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:09,398 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:09,398 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:09,472 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:09,473 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:09,473 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:09,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:09,473 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:09,473 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:09,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2444 [2022-12-06 07:33:09,473 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-06 07:33:09,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:09,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1635866888, now seen corresponding path program 1 times [2022-12-06 07:33:09,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:09,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704971619] [2022-12-06 07:33:09,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:09,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:09,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:09,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:09,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704971619] [2022-12-06 07:33:09,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704971619] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:09,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:09,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:09,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977401423] [2022-12-06 07:33:09,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:09,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:09,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:09,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:09,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:09,538 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:09,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:09,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:09,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:09,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:09,574 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:09,574 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:09,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:09,574 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:09,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:09,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:09,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:09,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:09,575 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:09,575 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:09,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:09,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:09,575 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:09,576 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:09,576 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:09,576 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:09,576 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:09,576 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:09,576 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:09,576 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:09,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:09,578 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:09,578 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:09,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:09,578 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:09,578 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:09,652 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:09,653 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:09,653 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:09,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:09,654 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:09,654 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:09,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2445 [2022-12-06 07:33:09,654 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-06 07:33:09,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:09,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1609084779, now seen corresponding path program 1 times [2022-12-06 07:33:09,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:09,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953320997] [2022-12-06 07:33:09,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:09,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:09,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-06 07:33:09,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:09,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953320997] [2022-12-06 07:33:09,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953320997] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:09,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:09,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:09,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472630481] [2022-12-06 07:33:09,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:09,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:09,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:09,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:09,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:09,721 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:09,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:09,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:09,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:09,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:09,762 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:09,762 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:09,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:09,763 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:09,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:09,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:09,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:09,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:09,763 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:09,763 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:09,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:09,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:09,764 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:09,764 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:09,764 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:09,764 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:09,764 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:09,764 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:09,764 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:09,764 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:09,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:09,767 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:09,767 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:09,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:09,767 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:09,767 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:09,840 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:09,841 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:09,841 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:09,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:09,841 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:09,841 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:09,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2446 [2022-12-06 07:33:09,841 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-06 07:33:09,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:09,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1578608586, now seen corresponding path program 1 times [2022-12-06 07:33:09,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:09,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102204750] [2022-12-06 07:33:09,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:09,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:09,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-06 07:33:09,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:09,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102204750] [2022-12-06 07:33:09,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102204750] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:09,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:09,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:09,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552799897] [2022-12-06 07:33:09,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:09,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:09,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:09,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:09,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:09,907 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:09,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:09,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:09,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:09,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:09,948 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:09,948 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:09,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:09,949 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:09,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:09,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:09,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:09,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:09,949 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:09,949 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:09,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:09,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:09,950 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:09,950 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:09,950 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:09,950 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:09,950 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:09,950 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:09,950 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:09,950 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:09,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:09,953 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:09,953 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:09,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:09,953 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:09,953 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:10,026 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:10,027 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:10,027 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:10,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:10,027 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:10,027 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:10,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2447 [2022-12-06 07:33:10,027 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-06 07:33:10,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:10,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1551826477, now seen corresponding path program 1 times [2022-12-06 07:33:10,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:10,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195001660] [2022-12-06 07:33:10,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:10,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:10,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:10,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:10,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:10,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195001660] [2022-12-06 07:33:10,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195001660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:10,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:10,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:10,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286108169] [2022-12-06 07:33:10,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:10,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:10,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:10,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:10,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:10,096 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:10,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:10,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:10,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:10,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:10,138 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:10,138 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:10,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:10,139 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:10,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:10,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:10,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:10,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:10,139 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:10,140 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:10,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:10,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:10,140 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:10,140 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:10,140 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:10,140 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:10,141 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:10,141 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:10,141 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:10,141 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:10,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:10,143 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:10,143 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:10,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:10,143 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:10,143 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:10,218 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:10,219 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:10,219 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:10,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:10,219 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:10,219 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:10,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2448 [2022-12-06 07:33:10,219 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-06 07:33:10,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:10,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1521350284, now seen corresponding path program 1 times [2022-12-06 07:33:10,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:10,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025483663] [2022-12-06 07:33:10,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:10,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:10,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-06 07:33:10,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:10,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025483663] [2022-12-06 07:33:10,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025483663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:10,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:10,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:10,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221917452] [2022-12-06 07:33:10,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:10,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:10,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:10,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:10,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:10,283 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:10,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:10,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:10,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:10,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:10,335 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:10,335 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:10,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:10,335 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:10,335 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:10,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:10,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:10,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:10,336 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:10,336 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:10,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:10,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:10,337 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:10,337 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:10,337 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:10,337 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:10,337 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:10,337 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:10,337 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:10,337 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:10,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:10,339 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:10,339 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:10,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:10,340 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:10,340 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:10,413 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:10,414 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:10,414 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:10,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:10,414 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:10,414 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:10,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2449 [2022-12-06 07:33:10,414 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-06 07:33:10,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:10,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1494568175, now seen corresponding path program 1 times [2022-12-06 07:33:10,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:10,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113268008] [2022-12-06 07:33:10,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:10,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:10,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-06 07:33:10,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:10,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113268008] [2022-12-06 07:33:10,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113268008] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:10,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:10,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:10,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365114837] [2022-12-06 07:33:10,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:10,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:10,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:10,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:10,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:10,481 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:10,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:10,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:10,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:10,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:10,516 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:10,517 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:10,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 370 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:10,517 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:10,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:10,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:10,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:10,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:10,518 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:10,518 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:10,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:10,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:10,518 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:10,518 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:10,519 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:10,519 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:10,519 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:10,519 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:10,519 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:10,519 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:10,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:10,521 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:10,521 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:10,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:10,521 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:10,521 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:10,595 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:10,596 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:10,596 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:10,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:10,596 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:10,596 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:10,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2450 [2022-12-06 07:33:10,596 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-06 07:33:10,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:10,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1464091982, now seen corresponding path program 1 times [2022-12-06 07:33:10,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:10,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396999873] [2022-12-06 07:33:10,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:10,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:10,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-06 07:33:10,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:10,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396999873] [2022-12-06 07:33:10,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396999873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:10,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:10,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:10,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345738538] [2022-12-06 07:33:10,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:10,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:10,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:10,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:10,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:10,668 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:10,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:10,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:10,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:10,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:10,705 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:10,705 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:10,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:10,706 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:10,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:10,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:10,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:10,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:10,706 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:10,706 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:10,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:10,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:10,707 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:10,707 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:10,707 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:10,707 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:10,707 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:10,707 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:10,707 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:10,708 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:10,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:10,710 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:10,710 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:10,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:10,710 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:10,710 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:10,785 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:10,786 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:10,786 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:10,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:10,786 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:10,786 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:10,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2451 [2022-12-06 07:33:10,786 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-06 07:33:10,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:10,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1437309873, now seen corresponding path program 1 times [2022-12-06 07:33:10,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:10,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592936571] [2022-12-06 07:33:10,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:10,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:10,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-06 07:33:10,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:10,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592936571] [2022-12-06 07:33:10,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592936571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:10,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:10,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:10,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828535940] [2022-12-06 07:33:10,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:10,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:10,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:10,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:10,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:10,853 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:10,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:10,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:10,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:10,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:10,888 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:10,888 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:10,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:10,889 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:10,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:10,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:10,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:10,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:10,889 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:10,889 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:10,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:10,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:10,890 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:10,890 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:10,890 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:10,890 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:10,890 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:10,891 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:10,891 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:10,891 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:10,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:10,893 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:10,893 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:10,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:10,893 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:10,893 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:10,968 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:10,969 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:10,969 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:10,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:10,969 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:10,969 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:10,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2452 [2022-12-06 07:33:10,969 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-06 07:33:10,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:10,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1406833680, now seen corresponding path program 1 times [2022-12-06 07:33:10,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:10,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78798689] [2022-12-06 07:33:10,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:10,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:11,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-06 07:33:11,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:11,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78798689] [2022-12-06 07:33:11,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78798689] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:11,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:11,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:11,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070979799] [2022-12-06 07:33:11,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:11,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:11,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:11,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:11,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:11,035 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:11,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:11,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:11,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:11,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:11,071 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:11,071 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:11,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:11,072 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:11,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:11,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:11,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:11,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:11,072 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:11,072 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:11,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:11,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:11,073 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:11,073 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:11,073 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:11,073 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:11,073 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:11,074 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:11,074 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:11,074 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:11,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:11,076 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:11,076 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:11,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:11,076 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:11,076 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:11,151 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:11,152 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:11,152 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:11,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:11,152 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:11,152 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:11,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2453 [2022-12-06 07:33:11,152 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-06 07:33:11,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:11,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1380051571, now seen corresponding path program 1 times [2022-12-06 07:33:11,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:11,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314512886] [2022-12-06 07:33:11,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:11,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:11,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-06 07:33:11,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:11,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314512886] [2022-12-06 07:33:11,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314512886] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:11,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:11,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:11,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673604451] [2022-12-06 07:33:11,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:11,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:11,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:11,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:11,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:11,219 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:11,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:11,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:11,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:11,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:11,260 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:11,261 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:11,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:11,261 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:11,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:11,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:11,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:11,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:11,262 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:11,262 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:11,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:11,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:11,262 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:11,262 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:11,263 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:11,263 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:11,263 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:11,263 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:11,263 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:11,263 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:11,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:11,265 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:11,265 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:11,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:11,265 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:11,265 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:11,341 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:11,342 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:11,342 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:11,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:11,342 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:11,342 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:11,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2454 [2022-12-06 07:33:11,342 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-06 07:33:11,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:11,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1349575378, now seen corresponding path program 1 times [2022-12-06 07:33:11,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:11,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118641785] [2022-12-06 07:33:11,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:11,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:11,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-06 07:33:11,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:11,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118641785] [2022-12-06 07:33:11,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118641785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:11,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:11,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:11,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491207407] [2022-12-06 07:33:11,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:11,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:11,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:11,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:11,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:11,425 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:11,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:11,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:11,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:11,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:11,462 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:11,463 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:11,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:11,463 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:11,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:11,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:11,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:11,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:11,464 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:11,464 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:11,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:11,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:11,464 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:11,464 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:11,465 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:11,465 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:11,465 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:11,465 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:11,465 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:11,465 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:11,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:11,467 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:11,467 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:11,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:11,467 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:11,468 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:11,543 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:11,544 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:11,544 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:11,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:11,545 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:11,545 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:11,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2455 [2022-12-06 07:33:11,545 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-06 07:33:11,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:11,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1322793269, now seen corresponding path program 1 times [2022-12-06 07:33:11,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:11,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911847208] [2022-12-06 07:33:11,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:11,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:11,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:11,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-06 07:33:11,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:11,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911847208] [2022-12-06 07:33:11,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911847208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:11,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:11,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:11,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547924685] [2022-12-06 07:33:11,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:11,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:11,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:11,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:11,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:11,611 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:11,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:11,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:11,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:11,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:11,647 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:11,647 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:11,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 370 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:11,648 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:11,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:11,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:11,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:11,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:11,648 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:11,648 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:11,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:11,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:11,649 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:11,649 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:11,649 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:11,649 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:11,649 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:11,649 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:11,650 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:11,650 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:11,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:11,652 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:11,652 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:11,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:11,652 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:11,652 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:11,725 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:11,726 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:11,726 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:11,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:11,726 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:11,727 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:11,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2456 [2022-12-06 07:33:11,727 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-06 07:33:11,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:11,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1292317076, now seen corresponding path program 1 times [2022-12-06 07:33:11,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:11,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488842618] [2022-12-06 07:33:11,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:11,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:11,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-06 07:33:11,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:11,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488842618] [2022-12-06 07:33:11,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488842618] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:11,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:11,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:11,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223378177] [2022-12-06 07:33:11,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:11,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:11,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:11,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:11,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:11,791 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:11,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:11,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:11,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:11,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:11,827 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:11,827 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:11,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:11,827 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:11,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:11,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:11,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:11,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:11,828 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:11,828 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:11,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:11,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:11,828 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:11,829 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:11,829 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:11,829 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:11,829 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:11,829 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:11,829 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:11,829 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:11,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:11,831 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:11,831 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:11,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:11,832 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:11,832 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:11,904 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:11,905 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:33:11,905 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:11,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:11,905 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:11,905 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:11,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2457 [2022-12-06 07:33:11,905 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-06 07:33:11,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:11,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1265534967, now seen corresponding path program 1 times [2022-12-06 07:33:11,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:11,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704557553] [2022-12-06 07:33:11,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:11,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:11,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:11,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:11,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704557553] [2022-12-06 07:33:11,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704557553] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:11,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:11,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:11,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499435370] [2022-12-06 07:33:11,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:11,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:11,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:11,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:11,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:11,973 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:11,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:11,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:11,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:11,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:12,010 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:12,010 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:12,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:12,011 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:12,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:12,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:12,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:12,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:12,011 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:12,011 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:12,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:12,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:12,012 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:12,012 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:12,012 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:12,012 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:12,012 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:12,012 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:12,012 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:12,012 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:12,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:12,015 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:12,015 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:12,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:12,015 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:12,015 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:12,090 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:12,091 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:12,091 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:12,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:12,091 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:12,091 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:12,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2458 [2022-12-06 07:33:12,091 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-06 07:33:12,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:12,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1235058774, now seen corresponding path program 1 times [2022-12-06 07:33:12,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:12,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280109858] [2022-12-06 07:33:12,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:12,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:12,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-06 07:33:12,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:12,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280109858] [2022-12-06 07:33:12,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280109858] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:12,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:12,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:12,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669914289] [2022-12-06 07:33:12,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:12,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:12,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:12,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:12,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:12,158 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:12,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:12,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:12,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:12,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:12,200 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:12,201 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:12,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:12,201 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:12,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:12,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:12,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:12,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:12,202 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:12,202 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:12,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:12,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:12,202 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:12,202 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:12,203 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:12,203 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:12,203 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:12,203 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:12,203 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:12,203 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:12,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:12,205 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:12,205 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:12,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:12,205 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:12,205 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:12,278 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:12,279 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:33:12,279 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:12,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:12,279 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:12,279 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:12,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2459 [2022-12-06 07:33:12,279 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-06 07:33:12,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:12,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1208276665, now seen corresponding path program 1 times [2022-12-06 07:33:12,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:12,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307215401] [2022-12-06 07:33:12,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:12,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:12,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:12,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:12,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307215401] [2022-12-06 07:33:12,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307215401] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:12,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:12,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:12,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174111301] [2022-12-06 07:33:12,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:12,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:12,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:12,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:12,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:12,346 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:12,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:12,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:12,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:12,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:12,385 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:12,385 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:12,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:12,385 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:12,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:12,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:12,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:12,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:12,386 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:12,386 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:12,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:12,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:12,387 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:12,387 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:12,387 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:12,387 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:12,387 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:12,387 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:12,387 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:12,387 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:12,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:12,389 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:12,389 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:12,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:12,390 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:12,390 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:12,464 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:12,465 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:12,465 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:12,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:12,465 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:12,465 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:12,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2460 [2022-12-06 07:33:12,465 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-06 07:33:12,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:12,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1177800472, now seen corresponding path program 1 times [2022-12-06 07:33:12,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:12,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025099804] [2022-12-06 07:33:12,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:12,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:12,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:12,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-06 07:33:12,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:12,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025099804] [2022-12-06 07:33:12,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025099804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:12,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:12,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:12,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214831898] [2022-12-06 07:33:12,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:12,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:12,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:12,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:12,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:12,539 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:12,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:12,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:12,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:12,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:12,574 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:12,575 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:12,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:12,575 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:12,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:12,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:12,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:12,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:12,576 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:12,576 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:12,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:12,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:12,576 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:12,576 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:12,577 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:12,577 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:12,577 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:12,577 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:12,577 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:12,577 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:12,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:12,579 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:12,579 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:12,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:12,579 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:12,579 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:12,653 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:12,654 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:12,654 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:12,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:12,655 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:12,655 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:12,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2461 [2022-12-06 07:33:12,655 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-06 07:33:12,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:12,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1151018363, now seen corresponding path program 1 times [2022-12-06 07:33:12,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:12,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573337425] [2022-12-06 07:33:12,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:12,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:12,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:12,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-06 07:33:12,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:12,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573337425] [2022-12-06 07:33:12,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573337425] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:12,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:12,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:12,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064399305] [2022-12-06 07:33:12,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:12,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:12,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:12,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:12,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:12,724 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:12,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:12,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:12,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:12,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:12,760 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:12,760 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:12,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:12,761 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:12,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:12,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:12,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:12,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:12,761 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:12,761 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:12,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:12,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:12,762 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:12,762 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:12,762 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:12,762 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:12,763 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:12,763 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:12,763 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:12,763 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:12,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:12,765 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:12,765 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:12,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:12,765 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:12,765 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:12,841 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:12,842 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:33:12,842 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:12,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:12,843 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:12,843 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:12,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2462 [2022-12-06 07:33:12,843 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-06 07:33:12,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:12,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1120542170, now seen corresponding path program 1 times [2022-12-06 07:33:12,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:12,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688806742] [2022-12-06 07:33:12,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:12,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:12,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:12,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:12,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688806742] [2022-12-06 07:33:12,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688806742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:12,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:12,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:12,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505953140] [2022-12-06 07:33:12,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:12,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:12,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:12,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:12,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:12,912 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:12,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:12,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:12,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:12,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:12,953 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:12,953 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:12,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:12,954 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:12,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:12,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:12,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:12,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:12,954 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:12,955 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:12,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:12,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:12,955 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:12,955 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:12,955 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:12,955 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:12,956 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:12,956 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:12,956 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:12,956 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:12,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:12,958 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:12,958 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:12,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 115 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:12,958 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:12,958 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:13,034 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:13,035 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:33:13,035 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:13,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:13,035 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:13,035 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:13,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2463 [2022-12-06 07:33:13,036 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-06 07:33:13,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:13,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1093760061, now seen corresponding path program 1 times [2022-12-06 07:33:13,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:13,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119987361] [2022-12-06 07:33:13,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:13,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:13,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-06 07:33:13,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:13,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119987361] [2022-12-06 07:33:13,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119987361] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:13,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:13,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:13,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475158651] [2022-12-06 07:33:13,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:13,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:13,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:13,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:13,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:13,106 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:13,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:13,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:13,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:13,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:13,142 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:13,143 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:13,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:13,143 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:13,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:13,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:13,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:13,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:13,144 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:13,144 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:13,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:13,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:13,144 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:13,144 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:13,145 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:13,145 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:13,145 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:13,145 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:13,145 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:13,145 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:13,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:13,147 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:13,147 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:13,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:13,147 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:13,148 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:13,222 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:13,223 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:13,223 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:13,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:13,223 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:13,223 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:13,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2464 [2022-12-06 07:33:13,223 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-06 07:33:13,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:13,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1063283868, now seen corresponding path program 1 times [2022-12-06 07:33:13,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:13,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939434230] [2022-12-06 07:33:13,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:13,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:13,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-06 07:33:13,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:13,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939434230] [2022-12-06 07:33:13,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939434230] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:13,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:13,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:13,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938388366] [2022-12-06 07:33:13,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:13,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:13,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:13,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:13,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:13,289 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:13,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:13,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:13,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:13,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:13,327 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:13,327 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:13,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:13,327 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:13,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:13,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:13,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:13,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:13,328 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:13,328 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:13,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:13,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:13,329 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:13,329 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:13,329 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:13,329 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:13,329 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:13,329 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:13,329 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:13,329 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:13,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:13,332 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:13,332 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:13,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:13,332 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:13,332 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:13,407 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:13,408 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:13,408 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:13,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:13,408 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:13,408 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:13,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2465 [2022-12-06 07:33:13,408 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-06 07:33:13,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:13,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1036501759, now seen corresponding path program 1 times [2022-12-06 07:33:13,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:13,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415804107] [2022-12-06 07:33:13,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:13,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:13,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:13,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:13,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415804107] [2022-12-06 07:33:13,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415804107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:13,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:13,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:13,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843659506] [2022-12-06 07:33:13,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:13,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:13,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:13,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:13,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:13,479 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:13,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:13,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:13,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:13,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:13,521 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:13,521 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:13,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:13,522 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:13,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:13,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:13,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:13,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:13,522 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:13,522 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:13,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:13,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:13,523 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:13,523 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:13,523 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:13,523 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:13,523 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:13,533 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:13,533 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:13,533 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:13,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:13,536 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:13,536 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:13,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:13,536 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:13,536 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:13,613 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:13,614 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-06 07:33:13,614 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:13,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:13,614 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:13,614 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:13,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2466 [2022-12-06 07:33:13,614 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-06 07:33:13,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:13,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1006025566, now seen corresponding path program 1 times [2022-12-06 07:33:13,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:13,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002066671] [2022-12-06 07:33:13,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:13,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33: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-06 07:33:13,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:13,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002066671] [2022-12-06 07:33:13,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002066671] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:13,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:13,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:13,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053831362] [2022-12-06 07:33:13,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:13,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:13,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:13,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:13,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:13,679 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:13,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:13,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:13,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:13,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:13,714 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:13,715 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:13,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:13,715 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:13,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:13,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:13,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:13,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:13,716 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:13,716 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:13,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:13,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:13,716 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:13,716 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:13,716 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:13,717 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:13,717 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:13,717 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:13,717 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:13,717 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:13,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:13,719 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:13,719 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:13,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 112 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:13,719 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:13,719 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:13,794 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:13,795 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:13,795 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:13,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:13,795 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:13,795 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:13,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2467 [2022-12-06 07:33:13,795 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-06 07:33:13,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:13,796 INFO L85 PathProgramCache]: Analyzing trace with hash -979243457, now seen corresponding path program 1 times [2022-12-06 07:33:13,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:13,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466049052] [2022-12-06 07:33:13,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:13,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:13,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-06 07:33:13,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:13,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466049052] [2022-12-06 07:33:13,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466049052] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:13,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:13,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:13,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002917749] [2022-12-06 07:33:13,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:13,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:13,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:13,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:13,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:13,863 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:13,863 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:13,863 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:13,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:13,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:13,899 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:13,899 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:13,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:13,899 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:13,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:13,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:13,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:13,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:13,900 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:13,900 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:13,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:13,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:13,901 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:13,901 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:13,901 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:13,901 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:13,901 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:13,901 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:13,901 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:13,901 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:13,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:13,904 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:13,904 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:13,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:13,904 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:13,904 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:13,978 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:13,979 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:13,979 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:13,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:13,979 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:13,979 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:13,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2468 [2022-12-06 07:33:13,979 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-06 07:33:13,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:13,980 INFO L85 PathProgramCache]: Analyzing trace with hash -948767264, now seen corresponding path program 1 times [2022-12-06 07:33:13,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:13,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673592522] [2022-12-06 07:33:13,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:13,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:14,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-06 07:33:14,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:14,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673592522] [2022-12-06 07:33:14,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673592522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:14,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:14,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:14,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138930112] [2022-12-06 07:33:14,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:14,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:14,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:14,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:14,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:14,045 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:14,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:14,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:14,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:14,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:14,082 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:14,082 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:14,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:14,083 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:14,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:14,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:14,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:14,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:14,083 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:14,083 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:14,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:14,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:14,084 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:14,084 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:14,084 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:14,084 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:14,084 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:14,085 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:14,085 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:14,085 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:14,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:14,087 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:14,087 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:14,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:14,087 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:14,087 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:14,160 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:14,161 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:14,161 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:14,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:14,162 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:14,162 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:14,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2469 [2022-12-06 07:33:14,162 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-06 07:33:14,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:14,162 INFO L85 PathProgramCache]: Analyzing trace with hash -921985155, now seen corresponding path program 1 times [2022-12-06 07:33:14,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:14,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361921505] [2022-12-06 07:33:14,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:14,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:14,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-06 07:33:14,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:14,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361921505] [2022-12-06 07:33:14,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361921505] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:14,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:14,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:14,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122357282] [2022-12-06 07:33:14,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:14,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:14,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:14,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:14,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:14,232 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:14,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:14,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:14,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:14,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:14,273 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:14,273 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:14,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:14,274 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:14,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:14,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:14,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:14,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:14,274 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:14,274 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:14,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:14,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:14,275 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:14,275 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:14,275 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:14,275 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:14,275 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:14,275 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:14,275 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:14,275 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:14,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:14,278 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:14,278 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:14,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:14,278 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:14,278 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:14,354 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:14,355 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:33:14,355 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:14,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:14,355 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:14,355 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:14,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2470 [2022-12-06 07:33:14,355 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-06 07:33:14,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:14,355 INFO L85 PathProgramCache]: Analyzing trace with hash -891508962, now seen corresponding path program 1 times [2022-12-06 07:33:14,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:14,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122130347] [2022-12-06 07:33:14,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:14,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:14,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-06 07:33:14,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:14,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122130347] [2022-12-06 07:33:14,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122130347] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:14,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:14,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:14,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824356015] [2022-12-06 07:33:14,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:14,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:14,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:14,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:14,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:14,420 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:14,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:14,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:14,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:14,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:14,458 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:14,458 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:14,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:14,458 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:14,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:14,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:14,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:14,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:14,459 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:14,459 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:14,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:14,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:14,459 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:14,460 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:14,460 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:14,460 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:14,460 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:14,460 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:14,460 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:14,460 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:14,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:14,462 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:14,462 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:14,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:14,463 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:14,463 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:14,535 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:14,536 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:33:14,536 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:14,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:14,536 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:14,536 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:14,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2471 [2022-12-06 07:33:14,536 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-06 07:33:14,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:14,537 INFO L85 PathProgramCache]: Analyzing trace with hash -864726853, now seen corresponding path program 1 times [2022-12-06 07:33:14,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:14,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938107444] [2022-12-06 07:33:14,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:14,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:14,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-06 07:33:14,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:14,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938107444] [2022-12-06 07:33:14,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938107444] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:14,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:14,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:14,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045899462] [2022-12-06 07:33:14,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:14,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:14,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:14,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:14,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:14,622 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:14,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:14,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:14,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:14,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:14,665 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:14,665 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:14,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:14,665 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:14,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:14,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:14,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:14,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:14,666 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:14,666 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:14,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:14,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:14,667 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:14,667 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:14,667 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:14,667 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:14,667 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:14,667 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:14,667 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:14,667 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:14,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:14,669 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:14,670 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:14,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:14,670 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:14,670 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:14,744 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:14,745 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:14,745 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:14,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:14,745 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:14,746 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:14,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2472 [2022-12-06 07:33:14,746 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-06 07:33:14,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:14,746 INFO L85 PathProgramCache]: Analyzing trace with hash -834250660, now seen corresponding path program 1 times [2022-12-06 07:33:14,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:14,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636815216] [2022-12-06 07:33:14,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:14,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:14,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-06 07:33:14,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:14,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636815216] [2022-12-06 07:33:14,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636815216] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:14,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:14,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:14,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870300919] [2022-12-06 07:33:14,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:14,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:14,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:14,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:14,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:14,810 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:14,810 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:14,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:14,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:14,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:14,845 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:14,845 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:14,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:14,846 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:14,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:14,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:14,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:14,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:14,846 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:14,846 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:14,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:14,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:14,847 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:14,847 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:14,847 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:14,847 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:14,847 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:14,848 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:14,848 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:14,848 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:14,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:14,850 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:14,850 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:14,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 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 116. Up to 16 conditions per place. [2022-12-06 07:33:14,850 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:14,850 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:14,924 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:14,925 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:14,925 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:14,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:14,925 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:14,925 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:14,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2473 [2022-12-06 07:33:14,925 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-06 07:33:14,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:14,925 INFO L85 PathProgramCache]: Analyzing trace with hash -807468551, now seen corresponding path program 1 times [2022-12-06 07:33:14,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:14,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735583840] [2022-12-06 07:33:14,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:14,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:14,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-06 07:33:14,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:14,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735583840] [2022-12-06 07:33:14,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735583840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:14,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:14,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:14,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486496347] [2022-12-06 07:33:14,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:14,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:14,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:14,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:14,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:14,993 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:14,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:14,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:14,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:14,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:15,028 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:15,029 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:15,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:15,029 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:15,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:15,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:15,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:15,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:15,030 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:15,030 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:15,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:15,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:15,030 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:15,030 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:15,031 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:15,031 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:15,031 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:15,031 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:15,031 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:15,031 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:15,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:15,033 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:15,033 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:15,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:15,033 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:15,033 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:15,108 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:15,109 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:15,109 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:15,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:15,109 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:15,109 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:15,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2474 [2022-12-06 07:33:15,109 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-06 07:33:15,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:15,109 INFO L85 PathProgramCache]: Analyzing trace with hash -776992358, now seen corresponding path program 1 times [2022-12-06 07:33:15,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:15,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187914869] [2022-12-06 07:33:15,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:15,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:15,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-06 07:33:15,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:15,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187914869] [2022-12-06 07:33:15,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187914869] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:15,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:15,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:15,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263381665] [2022-12-06 07:33:15,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:15,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:15,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:15,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:15,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:15,175 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:15,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:15,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:15,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:15,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:15,212 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:15,212 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:15,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:15,212 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:15,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:15,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:15,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:15,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:15,213 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:15,213 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:15,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:15,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:15,214 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:15,214 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:15,214 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:15,214 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:15,214 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:15,214 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:15,214 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:15,215 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:15,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:15,217 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:15,217 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:15,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:15,217 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:15,217 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:15,293 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:15,294 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:33:15,294 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:15,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:15,295 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:15,295 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:15,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2475 [2022-12-06 07:33:15,295 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-06 07:33:15,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:15,295 INFO L85 PathProgramCache]: Analyzing trace with hash -750210249, now seen corresponding path program 1 times [2022-12-06 07:33:15,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:15,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805709675] [2022-12-06 07:33:15,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:15,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:15,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-06 07:33:15,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:15,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805709675] [2022-12-06 07:33:15,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805709675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:15,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:15,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:15,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507887117] [2022-12-06 07:33:15,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:15,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:15,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:15,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:15,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:15,366 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:15,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:15,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:15,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:15,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:15,408 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:15,408 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:15,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 355 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:15,408 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:15,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:15,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:15,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:15,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:15,409 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:15,409 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:15,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:15,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:15,409 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:15,410 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:15,410 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:15,410 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:15,410 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:15,410 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:15,410 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:15,410 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:15,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:15,412 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:15,412 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:15,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:15,413 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:15,413 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:15,486 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:15,487 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:15,487 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:15,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:15,488 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:15,488 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:15,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2476 [2022-12-06 07:33:15,488 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-06 07:33:15,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:15,488 INFO L85 PathProgramCache]: Analyzing trace with hash -719734056, now seen corresponding path program 1 times [2022-12-06 07:33:15,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:15,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689804795] [2022-12-06 07:33:15,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:15,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:15,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-06 07:33:15,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:15,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689804795] [2022-12-06 07:33:15,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689804795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:15,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:15,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:15,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627318064] [2022-12-06 07:33:15,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:15,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:15,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:15,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:15,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:15,555 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:15,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:15,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:15,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:15,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:15,591 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:15,592 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:15,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:15,592 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:15,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:15,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:15,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:15,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:15,593 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:15,593 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:15,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:15,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:15,593 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:15,593 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:15,593 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:15,593 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:15,594 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:15,594 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:15,594 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:15,594 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:15,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:15,596 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:15,596 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:15,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:15,596 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:15,597 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:15,671 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:15,672 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:15,672 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:15,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:15,672 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:15,672 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:15,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2477 [2022-12-06 07:33:15,672 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-06 07:33:15,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:15,673 INFO L85 PathProgramCache]: Analyzing trace with hash -692951947, now seen corresponding path program 1 times [2022-12-06 07:33:15,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:15,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374375496] [2022-12-06 07:33:15,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:15,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:15,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:15,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-06 07:33:15,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:15,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374375496] [2022-12-06 07:33:15,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374375496] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:15,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:15,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:15,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671349637] [2022-12-06 07:33:15,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:15,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:15,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:15,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:15,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:15,755 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:15,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:15,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:15,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:15,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:15,798 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:15,798 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:15,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:15,798 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:15,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:15,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:15,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:15,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:15,799 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:15,799 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:15,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:15,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:15,800 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:15,800 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:15,800 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:15,800 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:15,800 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:15,800 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:15,800 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:15,800 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:15,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:15,803 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:15,803 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:15,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:15,803 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:15,803 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:15,879 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:15,880 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:33:15,880 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:15,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:15,880 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:15,880 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:15,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2478 [2022-12-06 07:33:15,880 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-06 07:33:15,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:15,881 INFO L85 PathProgramCache]: Analyzing trace with hash -662475754, now seen corresponding path program 1 times [2022-12-06 07:33:15,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:15,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660110496] [2022-12-06 07:33:15,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:15,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:15,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-06 07:33:15,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:15,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660110496] [2022-12-06 07:33:15,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660110496] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:15,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:15,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:15,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510905045] [2022-12-06 07:33:15,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:15,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:15,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:15,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:15,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:15,949 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:15,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:15,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:15,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:15,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:15,985 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:15,986 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:15,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:15,986 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:15,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:15,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:15,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:15,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:15,987 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:15,987 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:15,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:15,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:15,987 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:15,987 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:15,988 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:15,988 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:15,988 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:15,988 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:15,988 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:15,988 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:15,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:15,990 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:15,990 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:15,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:15,990 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:15,990 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:16,066 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:16,067 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:16,068 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:16,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:16,068 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:16,068 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:16,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2479 [2022-12-06 07:33:16,068 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-06 07:33:16,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:16,068 INFO L85 PathProgramCache]: Analyzing trace with hash -635693645, now seen corresponding path program 1 times [2022-12-06 07:33:16,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:16,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353407728] [2022-12-06 07:33:16,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:16,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:16,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-06 07:33:16,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:16,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353407728] [2022-12-06 07:33:16,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353407728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:16,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:16,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:16,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422387773] [2022-12-06 07:33:16,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:16,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:16,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:16,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:16,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:16,137 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:16,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:16,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:16,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:16,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:16,179 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:16,179 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:16,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:16,179 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:16,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:16,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:16,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:16,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:16,180 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:16,180 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:16,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:16,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:16,181 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:16,181 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:16,181 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:16,181 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:16,181 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:16,181 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:16,181 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:16,181 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:16,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:16,183 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:16,183 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:16,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:16,184 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:16,184 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:16,258 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:16,259 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:16,259 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:16,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:16,260 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:16,260 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:16,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2480 [2022-12-06 07:33:16,260 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-06 07:33:16,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:16,260 INFO L85 PathProgramCache]: Analyzing trace with hash -605217452, now seen corresponding path program 1 times [2022-12-06 07:33:16,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:16,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704745471] [2022-12-06 07:33:16,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:16,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:16,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-06 07:33:16,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:16,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704745471] [2022-12-06 07:33:16,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704745471] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:16,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:16,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:16,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600991080] [2022-12-06 07:33:16,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:16,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:16,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:16,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:16,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:16,327 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:16,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:16,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:16,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:16,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:16,364 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:16,364 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:16,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:16,365 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:16,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:16,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:16,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:16,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:16,365 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:16,365 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:16,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:16,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:16,366 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:16,366 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:16,366 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:16,366 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:16,366 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:16,367 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:16,367 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:16,367 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:16,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:16,369 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:16,369 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:16,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:16,369 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:16,369 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:16,444 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:16,445 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:16,445 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:16,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:16,445 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:16,445 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:16,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2481 [2022-12-06 07:33:16,445 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-06 07:33:16,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:16,445 INFO L85 PathProgramCache]: Analyzing trace with hash -578435343, now seen corresponding path program 1 times [2022-12-06 07:33:16,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:16,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141419380] [2022-12-06 07:33:16,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:16,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:16,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-06 07:33:16,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:16,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141419380] [2022-12-06 07:33:16,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141419380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:16,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:16,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:16,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113381053] [2022-12-06 07:33:16,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:16,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:16,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:16,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:16,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:16,515 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:16,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:16,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:16,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:16,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:16,557 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:16,557 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:16,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:16,557 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:16,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:16,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:16,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:16,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:16,558 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:16,558 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:16,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:16,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:16,559 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:16,559 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:16,559 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:16,559 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:16,559 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:16,559 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:16,559 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:16,559 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:16,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:16,561 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:16,561 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:16,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:16,562 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:16,562 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:16,641 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:16,642 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 07:33:16,642 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:16,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:16,642 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:16,642 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:16,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2482 [2022-12-06 07:33:16,642 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-06 07:33:16,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:16,642 INFO L85 PathProgramCache]: Analyzing trace with hash -547959150, now seen corresponding path program 1 times [2022-12-06 07:33:16,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:16,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461482822] [2022-12-06 07:33:16,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:16,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:16,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-06 07:33:16,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:16,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461482822] [2022-12-06 07:33:16,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461482822] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:16,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:16,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:16,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745633894] [2022-12-06 07:33:16,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:16,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:16,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:16,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:16,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:16,707 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:16,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:16,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:16,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:16,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:16,749 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:16,749 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:16,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:16,750 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:16,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:16,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:16,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:16,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:16,750 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:16,750 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:16,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:16,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:16,751 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:16,751 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:16,751 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:16,751 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:16,751 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:16,752 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:16,752 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:16,752 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:16,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:16,764 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:16,764 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:16,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:16,764 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:16,764 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:16,839 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:16,840 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 07:33:16,840 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:16,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:16,841 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:16,841 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:16,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2483 [2022-12-06 07:33:16,841 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-06 07:33:16,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:16,841 INFO L85 PathProgramCache]: Analyzing trace with hash -521177041, now seen corresponding path program 1 times [2022-12-06 07:33:16,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:16,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919449404] [2022-12-06 07:33:16,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:16,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33: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-06 07:33:16,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:16,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919449404] [2022-12-06 07:33:16,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919449404] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:16,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:16,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:16,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742907639] [2022-12-06 07:33:16,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:16,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:16,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:16,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:16,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:16,908 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:16,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:16,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:16,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:16,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:16,944 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:16,944 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:16,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:16,944 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:16,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:16,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:16,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:16,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:16,945 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:16,945 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:16,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:16,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:16,946 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:16,946 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:16,946 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:16,946 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:16,946 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:16,946 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:16,946 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:16,946 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:16,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:16,948 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:16,949 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:16,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:16,949 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:16,949 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:17,024 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:17,025 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:17,025 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:17,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:17,025 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:17,025 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:17,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2484 [2022-12-06 07:33:17,025 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-06 07:33:17,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:17,026 INFO L85 PathProgramCache]: Analyzing trace with hash -490700848, now seen corresponding path program 1 times [2022-12-06 07:33:17,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:17,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111865388] [2022-12-06 07:33:17,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:17,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:17,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-06 07:33:17,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:17,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111865388] [2022-12-06 07:33:17,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111865388] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:17,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:17,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:17,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034919592] [2022-12-06 07:33:17,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:17,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:17,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:17,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:17,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:17,092 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:17,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:17,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:17,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:17,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:17,135 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:17,135 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:17,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:17,136 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:17,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:17,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:17,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:17,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:17,136 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:17,137 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:17,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:17,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:17,137 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:17,137 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:17,137 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:17,137 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:17,137 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:17,138 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:17,138 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:17,138 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:17,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:17,140 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:17,140 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:17,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:17,140 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:17,140 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:17,215 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:17,216 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:17,216 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:17,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:17,216 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:17,216 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:17,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2485 [2022-12-06 07:33:17,216 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-06 07:33:17,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:17,216 INFO L85 PathProgramCache]: Analyzing trace with hash -463918739, now seen corresponding path program 1 times [2022-12-06 07:33:17,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:17,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700762900] [2022-12-06 07:33:17,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:17,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33: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-06 07:33:17,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:17,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700762900] [2022-12-06 07:33:17,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700762900] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:17,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:17,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:17,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443722762] [2022-12-06 07:33:17,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:17,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:17,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:17,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:17,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:17,284 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:17,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:17,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:17,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:17,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:17,326 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:17,326 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:17,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:17,326 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:17,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:17,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:17,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:17,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:17,327 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:17,327 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:17,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:17,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:17,328 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:17,328 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:17,328 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:17,328 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:17,328 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:17,328 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:17,328 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:17,328 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:17,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:17,330 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:17,330 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:17,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:17,331 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:17,331 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:17,404 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:17,405 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:17,405 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:17,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:17,405 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:17,405 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:17,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2486 [2022-12-06 07:33:17,405 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-06 07:33:17,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:17,406 INFO L85 PathProgramCache]: Analyzing trace with hash -433442546, now seen corresponding path program 1 times [2022-12-06 07:33:17,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:17,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724988916] [2022-12-06 07:33:17,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:17,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:17,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-06 07:33:17,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:17,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724988916] [2022-12-06 07:33:17,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724988916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:17,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:17,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:17,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032249441] [2022-12-06 07:33:17,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:17,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:17,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:17,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:17,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:17,472 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:17,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:17,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:17,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:17,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:17,508 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:17,509 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:17,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:17,509 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:17,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:17,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:17,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:17,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:17,510 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:17,510 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:17,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:17,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:17,510 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:17,510 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:17,510 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:17,511 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:17,511 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:17,511 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:17,511 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:17,511 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:17,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:17,513 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:17,513 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:17,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:17,513 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:17,513 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:17,588 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:17,589 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:17,589 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:17,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:17,589 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:17,589 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:17,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2487 [2022-12-06 07:33:17,590 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-06 07:33:17,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:17,590 INFO L85 PathProgramCache]: Analyzing trace with hash -406660437, now seen corresponding path program 1 times [2022-12-06 07:33:17,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:17,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424216363] [2022-12-06 07:33:17,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:17,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:17,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-06 07:33:17,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:17,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424216363] [2022-12-06 07:33:17,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424216363] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:17,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:17,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:17,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277527576] [2022-12-06 07:33:17,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:17,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:17,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:17,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:17,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:17,659 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:17,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:17,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:17,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:17,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:17,695 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:17,695 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:17,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 353 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:17,696 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:17,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:17,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:17,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:17,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:17,696 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:17,696 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:17,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:17,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:17,697 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:17,697 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:17,697 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:17,697 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:17,697 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:17,697 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:17,697 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:17,698 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:17,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:17,700 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:17,700 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:17,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:17,700 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:17,700 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:17,776 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:17,777 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:33:17,777 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:17,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:17,777 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:17,777 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:17,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2488 [2022-12-06 07:33:17,777 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-06 07:33:17,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:17,777 INFO L85 PathProgramCache]: Analyzing trace with hash -376184244, now seen corresponding path program 1 times [2022-12-06 07:33:17,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:17,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055098253] [2022-12-06 07:33:17,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:17,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:17,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-06 07:33:17,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:17,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055098253] [2022-12-06 07:33:17,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055098253] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:17,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:17,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:17,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114569001] [2022-12-06 07:33:17,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:17,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:17,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:17,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:17,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:17,855 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:17,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:17,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:17,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:17,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:17,898 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:17,898 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:17,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:17,898 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:17,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:17,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:17,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:17,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:17,899 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:17,899 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:17,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:17,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:17,900 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:17,900 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:17,900 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:17,900 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:17,900 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:17,900 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:17,900 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:17,900 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:17,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:17,902 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:17,903 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:17,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:17,903 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:17,903 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:17,977 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:17,978 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:17,978 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:17,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:17,978 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:17,978 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:17,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2489 [2022-12-06 07:33:17,978 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-06 07:33:17,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:17,979 INFO L85 PathProgramCache]: Analyzing trace with hash -349402135, now seen corresponding path program 1 times [2022-12-06 07:33:17,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:17,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839958555] [2022-12-06 07:33:17,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:17,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:18,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-06 07:33:18,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:18,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839958555] [2022-12-06 07:33:18,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839958555] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:18,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:18,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:18,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513663273] [2022-12-06 07:33:18,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:18,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:18,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:18,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:18,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:18,050 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:18,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:18,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:18,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:18,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:18,092 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:18,092 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:18,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:18,092 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:18,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:18,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:18,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:18,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:18,093 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:18,093 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:18,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:18,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:18,094 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:18,094 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:18,094 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:18,094 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:18,094 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:18,094 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:18,094 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:18,094 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:18,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:18,096 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:18,097 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:18,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:18,097 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:18,097 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:18,172 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:18,173 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:18,173 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:18,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:18,174 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:18,174 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:18,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2490 [2022-12-06 07:33:18,174 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-06 07:33:18,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:18,174 INFO L85 PathProgramCache]: Analyzing trace with hash -318925942, now seen corresponding path program 1 times [2022-12-06 07:33:18,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:18,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586139098] [2022-12-06 07:33:18,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:18,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:18,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-06 07:33:18,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:18,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586139098] [2022-12-06 07:33:18,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586139098] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:18,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:18,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:18,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538770201] [2022-12-06 07:33:18,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:18,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:18,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:18,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:18,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:18,241 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:18,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:18,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:18,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:18,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:18,278 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:18,278 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:18,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:18,278 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:18,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:18,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:18,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:18,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:18,279 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:18,279 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:18,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:18,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:18,280 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:18,280 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:18,280 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:18,280 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:18,280 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:18,280 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:18,280 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:18,280 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:18,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:18,282 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:18,282 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:18,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:18,283 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:18,283 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:18,357 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:18,358 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:18,358 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:18,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:18,358 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:18,358 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:18,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2491 [2022-12-06 07:33:18,358 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-06 07:33:18,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:18,358 INFO L85 PathProgramCache]: Analyzing trace with hash -292143833, now seen corresponding path program 1 times [2022-12-06 07:33:18,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:18,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348878542] [2022-12-06 07:33:18,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:18,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:18,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-06 07:33:18,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:18,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348878542] [2022-12-06 07:33:18,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348878542] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:18,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:18,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:18,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345883412] [2022-12-06 07:33:18,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:18,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:18,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:18,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:18,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:18,427 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:18,427 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:18,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:18,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:18,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:18,468 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:18,469 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:18,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:18,469 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:18,469 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:18,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:18,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:18,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:18,470 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:18,470 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:18,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:18,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:18,470 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:18,471 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:18,471 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:18,471 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:18,471 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:18,471 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:18,471 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:18,471 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:18,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:18,473 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:18,473 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:18,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:18,474 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:18,474 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:18,549 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:18,550 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:18,550 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:18,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:18,550 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:18,550 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:18,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2492 [2022-12-06 07:33:18,550 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-06 07:33:18,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:18,550 INFO L85 PathProgramCache]: Analyzing trace with hash -261667640, now seen corresponding path program 1 times [2022-12-06 07:33:18,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:18,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273152839] [2022-12-06 07:33:18,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:18,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:18,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-06 07:33:18,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:18,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273152839] [2022-12-06 07:33:18,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273152839] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:18,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:18,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:18,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65171809] [2022-12-06 07:33:18,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:18,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:18,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:18,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:18,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:18,628 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:18,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:18,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:18,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:18,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:18,672 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:18,673 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:18,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:18,673 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:18,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:18,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:18,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:18,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:18,674 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:18,674 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:18,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:18,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:18,675 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:18,675 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:18,675 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:18,675 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:18,675 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:18,675 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:18,675 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:18,675 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:18,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:18,677 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:18,677 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:18,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:18,678 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:18,678 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:18,753 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:18,754 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:18,754 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:18,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:18,754 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:18,755 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:18,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2493 [2022-12-06 07:33:18,755 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-06 07:33:18,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:18,755 INFO L85 PathProgramCache]: Analyzing trace with hash -234885531, now seen corresponding path program 1 times [2022-12-06 07:33:18,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:18,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33579567] [2022-12-06 07:33:18,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:18,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:18,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:18,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:18,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33579567] [2022-12-06 07:33:18,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33579567] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:18,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:18,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:18,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144522746] [2022-12-06 07:33:18,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:18,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:18,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:18,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:18,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:18,825 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:18,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:18,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:18,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:18,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:18,867 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:18,867 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:18,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:18,868 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:18,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:18,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:18,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:18,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:18,868 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:18,868 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:18,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:18,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:18,869 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:18,869 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:18,869 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:18,869 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:18,869 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:18,869 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:18,870 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:18,870 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:18,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:18,872 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:18,872 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:18,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:18,872 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:18,872 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:18,946 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:18,947 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:18,947 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:18,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:18,947 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:18,947 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:18,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2494 [2022-12-06 07:33:18,947 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-06 07:33:18,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:18,948 INFO L85 PathProgramCache]: Analyzing trace with hash -204409338, now seen corresponding path program 1 times [2022-12-06 07:33:18,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:18,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847770307] [2022-12-06 07:33:18,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:18,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:19,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:19,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:19,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847770307] [2022-12-06 07:33:19,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847770307] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:19,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:19,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:19,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82956672] [2022-12-06 07:33:19,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:19,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:19,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:19,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:19,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:19,023 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:19,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:19,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:19,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:19,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:19,064 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:19,064 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:19,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:19,065 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:19,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:19,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:19,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:19,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:19,065 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:19,065 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:19,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:19,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:19,066 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:19,066 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:19,066 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:19,066 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:19,066 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:19,066 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:19,066 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:19,066 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:19,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:19,068 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:19,069 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:19,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:19,069 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:19,069 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:19,143 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:19,144 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:19,144 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:19,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:19,145 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:19,145 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:19,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2495 [2022-12-06 07:33:19,145 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-06 07:33:19,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:19,145 INFO L85 PathProgramCache]: Analyzing trace with hash -177627229, now seen corresponding path program 1 times [2022-12-06 07:33:19,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:19,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88230547] [2022-12-06 07:33:19,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:19,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:19,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-06 07:33:19,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:19,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88230547] [2022-12-06 07:33:19,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88230547] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:19,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:19,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:19,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123960920] [2022-12-06 07:33:19,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:19,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:19,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:19,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:19,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:19,210 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:19,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:19,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:19,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:19,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:19,247 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:19,247 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:19,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:19,248 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:19,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:19,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:19,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:19,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:19,248 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:19,248 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:19,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:19,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:19,249 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:19,249 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:19,249 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:19,249 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:19,249 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:19,250 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:19,250 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:19,250 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:19,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:19,252 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:19,252 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:19,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:19,252 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:19,252 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:19,327 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:19,328 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:19,328 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:19,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:19,328 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:19,328 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:19,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2496 [2022-12-06 07:33:19,328 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-06 07:33:19,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:19,328 INFO L85 PathProgramCache]: Analyzing trace with hash -147151036, now seen corresponding path program 1 times [2022-12-06 07:33:19,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:19,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586208635] [2022-12-06 07:33:19,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:19,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:19,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:19,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:19,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586208635] [2022-12-06 07:33:19,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586208635] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:19,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:19,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:19,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181038625] [2022-12-06 07:33:19,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:19,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:19,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:19,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:19,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:19,398 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:19,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:19,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:19,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:19,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:19,440 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:19,440 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:19,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:19,441 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:19,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:19,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:19,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:19,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:19,441 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:19,441 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:19,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:19,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:19,442 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:19,442 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:19,442 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:19,442 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:19,442 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:19,442 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:19,442 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:19,443 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:19,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:19,445 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:19,445 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:19,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:19,445 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:19,445 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:19,520 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:19,521 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:19,521 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:19,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:19,521 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:19,521 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:19,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2497 [2022-12-06 07:33:19,521 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-06 07:33:19,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:19,521 INFO L85 PathProgramCache]: Analyzing trace with hash -120368927, now seen corresponding path program 1 times [2022-12-06 07:33:19,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:19,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543195448] [2022-12-06 07:33:19,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:19,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:19,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-06 07:33:19,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:19,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543195448] [2022-12-06 07:33:19,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543195448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:19,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:19,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:19,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103445289] [2022-12-06 07:33:19,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:19,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:19,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:19,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:19,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:19,591 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:19,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:19,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:19,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:19,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:19,633 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:19,633 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:19,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:19,634 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:19,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:19,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:19,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:19,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:19,634 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:19,634 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:19,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:19,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:19,635 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:19,635 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:19,635 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:19,635 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:19,635 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:19,635 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:19,635 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:19,635 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:19,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:19,637 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:19,638 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:19,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 144 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:19,638 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:19,638 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:19,713 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:19,714 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:19,714 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:19,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:19,714 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:19,714 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:19,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2498 [2022-12-06 07:33:19,714 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-06 07:33:19,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:19,715 INFO L85 PathProgramCache]: Analyzing trace with hash -89892734, now seen corresponding path program 1 times [2022-12-06 07:33:19,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:19,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298362428] [2022-12-06 07:33:19,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:19,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:19,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-06 07:33:19,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:19,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298362428] [2022-12-06 07:33:19,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298362428] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:19,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:19,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:19,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430611434] [2022-12-06 07:33:19,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:19,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:19,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:19,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:19,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:19,781 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:19,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:19,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:19,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:19,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:19,823 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:19,823 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:19,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:19,824 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:19,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:19,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:19,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:19,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:19,824 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:19,824 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:19,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:19,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:19,825 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:19,825 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:19,825 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:19,825 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:19,825 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:19,825 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:19,825 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:19,826 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:19,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:19,828 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:19,828 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:19,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:19,828 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:19,828 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:19,905 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:19,906 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:33:19,906 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:19,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:19,906 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:19,906 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:19,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2499 [2022-12-06 07:33:19,906 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-06 07:33:19,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:19,906 INFO L85 PathProgramCache]: Analyzing trace with hash -63110625, now seen corresponding path program 1 times [2022-12-06 07:33:19,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:19,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191371766] [2022-12-06 07:33:19,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:19,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:19,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-06 07:33:19,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:19,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191371766] [2022-12-06 07:33:19,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191371766] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:19,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:19,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:19,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983575903] [2022-12-06 07:33:19,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:19,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:19,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:19,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:19,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:19,975 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:19,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:19,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:19,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:19,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:20,024 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:20,024 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:20,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:20,024 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:20,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:20,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:20,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:20,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:20,025 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:20,025 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:20,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:20,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:20,026 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:20,026 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:20,026 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:20,026 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:20,026 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:20,026 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:20,026 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:20,026 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:20,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:20,028 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:20,029 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:20,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:20,029 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:20,029 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:20,106 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:20,107 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:33:20,107 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:20,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:20,107 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:20,107 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:20,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2500 [2022-12-06 07:33:20,107 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-06 07:33:20,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:20,107 INFO L85 PathProgramCache]: Analyzing trace with hash -32634432, now seen corresponding path program 1 times [2022-12-06 07:33:20,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:20,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735960627] [2022-12-06 07:33:20,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:20,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:20,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:20,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-06 07:33:20,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:20,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735960627] [2022-12-06 07:33:20,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735960627] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:20,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:20,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:20,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089028463] [2022-12-06 07:33:20,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:20,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:20,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:20,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:20,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:20,172 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:20,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:20,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:20,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:20,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:20,215 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:20,215 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:20,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:20,215 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:20,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:20,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:20,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:20,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:20,216 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:20,216 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:20,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:20,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:20,216 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:20,217 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:20,217 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:20,217 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:20,217 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:20,217 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:20,217 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:20,217 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:20,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:20,219 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:20,219 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:20,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:20,220 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:20,220 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:20,295 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:20,296 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:20,296 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:20,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:20,297 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:20,297 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:20,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2501 [2022-12-06 07:33:20,297 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-06 07:33:20,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:20,297 INFO L85 PathProgramCache]: Analyzing trace with hash -5852323, now seen corresponding path program 1 times [2022-12-06 07:33:20,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:20,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14878884] [2022-12-06 07:33:20,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:20,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:20,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-06 07:33:20,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:20,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14878884] [2022-12-06 07:33:20,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14878884] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:20,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:20,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:20,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432748860] [2022-12-06 07:33:20,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:20,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:20,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:20,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:20,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:20,365 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:20,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:20,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:20,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:20,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:20,401 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:20,401 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:20,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:20,402 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:20,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:20,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:20,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:20,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:20,402 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:20,402 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:20,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:20,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:20,403 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:20,403 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:20,403 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:20,403 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:20,403 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:20,403 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:20,403 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:20,403 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:20,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:20,406 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:20,406 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:20,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:20,406 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:20,406 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:20,482 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:20,483 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:33:20,483 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:20,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:20,484 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:20,484 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:20,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2502 [2022-12-06 07:33:20,484 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-06 07:33:20,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:20,484 INFO L85 PathProgramCache]: Analyzing trace with hash 24623870, now seen corresponding path program 1 times [2022-12-06 07:33:20,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:20,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723868984] [2022-12-06 07:33:20,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:20,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33: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-06 07:33:20,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:20,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723868984] [2022-12-06 07:33:20,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723868984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:20,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:20,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:20,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807962387] [2022-12-06 07:33:20,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:20,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:20,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:20,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:20,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:20,550 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:20,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:20,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:20,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:20,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:20,591 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:20,591 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:20,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:20,592 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:20,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:20,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:20,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:20,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:20,593 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:20,593 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:20,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:20,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:20,593 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:20,593 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:20,593 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:20,594 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:20,594 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:20,594 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:20,594 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:20,594 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:20,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:20,596 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:20,596 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:20,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:20,596 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:20,596 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:20,671 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:20,672 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:20,672 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:20,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:20,672 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:20,672 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:20,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2503 [2022-12-06 07:33:20,672 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-06 07:33:20,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:20,672 INFO L85 PathProgramCache]: Analyzing trace with hash 51405979, now seen corresponding path program 1 times [2022-12-06 07:33:20,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:20,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766879656] [2022-12-06 07:33:20,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:20,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:20,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-06 07:33:20,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:20,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766879656] [2022-12-06 07:33:20,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766879656] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:20,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:20,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:20,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282238854] [2022-12-06 07:33:20,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:20,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:20,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:20,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:20,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:20,740 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:20,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:20,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:20,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:20,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:20,781 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:20,781 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:20,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:20,782 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:20,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:20,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:20,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:20,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:20,782 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:20,782 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:20,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:20,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:20,783 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:20,783 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:20,783 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:20,783 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:20,783 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:20,783 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:20,783 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:20,784 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:20,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:20,786 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:20,786 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:20,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:20,786 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:20,786 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:20,861 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:20,862 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:20,862 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:20,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:20,862 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:20,862 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:20,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2504 [2022-12-06 07:33:20,862 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-06 07:33:20,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:20,862 INFO L85 PathProgramCache]: Analyzing trace with hash 81882172, now seen corresponding path program 1 times [2022-12-06 07:33:20,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:20,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147164854] [2022-12-06 07:33:20,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:20,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:20,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-06 07:33:20,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:20,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147164854] [2022-12-06 07:33:20,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147164854] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:20,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:20,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:20,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480326380] [2022-12-06 07:33:20,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:20,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:20,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:20,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:20,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:20,929 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:20,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:20,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:20,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:20,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:20,965 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:20,965 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:20,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:20,965 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:20,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:20,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:20,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:20,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:20,966 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:20,966 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:20,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:20,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:20,966 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:20,966 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:20,967 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:20,967 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:20,967 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:20,967 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:20,967 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:20,967 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:20,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:20,969 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:20,969 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:20,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:20,969 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:20,969 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:21,045 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:21,046 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:21,046 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:21,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:21,046 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:21,046 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:21,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2505 [2022-12-06 07:33:21,046 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-06 07:33:21,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:21,047 INFO L85 PathProgramCache]: Analyzing trace with hash 108664281, now seen corresponding path program 1 times [2022-12-06 07:33:21,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:21,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440791624] [2022-12-06 07:33:21,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:21,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:21,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:21,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-06 07:33:21,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:21,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440791624] [2022-12-06 07:33:21,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440791624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:21,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:21,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:21,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127359964] [2022-12-06 07:33:21,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:21,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:21,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:21,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:21,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:21,128 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:21,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:21,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:21,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:21,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:21,168 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:21,169 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:21,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:21,169 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:21,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:21,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:21,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:21,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:21,169 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:21,170 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:21,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:21,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:21,170 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:21,170 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:21,170 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:21,170 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:21,171 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:21,171 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:21,171 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:21,171 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:21,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:21,173 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:21,173 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:21,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:21,173 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:21,173 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:21,247 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:21,248 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:21,248 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:21,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:21,248 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:21,248 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:21,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2506 [2022-12-06 07:33:21,249 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-06 07:33:21,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:21,249 INFO L85 PathProgramCache]: Analyzing trace with hash 139140474, now seen corresponding path program 1 times [2022-12-06 07:33:21,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:21,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516063411] [2022-12-06 07:33:21,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:21,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:21,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-06 07:33:21,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:21,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516063411] [2022-12-06 07:33:21,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516063411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:21,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:21,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:21,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297436033] [2022-12-06 07:33:21,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:21,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:21,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:21,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:21,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:21,315 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:21,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:21,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:21,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:21,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:21,352 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:21,352 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:21,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:21,353 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:21,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:21,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:21,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:21,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:21,353 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:21,353 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:21,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:21,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:21,354 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:21,354 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:21,354 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:21,354 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:21,354 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:21,354 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:21,354 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:21,354 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:21,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:21,357 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:21,357 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:21,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 118 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:21,357 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:21,357 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:21,434 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:21,435 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:33:21,435 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:21,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:21,435 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:21,435 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:21,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2507 [2022-12-06 07:33:21,436 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-06 07:33:21,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:21,436 INFO L85 PathProgramCache]: Analyzing trace with hash 165922583, now seen corresponding path program 1 times [2022-12-06 07:33:21,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:21,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975836374] [2022-12-06 07:33:21,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:21,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33: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-06 07:33:21,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:21,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975836374] [2022-12-06 07:33:21,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975836374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:21,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:21,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:21,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788138871] [2022-12-06 07:33:21,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:21,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:21,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:21,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:21,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:21,506 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:21,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:21,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:21,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:21,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:21,547 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:21,548 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:21,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:21,548 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:21,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:21,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:21,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:21,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:21,549 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:21,549 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:21,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:21,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:21,549 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:21,550 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:21,550 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:21,550 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:21,550 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:21,550 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:21,550 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:21,550 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:21,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:21,552 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:21,552 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:21,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:21,553 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:21,553 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:21,628 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:21,629 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:21,629 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:21,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:21,629 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:21,629 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:21,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2508 [2022-12-06 07:33:21,629 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-06 07:33:21,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:21,629 INFO L85 PathProgramCache]: Analyzing trace with hash 196398776, now seen corresponding path program 1 times [2022-12-06 07:33:21,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:21,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868188475] [2022-12-06 07:33:21,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:21,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:21,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-06 07:33:21,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:21,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868188475] [2022-12-06 07:33:21,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868188475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:21,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:21,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:21,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642014445] [2022-12-06 07:33:21,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:21,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:21,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:21,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:21,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:21,698 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:21,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:21,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:21,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:21,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:21,741 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:21,742 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:21,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:21,742 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:21,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:21,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:21,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:21,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:21,743 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:21,743 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:21,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:21,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:21,743 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:21,743 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:21,744 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:21,744 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:21,744 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:21,744 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:21,744 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:21,744 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:21,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:21,746 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:21,746 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:21,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:21,747 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:21,747 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:21,822 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:21,823 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:21,823 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:21,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:21,823 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:21,824 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:21,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2509 [2022-12-06 07:33:21,824 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-06 07:33:21,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:21,824 INFO L85 PathProgramCache]: Analyzing trace with hash 223180885, now seen corresponding path program 1 times [2022-12-06 07:33:21,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:21,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775034345] [2022-12-06 07:33:21,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:21,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33: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-06 07:33:21,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:21,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775034345] [2022-12-06 07:33:21,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775034345] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:21,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:21,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:21,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922968666] [2022-12-06 07:33:21,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:21,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:21,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:21,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:21,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:21,893 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:21,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:21,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:21,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:21,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:21,929 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:21,929 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:21,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:21,930 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:21,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:21,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:21,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:21,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:21,930 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:21,930 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:21,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:21,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:21,931 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:21,931 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:21,931 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:21,931 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:21,931 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:21,932 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:21,932 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:21,932 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:21,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:21,934 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:21,934 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:21,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:21,934 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:21,934 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:22,010 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:22,011 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:33:22,011 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:22,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:22,011 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:22,011 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:22,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2510 [2022-12-06 07:33:22,011 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-06 07:33:22,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:22,012 INFO L85 PathProgramCache]: Analyzing trace with hash 253657078, now seen corresponding path program 1 times [2022-12-06 07:33:22,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:22,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568987062] [2022-12-06 07:33:22,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:22,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:22,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-06 07:33:22,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:22,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568987062] [2022-12-06 07:33:22,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568987062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:22,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:22,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:22,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864289669] [2022-12-06 07:33:22,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:22,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:22,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:22,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:22,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:22,079 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:22,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:22,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:22,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:22,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:22,116 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:22,116 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:22,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:22,117 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:22,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:22,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:22,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:22,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:22,118 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:22,118 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:22,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:22,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:22,118 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:22,118 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:22,119 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:22,119 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:22,119 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:22,119 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:22,119 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:22,119 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:22,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:22,121 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:22,121 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:22,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:22,121 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:22,122 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:22,197 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:22,199 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:33:22,199 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:22,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:22,199 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:22,199 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:22,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2511 [2022-12-06 07:33:22,199 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-06 07:33:22,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:22,199 INFO L85 PathProgramCache]: Analyzing trace with hash 280439187, now seen corresponding path program 1 times [2022-12-06 07:33:22,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:22,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954643713] [2022-12-06 07:33:22,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:22,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:22,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-06 07:33:22,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:22,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954643713] [2022-12-06 07:33:22,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954643713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:22,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:22,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:22,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199578683] [2022-12-06 07:33:22,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:22,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:22,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:22,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:22,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:22,277 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:22,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:22,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:22,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:22,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:22,320 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:22,320 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:22,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:22,320 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:22,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:22,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:22,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:22,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:22,321 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:22,321 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:22,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:22,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:22,321 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:22,322 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:22,322 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:22,322 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:22,322 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:22,322 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:22,322 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:22,322 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:22,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:22,324 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:22,324 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:22,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:22,325 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:22,325 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:22,398 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:22,399 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:22,399 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:22,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:22,399 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:22,399 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:22,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2512 [2022-12-06 07:33:22,400 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-06 07:33:22,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:22,400 INFO L85 PathProgramCache]: Analyzing trace with hash 310915380, now seen corresponding path program 1 times [2022-12-06 07:33:22,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:22,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908982201] [2022-12-06 07:33:22,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:22,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:22,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-06 07:33:22,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:22,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908982201] [2022-12-06 07:33:22,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908982201] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:22,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:22,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:22,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399085142] [2022-12-06 07:33:22,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:22,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:22,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:22,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:22,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:22,465 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:22,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:22,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:22,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:22,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:22,509 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:22,509 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:22,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:22,510 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:22,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:22,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:22,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:22,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:22,510 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:22,510 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:22,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:22,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:22,511 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:22,511 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:22,511 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:22,511 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:22,511 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:22,511 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:22,511 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:22,511 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:22,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:22,514 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:22,514 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:22,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:22,514 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:22,514 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:22,588 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:22,589 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:22,589 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:22,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:22,589 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:22,589 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:22,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2513 [2022-12-06 07:33:22,589 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-06 07:33:22,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:22,589 INFO L85 PathProgramCache]: Analyzing trace with hash 337697489, now seen corresponding path program 1 times [2022-12-06 07:33:22,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:22,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336376172] [2022-12-06 07:33:22,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:22,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:22,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-06 07:33:22,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:22,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336376172] [2022-12-06 07:33:22,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336376172] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:22,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:22,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:22,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771776976] [2022-12-06 07:33:22,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:22,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:22,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:22,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:22,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:22,658 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:22,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:22,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:22,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:22,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:22,697 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:22,698 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:22,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 373 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:22,698 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:22,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:22,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:22,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:22,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:22,699 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:22,699 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:22,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:22,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:22,699 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:22,700 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:22,700 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:22,700 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:22,700 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:22,700 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:22,700 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:22,700 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:22,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:22,702 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:22,702 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:22,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:22,703 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:22,703 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:22,778 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:22,779 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:22,779 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:22,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:22,779 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:22,779 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:22,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2514 [2022-12-06 07:33:22,779 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-06 07:33:22,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:22,779 INFO L85 PathProgramCache]: Analyzing trace with hash 368173682, now seen corresponding path program 1 times [2022-12-06 07:33:22,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:22,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259476802] [2022-12-06 07:33:22,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:22,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33: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-06 07:33:22,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:22,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259476802] [2022-12-06 07:33:22,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259476802] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:22,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:22,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:22,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773705921] [2022-12-06 07:33:22,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:22,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:22,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:22,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:22,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:22,844 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:22,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:22,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:22,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:22,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:22,881 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:22,881 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:22,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:22,881 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:22,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:22,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:22,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:22,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:22,882 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:22,882 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:22,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:22,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:22,883 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:22,883 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:22,883 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:22,883 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:22,883 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:22,883 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:22,883 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:22,883 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:22,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:22,885 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:22,885 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:22,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:22,886 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:22,886 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:22,961 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:22,962 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:22,962 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:22,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:22,962 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:22,962 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:22,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2515 [2022-12-06 07:33:22,963 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-06 07:33:22,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:22,963 INFO L85 PathProgramCache]: Analyzing trace with hash 394955791, now seen corresponding path program 1 times [2022-12-06 07:33:22,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:22,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141310389] [2022-12-06 07:33:22,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:22,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:23,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-06 07:33:23,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:23,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141310389] [2022-12-06 07:33:23,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141310389] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:23,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:23,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:23,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247928104] [2022-12-06 07:33:23,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:23,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:23,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:23,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:23,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:23,034 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:23,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:23,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:23,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:23,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:23,076 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:23,076 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:23,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:23,077 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:23,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:23,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:23,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:23,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:23,077 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:23,077 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:23,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:23,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:23,078 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:23,078 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:23,078 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:23,078 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:23,078 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:23,079 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:23,079 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:23,079 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:23,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:23,081 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:23,081 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:23,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:23,081 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:23,081 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:23,157 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:23,158 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:33:23,158 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:23,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:23,158 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:23,158 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:23,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2516 [2022-12-06 07:33:23,158 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-06 07:33:23,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:23,158 INFO L85 PathProgramCache]: Analyzing trace with hash 425431984, now seen corresponding path program 1 times [2022-12-06 07:33:23,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:23,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915290770] [2022-12-06 07:33:23,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:23,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:23,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-06 07:33:23,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:23,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915290770] [2022-12-06 07:33:23,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915290770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:23,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:23,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:23,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564490249] [2022-12-06 07:33:23,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:23,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:23,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:23,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:23,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:23,224 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:23,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:23,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:23,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:23,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:23,280 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:23,280 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:23,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 352 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:23,281 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:23,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:23,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:23,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:23,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:23,281 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:23,281 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:23,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:23,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:23,282 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:23,282 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:23,282 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:23,282 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:23,282 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:23,282 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:23,282 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:23,283 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:23,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:23,285 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:23,285 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:23,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:23,285 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:23,285 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:23,361 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:23,361 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:23,362 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:23,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:23,362 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:23,362 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:23,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2517 [2022-12-06 07:33:23,362 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-06 07:33:23,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:23,362 INFO L85 PathProgramCache]: Analyzing trace with hash 452214093, now seen corresponding path program 1 times [2022-12-06 07:33:23,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:23,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172993383] [2022-12-06 07:33:23,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:23,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:23,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-06 07:33:23,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:23,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172993383] [2022-12-06 07:33:23,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172993383] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:23,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:23,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:23,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956763142] [2022-12-06 07:33:23,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:23,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:23,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:23,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:23,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:23,430 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:23,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:23,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:23,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:23,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:23,472 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:23,473 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:23,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:23,473 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:23,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:23,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:23,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:23,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:23,474 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:23,474 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:23,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:23,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:23,474 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:23,474 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:23,475 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:23,475 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:23,475 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:23,475 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:23,475 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:23,475 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:23,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:23,477 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:23,477 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:23,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 145 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:23,477 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:23,478 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:23,552 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:23,553 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:23,553 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:23,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:23,553 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:23,553 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:23,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2518 [2022-12-06 07:33:23,553 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-06 07:33:23,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:23,554 INFO L85 PathProgramCache]: Analyzing trace with hash 482690286, now seen corresponding path program 1 times [2022-12-06 07:33:23,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:23,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553587445] [2022-12-06 07:33:23,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:23,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:23,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-06 07:33:23,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:23,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553587445] [2022-12-06 07:33:23,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553587445] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:23,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:23,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:23,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147800198] [2022-12-06 07:33:23,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:23,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:23,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:23,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:23,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:23,621 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:23,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:23,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:23,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:23,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:23,658 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:23,659 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:23,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:23,659 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:23,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:23,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:23,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:23,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:23,660 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:23,660 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:23,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:23,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:23,661 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:23,661 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:23,661 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:23,661 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:23,661 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:23,661 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:23,661 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:23,661 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:23,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:23,663 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:23,663 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:23,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:23,664 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:23,664 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:23,740 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:23,741 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:33:23,742 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:23,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:23,742 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:23,742 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:23,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2519 [2022-12-06 07:33:23,742 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-06 07:33:23,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:23,742 INFO L85 PathProgramCache]: Analyzing trace with hash 509472395, now seen corresponding path program 1 times [2022-12-06 07:33:23,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:23,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465958904] [2022-12-06 07:33:23,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:23,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:23,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-06 07:33:23,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:23,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465958904] [2022-12-06 07:33:23,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465958904] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:23,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:23,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:23,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685298806] [2022-12-06 07:33:23,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:23,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:23,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:23,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:23,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:23,811 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:23,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:23,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:23,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:23,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:23,847 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:23,848 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:23,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:23,848 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:23,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:23,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:23,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:23,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:23,849 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:23,849 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:23,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:23,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:23,849 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:23,849 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:23,850 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:23,850 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:23,850 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:23,850 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:23,850 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:23,850 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:23,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:23,852 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:23,852 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:23,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:23,853 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:23,853 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:23,927 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:23,928 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:23,928 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:23,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:23,928 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:23,928 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:23,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2520 [2022-12-06 07:33:23,928 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-06 07:33:23,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:23,929 INFO L85 PathProgramCache]: Analyzing trace with hash 539948588, now seen corresponding path program 1 times [2022-12-06 07:33:23,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:23,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263013249] [2022-12-06 07:33:23,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:23,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:23,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:23,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:23,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263013249] [2022-12-06 07:33:23,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263013249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:23,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:23,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:23,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802105271] [2022-12-06 07:33:23,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:23,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:23,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:23,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:23,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:23,999 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:23,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:23,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:23,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:23,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:24,036 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:24,036 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:24,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:24,036 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:24,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:24,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:24,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:24,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:24,037 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:24,037 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:24,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:24,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:24,038 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:24,038 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:24,038 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:24,038 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:24,038 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:24,038 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:24,038 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:24,038 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:24,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:24,040 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:24,040 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:24,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:24,041 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:24,041 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:24,114 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:24,114 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:33:24,115 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:24,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:24,115 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:24,115 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:24,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2521 [2022-12-06 07:33:24,115 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-06 07:33:24,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:24,115 INFO L85 PathProgramCache]: Analyzing trace with hash 566730697, now seen corresponding path program 1 times [2022-12-06 07:33:24,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:24,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793528085] [2022-12-06 07:33:24,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:24,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:24,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-06 07:33:24,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:24,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793528085] [2022-12-06 07:33:24,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793528085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:24,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:24,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:24,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6103513] [2022-12-06 07:33:24,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:24,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:24,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:24,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:24,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:24,185 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:24,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:24,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:24,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:24,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:24,227 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:24,227 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:24,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:24,227 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:24,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:24,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:24,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:24,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:24,228 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:24,228 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:24,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:24,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:24,229 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:24,229 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:24,229 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:24,229 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:24,229 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:24,229 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:24,229 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:24,229 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:24,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:24,232 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:24,232 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:24,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:24,232 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:24,232 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:24,306 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:24,307 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:24,307 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:24,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:24,308 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:24,308 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:24,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2522 [2022-12-06 07:33:24,308 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-06 07:33:24,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:24,308 INFO L85 PathProgramCache]: Analyzing trace with hash 597206890, now seen corresponding path program 1 times [2022-12-06 07:33:24,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:24,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400080494] [2022-12-06 07:33:24,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:24,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:24,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-06 07:33:24,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:24,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400080494] [2022-12-06 07:33:24,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400080494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:24,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:24,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:24,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014709707] [2022-12-06 07:33:24,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:24,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:24,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:24,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:24,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:24,389 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:24,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:24,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:24,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:24,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:24,425 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:24,425 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:24,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:24,426 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:24,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:24,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:24,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:24,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:24,426 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:24,426 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:24,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:24,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:24,427 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:24,427 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:24,427 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:24,427 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:24,427 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:24,427 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:24,428 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:24,428 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:24,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:24,430 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:24,430 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:24,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:24,430 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:24,430 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:24,505 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:24,506 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:24,506 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:24,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:24,506 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:24,506 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:24,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2523 [2022-12-06 07:33:24,506 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-06 07:33:24,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:24,506 INFO L85 PathProgramCache]: Analyzing trace with hash 623988999, now seen corresponding path program 1 times [2022-12-06 07:33:24,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:24,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746171963] [2022-12-06 07:33:24,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:24,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:24,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-06 07:33:24,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:24,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746171963] [2022-12-06 07:33:24,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746171963] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:24,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:24,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:24,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734640646] [2022-12-06 07:33:24,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:24,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:24,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:24,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:24,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:24,573 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:24,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:24,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:24,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:24,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:24,610 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:24,610 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:24,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:24,611 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:24,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:24,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:24,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:24,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:24,611 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:24,611 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:24,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:24,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:24,612 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:24,612 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:24,612 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:24,612 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:24,612 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:24,613 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:24,613 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:24,613 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:24,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:24,615 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:24,615 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:24,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:24,615 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:24,615 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:24,689 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:24,690 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:24,691 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:24,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:24,691 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:24,691 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:24,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2524 [2022-12-06 07:33:24,691 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-06 07:33:24,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:24,691 INFO L85 PathProgramCache]: Analyzing trace with hash 654465192, now seen corresponding path program 1 times [2022-12-06 07:33:24,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:24,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094199380] [2022-12-06 07:33:24,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:24,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:24,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-06 07:33:24,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:24,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094199380] [2022-12-06 07:33:24,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094199380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:24,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:24,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:24,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549012355] [2022-12-06 07:33:24,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:24,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:24,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:24,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:24,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:24,756 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:24,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:24,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:24,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:24,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:24,800 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:24,800 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:24,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:24,801 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:24,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:24,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:24,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:24,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:24,801 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:24,801 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:24,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:24,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:24,802 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:24,802 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:24,802 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:24,802 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:24,803 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:24,803 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:24,803 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:24,803 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:24,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:24,805 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:24,805 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:24,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:24,805 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:24,806 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:24,880 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:24,881 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:24,881 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:24,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:24,881 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:24,881 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:24,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2525 [2022-12-06 07:33:24,881 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-06 07:33:24,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:24,881 INFO L85 PathProgramCache]: Analyzing trace with hash 681247301, now seen corresponding path program 1 times [2022-12-06 07:33:24,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:24,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901229246] [2022-12-06 07:33:24,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:24,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:24,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-06 07:33:24,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:24,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901229246] [2022-12-06 07:33:24,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901229246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:24,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:24,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:24,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461257448] [2022-12-06 07:33:24,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:24,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:24,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:24,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:24,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:24,949 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:24,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:24,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:24,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:24,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:24,984 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:24,984 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:24,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 372 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:24,984 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:24,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:24,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:24,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:24,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:24,985 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:24,985 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:24,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:24,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:24,986 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:24,986 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:24,986 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:24,986 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:24,986 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:24,986 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:24,986 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:24,986 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:24,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:24,988 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:24,989 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:24,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:24,989 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:24,989 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:25,067 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:25,068 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:33:25,068 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:25,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:25,068 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:25,068 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:25,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2526 [2022-12-06 07:33:25,068 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-06 07:33:25,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:25,068 INFO L85 PathProgramCache]: Analyzing trace with hash 711723494, now seen corresponding path program 1 times [2022-12-06 07:33:25,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:25,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881179210] [2022-12-06 07:33:25,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:25,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:25,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:25,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-06 07:33:25,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:25,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881179210] [2022-12-06 07:33:25,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881179210] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:25,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:25,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:25,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791418742] [2022-12-06 07:33:25,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:25,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:25,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:25,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:25,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:25,134 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:25,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:25,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:25,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:25,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:25,176 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:25,176 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:25,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:25,177 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:25,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:25,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:25,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:25,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:25,177 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:25,177 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:25,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:25,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:25,178 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:25,178 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:25,178 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:25,178 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:25,178 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:25,178 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:25,178 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:25,179 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:25,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:25,181 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:25,181 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:25,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:25,181 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:25,181 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:25,257 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:25,258 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:33:25,259 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:25,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:25,259 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:25,259 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:25,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2527 [2022-12-06 07:33:25,259 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-06 07:33:25,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:25,259 INFO L85 PathProgramCache]: Analyzing trace with hash 738505603, now seen corresponding path program 1 times [2022-12-06 07:33:25,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:25,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539624769] [2022-12-06 07:33:25,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:25,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:25,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-06 07:33:25,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:25,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539624769] [2022-12-06 07:33:25,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539624769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:25,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:25,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:25,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27582376] [2022-12-06 07:33:25,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:25,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:25,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:25,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:25,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:25,331 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:25,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:25,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:25,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:25,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:25,366 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:25,366 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:25,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:25,367 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:25,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:25,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:25,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:25,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:25,368 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:25,368 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:25,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:25,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:25,368 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:25,368 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:25,368 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:25,369 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:25,369 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:25,369 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:25,369 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:25,369 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:25,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:25,371 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:25,371 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:25,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:25,371 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:25,371 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:25,447 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:25,448 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:25,448 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:25,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:25,448 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:25,448 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:25,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2528 [2022-12-06 07:33:25,448 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-06 07:33:25,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:25,449 INFO L85 PathProgramCache]: Analyzing trace with hash 768981796, now seen corresponding path program 1 times [2022-12-06 07:33:25,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:25,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194949568] [2022-12-06 07:33:25,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:25,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:25,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-06 07:33:25,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:25,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194949568] [2022-12-06 07:33:25,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194949568] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:25,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:25,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:25,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442672611] [2022-12-06 07:33:25,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:25,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:25,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:25,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:25,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:25,523 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:25,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:25,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:25,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:25,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:25,566 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:25,566 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:25,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:25,566 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:25,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:25,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:25,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:25,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:25,567 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:25,567 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:25,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:25,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:25,568 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:25,568 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:25,568 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:25,568 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:25,568 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:25,568 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:25,568 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:25,568 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:25,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:25,570 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:25,570 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:25,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:25,570 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:25,571 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:25,646 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:25,647 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:25,647 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:25,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:25,647 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:25,647 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:25,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2529 [2022-12-06 07:33:25,648 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-06 07:33:25,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:25,648 INFO L85 PathProgramCache]: Analyzing trace with hash 795763905, now seen corresponding path program 1 times [2022-12-06 07:33:25,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:25,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645890674] [2022-12-06 07:33:25,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:25,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:25,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-06 07:33:25,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:25,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645890674] [2022-12-06 07:33:25,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645890674] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:25,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:25,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:25,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046312853] [2022-12-06 07:33:25,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:25,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:25,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:25,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:25,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:25,715 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:25,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:25,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:25,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:25,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:25,750 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:25,751 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:25,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:25,751 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:25,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:25,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:25,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:25,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:25,752 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:25,752 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:25,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:25,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:25,752 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:25,752 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:25,753 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:25,753 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:25,753 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:25,753 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:25,753 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:25,753 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:25,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:25,755 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:25,755 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:25,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:25,755 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:25,756 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:25,830 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:25,831 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:25,831 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:25,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:25,831 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:25,831 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:25,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2530 [2022-12-06 07:33:25,831 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-06 07:33:25,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:25,831 INFO L85 PathProgramCache]: Analyzing trace with hash 826240098, now seen corresponding path program 1 times [2022-12-06 07:33:25,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:25,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525570561] [2022-12-06 07:33:25,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:25,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:25,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:25,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-06 07:33:25,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:25,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525570561] [2022-12-06 07:33:25,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525570561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:25,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:25,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:25,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061068441] [2022-12-06 07:33:25,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:25,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:25,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:25,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:25,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:25,898 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:25,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:25,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:25,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:25,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:25,943 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:25,944 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:25,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:25,944 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:25,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:25,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:25,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:25,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:25,945 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:25,945 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:25,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:25,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:25,946 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:25,946 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:25,946 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:25,946 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:25,946 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:25,946 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:25,946 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:25,946 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:25,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:25,948 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:25,948 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:25,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:25,949 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:25,949 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:26,024 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:26,025 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:26,025 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:26,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:26,025 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:26,025 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:26,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2531 [2022-12-06 07:33:26,025 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-06 07:33:26,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:26,025 INFO L85 PathProgramCache]: Analyzing trace with hash 853022207, now seen corresponding path program 1 times [2022-12-06 07:33:26,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:26,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070537461] [2022-12-06 07:33:26,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:26,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:26,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-06 07:33:26,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:26,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070537461] [2022-12-06 07:33:26,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070537461] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:26,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:26,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:26,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644152300] [2022-12-06 07:33:26,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:26,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:26,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:26,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:26,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:26,093 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:26,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:26,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:26,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:26,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:26,135 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:26,135 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:26,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:26,135 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:26,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:26,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:26,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:26,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:26,136 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:26,136 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:26,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:26,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:26,137 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:26,137 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:26,137 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:26,137 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:26,137 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:26,137 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:26,137 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:26,137 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:26,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:26,139 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:26,139 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:26,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:26,140 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:26,140 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:26,215 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:26,216 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:26,216 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:26,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:26,216 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:26,216 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:26,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2532 [2022-12-06 07:33:26,217 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-06 07:33:26,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:26,217 INFO L85 PathProgramCache]: Analyzing trace with hash 883498400, now seen corresponding path program 1 times [2022-12-06 07:33:26,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:26,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22692820] [2022-12-06 07:33:26,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:26,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:26,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-06 07:33:26,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:26,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22692820] [2022-12-06 07:33:26,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22692820] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:26,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:26,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:26,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822993995] [2022-12-06 07:33:26,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:26,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:26,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:26,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:26,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:26,284 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:26,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:26,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:26,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:26,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:26,320 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:26,320 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:26,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:26,320 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:26,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:26,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:26,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:26,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:26,321 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:26,321 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:26,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:26,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:26,321 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:26,322 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:26,322 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:26,322 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:26,322 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:26,322 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:26,322 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:26,322 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:26,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:26,324 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:26,324 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:26,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:26,325 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:26,325 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:26,400 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:26,401 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:26,401 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:26,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:26,401 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:26,401 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:26,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2533 [2022-12-06 07:33:26,401 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-06 07:33:26,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:26,401 INFO L85 PathProgramCache]: Analyzing trace with hash 910280509, now seen corresponding path program 1 times [2022-12-06 07:33:26,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:26,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606770661] [2022-12-06 07:33:26,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:26,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:26,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-06 07:33:26,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:26,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606770661] [2022-12-06 07:33:26,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606770661] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:26,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:26,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:26,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705525947] [2022-12-06 07:33:26,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:26,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:26,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:26,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:26,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:26,472 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:26,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:26,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:26,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:26,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:26,519 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:26,519 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:26,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 355 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:26,520 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:26,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:26,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:26,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:26,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:26,521 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:26,521 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:26,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:26,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:26,521 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:26,521 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:26,521 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:26,522 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:26,522 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:26,522 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:26,522 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:26,522 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:26,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:26,524 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:26,524 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:26,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:26,524 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:26,524 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:26,601 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:26,602 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:33:26,602 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:26,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:26,602 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:26,602 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:26,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2534 [2022-12-06 07:33:26,602 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-06 07:33:26,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:26,602 INFO L85 PathProgramCache]: Analyzing trace with hash 940756702, now seen corresponding path program 1 times [2022-12-06 07:33:26,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:26,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244585831] [2022-12-06 07:33:26,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:26,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:26,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-06 07:33:26,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:26,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244585831] [2022-12-06 07:33:26,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244585831] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:26,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:26,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:26,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563070029] [2022-12-06 07:33:26,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:26,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:26,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:26,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:26,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:26,668 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:26,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:26,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:26,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:26,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:26,704 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:26,705 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:26,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 349 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:26,705 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:26,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:26,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:26,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:26,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:26,706 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:26,706 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:26,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:26,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:26,706 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:26,706 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:26,707 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:26,707 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:26,707 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:26,707 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:26,707 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:26,707 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:26,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:26,709 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:26,709 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:26,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:26,709 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:26,709 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:26,783 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:26,784 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:26,784 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:26,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:26,784 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:26,784 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:26,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2535 [2022-12-06 07:33:26,784 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-06 07:33:26,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:26,785 INFO L85 PathProgramCache]: Analyzing trace with hash 967538811, now seen corresponding path program 1 times [2022-12-06 07:33:26,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:26,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617474692] [2022-12-06 07:33:26,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:26,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:26,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:26,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:26,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617474692] [2022-12-06 07:33:26,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617474692] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:26,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:26,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:26,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499278742] [2022-12-06 07:33:26,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:26,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:26,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:26,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:26,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:26,855 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:26,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:26,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:26,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:26,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:26,896 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:26,897 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:26,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 353 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:26,897 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:26,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:26,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:26,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:26,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:26,897 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:26,898 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:26,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:26,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:26,898 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:26,898 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:26,898 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:26,898 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:26,899 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:26,899 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:26,899 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:26,899 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:26,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:26,901 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:26,901 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:26,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:26,901 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:26,901 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:26,975 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:26,976 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:26,976 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:26,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:26,976 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:26,976 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:26,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2536 [2022-12-06 07:33:26,976 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-06 07:33:26,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:26,976 INFO L85 PathProgramCache]: Analyzing trace with hash 998015004, now seen corresponding path program 1 times [2022-12-06 07:33:26,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:26,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32515407] [2022-12-06 07:33:26,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:26,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:27,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-06 07:33:27,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:27,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32515407] [2022-12-06 07:33:27,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32515407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:27,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:27,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:27,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570557147] [2022-12-06 07:33:27,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:27,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:27,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:27,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:27,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:27,040 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:27,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:27,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:27,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:27,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:27,084 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:27,084 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:27,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:27,085 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:27,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:27,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:27,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:27,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:27,085 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:27,085 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:27,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:27,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:27,086 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:27,086 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:27,086 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:27,086 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:27,086 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:27,086 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:27,086 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:27,086 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:27,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:27,089 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:27,089 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:27,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:27,089 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:27,089 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:27,165 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:27,166 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:33:27,166 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:27,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:27,166 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:27,166 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:27,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2537 [2022-12-06 07:33:27,166 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-06 07:33:27,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:27,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1024797113, now seen corresponding path program 1 times [2022-12-06 07:33:27,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:27,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360765690] [2022-12-06 07:33:27,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:27,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:27,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-06 07:33:27,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:27,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360765690] [2022-12-06 07:33:27,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360765690] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:27,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:27,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:27,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647985654] [2022-12-06 07:33:27,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:27,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:27,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:27,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:27,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:27,236 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:27,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:27,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:27,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:27,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:27,272 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:27,272 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:27,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:27,273 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:27,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:27,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:27,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:27,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:27,273 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:27,273 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:27,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:27,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:27,274 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:27,274 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:27,274 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:27,274 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:27,274 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:27,274 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:27,274 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:27,274 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:27,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:27,277 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:27,277 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:27,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:27,277 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:27,277 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:27,350 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:27,351 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:27,351 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:27,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:27,351 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:27,351 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:27,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2538 [2022-12-06 07:33:27,351 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-06 07:33:27,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:27,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1055273306, now seen corresponding path program 1 times [2022-12-06 07:33:27,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:27,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968700962] [2022-12-06 07:33:27,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:27,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:27,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-06 07:33:27,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:27,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968700962] [2022-12-06 07:33:27,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968700962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:27,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:27,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:27,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981237804] [2022-12-06 07:33:27,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:27,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:27,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:27,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:27,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:27,419 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:27,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:27,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:27,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:27,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:27,461 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:27,461 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:27,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 349 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:27,462 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:27,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:27,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:27,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:27,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:27,462 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:27,462 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:27,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:27,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:27,463 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:27,463 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:27,463 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:27,463 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:27,463 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:27,464 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:27,464 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:27,464 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:27,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:27,466 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:27,466 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:27,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 118 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:27,466 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:27,466 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:27,540 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:27,541 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:27,541 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:27,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:27,541 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:27,541 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:27,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2539 [2022-12-06 07:33:27,542 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-06 07:33:27,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:27,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1082055415, now seen corresponding path program 1 times [2022-12-06 07:33:27,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:27,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240620149] [2022-12-06 07:33:27,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:27,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:27,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-06 07:33:27,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:27,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240620149] [2022-12-06 07:33:27,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240620149] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:27,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:27,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:27,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674828536] [2022-12-06 07:33:27,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:27,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:27,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:27,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:27,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:27,626 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:27,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:27,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:27,626 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:27,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:27,661 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:27,661 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:27,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:27,662 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:27,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:27,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:27,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:27,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:27,662 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:27,662 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:27,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:27,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:27,663 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:27,663 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:27,663 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:27,663 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:27,663 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:27,663 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:27,664 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:27,664 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:27,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:27,666 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:27,666 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:27,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:27,666 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:27,666 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:27,742 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:27,743 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:33:27,743 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:27,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:27,743 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:27,743 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:27,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2540 [2022-12-06 07:33:27,743 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-06 07:33:27,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:27,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1112531608, now seen corresponding path program 1 times [2022-12-06 07:33:27,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:27,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419119438] [2022-12-06 07:33:27,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:27,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:27,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-06 07:33:27,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:27,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419119438] [2022-12-06 07:33:27,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419119438] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:27,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:27,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:27,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491821948] [2022-12-06 07:33:27,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:27,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:27,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:27,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:27,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:27,809 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:27,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:27,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:27,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:27,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:27,846 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:27,846 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:27,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:27,847 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:27,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:27,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:27,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:27,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:27,847 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:27,847 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:27,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:27,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:27,848 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:27,848 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:27,848 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:27,848 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:27,848 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:27,848 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:27,849 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:27,849 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:27,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:27,851 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:27,851 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:27,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:27,851 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:27,851 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:27,926 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:27,927 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:27,927 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:27,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:27,927 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:27,927 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:27,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2541 [2022-12-06 07:33:27,927 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-06 07:33:27,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:27,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1139313717, now seen corresponding path program 1 times [2022-12-06 07:33:27,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:27,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945331520] [2022-12-06 07:33:27,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:27,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:27,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-06 07:33:27,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:27,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945331520] [2022-12-06 07:33:27,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945331520] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:27,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:27,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:27,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793952655] [2022-12-06 07:33:27,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:27,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:27,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:27,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:27,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:27,996 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:27,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:27,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:27,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:27,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:28,032 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:28,032 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:28,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:28,033 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:28,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:28,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:28,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:28,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:28,033 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:28,033 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:28,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:28,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:28,034 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:28,034 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:28,034 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:28,034 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:28,034 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:28,034 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:28,034 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:28,035 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:28,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:28,037 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:28,037 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:28,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:28,037 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:28,037 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:28,110 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:28,111 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:28,111 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:28,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:28,111 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:28,112 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:28,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2542 [2022-12-06 07:33:28,112 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-06 07:33:28,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:28,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1169789910, now seen corresponding path program 1 times [2022-12-06 07:33:28,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:28,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94414303] [2022-12-06 07:33:28,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:28,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:28,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-06 07:33:28,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:28,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94414303] [2022-12-06 07:33:28,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94414303] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:28,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:28,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:28,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3736085] [2022-12-06 07:33:28,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:28,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:28,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:28,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:28,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:28,178 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:28,178 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:28,178 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:28,178 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:28,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:28,215 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:28,215 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:28,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:28,216 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:28,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:28,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:28,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:28,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:28,216 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:28,216 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:28,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:28,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:28,217 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:28,217 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:28,217 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:28,217 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:28,217 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:28,217 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:28,217 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:28,218 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:28,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:28,220 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:28,220 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:28,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:28,220 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:28,220 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:28,296 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:28,297 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:33:28,297 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:28,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:28,297 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:28,297 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:28,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2543 [2022-12-06 07:33:28,297 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-06 07:33:28,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:28,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1196572019, now seen corresponding path program 1 times [2022-12-06 07:33:28,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:28,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062832720] [2022-12-06 07:33:28,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:28,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:28,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-06 07:33:28,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:28,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062832720] [2022-12-06 07:33:28,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062832720] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:28,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:28,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:28,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009253182] [2022-12-06 07:33:28,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:28,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:28,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:28,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:28,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:28,368 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:28,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:28,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:28,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:28,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:28,410 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:28,410 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:28,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:28,411 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:28,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:28,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:28,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:28,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:28,411 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:28,411 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:28,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:28,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:28,412 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:28,412 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:28,412 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:28,412 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:28,412 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:28,412 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:28,412 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:28,412 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:28,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:28,415 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:28,415 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:28,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:28,415 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:28,415 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:28,489 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:28,490 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:28,490 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:28,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:28,490 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:28,490 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:28,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2544 [2022-12-06 07:33:28,490 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-06 07:33:28,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:28,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1227048212, now seen corresponding path program 1 times [2022-12-06 07:33:28,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:28,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175816851] [2022-12-06 07:33:28,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:28,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:28,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:28,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:28,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175816851] [2022-12-06 07:33:28,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175816851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:28,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:28,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:28,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785864595] [2022-12-06 07:33:28,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:28,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:28,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:28,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:28,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:28,559 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:28,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:28,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:28,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:28,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:28,603 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:28,603 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:28,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:28,603 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:28,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:28,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:28,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:28,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:28,604 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:28,604 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:28,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:28,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:28,605 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:28,605 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:28,605 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:28,605 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:28,605 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:28,605 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:28,605 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:28,605 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:28,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:28,607 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:28,607 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:28,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:28,608 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:28,608 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:28,682 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:28,683 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:28,683 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:28,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:28,683 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:28,683 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:28,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2545 [2022-12-06 07:33:28,683 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-06 07:33:28,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:28,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1253830321, now seen corresponding path program 1 times [2022-12-06 07:33:28,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:28,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607616050] [2022-12-06 07:33:28,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:28,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:28,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-06 07:33:28,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:28,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607616050] [2022-12-06 07:33:28,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607616050] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:28,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:28,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:28,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493293149] [2022-12-06 07:33:28,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:28,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:28,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:28,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:28,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:28,758 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:28,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:28,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:28,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:28,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:28,799 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:28,799 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:28,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:28,800 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:28,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:28,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:28,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:28,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:28,800 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:28,800 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:28,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:28,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:28,801 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:28,801 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:28,801 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:28,801 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:28,801 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:28,801 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:28,801 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:28,801 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:28,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:28,804 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:28,804 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:28,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:28,804 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:28,804 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:28,880 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:28,881 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:33:28,881 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:28,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:28,881 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:28,881 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:28,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2546 [2022-12-06 07:33:28,881 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-06 07:33:28,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:28,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1284306514, now seen corresponding path program 1 times [2022-12-06 07:33:28,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:28,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684372926] [2022-12-06 07:33:28,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:28,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:28,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-06 07:33:28,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:28,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684372926] [2022-12-06 07:33:28,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684372926] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:28,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:28,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:28,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515220188] [2022-12-06 07:33:28,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:28,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:28,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:28,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:28,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:28,950 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:28,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:28,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:28,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:28,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:28,987 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:28,988 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:28,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:28,988 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:28,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:28,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:28,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:28,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:28,989 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:28,989 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:28,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:28,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:28,989 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:28,990 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:28,990 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:28,990 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:28,990 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:28,990 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:28,990 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:28,990 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:28,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:28,992 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:28,992 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:28,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:28,993 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:28,993 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:29,068 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:29,069 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:29,069 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:29,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:29,069 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:29,069 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:29,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2547 [2022-12-06 07:33:29,069 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-06 07:33:29,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:29,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1311088623, now seen corresponding path program 1 times [2022-12-06 07:33:29,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:29,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608788676] [2022-12-06 07:33:29,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:29,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:29,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-06 07:33:29,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:29,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608788676] [2022-12-06 07:33:29,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608788676] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:29,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:29,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:29,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599911983] [2022-12-06 07:33:29,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:29,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:29,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:29,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:29,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:29,138 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:29,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:29,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:29,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:29,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:29,174 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:29,174 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:29,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:29,175 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:29,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:29,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:29,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:29,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:29,175 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:29,176 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:29,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:29,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:29,176 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:29,176 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:29,176 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:29,176 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:29,177 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:29,177 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:29,177 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:29,177 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:29,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:29,179 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:29,179 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:29,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:29,179 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:29,179 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:29,253 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:29,254 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:29,255 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:29,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:29,255 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:29,255 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:29,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2548 [2022-12-06 07:33:29,255 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-06 07:33:29,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:29,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1341564816, now seen corresponding path program 1 times [2022-12-06 07:33:29,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:29,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632113942] [2022-12-06 07:33:29,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:29,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:29,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-06 07:33:29,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:29,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632113942] [2022-12-06 07:33:29,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632113942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:29,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:29,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:29,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174130211] [2022-12-06 07:33:29,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:29,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:29,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:29,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:29,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:29,319 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:29,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:29,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:29,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:29,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:29,362 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:29,362 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:29,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:29,362 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:29,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:29,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:29,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:29,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:29,363 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:29,363 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:29,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:29,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:29,364 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:29,364 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:29,364 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:29,364 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:29,364 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:29,364 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:29,364 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:29,364 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:29,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:29,366 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:29,366 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:29,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:29,367 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:29,367 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:29,441 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:29,442 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:29,442 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:29,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:29,442 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:29,442 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:29,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2549 [2022-12-06 07:33:29,443 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-06 07:33:29,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:29,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1368346925, now seen corresponding path program 1 times [2022-12-06 07:33:29,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:29,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97320129] [2022-12-06 07:33:29,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:29,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:29,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-06 07:33:29,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:29,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97320129] [2022-12-06 07:33:29,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97320129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:29,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:29,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:29,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723879159] [2022-12-06 07:33:29,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:29,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:29,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:29,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:29,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:29,512 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:29,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:29,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:29,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:29,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:29,553 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:29,553 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:29,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:29,554 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:29,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:29,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:29,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:29,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:29,554 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:29,554 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:29,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:29,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:29,555 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:29,555 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:29,555 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:29,555 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:29,555 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:29,555 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:29,556 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:29,556 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:29,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:29,558 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:29,558 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:29,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:29,558 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:29,558 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:29,641 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:29,642 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 07:33:29,642 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:29,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:29,642 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:29,643 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:29,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2550 [2022-12-06 07:33:29,643 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-06 07:33:29,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:29,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1398823118, now seen corresponding path program 1 times [2022-12-06 07:33:29,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:29,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453534022] [2022-12-06 07:33:29,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:29,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:29,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-06 07:33:29,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:29,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453534022] [2022-12-06 07:33:29,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453534022] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:29,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:29,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:29,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665590868] [2022-12-06 07:33:29,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:29,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:29,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:29,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:29,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:29,725 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:29,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:29,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:29,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:29,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:29,767 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:29,767 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:29,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:29,767 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:29,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:29,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:29,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:29,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:29,768 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:29,768 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:29,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:29,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:29,769 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:29,769 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:29,769 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:29,769 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:29,769 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:29,769 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:29,769 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:29,769 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:29,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:29,771 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:29,771 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:29,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:29,772 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:29,772 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:29,846 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:29,847 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:29,847 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:29,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:29,847 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:29,847 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:29,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2551 [2022-12-06 07:33:29,847 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-06 07:33:29,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:29,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1425605227, now seen corresponding path program 1 times [2022-12-06 07:33:29,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:29,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592690938] [2022-12-06 07:33:29,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:29,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:29,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:29,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-06 07:33:29,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:29,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592690938] [2022-12-06 07:33:29,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592690938] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:29,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:29,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:29,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025499577] [2022-12-06 07:33:29,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:29,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:29,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:29,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:29,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:29,913 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:29,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:29,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:29,914 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:29,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:29,950 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:29,950 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:29,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 355 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:29,950 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:29,951 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:29,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:29,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:29,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:29,951 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:29,951 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:29,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:29,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:29,952 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:29,952 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:29,952 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:29,952 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:29,952 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:29,952 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:29,952 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:29,952 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:29,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:29,954 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:29,954 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:29,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:29,955 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:29,955 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:30,030 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:30,031 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:30,031 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:30,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:30,031 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:30,031 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:30,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2552 [2022-12-06 07:33:30,031 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-06 07:33:30,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:30,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1456081420, now seen corresponding path program 1 times [2022-12-06 07:33:30,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:30,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136979029] [2022-12-06 07:33:30,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:30,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:30,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-06 07:33:30,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:30,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136979029] [2022-12-06 07:33:30,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136979029] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:30,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:30,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:30,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489970951] [2022-12-06 07:33:30,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:30,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:30,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:30,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:30,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:30,110 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:30,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:30,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:30,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:30,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:30,153 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:30,153 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:30,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:30,153 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:30,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:30,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:30,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:30,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:30,154 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:30,154 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:30,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:30,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:30,155 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:30,155 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:30,155 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:30,155 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:30,155 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:30,155 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:30,155 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:30,155 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:30,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:30,157 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:30,157 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:30,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:30,158 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:30,158 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:30,233 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:30,234 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:30,234 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:30,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:30,234 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:30,234 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:30,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2553 [2022-12-06 07:33:30,234 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-06 07:33:30,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:30,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1482863529, now seen corresponding path program 1 times [2022-12-06 07:33:30,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:30,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85942302] [2022-12-06 07:33:30,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:30,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:30,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-06 07:33:30,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:30,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85942302] [2022-12-06 07:33:30,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85942302] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:30,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:30,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:30,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485210807] [2022-12-06 07:33:30,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:30,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:30,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:30,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:30,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:30,303 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:30,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:30,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:30,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:30,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:30,338 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:30,338 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:30,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:30,339 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:30,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:30,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:30,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:30,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:30,339 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:30,339 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:30,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:30,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:30,340 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:30,340 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:30,340 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:30,340 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:30,340 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:30,341 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:30,341 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:30,341 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:30,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:30,343 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:30,343 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:30,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:30,343 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:30,344 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:30,421 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:30,422 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:33:30,422 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:30,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:30,422 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:30,422 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:30,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2554 [2022-12-06 07:33:30,422 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-06 07:33:30,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:30,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1513339722, now seen corresponding path program 1 times [2022-12-06 07:33:30,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:30,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134849065] [2022-12-06 07:33:30,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:30,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:30,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-06 07:33:30,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:30,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134849065] [2022-12-06 07:33:30,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134849065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:30,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:30,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:30,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126803590] [2022-12-06 07:33:30,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:30,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:30,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:30,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:30,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:30,492 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:30,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:30,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:30,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:30,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:30,534 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:30,534 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:30,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:30,535 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:30,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:30,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:30,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:30,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:30,535 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:30,536 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:30,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:30,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:30,536 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:30,536 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:30,536 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:30,536 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:30,537 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:30,537 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:30,537 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:30,537 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:30,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:30,539 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:30,539 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:30,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:30,539 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:30,539 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:30,614 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:30,615 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:30,615 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:30,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:30,615 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:30,615 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:30,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2555 [2022-12-06 07:33:30,615 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-06 07:33:30,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:30,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1540121831, now seen corresponding path program 1 times [2022-12-06 07:33:30,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:30,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605610915] [2022-12-06 07:33:30,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:30,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:30,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-06 07:33:30,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:30,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605610915] [2022-12-06 07:33:30,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605610915] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:30,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:30,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:30,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281740001] [2022-12-06 07:33:30,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:30,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:30,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:30,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:30,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:30,684 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:30,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:30,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:30,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:30,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:30,720 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:30,720 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:30,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:30,721 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:30,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:30,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:30,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:30,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:30,721 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:30,721 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:30,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:30,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:30,722 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:30,722 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:30,722 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:30,722 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:30,722 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:30,722 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:30,722 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:30,723 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:30,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:30,725 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:30,725 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:30,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:30,725 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:30,725 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:30,799 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:30,800 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:30,800 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:30,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:30,800 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:30,800 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:30,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2556 [2022-12-06 07:33:30,800 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-06 07:33:30,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:30,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1570598024, now seen corresponding path program 1 times [2022-12-06 07:33:30,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:30,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192886234] [2022-12-06 07:33:30,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:30,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:30,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-06 07:33:30,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:30,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192886234] [2022-12-06 07:33:30,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192886234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:30,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:30,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:30,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903186078] [2022-12-06 07:33:30,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:30,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:30,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:30,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:30,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:30,881 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:30,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:30,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:30,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:30,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:30,923 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:30,923 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:30,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:30,924 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:30,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:30,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:30,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:30,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:30,924 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:30,924 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:30,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:30,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:30,925 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:30,925 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:30,925 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:30,925 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:30,925 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:30,926 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:30,926 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:30,926 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:30,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:30,928 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:30,928 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:30,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:30,928 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:30,928 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:31,001 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:31,002 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:31,002 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:31,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:31,002 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:31,002 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:31,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2557 [2022-12-06 07:33:31,002 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-06 07:33:31,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:31,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1597380133, now seen corresponding path program 1 times [2022-12-06 07:33:31,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:31,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359830640] [2022-12-06 07:33:31,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:31,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:31,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33: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-06 07:33:31,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:31,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359830640] [2022-12-06 07:33:31,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359830640] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:31,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:31,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:31,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686983416] [2022-12-06 07:33:31,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:31,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:31,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:31,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:31,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:31,075 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:31,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:31,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:31,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:31,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:31,112 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:31,113 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:31,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:31,113 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:31,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:31,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:31,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:31,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:31,114 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:31,114 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:31,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:31,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:31,115 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:31,115 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:31,115 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:31,115 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:31,115 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:31,115 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:31,115 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:31,115 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:31,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:31,117 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:31,117 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:31,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:31,118 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:31,118 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:31,193 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:31,194 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:31,194 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:31,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:31,194 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:31,194 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:31,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2558 [2022-12-06 07:33:31,194 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-06 07:33:31,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:31,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1627856326, now seen corresponding path program 1 times [2022-12-06 07:33:31,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:31,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53807969] [2022-12-06 07:33:31,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:31,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:31,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-06 07:33:31,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:31,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53807969] [2022-12-06 07:33:31,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53807969] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:31,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:31,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:31,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559804245] [2022-12-06 07:33:31,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:31,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:31,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:31,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:31,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:31,260 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:31,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:31,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:31,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:31,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:31,302 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:31,302 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:31,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:31,303 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:31,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:31,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:31,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:31,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:31,303 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:31,303 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:31,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:31,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:31,304 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:31,304 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:31,304 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:31,304 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:31,304 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:31,304 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:31,305 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:31,305 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:31,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:31,307 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:31,307 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:31,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:31,307 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:31,307 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:31,381 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:31,382 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:31,382 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:31,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:31,382 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:31,382 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:31,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2559 [2022-12-06 07:33:31,383 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-06 07:33:31,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:31,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1654638435, now seen corresponding path program 1 times [2022-12-06 07:33:31,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:31,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957296573] [2022-12-06 07:33:31,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:31,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:31,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-06 07:33:31,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:31,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957296573] [2022-12-06 07:33:31,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957296573] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:31,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:31,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:31,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282116852] [2022-12-06 07:33:31,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:31,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:31,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:31,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:31,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:31,451 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:31,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:31,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:31,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:31,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:31,492 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:31,492 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:31,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:31,493 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:31,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:31,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:31,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:31,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:31,493 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:31,493 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:31,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:31,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:31,494 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:31,494 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:31,494 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:31,494 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:31,494 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:31,495 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:31,495 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:31,495 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:31,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:31,497 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:31,497 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:31,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:31,497 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:31,497 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:31,572 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:31,573 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:31,573 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:31,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:31,573 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:31,573 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:31,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2560 [2022-12-06 07:33:31,573 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-06 07:33:31,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:31,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1685114628, now seen corresponding path program 1 times [2022-12-06 07:33:31,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:31,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90162066] [2022-12-06 07:33:31,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:31,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:31,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:31,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-06 07:33:31,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:31,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90162066] [2022-12-06 07:33:31,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90162066] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:31,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:31,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:31,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936594801] [2022-12-06 07:33:31,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:31,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:31,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:31,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:31,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:31,638 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:31,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:31,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:31,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:31,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:31,680 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:31,680 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:31,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:31,681 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:31,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:31,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:31,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:31,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:31,681 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:31,681 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:31,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:31,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:31,682 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:31,682 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:31,682 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:31,682 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:31,682 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:31,682 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:31,682 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:31,682 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:31,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:31,685 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:31,685 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:31,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:31,685 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:31,685 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:31,759 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:31,760 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:31,760 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:31,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:31,760 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:31,761 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:31,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2561 [2022-12-06 07:33:31,761 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-06 07:33:31,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:31,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1711896737, now seen corresponding path program 1 times [2022-12-06 07:33:31,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:31,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092044702] [2022-12-06 07:33:31,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:31,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:31,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-06 07:33:31,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:31,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092044702] [2022-12-06 07:33:31,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092044702] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:31,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:31,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:31,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605261488] [2022-12-06 07:33:31,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:31,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:31,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:31,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:31,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:31,833 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:31,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:31,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:31,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:31,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:31,876 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:31,876 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:31,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:31,877 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:31,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:31,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:31,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:31,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:31,877 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:31,877 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:31,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:31,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:31,878 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:31,878 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:31,878 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:31,878 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:31,878 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:31,878 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:31,878 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:31,879 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:31,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:31,881 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:31,881 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:31,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:31,881 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:31,881 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:31,956 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:31,957 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:31,957 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:31,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:31,957 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:31,957 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:31,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2562 [2022-12-06 07:33:31,957 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-06 07:33:31,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:31,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1742372930, now seen corresponding path program 1 times [2022-12-06 07:33:31,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:31,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601920118] [2022-12-06 07:33:31,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:31,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:32,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-06 07:33:32,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:32,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601920118] [2022-12-06 07:33:32,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601920118] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:32,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:32,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:32,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063820671] [2022-12-06 07:33:32,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:32,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:32,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:32,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:32,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:32,031 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:32,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:32,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:32,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:32,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:32,072 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:32,072 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:32,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:32,072 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:32,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:32,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:32,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:32,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:32,073 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:32,073 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:32,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:32,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:32,074 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:32,074 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:32,074 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:32,074 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:32,074 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:32,074 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:32,074 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:32,074 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:32,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:32,076 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:32,076 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:32,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:32,077 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:32,077 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:32,152 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:32,153 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:32,153 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:32,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:32,153 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:32,153 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:32,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2563 [2022-12-06 07:33:32,153 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-06 07:33:32,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:32,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1769155039, now seen corresponding path program 1 times [2022-12-06 07:33:32,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:32,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781101447] [2022-12-06 07:33:32,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:32,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:32,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:32,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:32,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781101447] [2022-12-06 07:33:32,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781101447] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:32,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:32,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:32,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583700540] [2022-12-06 07:33:32,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:32,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:32,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:32,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:32,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:32,221 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:32,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:32,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:32,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:32,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:32,262 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:32,262 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:32,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:32,262 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:32,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:32,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:32,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:32,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:32,263 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:32,263 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:32,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:32,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:32,264 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:32,264 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:32,264 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:32,264 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:32,264 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:32,264 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:32,264 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:32,264 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:32,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:32,266 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:32,266 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:32,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:32,267 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:32,267 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:32,342 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:32,343 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:32,343 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:32,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:32,343 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:32,343 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:32,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2564 [2022-12-06 07:33:32,343 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-06 07:33:32,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:32,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1799631232, now seen corresponding path program 1 times [2022-12-06 07:33:32,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:32,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990264829] [2022-12-06 07:33:32,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:32,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:32,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-06 07:33:32,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:32,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990264829] [2022-12-06 07:33:32,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990264829] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:32,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:32,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:32,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817567161] [2022-12-06 07:33:32,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:32,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:32,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:32,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:32,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:32,410 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:32,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:32,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:32,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:32,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:32,451 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:32,452 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:32,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:32,452 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:32,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:32,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:32,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:32,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:32,453 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:32,453 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:32,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:32,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:32,453 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:32,454 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:32,454 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:32,454 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:32,454 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:32,454 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:32,454 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:32,454 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:32,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:32,456 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:32,456 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:32,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:32,457 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:32,457 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:32,533 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:32,534 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:33:32,534 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:32,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:32,534 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:32,534 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:32,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2565 [2022-12-06 07:33:32,535 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-06 07:33:32,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:32,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1826413341, now seen corresponding path program 1 times [2022-12-06 07:33:32,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:32,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657478657] [2022-12-06 07:33:32,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:32,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:32,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:32,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:32,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657478657] [2022-12-06 07:33:32,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657478657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:32,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:32,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:32,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802808594] [2022-12-06 07:33:32,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:32,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:32,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:32,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:32,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:32,606 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:32,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:32,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:32,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:32,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:32,648 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:32,648 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:32,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:32,649 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:32,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:32,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:32,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:32,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:32,649 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:32,649 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:32,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:32,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:32,650 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:32,650 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:32,650 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:32,650 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:32,650 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:32,650 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:32,650 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:32,650 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:32,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:32,653 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:32,653 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:32,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:32,653 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:32,653 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:32,728 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:32,729 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:32,729 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:32,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:32,729 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:32,729 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:32,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2566 [2022-12-06 07:33:32,729 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-06 07:33:32,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:32,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1856889534, now seen corresponding path program 1 times [2022-12-06 07:33:32,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:32,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981106829] [2022-12-06 07:33:32,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:32,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:32,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-06 07:33:32,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:32,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981106829] [2022-12-06 07:33:32,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981106829] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:32,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:32,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:32,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635644580] [2022-12-06 07:33:32,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:32,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:32,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:32,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:32,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:32,794 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:32,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:32,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:32,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:32,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:32,831 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:32,832 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:32,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:32,832 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:32,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:32,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:32,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:32,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:32,833 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:32,833 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:32,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:32,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:32,833 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:32,833 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:32,834 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:32,834 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:32,834 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:32,834 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:32,834 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:32,834 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:32,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:32,836 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:32,836 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:32,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:32,836 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:32,836 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:32,911 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:32,912 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:32,912 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:32,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:32,912 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:32,912 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:32,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2567 [2022-12-06 07:33:32,912 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-06 07:33:32,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:32,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1883671643, now seen corresponding path program 1 times [2022-12-06 07:33:32,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:32,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139492799] [2022-12-06 07:33:32,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:32,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:32,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:32,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-06 07:33:32,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:32,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139492799] [2022-12-06 07:33:32,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139492799] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:32,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:32,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:32,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686389757] [2022-12-06 07:33:32,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:32,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:32,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:32,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:32,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:32,996 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:32,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:32,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:32,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:32,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:33,035 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:33,035 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:33,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:33,036 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:33,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:33,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:33,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:33,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:33,036 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:33,037 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:33,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:33,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:33,037 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:33,037 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:33,037 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:33,037 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:33,037 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:33,038 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:33,038 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:33,038 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:33,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:33,040 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:33,040 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:33,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:33,040 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:33,040 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:33,116 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:33,117 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:33:33,117 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:33,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:33,117 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:33,117 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:33,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2568 [2022-12-06 07:33:33,117 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-06 07:33:33,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:33,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1914147836, now seen corresponding path program 1 times [2022-12-06 07:33:33,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:33,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568216545] [2022-12-06 07:33:33,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:33,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:33,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-06 07:33:33,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:33,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568216545] [2022-12-06 07:33:33,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568216545] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:33,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:33,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:33,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680089034] [2022-12-06 07:33:33,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:33,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:33,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:33,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:33,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:33,186 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:33,187 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:33,187 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:33,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:33,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:33,224 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:33,224 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:33,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:33,225 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:33,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:33,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:33,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:33,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:33,225 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:33,225 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:33,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:33,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:33,226 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:33,226 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:33,226 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:33,226 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:33,226 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:33,226 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:33,226 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:33,227 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:33,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:33,229 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:33,229 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:33,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:33,229 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:33,229 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:33,303 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:33,304 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:33,304 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:33,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:33,304 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:33,304 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:33,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2569 [2022-12-06 07:33:33,305 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-06 07:33:33,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:33,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1940929945, now seen corresponding path program 1 times [2022-12-06 07:33:33,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:33,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828525192] [2022-12-06 07:33:33,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:33,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33: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-06 07:33:33,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:33,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828525192] [2022-12-06 07:33:33,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828525192] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:33,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:33,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:33,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180782749] [2022-12-06 07:33:33,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:33,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:33,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:33,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:33,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:33,378 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:33,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:33,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:33,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:33,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:33,414 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:33,415 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:33,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:33,415 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:33,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:33,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:33,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:33,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:33,416 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:33,416 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:33,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:33,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:33,416 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:33,417 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:33,417 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:33,417 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:33,417 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:33,417 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:33,417 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:33,417 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:33,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:33,419 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:33,419 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:33,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:33,420 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:33,420 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:33,495 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:33,496 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:33,496 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:33,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:33,496 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:33,496 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:33,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2570 [2022-12-06 07:33:33,496 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-06 07:33:33,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:33,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1971406138, now seen corresponding path program 1 times [2022-12-06 07:33:33,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:33,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765103656] [2022-12-06 07:33:33,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:33,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:33,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-06 07:33:33,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:33,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765103656] [2022-12-06 07:33:33,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765103656] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:33,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:33,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:33,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28455437] [2022-12-06 07:33:33,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:33,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:33,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:33,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:33,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:33,563 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:33,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:33,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:33,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:33,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:33,604 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:33,604 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:33,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:33,605 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:33,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:33,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:33,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:33,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:33,605 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:33,605 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:33,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:33,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:33,606 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:33,606 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:33,606 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:33,606 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:33,606 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:33,606 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:33,606 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:33,607 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:33,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:33,609 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:33,609 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:33,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:33,609 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:33,609 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:33,683 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:33,684 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:33,684 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:33,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:33,684 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:33,684 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:33,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2571 [2022-12-06 07:33:33,684 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-06 07:33:33,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:33,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1998188247, now seen corresponding path program 1 times [2022-12-06 07:33:33,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:33,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684911107] [2022-12-06 07:33:33,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:33,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:33,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-06 07:33:33,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:33,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684911107] [2022-12-06 07:33:33,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684911107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:33,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:33,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:33,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811437271] [2022-12-06 07:33:33,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:33,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:33,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:33,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:33,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:33,754 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:33,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:33,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:33,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:33,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:33,795 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:33,796 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:33,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:33,796 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:33,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:33,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:33,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:33,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:33,797 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:33,797 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:33,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:33,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:33,797 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:33,798 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:33,798 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:33,798 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:33,798 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:33,798 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:33,798 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:33,798 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:33,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:33,800 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:33,800 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:33,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:33,801 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:33,801 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:33,874 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:33,875 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:33,875 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:33,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:33,875 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:33,876 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:33,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2572 [2022-12-06 07:33:33,876 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-06 07:33:33,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:33,876 INFO L85 PathProgramCache]: Analyzing trace with hash 2028664440, now seen corresponding path program 1 times [2022-12-06 07:33:33,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:33,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284095644] [2022-12-06 07:33:33,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:33,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:33,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-06 07:33:33,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:33,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284095644] [2022-12-06 07:33:33,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284095644] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:33,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:33,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:33,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115541734] [2022-12-06 07:33:33,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:33,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:33,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:33,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:33,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:33,941 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:33,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:33,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:33,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:33,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:33,978 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:33,978 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:33,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:33,979 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:33,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:33,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:33,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:33,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:33,980 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:33,980 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:33,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:33,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:33,980 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:33,980 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:33,981 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:33,981 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:33,981 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:33,981 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:33,981 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:33,981 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:33,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:33,983 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:33,983 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:33,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:33,984 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:33,984 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:34,060 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:34,061 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:33:34,061 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:34,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:34,061 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:34,061 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:34,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2573 [2022-12-06 07:33:34,061 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-06 07:33:34,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:34,061 INFO L85 PathProgramCache]: Analyzing trace with hash 2055446549, now seen corresponding path program 1 times [2022-12-06 07:33:34,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:34,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199756216] [2022-12-06 07:33:34,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:34,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:34,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:34,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:34,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199756216] [2022-12-06 07:33:34,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199756216] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:34,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:34,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:34,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706919605] [2022-12-06 07:33:34,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:34,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:34,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:34,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:34,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:34,148 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:34,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:34,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:34,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:34,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:34,184 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:34,184 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:34,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:34,185 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:34,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:34,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:34,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:34,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:34,185 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:34,185 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:34,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:34,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:34,186 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:34,186 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:34,186 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:34,186 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:34,186 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:34,187 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:34,187 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:34,187 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:34,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:34,189 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:34,189 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:34,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:34,189 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:34,189 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:34,263 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:34,264 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:34,264 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:34,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:34,264 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:34,264 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:34,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2574 [2022-12-06 07:33:34,264 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-06 07:33:34,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:34,265 INFO L85 PathProgramCache]: Analyzing trace with hash 2085922742, now seen corresponding path program 1 times [2022-12-06 07:33:34,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:34,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112170768] [2022-12-06 07:33:34,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:34,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:34,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-06 07:33:34,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:34,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112170768] [2022-12-06 07:33:34,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112170768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:34,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:34,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:34,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672439137] [2022-12-06 07:33:34,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:34,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:34,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:34,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:34,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:34,331 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:34,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:34,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:34,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:34,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:34,373 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:34,373 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:34,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:34,374 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:34,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:34,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:34,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:34,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:34,374 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:34,374 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:34,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:34,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:34,375 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:34,375 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:34,375 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:34,375 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:34,375 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:34,375 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:34,375 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:34,375 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:34,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:34,378 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:34,378 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:34,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:34,378 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:34,378 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:34,453 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:34,454 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:34,454 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:34,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:34,454 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:34,454 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:34,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2575 [2022-12-06 07:33:34,454 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-06 07:33:34,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:34,455 INFO L85 PathProgramCache]: Analyzing trace with hash 2112704851, now seen corresponding path program 1 times [2022-12-06 07:33:34,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:34,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372859312] [2022-12-06 07:33:34,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:34,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:34,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-06 07:33:34,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:34,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372859312] [2022-12-06 07:33:34,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372859312] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:34,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:34,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:34,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668087441] [2022-12-06 07:33:34,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:34,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:34,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:34,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:34,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:34,523 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:34,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:34,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:34,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:34,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:34,559 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:34,559 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:34,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:34,559 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:34,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:34,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:34,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:34,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:34,560 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:34,560 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:34,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:34,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:34,561 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:34,561 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:34,561 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:34,561 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:34,561 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:34,561 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:34,561 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:34,561 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:34,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:34,564 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:34,564 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:34,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:34,564 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:34,564 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:34,639 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:34,640 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:34,640 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:34,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:34,640 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:34,640 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:34,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2576 [2022-12-06 07:33:34,640 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-06 07:33:34,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:34,640 INFO L85 PathProgramCache]: Analyzing trace with hash 2143181044, now seen corresponding path program 1 times [2022-12-06 07:33:34,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:34,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778526423] [2022-12-06 07:33:34,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:34,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:34,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-06 07:33:34,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:34,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778526423] [2022-12-06 07:33:34,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778526423] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:34,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:34,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:34,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135863683] [2022-12-06 07:33:34,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:34,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:34,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:34,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:34,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:34,707 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:34,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:34,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:34,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:34,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:34,749 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:34,750 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:34,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:34,750 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:34,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:34,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:34,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:34,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:34,751 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:34,751 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:34,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:34,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:34,751 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:34,751 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:34,752 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:34,752 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:34,752 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:34,752 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:34,752 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:34,752 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:34,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:34,755 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:34,755 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:34,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:34,756 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:34,756 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:34,836 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:34,837 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 07:33:34,837 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:34,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:34,837 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:34,837 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:34,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2577 [2022-12-06 07:33:34,837 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-06 07:33:34,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:34,837 INFO L85 PathProgramCache]: Analyzing trace with hash -2125004143, now seen corresponding path program 1 times [2022-12-06 07:33:34,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:34,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68614762] [2022-12-06 07:33:34,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:34,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:34,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-06 07:33:34,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:34,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68614762] [2022-12-06 07:33:34,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68614762] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:34,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:34,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:34,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331166422] [2022-12-06 07:33:34,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:34,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:34,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:34,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:34,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:34,907 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:34,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:34,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:34,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:34,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:34,947 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:34,947 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:34,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:34,948 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:34,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:34,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:34,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:34,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:34,948 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:34,948 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:34,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:34,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:34,949 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:34,949 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:34,949 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:34,949 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:34,949 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:34,949 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:34,949 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:34,950 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:34,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:34,952 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:34,952 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:34,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:34,952 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:34,952 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:35,027 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:35,028 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:35,028 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:35,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:35,028 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:35,028 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:35,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2578 [2022-12-06 07:33:35,028 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-06 07:33:35,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:35,029 INFO L85 PathProgramCache]: Analyzing trace with hash -2094527950, now seen corresponding path program 1 times [2022-12-06 07:33:35,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:35,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789690690] [2022-12-06 07:33:35,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:35,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:35,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:35,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-06 07:33:35,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:35,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789690690] [2022-12-06 07:33:35,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789690690] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:35,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:35,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:35,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731813638] [2022-12-06 07:33:35,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:35,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:35,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:35,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:35,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:35,097 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:35,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:35,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:35,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:35,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:35,134 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:35,134 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:35,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:35,134 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:35,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:35,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:35,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:35,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:35,135 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:35,135 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:35,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:35,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:35,136 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:35,136 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:35,136 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:35,136 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:35,136 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:35,136 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:35,136 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:35,136 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:35,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:35,138 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:35,139 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:35,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:35,139 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:35,139 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:35,224 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:35,225 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 07:33:35,225 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:35,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:35,225 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:35,225 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:35,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2579 [2022-12-06 07:33:35,225 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-06 07:33:35,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:35,225 INFO L85 PathProgramCache]: Analyzing trace with hash -2067745841, now seen corresponding path program 1 times [2022-12-06 07:33:35,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:35,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510508315] [2022-12-06 07:33:35,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:35,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:35,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:35,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-06 07:33:35,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:35,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510508315] [2022-12-06 07:33:35,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510508315] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:35,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:35,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:35,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360554022] [2022-12-06 07:33:35,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:35,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:35,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:35,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:35,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:35,292 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:35,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:35,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:35,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:35,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:35,333 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:35,333 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:35,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:35,334 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:35,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:35,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:35,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:35,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:35,334 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:35,334 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:35,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:35,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:35,335 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:35,335 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:35,335 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:35,335 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:35,335 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:35,335 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:35,335 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:35,335 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:35,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:35,338 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:35,338 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:35,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:35,338 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:35,338 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:35,412 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:35,413 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:35,413 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:35,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:35,413 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:35,413 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:35,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2580 [2022-12-06 07:33:35,413 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-06 07:33:35,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:35,413 INFO L85 PathProgramCache]: Analyzing trace with hash -2037269648, now seen corresponding path program 1 times [2022-12-06 07:33:35,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:35,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455390171] [2022-12-06 07:33:35,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:35,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:35,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-06 07:33:35,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:35,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455390171] [2022-12-06 07:33:35,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455390171] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:35,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:35,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:35,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918667930] [2022-12-06 07:33:35,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:35,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:35,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:35,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:35,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:35,479 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:35,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:35,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:35,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:35,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:35,515 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:35,516 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:35,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:35,516 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:35,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:35,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:35,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:35,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:35,517 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:35,517 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:35,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:35,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:35,517 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:35,517 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:35,518 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:35,518 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:35,518 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:35,518 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:35,518 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:35,518 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:35,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:35,520 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:35,520 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:35,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:35,521 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:35,521 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:35,595 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:35,596 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:35,596 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:35,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:35,596 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:35,596 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:35,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2581 [2022-12-06 07:33:35,596 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-06 07:33:35,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:35,596 INFO L85 PathProgramCache]: Analyzing trace with hash -2010487539, now seen corresponding path program 1 times [2022-12-06 07:33:35,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:35,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954430118] [2022-12-06 07:33:35,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:35,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:35,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-06 07:33:35,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:35,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954430118] [2022-12-06 07:33:35,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954430118] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:35,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:35,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:35,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954273469] [2022-12-06 07:33:35,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:35,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:35,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:35,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:35,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:35,666 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:35,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:35,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:35,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:35,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:35,701 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:35,701 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:35,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:35,701 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:35,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:35,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:35,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:35,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:35,702 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:35,702 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:35,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:35,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:35,702 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:35,703 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:35,703 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:35,703 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:35,703 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:35,703 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:35,703 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:35,703 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:35,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:35,705 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:35,705 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:35,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:35,706 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:35,706 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:35,780 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:35,781 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:35,781 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:35,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:35,781 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:35,781 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:35,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2582 [2022-12-06 07:33:35,782 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-06 07:33:35,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:35,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1980011346, now seen corresponding path program 1 times [2022-12-06 07:33:35,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:35,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565899458] [2022-12-06 07:33:35,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:35,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:35,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-06 07:33:35,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:35,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565899458] [2022-12-06 07:33:35,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565899458] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:35,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:35,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:35,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481227528] [2022-12-06 07:33:35,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:35,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:35,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:35,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:35,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:35,849 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:35,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:35,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:35,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:35,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:35,892 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:35,893 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:35,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:35,893 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:35,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:35,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:35,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:35,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:35,894 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:35,894 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:35,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:35,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:35,895 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:35,895 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:35,895 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:35,895 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:35,895 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:35,895 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:35,895 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:35,895 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:35,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:35,897 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:35,897 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:35,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:35,898 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:35,898 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:35,972 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:35,973 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:35,973 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:35,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:35,973 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:35,973 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:35,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2583 [2022-12-06 07:33:35,974 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-06 07:33:35,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:35,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1953229237, now seen corresponding path program 1 times [2022-12-06 07:33:35,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:35,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574172807] [2022-12-06 07:33:35,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:35,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:36,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-06 07:33:36,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:36,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574172807] [2022-12-06 07:33:36,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574172807] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:36,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:36,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:36,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220936370] [2022-12-06 07:33:36,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:36,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:36,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:36,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:36,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:36,045 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:36,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:36,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:36,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:36,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:36,084 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:36,084 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:36,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:36,085 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:36,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:36,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:36,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:36,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:36,085 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:36,085 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:36,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:36,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:36,086 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:36,086 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:36,086 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:36,086 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:36,086 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:36,086 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:36,087 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:36,087 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:36,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:36,089 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:36,089 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:36,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:36,089 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:36,089 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:36,163 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:36,164 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:36,165 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:36,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:36,165 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:36,165 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:36,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2584 [2022-12-06 07:33:36,165 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-06 07:33:36,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:36,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1922753044, now seen corresponding path program 1 times [2022-12-06 07:33:36,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:36,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694167777] [2022-12-06 07:33:36,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:36,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:36,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-06 07:33:36,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:36,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694167777] [2022-12-06 07:33:36,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694167777] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:36,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:36,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:36,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864144225] [2022-12-06 07:33:36,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:36,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:36,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:36,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:36,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:36,246 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:36,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:36,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:36,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:36,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:36,289 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:36,289 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:36,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:36,290 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:36,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:36,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:36,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:36,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:36,290 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:36,290 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:36,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:36,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:36,291 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:36,291 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:36,291 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:36,291 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:36,291 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:36,291 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:36,291 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:36,291 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:36,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:36,294 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:36,294 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:36,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:36,294 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:36,294 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:36,367 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:36,368 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:36,368 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:36,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:36,368 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:36,368 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:36,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2585 [2022-12-06 07:33:36,368 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-06 07:33:36,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:36,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1895970935, now seen corresponding path program 1 times [2022-12-06 07:33:36,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:36,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943448324] [2022-12-06 07:33:36,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:36,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:36,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:36,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-06 07:33:36,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:36,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943448324] [2022-12-06 07:33:36,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943448324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:36,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:36,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:36,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265636799] [2022-12-06 07:33:36,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:36,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:36,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:36,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:36,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:36,436 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:36,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:36,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:36,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:36,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:36,476 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:36,476 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:36,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:36,476 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:36,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:36,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:36,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:36,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:36,477 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:36,477 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:36,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:36,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:36,478 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:36,478 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:36,478 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:36,478 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:36,478 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:36,478 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:36,478 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:36,478 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:36,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:36,480 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:36,480 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:36,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:36,481 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:36,481 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:36,553 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:36,555 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:36,555 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:36,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:36,555 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:36,555 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:36,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2586 [2022-12-06 07:33:36,555 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-06 07:33:36,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:36,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1865494742, now seen corresponding path program 1 times [2022-12-06 07:33:36,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:36,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125142455] [2022-12-06 07:33:36,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:36,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:36,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:36,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-06 07:33:36,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:36,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125142455] [2022-12-06 07:33:36,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125142455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:36,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:36,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:36,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607372033] [2022-12-06 07:33:36,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:36,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:36,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:36,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:36,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:36,620 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:36,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:36,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:36,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:36,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:36,661 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:36,662 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:36,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:36,662 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:36,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:36,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:36,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:36,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:36,663 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:36,663 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:36,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:36,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:36,664 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:36,664 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:36,664 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:36,664 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:36,664 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:36,664 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:36,664 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:36,664 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:36,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:36,666 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:36,666 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:36,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:36,667 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:36,667 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:36,741 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:36,742 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:36,742 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:36,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:36,742 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:36,742 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:36,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2587 [2022-12-06 07:33:36,742 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-06 07:33:36,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:36,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1838712633, now seen corresponding path program 1 times [2022-12-06 07:33:36,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:36,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932430766] [2022-12-06 07:33:36,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:36,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:36,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-06 07:33:36,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:36,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932430766] [2022-12-06 07:33:36,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932430766] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:36,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:36,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:36,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129432852] [2022-12-06 07:33:36,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:36,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:36,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:36,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:36,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:36,812 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:36,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:36,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:36,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:36,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:36,848 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:36,848 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:36,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:36,849 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:36,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:36,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:36,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:36,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:36,849 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:36,849 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:36,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:36,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:36,850 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:36,850 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:36,850 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:36,850 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:36,850 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:36,850 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:36,850 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:36,851 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:36,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:36,853 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:36,853 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:36,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:36,853 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:36,853 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:36,927 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:36,928 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:36,928 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:36,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:36,928 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:36,928 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:36,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2588 [2022-12-06 07:33:36,929 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-06 07:33:36,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:36,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1808236440, now seen corresponding path program 1 times [2022-12-06 07:33:36,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:36,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225661527] [2022-12-06 07:33:36,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:36,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:36,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-06 07:33:36,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:36,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225661527] [2022-12-06 07:33:36,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225661527] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:36,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:36,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:36,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764624223] [2022-12-06 07:33:36,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:36,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:36,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:36,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:36,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:36,993 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:36,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:36,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:36,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:36,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:37,030 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:37,030 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:37,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:37,030 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:37,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:37,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:37,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:37,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:37,031 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:37,031 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:37,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:37,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:37,032 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:37,032 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:37,032 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:37,032 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:37,032 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:37,032 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:37,032 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:37,032 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:37,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:37,034 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:37,034 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:37,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:37,035 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:37,035 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:37,111 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:37,112 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:33:37,112 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:37,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:37,112 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:37,112 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:37,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2589 [2022-12-06 07:33:37,112 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-06 07:33:37,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:37,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1781454331, now seen corresponding path program 1 times [2022-12-06 07:33:37,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:37,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397403678] [2022-12-06 07:33:37,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:37,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:37,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-06 07:33:37,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:37,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397403678] [2022-12-06 07:33:37,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397403678] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:37,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:37,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:37,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070548266] [2022-12-06 07:33:37,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:37,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:37,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:37,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:37,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:37,181 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:37,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:37,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:37,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:37,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:37,217 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:37,217 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:37,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:37,218 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:37,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:37,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:37,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:37,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:37,218 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:37,218 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:37,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:37,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:37,219 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:37,219 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:37,219 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:37,219 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:37,219 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:37,220 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:37,220 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:37,220 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:37,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:37,222 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:37,222 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:37,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:37,222 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:37,222 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:37,296 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:37,297 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:37,297 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:37,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:37,297 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:37,297 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:37,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2590 [2022-12-06 07:33:37,298 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-06 07:33:37,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:37,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1750978138, now seen corresponding path program 1 times [2022-12-06 07:33:37,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:37,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363142434] [2022-12-06 07:33:37,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:37,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:37,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-06 07:33:37,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:37,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363142434] [2022-12-06 07:33:37,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363142434] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:37,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:37,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:37,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966078201] [2022-12-06 07:33:37,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:37,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:37,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:37,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:37,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:37,377 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:37,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:37,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:37,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:37,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:37,414 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:37,414 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:37,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:37,415 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:37,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:37,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:37,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:37,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:37,415 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:37,415 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:37,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:37,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:37,416 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:37,416 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:37,416 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:37,416 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:37,416 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:37,416 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:37,416 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:37,416 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:37,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:37,419 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:37,419 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:37,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:37,419 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:37,419 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:37,493 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:37,494 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:37,494 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:37,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:37,494 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:37,494 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:37,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2591 [2022-12-06 07:33:37,494 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-06 07:33:37,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:37,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1724196029, now seen corresponding path program 1 times [2022-12-06 07:33:37,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:37,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136105960] [2022-12-06 07:33:37,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:37,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:37,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:37,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-06 07:33:37,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:37,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136105960] [2022-12-06 07:33:37,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136105960] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:37,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:37,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:37,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013168517] [2022-12-06 07:33:37,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:37,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:37,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:37,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:37,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:37,561 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:37,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:37,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:37,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:37,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:37,597 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:37,598 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:37,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:37,598 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:37,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:37,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:37,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:37,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:37,599 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:37,599 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:37,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:37,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:37,599 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:37,600 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:37,600 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:37,600 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:37,600 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:37,600 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:37,600 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:37,600 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:37,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:37,602 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:37,602 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:37,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:37,603 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:37,603 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:37,676 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:37,677 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:37,677 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:37,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:37,677 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:37,677 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:37,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2592 [2022-12-06 07:33:37,677 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-06 07:33:37,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:37,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1693719836, now seen corresponding path program 1 times [2022-12-06 07:33:37,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:37,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520844451] [2022-12-06 07:33:37,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:37,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:37,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-06 07:33:37,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:37,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520844451] [2022-12-06 07:33:37,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520844451] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:37,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:37,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:37,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716847238] [2022-12-06 07:33:37,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:37,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:37,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:37,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:37,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:37,744 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:37,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:37,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:37,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:37,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:37,787 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:37,787 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:37,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:37,788 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:37,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:37,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:37,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:37,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:37,788 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:37,788 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:37,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:37,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:37,789 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:37,789 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:37,789 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:37,789 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:37,789 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:37,789 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:37,789 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:37,789 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:37,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:37,792 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:37,792 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:37,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:37,792 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:37,792 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:37,867 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:37,868 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:37,868 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:37,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:37,868 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:37,868 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:37,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2593 [2022-12-06 07:33:37,868 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-06 07:33:37,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:37,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1666937727, now seen corresponding path program 1 times [2022-12-06 07:33:37,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:37,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628119789] [2022-12-06 07:33:37,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:37,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:37,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-06 07:33:37,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:37,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628119789] [2022-12-06 07:33:37,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628119789] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:37,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:37,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:37,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61176700] [2022-12-06 07:33:37,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:37,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:37,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:37,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:37,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:37,936 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:37,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:37,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:37,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:37,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:37,977 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:37,977 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:37,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:37,977 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:37,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:37,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:37,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:37,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:37,978 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:37,978 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:37,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:37,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:37,979 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:37,979 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:37,979 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:37,979 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:37,979 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:37,979 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:37,979 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:37,979 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:37,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:37,982 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:37,982 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:37,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:37,982 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:37,982 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:38,057 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:38,058 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:38,058 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:38,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:38,058 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:38,058 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:38,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2594 [2022-12-06 07:33:38,058 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-06 07:33:38,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:38,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1636461534, now seen corresponding path program 1 times [2022-12-06 07:33:38,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:38,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126692742] [2022-12-06 07:33:38,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:38,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:38,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-06 07:33:38,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:38,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126692742] [2022-12-06 07:33:38,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126692742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:38,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:38,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:38,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521998525] [2022-12-06 07:33:38,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:38,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:38,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:38,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:38,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:38,124 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:38,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:38,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:38,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:38,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:38,160 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:38,160 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:38,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:38,161 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:38,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:38,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:38,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:38,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:38,162 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:38,162 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:38,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:38,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:38,162 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:38,162 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:38,162 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:38,163 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:38,163 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:38,163 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:38,163 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:38,163 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:38,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:38,165 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:38,165 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:38,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:38,165 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:38,166 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:38,240 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:38,241 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:38,241 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:38,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:38,241 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:38,241 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:38,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2595 [2022-12-06 07:33:38,241 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-06 07:33:38,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:38,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1609679425, now seen corresponding path program 1 times [2022-12-06 07:33:38,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:38,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570998409] [2022-12-06 07:33:38,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:38,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:38,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-06 07:33:38,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:38,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570998409] [2022-12-06 07:33:38,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570998409] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:38,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:38,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:38,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463568861] [2022-12-06 07:33:38,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:38,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:38,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:38,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:38,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:38,310 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:38,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:38,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:38,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:38,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:38,346 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:38,347 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:38,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:38,358 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:38,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:38,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:38,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:38,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:38,358 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:38,358 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:38,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:38,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:38,359 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:38,359 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:38,359 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:38,359 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:38,360 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:38,360 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:38,360 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:38,360 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:38,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:38,363 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:38,363 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:38,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:38,363 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:38,363 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:38,437 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:38,438 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:38,438 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:38,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:38,438 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:38,438 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:38,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2596 [2022-12-06 07:33:38,438 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-06 07:33:38,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:38,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1579203232, now seen corresponding path program 1 times [2022-12-06 07:33:38,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:38,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27545168] [2022-12-06 07:33:38,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:38,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:38,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-06 07:33:38,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:38,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27545168] [2022-12-06 07:33:38,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27545168] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:38,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:38,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:38,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146529038] [2022-12-06 07:33:38,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:38,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:38,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:38,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:38,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:38,504 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:38,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:38,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:38,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:38,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:38,546 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:38,546 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:38,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:38,547 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:38,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:38,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:38,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:38,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:38,547 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:38,547 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:38,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:38,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:38,548 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:38,548 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:38,548 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:38,548 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:38,549 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:38,549 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:38,549 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:38,549 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:38,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:38,551 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:38,551 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:38,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:38,552 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:38,552 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:38,627 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:38,628 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:33:38,628 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:38,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:38,628 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:38,628 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:38,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2597 [2022-12-06 07:33:38,629 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-06 07:33:38,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:38,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1552421123, now seen corresponding path program 1 times [2022-12-06 07:33:38,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:38,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554663372] [2022-12-06 07:33:38,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:38,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:38,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-06 07:33:38,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:38,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554663372] [2022-12-06 07:33:38,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554663372] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:38,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:38,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:38,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811636049] [2022-12-06 07:33:38,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:38,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:38,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:38,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:38,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:38,696 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:38,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:38,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:38,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:38,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:38,738 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:38,738 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:38,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:38,739 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:38,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:38,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:38,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:38,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:38,739 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:38,739 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:38,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:38,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:38,740 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:38,740 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:38,740 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:38,740 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:38,740 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:38,740 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:38,740 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:38,740 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:38,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:38,743 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:38,743 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:38,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:38,743 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:38,743 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:38,816 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:38,817 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:38,817 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:38,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:38,818 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:38,818 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:38,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2598 [2022-12-06 07:33:38,818 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-06 07:33:38,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:38,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1521944930, now seen corresponding path program 1 times [2022-12-06 07:33:38,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:38,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973365257] [2022-12-06 07:33:38,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:38,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:38,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-06 07:33:38,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:38,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973365257] [2022-12-06 07:33:38,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973365257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:38,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:38,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:38,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794690305] [2022-12-06 07:33:38,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:38,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:38,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:38,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:38,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:38,884 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:38,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:38,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:38,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:38,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:38,921 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:38,921 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:38,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:38,921 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:38,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:38,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:38,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:38,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:38,922 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:38,922 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:38,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:38,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:38,923 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:38,923 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:38,923 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:38,923 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:38,923 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:38,923 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:38,923 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:38,923 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:38,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:38,925 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:38,925 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:38,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:38,926 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:38,926 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:39,001 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:39,002 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:39,002 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:39,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:39,002 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:39,002 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:39,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2599 [2022-12-06 07:33:39,002 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-06 07:33:39,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:39,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1495162821, now seen corresponding path program 1 times [2022-12-06 07:33:39,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:39,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797293290] [2022-12-06 07:33:39,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:39,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33: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-06 07:33:39,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:39,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797293290] [2022-12-06 07:33:39,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797293290] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:39,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:39,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:39,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157044857] [2022-12-06 07:33:39,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:39,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:39,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:39,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:39,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:39,070 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:39,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:39,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:39,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:39,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:39,111 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:39,112 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:39,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:39,112 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:39,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:39,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:39,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:39,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:39,113 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:39,113 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:39,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:39,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:39,113 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:39,113 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:39,114 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:39,114 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:39,114 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:39,114 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:39,114 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:39,114 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:39,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:39,116 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:39,116 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:39,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:39,116 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:39,116 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:39,190 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:39,191 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:39,191 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:39,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:39,191 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:39,191 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:39,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2600 [2022-12-06 07:33:39,192 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-06 07:33:39,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:39,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1464686628, now seen corresponding path program 1 times [2022-12-06 07:33:39,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:39,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104591504] [2022-12-06 07:33:39,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:39,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:39,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-06 07:33:39,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:39,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104591504] [2022-12-06 07:33:39,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104591504] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:39,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:39,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:39,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489385219] [2022-12-06 07:33:39,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:39,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:39,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:39,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:39,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:39,259 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:39,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:39,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:39,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:39,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:39,301 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:39,301 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:39,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:39,302 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:39,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:39,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:39,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:39,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:39,302 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:39,302 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:39,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:39,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:39,303 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:39,303 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:39,303 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:39,303 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:39,303 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:39,303 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:39,303 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:39,304 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:39,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:39,306 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:39,306 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:39,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:39,306 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:39,306 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:39,380 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:39,381 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:39,381 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:39,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:39,381 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:39,381 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:39,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2601 [2022-12-06 07:33:39,382 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-06 07:33:39,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:39,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1437904519, now seen corresponding path program 1 times [2022-12-06 07:33:39,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:39,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035462648] [2022-12-06 07:33:39,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:39,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:39,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:39,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:39,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035462648] [2022-12-06 07:33:39,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035462648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:39,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:39,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:39,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405801297] [2022-12-06 07:33:39,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:39,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:39,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:39,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:39,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:39,465 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:39,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:39,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:39,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:39,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:39,506 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:39,506 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:39,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:39,506 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:39,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:39,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:39,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:39,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:39,507 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:39,507 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:39,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:39,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:39,508 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:39,508 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:39,508 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:39,508 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:39,508 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:39,508 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:39,508 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:39,508 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:39,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:39,510 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:39,510 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:39,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:39,511 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:39,511 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:39,585 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:39,586 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:39,586 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:39,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:39,586 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:39,586 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:39,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2602 [2022-12-06 07:33:39,586 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-06 07:33:39,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:39,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1407428326, now seen corresponding path program 1 times [2022-12-06 07:33:39,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:39,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654955028] [2022-12-06 07:33:39,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:39,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:39,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:39,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:39,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654955028] [2022-12-06 07:33:39,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654955028] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:39,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:39,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:39,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327740855] [2022-12-06 07:33:39,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:39,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:39,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:39,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:39,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:39,651 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:39,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:39,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:39,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:39,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:39,688 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:39,688 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:39,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:39,688 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:39,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:39,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:39,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:39,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:39,689 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:39,689 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:39,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:39,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:39,689 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:39,690 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:39,690 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:39,690 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:39,690 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:39,690 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:39,690 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:39,690 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:39,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:39,692 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:39,692 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:39,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:39,693 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:39,693 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:39,767 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:39,768 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:39,768 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:39,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:39,768 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:39,768 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:39,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2603 [2022-12-06 07:33:39,768 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-06 07:33:39,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:39,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1380646217, now seen corresponding path program 1 times [2022-12-06 07:33:39,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:39,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023198676] [2022-12-06 07:33:39,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:39,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:39,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-06 07:33:39,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:39,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023198676] [2022-12-06 07:33:39,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023198676] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:39,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:39,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:39,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498703337] [2022-12-06 07:33:39,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:39,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:39,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:39,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:39,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:39,839 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:39,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:39,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:39,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:39,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:39,878 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:39,878 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:39,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 374 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:39,878 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:39,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:39,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:39,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:39,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:39,879 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:39,879 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:39,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:39,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:39,880 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:39,880 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:39,880 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:39,880 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:39,880 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:39,880 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:39,880 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:39,880 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:39,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:39,882 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:39,882 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:39,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:39,883 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:39,883 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:39,956 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:39,957 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:39,957 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:39,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:39,957 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:39,957 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:39,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2604 [2022-12-06 07:33:39,958 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-06 07:33:39,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:39,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1350170024, now seen corresponding path program 1 times [2022-12-06 07:33:39,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:39,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434366922] [2022-12-06 07:33:39,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:39,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:39,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:40,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:40,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:40,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434366922] [2022-12-06 07:33:40,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434366922] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:40,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:40,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:40,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341612434] [2022-12-06 07:33:40,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:40,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:40,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:40,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:40,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:40,030 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:40,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:40,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:40,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:40,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:40,074 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:40,074 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:40,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:40,074 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:40,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:40,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:40,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:40,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:40,075 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:40,075 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:40,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:40,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:40,076 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:40,076 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:40,076 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:40,076 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:40,076 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:40,076 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:40,076 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:40,076 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:40,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:40,079 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:40,079 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:40,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:40,079 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:40,079 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:40,155 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:40,156 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:33:40,157 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:40,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:40,157 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:40,157 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:40,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2605 [2022-12-06 07:33:40,157 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-06 07:33:40,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:40,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1323387915, now seen corresponding path program 1 times [2022-12-06 07:33:40,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:40,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631331534] [2022-12-06 07:33:40,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:40,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:40,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:40,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-06 07:33:40,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:40,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631331534] [2022-12-06 07:33:40,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631331534] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:40,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:40,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:40,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935474937] [2022-12-06 07:33:40,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:40,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:40,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:40,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:40,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:40,226 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:40,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:40,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:40,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:40,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:40,262 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:40,263 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:40,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:40,263 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:40,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:40,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:40,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:40,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:40,264 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:40,264 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:40,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:40,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:40,264 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:40,265 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:40,265 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:40,265 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:40,265 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:40,265 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:40,265 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:40,265 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:40,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:40,267 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:40,267 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:40,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:40,268 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:40,268 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:40,342 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:40,343 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:40,343 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:40,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:40,343 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:40,343 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:40,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2606 [2022-12-06 07:33:40,343 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-06 07:33:40,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:40,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1292911722, now seen corresponding path program 1 times [2022-12-06 07:33:40,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:40,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906480239] [2022-12-06 07:33:40,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:40,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:40,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-06 07:33:40,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:40,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906480239] [2022-12-06 07:33:40,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906480239] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:40,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:40,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:40,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134135317] [2022-12-06 07:33:40,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:40,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:40,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:40,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:40,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:40,409 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:40,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:40,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:40,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:40,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:40,451 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:40,452 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:40,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:40,452 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:40,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:40,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:40,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:40,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:40,453 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:40,453 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:40,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:40,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:40,453 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:40,454 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:40,454 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:40,454 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:40,454 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:40,454 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:40,454 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:40,454 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:40,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:40,456 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:40,456 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:40,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:40,457 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:40,457 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:40,541 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:40,542 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 07:33:40,542 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:40,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:40,542 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:40,542 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:40,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2607 [2022-12-06 07:33:40,542 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-06 07:33:40,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:40,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1266129613, now seen corresponding path program 1 times [2022-12-06 07:33:40,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:40,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151004653] [2022-12-06 07:33:40,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:40,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:40,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:40,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-06 07:33:40,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:40,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151004653] [2022-12-06 07:33:40,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151004653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:40,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:40,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:40,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487693511] [2022-12-06 07:33:40,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:40,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:40,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:40,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:40,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:40,620 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:40,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:40,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:40,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:40,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:40,656 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:40,656 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:40,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:40,656 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:40,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:40,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:40,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:40,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:40,657 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:40,657 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:40,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:40,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:40,658 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:40,658 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:40,658 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:40,658 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:40,658 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:40,658 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:40,658 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:40,658 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:40,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:40,660 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:40,660 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:40,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:40,661 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:40,661 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:40,734 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:40,735 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:40,735 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:40,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:40,735 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:40,735 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:40,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2608 [2022-12-06 07:33:40,735 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-06 07:33:40,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:40,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1235653420, now seen corresponding path program 1 times [2022-12-06 07:33:40,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:40,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142418222] [2022-12-06 07:33:40,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:40,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:40,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:40,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:40,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142418222] [2022-12-06 07:33:40,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142418222] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:40,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:40,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:40,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115075470] [2022-12-06 07:33:40,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:40,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:40,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:40,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:40,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:40,800 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:40,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:40,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:40,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:40,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:40,836 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:40,837 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:40,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:40,837 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:40,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:40,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:40,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:40,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:40,837 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:40,838 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:40,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:40,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:40,838 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:40,838 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:40,838 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:40,838 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:40,839 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:40,839 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:40,839 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:40,839 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:40,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:40,841 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:40,841 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:40,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:40,841 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:40,841 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:40,914 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:40,915 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:40,915 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:40,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:40,915 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:40,915 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:40,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2609 [2022-12-06 07:33:40,915 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-06 07:33:40,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:40,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1208871311, now seen corresponding path program 1 times [2022-12-06 07:33:40,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:40,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644739135] [2022-12-06 07:33:40,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:40,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:40,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-06 07:33:40,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:40,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644739135] [2022-12-06 07:33:40,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644739135] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:40,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:40,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:40,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9949007] [2022-12-06 07:33:40,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:40,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:40,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:40,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:40,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:40,985 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:40,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:40,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:40,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:40,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:41,025 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:41,026 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:41,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:41,026 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:41,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:41,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:41,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:41,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:41,027 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:41,027 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:41,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:41,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:41,027 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:41,027 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:41,028 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:41,028 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:41,028 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:41,028 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:41,028 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:41,028 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:41,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:41,030 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:41,030 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:41,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:41,031 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:41,031 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:41,116 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:41,117 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 07:33:41,117 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:41,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:41,117 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:41,117 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:41,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2610 [2022-12-06 07:33:41,117 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-06 07:33:41,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:41,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1178395118, now seen corresponding path program 1 times [2022-12-06 07:33:41,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:41,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587288156] [2022-12-06 07:33:41,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:41,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:41,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-06 07:33:41,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:41,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587288156] [2022-12-06 07:33:41,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587288156] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:41,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:41,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:41,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878068797] [2022-12-06 07:33:41,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:41,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:41,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:41,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:41,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:41,189 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:41,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:41,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:41,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:41,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:41,230 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:41,230 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:41,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:41,231 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:41,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:41,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:41,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:41,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:41,231 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:41,231 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:41,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:41,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:41,232 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:41,232 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:41,232 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:41,232 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:41,232 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:41,233 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:41,233 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:41,233 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:41,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:41,235 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:41,235 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:41,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:41,235 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:41,235 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:41,313 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:41,314 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:33:41,314 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:41,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:41,314 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:41,314 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:41,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2611 [2022-12-06 07:33:41,314 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-06 07:33:41,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:41,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1151613009, now seen corresponding path program 1 times [2022-12-06 07:33:41,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:41,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55088073] [2022-12-06 07:33:41,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:41,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:41,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-06 07:33:41,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:41,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55088073] [2022-12-06 07:33:41,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55088073] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:41,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:41,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:41,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371184162] [2022-12-06 07:33:41,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:41,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:41,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:41,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:41,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:41,383 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:41,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:41,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:41,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:41,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:41,419 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:41,420 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:41,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:41,420 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:41,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:41,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:41,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:41,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:41,421 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:41,421 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:41,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:41,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:41,421 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:41,421 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:41,422 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:41,422 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:41,422 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:41,422 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:41,422 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:41,422 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:41,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:41,424 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:41,424 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:41,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:41,425 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:41,425 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:41,498 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:41,499 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:41,499 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:41,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:41,499 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:41,500 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:41,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2612 [2022-12-06 07:33:41,500 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-06 07:33:41,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:41,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1121136816, now seen corresponding path program 1 times [2022-12-06 07:33:41,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:41,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881629735] [2022-12-06 07:33:41,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:41,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:41,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-06 07:33:41,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:41,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881629735] [2022-12-06 07:33:41,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881629735] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:41,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:41,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:41,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390660499] [2022-12-06 07:33:41,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:41,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:41,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:41,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:41,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:41,566 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:41,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:41,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:41,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:41,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:41,612 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:41,612 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:41,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:41,612 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:41,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:41,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:41,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:41,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:41,613 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:41,613 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:41,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:41,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:41,614 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:41,614 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:41,614 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:41,614 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:41,614 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:41,614 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:41,614 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:41,614 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:41,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:41,616 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:41,616 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:41,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:41,617 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:41,617 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:41,690 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:41,691 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:41,691 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:41,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:41,691 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:41,692 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:41,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2613 [2022-12-06 07:33:41,692 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-06 07:33:41,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:41,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1094354707, now seen corresponding path program 1 times [2022-12-06 07:33:41,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:41,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128960100] [2022-12-06 07:33:41,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:41,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:41,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-06 07:33:41,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:41,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128960100] [2022-12-06 07:33:41,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128960100] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:41,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:41,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:41,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500078676] [2022-12-06 07:33:41,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:41,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:41,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:41,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:41,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:41,757 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:41,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:41,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:41,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:41,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:41,793 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:41,793 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:41,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:41,794 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:41,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:41,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:41,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:41,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:41,794 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:41,794 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:41,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:41,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:41,795 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:41,795 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:41,795 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:41,795 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:41,795 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:41,795 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:41,795 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:41,795 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:41,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:41,797 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:41,797 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:41,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:41,798 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:41,798 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:41,871 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:41,872 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:41,872 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:41,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:41,872 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:41,872 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:41,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2614 [2022-12-06 07:33:41,872 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-06 07:33:41,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:41,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1063878514, now seen corresponding path program 1 times [2022-12-06 07:33:41,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:41,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929063353] [2022-12-06 07:33:41,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:41,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:41,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-06 07:33:41,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:41,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929063353] [2022-12-06 07:33:41,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929063353] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:41,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:41,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:41,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224806560] [2022-12-06 07:33:41,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:41,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:41,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:41,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:41,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:41,938 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:41,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:41,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:41,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:41,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:41,980 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:41,980 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:41,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:41,981 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:41,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:41,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:41,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:41,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:41,981 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:41,981 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:41,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:41,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:41,982 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:41,982 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:41,982 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:41,982 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:41,982 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:41,982 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:41,983 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:41,983 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:41,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:41,985 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:41,985 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:41,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:41,985 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:41,985 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:42,060 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:42,061 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:42,061 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:42,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:42,061 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:42,062 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:42,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2615 [2022-12-06 07:33:42,062 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-06 07:33:42,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:42,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1037096405, now seen corresponding path program 1 times [2022-12-06 07:33:42,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:42,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935134797] [2022-12-06 07:33:42,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:42,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:42,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-06 07:33:42,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:42,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935134797] [2022-12-06 07:33:42,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935134797] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:42,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:42,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:42,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776515879] [2022-12-06 07:33:42,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:42,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:42,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:42,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:42,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:42,130 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:42,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:42,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:42,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:42,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:42,164 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:42,164 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:42,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:42,165 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:42,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:42,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:42,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:42,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:42,165 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:42,165 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:42,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:42,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:42,166 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:42,166 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:42,166 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:42,166 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:42,166 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:42,166 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:42,166 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:42,166 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:42,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:42,168 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:42,169 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:42,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:42,169 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:42,169 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:42,260 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:42,261 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 07:33:42,261 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:42,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:42,261 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:42,261 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:42,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2616 [2022-12-06 07:33:42,262 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-06 07:33:42,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:42,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1006620212, now seen corresponding path program 1 times [2022-12-06 07:33:42,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:42,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890608242] [2022-12-06 07:33:42,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:42,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:42,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-06 07:33:42,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:42,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890608242] [2022-12-06 07:33:42,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890608242] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:42,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:42,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:42,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379131420] [2022-12-06 07:33:42,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:42,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:42,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:42,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:42,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:42,327 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:42,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:42,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:42,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:42,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:42,363 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:42,363 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:42,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:42,363 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:42,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:42,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:42,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:42,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:42,364 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:42,364 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:42,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:42,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:42,364 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:42,364 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:42,365 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:42,365 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:42,365 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:42,365 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:42,365 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:42,365 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:42,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:42,367 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:42,367 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:42,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:42,367 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:42,367 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:42,439 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:42,440 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:33:42,440 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:42,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:42,440 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:42,440 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:42,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2617 [2022-12-06 07:33:42,440 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-06 07:33:42,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:42,441 INFO L85 PathProgramCache]: Analyzing trace with hash -979838103, now seen corresponding path program 1 times [2022-12-06 07:33:42,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:42,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780055450] [2022-12-06 07:33:42,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:42,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:42,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:42,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:42,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780055450] [2022-12-06 07:33:42,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780055450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:42,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:42,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:42,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748908358] [2022-12-06 07:33:42,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:42,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:42,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:42,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:42,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:42,507 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:42,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:42,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:42,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:42,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:42,545 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:42,546 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:42,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:42,546 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:42,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:42,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:42,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:42,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:42,547 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:42,547 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:42,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:42,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:42,547 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:42,547 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:42,548 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:42,548 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:42,548 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:42,548 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:42,548 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:42,548 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:42,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:42,550 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:42,550 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:42,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:42,550 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:42,550 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:42,623 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:42,624 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:33:42,624 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:42,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:42,624 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:42,624 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:42,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2618 [2022-12-06 07:33:42,624 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-06 07:33:42,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:42,624 INFO L85 PathProgramCache]: Analyzing trace with hash -949361910, now seen corresponding path program 1 times [2022-12-06 07:33:42,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:42,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398730835] [2022-12-06 07:33:42,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:42,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:42,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-06 07:33:42,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:42,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398730835] [2022-12-06 07:33:42,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398730835] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:42,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:42,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:42,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237310230] [2022-12-06 07:33:42,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:42,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:42,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:42,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:42,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:42,702 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:42,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:42,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:42,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:42,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:42,738 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:42,738 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:42,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:42,738 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:42,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:42,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:42,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:42,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:42,739 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:42,739 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:42,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:42,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:42,740 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:42,740 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:42,740 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:42,740 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:42,740 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:42,740 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:42,740 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:42,740 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:42,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:42,742 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:42,742 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:42,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:42,743 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:42,743 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:42,816 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:42,817 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:42,817 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:42,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:42,817 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:42,817 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:42,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2619 [2022-12-06 07:33:42,817 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-06 07:33:42,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:42,817 INFO L85 PathProgramCache]: Analyzing trace with hash -922579801, now seen corresponding path program 1 times [2022-12-06 07:33:42,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:42,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251460990] [2022-12-06 07:33:42,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:42,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:42,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-06 07:33:42,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:42,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251460990] [2022-12-06 07:33:42,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251460990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:42,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:42,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:42,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975354902] [2022-12-06 07:33:42,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:42,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:42,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:42,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:42,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:42,884 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:42,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:42,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:42,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:42,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:42,920 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:42,920 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:42,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:42,921 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:42,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:42,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:42,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:42,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:42,921 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:42,921 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:42,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:42,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:42,922 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:42,922 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:42,922 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:42,922 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:42,922 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:42,922 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:42,922 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:42,922 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:42,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:42,924 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:42,925 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:42,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:42,925 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:42,925 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:42,999 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:43,001 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:43,001 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:43,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:43,001 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:43,001 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:43,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2620 [2022-12-06 07:33:43,001 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-06 07:33:43,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:43,001 INFO L85 PathProgramCache]: Analyzing trace with hash -892103608, now seen corresponding path program 1 times [2022-12-06 07:33:43,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:43,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454497333] [2022-12-06 07:33:43,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:43,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:43,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-06 07:33:43,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:43,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454497333] [2022-12-06 07:33:43,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454497333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:43,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:43,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:43,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707747401] [2022-12-06 07:33:43,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:43,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:43,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:43,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:43,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:43,069 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:43,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:43,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:43,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:43,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:43,112 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:43,112 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:43,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:43,112 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:43,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:43,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:43,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:43,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:43,113 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:43,113 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:43,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:43,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:43,114 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:43,114 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:43,114 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:43,114 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:43,114 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:43,114 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:43,114 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:43,114 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:43,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:43,117 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:43,117 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:43,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:43,117 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:43,117 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:43,192 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:43,193 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:43,193 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:43,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:43,194 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:43,194 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:43,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2621 [2022-12-06 07:33:43,194 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-06 07:33:43,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:43,194 INFO L85 PathProgramCache]: Analyzing trace with hash -865321499, now seen corresponding path program 1 times [2022-12-06 07:33:43,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:43,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351012330] [2022-12-06 07:33:43,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:43,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:43,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:43,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:43,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:43,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351012330] [2022-12-06 07:33:43,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351012330] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:43,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:43,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:43,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922337078] [2022-12-06 07:33:43,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:43,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:43,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:43,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:43,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:43,263 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:43,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:43,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:43,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:43,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:43,297 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:43,298 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:43,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 372 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:43,298 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:43,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:43,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:43,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:43,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:43,299 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:43,299 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:43,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:43,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:43,299 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:43,300 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:43,300 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:43,300 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:43,300 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:43,300 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:43,300 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:43,300 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:43,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:43,302 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:43,302 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:43,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:43,303 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:43,303 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:43,381 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:43,382 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:33:43,383 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:43,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:43,383 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:43,383 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:43,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2622 [2022-12-06 07:33:43,383 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-06 07:33:43,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:43,383 INFO L85 PathProgramCache]: Analyzing trace with hash -834845306, now seen corresponding path program 1 times [2022-12-06 07:33:43,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:43,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715254825] [2022-12-06 07:33:43,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:43,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:43,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-06 07:33:43,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:43,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715254825] [2022-12-06 07:33:43,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715254825] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:43,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:43,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:43,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399324946] [2022-12-06 07:33:43,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:43,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:43,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:43,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:43,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:43,449 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:43,449 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:43,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:43,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:43,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:43,485 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:43,485 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:43,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 336 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:43,486 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:43,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:43,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:43,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:43,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:43,486 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:43,486 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:43,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:43,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:43,487 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:43,487 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:43,487 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:43,487 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:43,487 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:43,488 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:43,488 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:43,488 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:43,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:43,490 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:43,490 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:43,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:43,490 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:43,490 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:43,565 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:43,566 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:43,566 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:43,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:43,566 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:43,566 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:43,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2623 [2022-12-06 07:33:43,566 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-06 07:33:43,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:43,566 INFO L85 PathProgramCache]: Analyzing trace with hash -808063197, now seen corresponding path program 1 times [2022-12-06 07:33:43,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:43,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025324204] [2022-12-06 07:33:43,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:43,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:43,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-06 07:33:43,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:43,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025324204] [2022-12-06 07:33:43,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025324204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:43,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:43,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:43,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668700435] [2022-12-06 07:33:43,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:43,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:43,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:43,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:43,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:43,635 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:43,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:43,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:43,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:43,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:43,676 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:43,676 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:43,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:43,677 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:43,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:43,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:43,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:43,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:43,677 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:43,677 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:43,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:43,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:43,678 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:43,678 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:43,678 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:43,678 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:43,678 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:43,679 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:43,679 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:43,679 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:43,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:43,681 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:43,681 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:43,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:43,681 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:43,681 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:43,759 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:43,760 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:33:43,760 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:43,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:43,760 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:43,760 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:43,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2624 [2022-12-06 07:33:43,760 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-06 07:33:43,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:43,761 INFO L85 PathProgramCache]: Analyzing trace with hash -777587004, now seen corresponding path program 1 times [2022-12-06 07:33:43,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:43,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445852699] [2022-12-06 07:33:43,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:43,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:43,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-06 07:33:43,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:43,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445852699] [2022-12-06 07:33:43,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445852699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:43,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:43,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:43,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680098793] [2022-12-06 07:33:43,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:43,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:43,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:43,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:43,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:43,832 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:43,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:43,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:43,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:43,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:43,868 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:43,868 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:43,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:43,868 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:43,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:43,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:43,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:43,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:43,869 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:43,869 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:43,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:43,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:43,870 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:43,870 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:43,870 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:43,870 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:43,870 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:43,870 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:43,870 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:43,870 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:43,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:43,872 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:43,872 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:43,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:43,873 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:43,873 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:43,946 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:43,947 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:43,947 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:43,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:43,947 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:43,947 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:43,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2625 [2022-12-06 07:33:43,948 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-06 07:33:43,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:43,948 INFO L85 PathProgramCache]: Analyzing trace with hash -750804895, now seen corresponding path program 1 times [2022-12-06 07:33:43,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:43,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282393755] [2022-12-06 07:33:43,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:43,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:44,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-06 07:33:44,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:44,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282393755] [2022-12-06 07:33:44,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282393755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:44,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:44,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:44,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367184891] [2022-12-06 07:33:44,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:44,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:44,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:44,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:44,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:44,015 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:44,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:44,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:44,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:44,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:44,052 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:44,052 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:44,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:44,052 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:44,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:44,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:44,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:44,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:44,053 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:44,053 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:44,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:44,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:44,054 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:44,054 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:44,054 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:44,054 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:44,054 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:44,054 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:44,054 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:44,054 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:44,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:44,056 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:44,056 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:44,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:44,057 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:44,057 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:44,131 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:44,132 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:44,132 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:44,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:44,132 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:44,132 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:44,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2626 [2022-12-06 07:33:44,133 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-06 07:33:44,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:44,133 INFO L85 PathProgramCache]: Analyzing trace with hash -720328702, now seen corresponding path program 1 times [2022-12-06 07:33:44,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:44,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047627690] [2022-12-06 07:33:44,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:44,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33: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-06 07:33:44,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:44,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047627690] [2022-12-06 07:33:44,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047627690] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:44,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:44,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:44,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165766737] [2022-12-06 07:33:44,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:44,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:44,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:44,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:44,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:44,197 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:44,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:44,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:44,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:44,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:44,232 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:44,232 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:44,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:44,233 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:44,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:44,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:44,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:44,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:44,233 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:44,233 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:44,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:44,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:44,234 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:44,234 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:44,234 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:44,234 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:44,234 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:44,234 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:44,234 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:44,234 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:44,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:44,237 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:44,237 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:44,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:44,237 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:44,237 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:44,310 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:44,311 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:44,311 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:44,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:44,311 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:44,311 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:44,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2627 [2022-12-06 07:33:44,311 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-06 07:33:44,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:44,311 INFO L85 PathProgramCache]: Analyzing trace with hash -693546593, now seen corresponding path program 1 times [2022-12-06 07:33:44,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:44,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912290973] [2022-12-06 07:33:44,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:44,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:44,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-06 07:33:44,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:44,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912290973] [2022-12-06 07:33:44,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912290973] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:44,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:44,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:44,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726069631] [2022-12-06 07:33:44,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:44,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:44,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:44,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:44,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:44,378 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:44,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:44,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:44,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:44,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:44,419 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:44,419 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:44,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:44,420 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:44,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:44,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:44,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:44,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:44,420 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:44,420 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:44,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:44,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:44,421 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:44,421 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:44,421 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:44,421 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:44,421 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:44,421 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:44,421 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:44,421 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:44,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:44,424 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:44,424 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:44,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:44,424 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:44,424 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:44,498 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:44,499 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:44,499 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:44,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:44,499 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:44,499 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:44,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2628 [2022-12-06 07:33:44,499 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-06 07:33:44,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:44,500 INFO L85 PathProgramCache]: Analyzing trace with hash -663070400, now seen corresponding path program 1 times [2022-12-06 07:33:44,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:44,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244356044] [2022-12-06 07:33:44,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:44,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:44,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-06 07:33:44,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:44,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244356044] [2022-12-06 07:33:44,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244356044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:44,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:44,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:44,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161389502] [2022-12-06 07:33:44,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:44,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:44,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:44,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:44,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:44,564 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:44,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:44,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:44,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:44,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:44,606 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:44,607 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:44,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:44,607 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:44,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:44,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:44,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:44,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:44,608 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:44,608 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:44,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:44,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:44,608 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:44,608 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:44,609 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:44,609 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:44,609 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:44,609 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:44,609 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:44,609 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:44,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:44,611 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:44,611 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:44,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:44,611 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:44,611 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:44,688 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:44,689 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:33:44,689 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:44,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:44,689 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:44,689 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:44,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2629 [2022-12-06 07:33:44,689 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-06 07:33:44,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:44,689 INFO L85 PathProgramCache]: Analyzing trace with hash -636288291, now seen corresponding path program 1 times [2022-12-06 07:33:44,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:44,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036091602] [2022-12-06 07:33:44,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:44,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:44,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:44,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-06 07:33:44,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:44,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036091602] [2022-12-06 07:33:44,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036091602] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:44,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:44,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:44,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822433467] [2022-12-06 07:33:44,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:44,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:44,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:44,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:44,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:44,770 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:44,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:44,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:44,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:44,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:44,820 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:44,820 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:44,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:44,820 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:44,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:44,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:44,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:44,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:44,821 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:44,821 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:44,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:44,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:44,822 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:44,822 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:44,822 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:44,822 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:44,822 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:44,822 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:44,822 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:44,822 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:44,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:44,824 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:44,825 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:44,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:44,825 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:44,825 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:44,900 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:44,901 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:44,901 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:44,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:44,901 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:44,901 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:44,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2630 [2022-12-06 07:33:44,901 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-06 07:33:44,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:44,901 INFO L85 PathProgramCache]: Analyzing trace with hash -605812098, now seen corresponding path program 1 times [2022-12-06 07:33:44,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:44,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084356822] [2022-12-06 07:33:44,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:44,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:44,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-06 07:33:44,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:44,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084356822] [2022-12-06 07:33:44,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084356822] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:44,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:44,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:44,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162808546] [2022-12-06 07:33:44,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:44,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:44,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:44,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:44,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:44,981 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:44,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:44,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:44,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:44,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:45,028 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:45,029 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:45,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:45,029 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:45,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:45,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:45,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:45,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:45,029 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:45,030 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:45,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:45,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:45,030 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:45,030 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:45,030 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:45,030 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:45,030 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:45,031 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:45,031 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:45,031 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:45,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:45,033 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:45,033 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:45,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:45,033 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:45,033 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:45,109 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:45,110 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:33:45,110 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:45,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:45,110 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:45,110 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:45,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2631 [2022-12-06 07:33:45,110 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-06 07:33:45,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:45,111 INFO L85 PathProgramCache]: Analyzing trace with hash -579029989, now seen corresponding path program 1 times [2022-12-06 07:33:45,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:45,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637554506] [2022-12-06 07:33:45,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:45,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33: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-06 07:33:45,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:45,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637554506] [2022-12-06 07:33:45,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637554506] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:45,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:45,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:45,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716964913] [2022-12-06 07:33:45,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:45,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:45,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:45,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:45,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:45,180 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:45,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:45,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:45,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:45,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:45,215 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:45,216 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:45,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:45,216 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:45,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:45,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:45,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:45,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:45,216 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:45,217 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:45,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:45,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:45,217 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:45,217 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:45,217 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:45,217 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:45,217 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:45,218 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:45,218 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:45,218 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:45,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:45,220 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:45,220 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:45,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:45,220 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:45,220 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:45,295 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:45,296 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:45,296 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:45,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:45,296 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:45,296 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:45,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2632 [2022-12-06 07:33:45,296 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-06 07:33:45,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:45,296 INFO L85 PathProgramCache]: Analyzing trace with hash -548553796, now seen corresponding path program 1 times [2022-12-06 07:33:45,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:45,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126018609] [2022-12-06 07:33:45,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:45,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:45,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:45,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-06 07:33:45,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:45,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126018609] [2022-12-06 07:33:45,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126018609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:45,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:45,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:45,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133488715] [2022-12-06 07:33:45,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:45,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:45,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:45,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:45,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:45,363 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:45,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:45,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:45,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:45,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:45,399 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:45,399 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:45,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:45,400 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:45,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:45,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:45,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:45,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:45,400 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:45,400 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:45,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:45,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:45,401 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:45,401 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:45,401 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:45,401 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:45,401 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:45,401 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:45,401 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:45,402 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:45,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:45,404 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:45,404 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:45,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:45,404 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:45,404 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:45,479 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:45,480 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:45,480 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:45,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:45,480 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:45,480 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:45,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2633 [2022-12-06 07:33:45,480 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-06 07:33:45,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:45,480 INFO L85 PathProgramCache]: Analyzing trace with hash -521771687, now seen corresponding path program 1 times [2022-12-06 07:33:45,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:45,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169613557] [2022-12-06 07:33:45,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:45,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:45,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-06 07:33:45,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:45,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169613557] [2022-12-06 07:33:45,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169613557] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:45,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:45,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:45,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145424683] [2022-12-06 07:33:45,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:45,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:45,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:45,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:45,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:45,548 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:45,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:45,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:45,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:45,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:45,583 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:45,584 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:45,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:45,584 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:45,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:45,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:45,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:45,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:45,585 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:45,585 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:45,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:45,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:45,585 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:45,585 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:45,586 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:45,586 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:45,586 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:45,586 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:45,586 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:45,586 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:45,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:45,588 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:45,588 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:45,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:45,588 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:45,588 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:45,664 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:45,665 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:45,665 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:45,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:45,665 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:45,665 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:45,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2634 [2022-12-06 07:33:45,666 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-06 07:33:45,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:45,666 INFO L85 PathProgramCache]: Analyzing trace with hash -491295494, now seen corresponding path program 1 times [2022-12-06 07:33:45,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:45,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911719593] [2022-12-06 07:33:45,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:45,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:45,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:45,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:45,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911719593] [2022-12-06 07:33:45,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911719593] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:45,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:45,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:45,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365712671] [2022-12-06 07:33:45,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:45,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:45,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:45,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:45,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:45,732 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:45,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:45,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:45,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:45,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:45,768 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:45,769 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:45,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 352 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:45,769 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:45,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:45,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:45,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:45,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:45,770 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:45,770 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:45,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:45,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:45,770 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:45,771 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:45,771 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:45,771 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:45,771 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:45,771 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:45,771 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:45,771 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:45,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:45,773 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:45,773 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:45,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:45,774 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:45,774 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:45,849 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:45,851 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:33:45,851 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:45,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:45,851 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:45,851 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:45,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2635 [2022-12-06 07:33:45,851 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-06 07:33:45,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:45,851 INFO L85 PathProgramCache]: Analyzing trace with hash -464513385, now seen corresponding path program 1 times [2022-12-06 07:33:45,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:45,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159233539] [2022-12-06 07:33:45,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:45,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:45,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:45,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-06 07:33:45,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:45,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159233539] [2022-12-06 07:33:45,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159233539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:45,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:45,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:45,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002761253] [2022-12-06 07:33:45,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:45,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:45,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:45,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:45,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:45,937 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:45,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:45,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:45,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:45,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:45,973 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:45,973 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:45,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:45,973 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:45,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:45,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:45,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:45,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:45,974 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:45,974 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:45,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:45,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:45,975 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:45,975 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:45,975 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:45,975 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:45,975 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:45,975 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:45,975 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:45,975 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:45,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:45,977 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:45,977 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:45,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:45,978 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:45,978 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:46,052 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:46,053 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:46,053 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:46,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:46,053 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:46,053 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:46,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2636 [2022-12-06 07:33:46,054 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-06 07:33:46,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:46,054 INFO L85 PathProgramCache]: Analyzing trace with hash -434037192, now seen corresponding path program 1 times [2022-12-06 07:33:46,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:46,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671955437] [2022-12-06 07:33:46,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:46,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:46,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:46,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-06 07:33:46,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:46,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671955437] [2022-12-06 07:33:46,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671955437] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:46,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:46,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:46,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471010035] [2022-12-06 07:33:46,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:46,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:46,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:46,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:46,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:46,117 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:46,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:46,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:46,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:46,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:46,160 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:46,160 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:46,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:46,160 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:46,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:46,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:46,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:46,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:46,161 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:46,161 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:46,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:46,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:46,161 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:46,162 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:46,162 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:46,162 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:46,162 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:46,162 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:46,162 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:46,162 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:46,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:46,164 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:46,164 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:46,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:46,164 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:46,165 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:46,243 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:46,244 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:33:46,244 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:46,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:46,244 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:46,244 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:46,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2637 [2022-12-06 07:33:46,244 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-06 07:33:46,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:46,244 INFO L85 PathProgramCache]: Analyzing trace with hash -407255083, now seen corresponding path program 1 times [2022-12-06 07:33:46,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:46,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379253081] [2022-12-06 07:33:46,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:46,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:46,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-06 07:33:46,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:46,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379253081] [2022-12-06 07:33:46,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379253081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:46,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:46,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:46,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488448388] [2022-12-06 07:33:46,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:46,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:46,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:46,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:46,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:46,312 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:46,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:46,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:46,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:46,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:46,347 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:46,347 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:46,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:46,348 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:46,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:46,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:46,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:46,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:46,348 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:46,348 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:46,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:46,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:46,349 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:46,349 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:46,349 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:46,349 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:46,349 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:46,349 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:46,349 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:46,349 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:46,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:46,351 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:46,352 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:46,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:46,352 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:46,352 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:46,426 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:46,427 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:46,427 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:46,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:46,427 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:46,427 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:46,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2638 [2022-12-06 07:33:46,427 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-06 07:33:46,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:46,428 INFO L85 PathProgramCache]: Analyzing trace with hash -376778890, now seen corresponding path program 1 times [2022-12-06 07:33:46,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:46,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144585022] [2022-12-06 07:33:46,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:46,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:46,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:46,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-06 07:33:46,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:46,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144585022] [2022-12-06 07:33:46,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144585022] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:46,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:46,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:46,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803680085] [2022-12-06 07:33:46,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:46,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:46,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:46,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:46,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:46,493 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:46,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:46,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:46,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:46,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:46,528 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:46,529 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:46,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:46,529 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:46,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:46,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:46,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:46,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:46,530 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:46,530 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:46,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:46,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:46,530 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:46,530 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:46,530 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:46,530 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:46,531 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:46,531 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:46,531 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:46,531 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:46,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:46,533 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:46,533 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:46,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:46,533 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:46,533 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:46,608 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:46,609 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:46,609 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:46,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:46,609 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:46,609 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:46,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2639 [2022-12-06 07:33:46,609 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-06 07:33:46,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:46,609 INFO L85 PathProgramCache]: Analyzing trace with hash -349996781, now seen corresponding path program 1 times [2022-12-06 07:33:46,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:46,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847888246] [2022-12-06 07:33:46,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:46,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:46,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-06 07:33:46,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:46,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847888246] [2022-12-06 07:33:46,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847888246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:46,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:46,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:46,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578602713] [2022-12-06 07:33:46,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:46,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:46,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:46,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:46,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:46,678 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:46,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:46,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:46,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:46,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:46,720 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:46,720 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:46,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:46,720 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:46,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:46,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:46,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:46,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:46,721 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:46,721 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:46,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:46,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:46,722 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:46,722 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:46,722 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:46,722 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:46,722 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:46,722 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:46,722 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:46,722 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:46,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:46,724 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:46,724 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:46,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:46,725 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:46,725 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:46,799 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:46,800 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:46,800 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:46,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:46,800 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:46,800 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:46,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2640 [2022-12-06 07:33:46,800 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-06 07:33:46,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:46,800 INFO L85 PathProgramCache]: Analyzing trace with hash -319520588, now seen corresponding path program 1 times [2022-12-06 07:33:46,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:46,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347882722] [2022-12-06 07:33:46,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:46,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:46,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:46,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-06 07:33:46,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:46,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347882722] [2022-12-06 07:33:46,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347882722] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:46,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:46,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:46,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300017543] [2022-12-06 07:33:46,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:46,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:46,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:46,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:46,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:46,869 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:46,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:46,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:46,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:46,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:46,911 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:46,912 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:46,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:46,912 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:46,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:46,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:46,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:46,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:46,913 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:46,913 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:46,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:46,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:46,913 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:46,913 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:46,913 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:46,913 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:46,914 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:46,914 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:46,914 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:46,914 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:46,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:46,916 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:46,916 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:46,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:46,925 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:46,926 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:46,998 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:46,999 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-06 07:33:46,999 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:46,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:46,999 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:46,999 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:46,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2641 [2022-12-06 07:33:46,999 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-06 07:33:46,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:46,999 INFO L85 PathProgramCache]: Analyzing trace with hash -292738479, now seen corresponding path program 1 times [2022-12-06 07:33:46,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:46,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521332586] [2022-12-06 07:33:46,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:46,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:47,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-06 07:33:47,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:47,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521332586] [2022-12-06 07:33:47,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521332586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:47,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:47,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:47,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84170592] [2022-12-06 07:33:47,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:47,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:47,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:47,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:47,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:47,066 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:47,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:47,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:47,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:47,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:47,107 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:47,107 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:47,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:47,108 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:47,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:47,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:47,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:47,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:47,108 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:47,108 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:47,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:47,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:47,109 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:47,109 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:47,109 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:47,109 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:47,109 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:47,109 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:47,109 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:47,109 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:47,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:47,111 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:47,112 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:47,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:47,112 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:47,112 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:47,186 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:47,187 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:47,187 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:47,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:47,187 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:47,187 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:47,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2642 [2022-12-06 07:33:47,187 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-06 07:33:47,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:47,187 INFO L85 PathProgramCache]: Analyzing trace with hash -262262286, now seen corresponding path program 1 times [2022-12-06 07:33:47,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:47,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703750026] [2022-12-06 07:33:47,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:47,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:47,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:47,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:47,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703750026] [2022-12-06 07:33:47,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703750026] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:47,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:47,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:47,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13774642] [2022-12-06 07:33:47,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:47,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:47,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:47,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:47,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:47,253 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:47,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:47,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:47,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:47,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:47,295 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:47,295 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:47,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:47,296 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:47,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:47,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:47,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:47,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:47,297 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:47,297 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:47,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:47,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:47,297 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:47,297 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:47,298 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:47,298 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:47,298 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:47,298 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:47,298 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:47,298 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:47,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:47,300 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:47,300 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:47,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:47,300 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:47,301 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:47,379 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:47,380 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:33:47,380 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:47,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:47,380 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:47,380 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:47,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2643 [2022-12-06 07:33:47,380 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-06 07:33:47,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:47,380 INFO L85 PathProgramCache]: Analyzing trace with hash -235480177, now seen corresponding path program 1 times [2022-12-06 07:33:47,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:47,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164812973] [2022-12-06 07:33:47,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:47,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:47,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-06 07:33:47,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:47,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164812973] [2022-12-06 07:33:47,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164812973] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:47,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:47,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:47,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075682075] [2022-12-06 07:33:47,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:47,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:47,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:47,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:47,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:47,448 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:47,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:47,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:47,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:47,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:47,490 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:47,491 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:47,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:47,491 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:47,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:47,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:47,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:47,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:47,492 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:47,492 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:47,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:47,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:47,492 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:47,493 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:47,493 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:47,493 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:47,493 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:47,493 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:47,493 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:47,493 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:47,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:47,495 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:47,495 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:47,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:47,495 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:47,496 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:47,568 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:47,569 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:33:47,569 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:47,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:47,569 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:47,569 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:47,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2644 [2022-12-06 07:33:47,569 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-06 07:33:47,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:47,569 INFO L85 PathProgramCache]: Analyzing trace with hash -205003984, now seen corresponding path program 1 times [2022-12-06 07:33:47,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:47,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454424398] [2022-12-06 07:33:47,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:47,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:47,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-06 07:33:47,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:47,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454424398] [2022-12-06 07:33:47,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454424398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:47,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:47,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:47,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190735454] [2022-12-06 07:33:47,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:47,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:47,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:47,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:47,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:47,635 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:47,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:47,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:47,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:47,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:47,677 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:47,678 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:47,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:47,678 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:47,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:47,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:47,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:47,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:47,679 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:47,679 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:47,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:47,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:47,679 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:47,679 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:47,680 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:47,680 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:47,680 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:47,680 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:47,680 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:47,680 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:47,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:47,682 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:47,682 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:47,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:47,682 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:47,682 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:47,755 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:47,756 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:33:47,756 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:47,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:47,756 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:47,756 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:47,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2645 [2022-12-06 07:33:47,756 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-06 07:33:47,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:47,756 INFO L85 PathProgramCache]: Analyzing trace with hash -178221875, now seen corresponding path program 1 times [2022-12-06 07:33:47,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:47,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135479601] [2022-12-06 07:33:47,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:47,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:47,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:47,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-06 07:33:47,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:47,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135479601] [2022-12-06 07:33:47,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135479601] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:47,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:47,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:47,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436726475] [2022-12-06 07:33:47,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:47,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:47,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:47,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:47,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:47,823 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:47,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:47,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:47,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:47,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:47,857 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:47,857 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:47,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:47,858 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:47,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:47,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:47,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:47,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:47,858 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:47,858 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:47,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:47,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:47,859 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:47,859 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:47,859 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:47,859 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:47,859 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:47,860 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:47,860 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:47,860 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:47,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:47,862 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:47,862 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:47,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:47,862 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:47,862 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:47,936 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:47,937 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:47,937 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:47,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:47,937 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:47,937 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:47,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2646 [2022-12-06 07:33:47,937 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-06 07:33:47,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:47,938 INFO L85 PathProgramCache]: Analyzing trace with hash -147745682, now seen corresponding path program 1 times [2022-12-06 07:33:47,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:47,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133567273] [2022-12-06 07:33:47,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:47,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:48,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-06 07:33:48,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:48,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133567273] [2022-12-06 07:33:48,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133567273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:48,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:48,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:48,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183719853] [2022-12-06 07:33:48,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:48,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:48,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:48,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:48,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:48,017 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:48,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:48,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:48,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:48,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:48,059 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:48,059 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:48,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:48,060 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:48,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:48,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:48,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:48,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:48,060 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:48,060 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:48,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:48,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:48,061 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:48,061 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:48,061 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:48,061 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:48,061 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:48,061 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:48,061 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:48,062 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:48,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:48,064 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:48,064 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:48,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:48,064 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:48,064 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:48,138 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:48,139 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:48,139 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:48,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:48,139 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:48,139 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:48,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2647 [2022-12-06 07:33:48,139 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-06 07:33:48,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:48,140 INFO L85 PathProgramCache]: Analyzing trace with hash -120963573, now seen corresponding path program 1 times [2022-12-06 07:33:48,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:48,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392985890] [2022-12-06 07:33:48,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:48,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:48,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-06 07:33:48,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:48,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392985890] [2022-12-06 07:33:48,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392985890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:48,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:48,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:48,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783572692] [2022-12-06 07:33:48,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:48,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:48,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:48,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:48,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:48,210 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:48,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:48,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:48,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:48,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:48,249 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:48,250 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:48,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:48,250 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:48,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:48,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:48,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:48,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:48,251 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:48,251 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:48,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:48,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:48,251 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:48,251 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:48,252 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:48,252 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:48,252 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:48,252 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:48,252 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:48,252 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:48,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:48,254 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:48,254 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:48,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:48,254 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:48,254 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:48,329 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:48,330 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:48,330 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:48,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:48,330 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:48,330 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:48,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2648 [2022-12-06 07:33:48,330 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-06 07:33:48,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:48,330 INFO L85 PathProgramCache]: Analyzing trace with hash -90487380, now seen corresponding path program 1 times [2022-12-06 07:33:48,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:48,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238923102] [2022-12-06 07:33:48,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:48,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:48,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-06 07:33:48,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:48,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238923102] [2022-12-06 07:33:48,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238923102] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:48,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:48,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:48,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883152233] [2022-12-06 07:33:48,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:48,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:48,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:48,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:48,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:48,394 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:48,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:48,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:48,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:48,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:48,435 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:48,435 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:48,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:48,436 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:48,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:48,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:48,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:48,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:48,436 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:48,436 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:48,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:48,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:48,437 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:48,437 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:48,437 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:48,437 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:48,437 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:48,437 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:48,437 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:48,437 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:48,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:48,440 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:48,440 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:48,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:48,440 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:48,440 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:48,514 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:48,515 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:48,515 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:48,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:48,515 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:48,515 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:48,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2649 [2022-12-06 07:33:48,515 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-06 07:33:48,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:48,515 INFO L85 PathProgramCache]: Analyzing trace with hash -63705271, now seen corresponding path program 1 times [2022-12-06 07:33:48,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:48,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176611813] [2022-12-06 07:33:48,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:48,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:48,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-06 07:33:48,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:48,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176611813] [2022-12-06 07:33:48,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176611813] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:48,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:48,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:48,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843879795] [2022-12-06 07:33:48,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:48,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:48,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:48,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:48,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:48,581 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:48,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:48,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:48,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:48,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:48,616 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:48,616 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:48,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:48,617 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:48,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:48,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:48,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:48,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:48,617 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:48,617 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:48,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:48,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:48,618 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:48,618 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:48,618 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:48,618 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:48,618 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:48,619 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:48,619 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:48,619 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:48,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:48,621 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:48,621 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:48,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:48,621 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:48,621 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:48,694 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:48,696 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:48,696 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:48,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:48,696 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:48,696 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:48,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2650 [2022-12-06 07:33:48,696 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-06 07:33:48,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:48,696 INFO L85 PathProgramCache]: Analyzing trace with hash -33229078, now seen corresponding path program 1 times [2022-12-06 07:33:48,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:48,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626970807] [2022-12-06 07:33:48,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:48,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:48,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:48,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:48,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626970807] [2022-12-06 07:33:48,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626970807] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:48,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:48,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:48,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109102767] [2022-12-06 07:33:48,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:48,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:48,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:48,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:48,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:48,762 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:48,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:48,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:48,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:48,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:48,804 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:48,804 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:48,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:48,805 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:48,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:48,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:48,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:48,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:48,805 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:48,805 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:48,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:48,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:48,806 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:48,806 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:48,806 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:48,806 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:48,806 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:48,806 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:48,806 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:48,806 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:48,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:48,809 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:48,809 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:48,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 115 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:48,809 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:48,809 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:48,883 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:48,884 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:48,884 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:48,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:48,884 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:48,884 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:48,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2651 [2022-12-06 07:33:48,885 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-06 07:33:48,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:48,885 INFO L85 PathProgramCache]: Analyzing trace with hash -6446969, now seen corresponding path program 1 times [2022-12-06 07:33:48,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:48,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947113315] [2022-12-06 07:33:48,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:48,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:48,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-06 07:33:48,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:48,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947113315] [2022-12-06 07:33:48,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947113315] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:48,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:48,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:48,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716029710] [2022-12-06 07:33:48,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:48,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:48,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:48,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:48,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:48,953 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:48,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:48,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:48,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:48,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:48,994 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:48,994 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:48,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:48,995 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:48,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:48,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:48,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:48,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:48,995 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:48,995 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:48,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:48,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:48,996 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:48,996 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:48,996 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:48,996 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:48,996 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:48,996 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:48,997 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:48,997 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:48,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:48,999 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:48,999 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:48,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:48,999 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:48,999 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:49,072 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:49,073 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:49,073 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:49,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:49,074 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:49,074 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:49,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2652 [2022-12-06 07:33:49,074 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-06 07:33:49,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:49,074 INFO L85 PathProgramCache]: Analyzing trace with hash 24029224, now seen corresponding path program 1 times [2022-12-06 07:33:49,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:49,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986882470] [2022-12-06 07:33:49,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:49,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:49,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-06 07:33:49,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:49,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986882470] [2022-12-06 07:33:49,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986882470] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:49,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:49,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:49,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742288148] [2022-12-06 07:33:49,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:49,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:49,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:49,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:49,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:49,151 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:49,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:49,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:49,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:49,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:49,193 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:49,193 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:49,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:49,193 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:49,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:49,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:49,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:49,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:49,194 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:49,194 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:49,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:49,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:49,195 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:49,195 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:49,195 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:49,195 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:49,195 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:49,195 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:49,195 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:49,195 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:49,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:49,197 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:49,197 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:49,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:49,198 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:49,198 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:49,273 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:49,274 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:49,274 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:49,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:49,274 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:49,274 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:49,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2653 [2022-12-06 07:33:49,274 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-06 07:33:49,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:49,274 INFO L85 PathProgramCache]: Analyzing trace with hash 50811333, now seen corresponding path program 1 times [2022-12-06 07:33:49,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:49,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074697226] [2022-12-06 07:33:49,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:49,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:49,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-06 07:33:49,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:49,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074697226] [2022-12-06 07:33:49,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074697226] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:49,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:49,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:49,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673618161] [2022-12-06 07:33:49,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:49,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:49,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:49,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:49,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:49,343 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:49,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:49,344 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:49,344 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:49,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:49,385 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:49,385 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:49,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:49,386 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:49,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:49,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:49,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:49,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:49,387 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:49,387 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:49,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:49,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:49,387 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:49,387 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:49,388 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:49,388 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:49,388 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:49,388 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:49,388 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:49,388 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:49,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:49,390 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:49,390 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:49,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:49,390 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:49,391 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:49,466 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:49,467 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:49,467 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:49,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:49,467 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:49,467 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:49,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2654 [2022-12-06 07:33:49,467 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-06 07:33:49,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:49,467 INFO L85 PathProgramCache]: Analyzing trace with hash 81287526, now seen corresponding path program 1 times [2022-12-06 07:33:49,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:49,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147588890] [2022-12-06 07:33:49,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:49,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:49,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-06 07:33:49,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:49,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147588890] [2022-12-06 07:33:49,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147588890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:49,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:49,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:49,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947296222] [2022-12-06 07:33:49,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:49,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:49,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:49,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:49,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:49,533 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:49,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:49,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:49,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:49,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:49,575 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:49,576 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:49,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:49,576 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:49,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:49,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:49,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:49,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:49,577 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:49,577 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:49,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:49,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:49,577 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:49,577 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:49,577 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:49,578 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:49,578 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:49,578 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:49,578 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:49,578 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:49,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:49,580 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:49,580 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:49,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:49,580 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:49,580 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:49,653 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:49,654 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:33:49,654 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:49,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:49,654 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:49,654 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:49,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2655 [2022-12-06 07:33:49,654 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-06 07:33:49,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:49,654 INFO L85 PathProgramCache]: Analyzing trace with hash 108069635, now seen corresponding path program 1 times [2022-12-06 07:33:49,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:49,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891962001] [2022-12-06 07:33:49,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:49,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:49,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-06 07:33:49,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:49,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891962001] [2022-12-06 07:33:49,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891962001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:49,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:49,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:49,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427960979] [2022-12-06 07:33:49,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:49,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:49,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:49,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:49,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:49,723 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:49,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:49,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:49,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:49,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:49,763 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:49,764 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:49,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:49,764 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:49,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:49,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:49,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:49,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:49,765 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:49,765 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:49,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:49,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:49,765 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:49,765 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:49,766 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:49,766 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:49,766 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:49,766 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:49,766 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:49,766 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:49,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:49,768 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:49,768 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:49,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:49,768 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:49,768 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:49,841 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:49,842 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:33:49,843 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:49,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:49,843 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:49,843 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:49,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2656 [2022-12-06 07:33:49,843 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-06 07:33:49,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:49,843 INFO L85 PathProgramCache]: Analyzing trace with hash 138545828, now seen corresponding path program 1 times [2022-12-06 07:33:49,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:49,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822133284] [2022-12-06 07:33:49,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:49,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:49,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-06 07:33:49,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:49,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822133284] [2022-12-06 07:33:49,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822133284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:49,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:49,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:49,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125355485] [2022-12-06 07:33:49,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:49,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:49,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:49,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:49,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:49,909 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:49,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:49,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:49,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:49,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:49,946 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:49,946 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:49,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:49,947 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:49,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:49,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:49,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:49,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:49,947 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:49,947 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:49,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:49,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:49,948 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:49,948 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:49,948 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:49,948 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:49,948 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:49,949 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:49,949 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:49,949 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:49,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:49,951 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:49,951 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:49,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:49,951 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:49,951 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:50,026 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:50,027 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:50,027 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:50,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:50,028 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:50,028 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:50,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2657 [2022-12-06 07:33:50,028 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-06 07:33:50,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:50,028 INFO L85 PathProgramCache]: Analyzing trace with hash 165327937, now seen corresponding path program 1 times [2022-12-06 07:33:50,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:50,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849674627] [2022-12-06 07:33:50,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:50,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:50,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-06 07:33:50,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:50,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849674627] [2022-12-06 07:33:50,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849674627] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:50,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:50,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:50,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924602458] [2022-12-06 07:33:50,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:50,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:50,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:50,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:50,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:50,113 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:50,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:50,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:50,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:50,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:50,150 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:50,150 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:50,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:50,150 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:50,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:50,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:50,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:50,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:50,151 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:50,151 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:50,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:50,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:50,152 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:50,152 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:50,152 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:50,152 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:50,152 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:50,152 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:50,152 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:50,152 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:50,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:50,155 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:50,155 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:50,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:50,155 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:50,155 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:50,232 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:50,233 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:33:50,233 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:50,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:50,233 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:50,233 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:50,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2658 [2022-12-06 07:33:50,233 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-06 07:33:50,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:50,233 INFO L85 PathProgramCache]: Analyzing trace with hash 195804130, now seen corresponding path program 1 times [2022-12-06 07:33:50,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:50,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132285897] [2022-12-06 07:33:50,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:50,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:50,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-06 07:33:50,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:50,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132285897] [2022-12-06 07:33:50,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132285897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:50,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:50,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:50,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632507036] [2022-12-06 07:33:50,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:50,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:50,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:50,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:50,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:50,299 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:50,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:50,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:50,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:50,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:50,335 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:50,335 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:50,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:50,336 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:50,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:50,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:50,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:50,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:50,336 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:50,336 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:50,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:50,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:50,337 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:50,337 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:50,337 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:50,337 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:50,337 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:50,337 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:50,337 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:50,337 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:50,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:50,340 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:50,340 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:50,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:50,340 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:50,340 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:50,414 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:50,415 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:50,415 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:50,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:50,415 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:50,415 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:50,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2659 [2022-12-06 07:33:50,415 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-06 07:33:50,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:50,416 INFO L85 PathProgramCache]: Analyzing trace with hash 222586239, now seen corresponding path program 1 times [2022-12-06 07:33:50,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:50,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138359749] [2022-12-06 07:33:50,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:50,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:50,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-06 07:33:50,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:50,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138359749] [2022-12-06 07:33:50,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138359749] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:50,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:50,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:50,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034766469] [2022-12-06 07:33:50,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:50,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:50,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:50,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:50,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:50,485 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:50,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:50,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:50,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:50,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:50,526 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:50,526 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:50,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:50,526 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:50,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:50,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:50,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:50,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:50,527 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:50,527 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:50,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:50,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:50,528 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:50,528 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:50,528 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:50,528 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:50,528 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:50,528 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:50,528 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:50,528 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:50,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:50,530 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:50,530 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:50,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:50,531 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:50,531 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:50,605 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:50,606 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:50,606 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:50,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:50,606 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:50,606 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:50,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2660 [2022-12-06 07:33:50,606 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-06 07:33:50,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:50,606 INFO L85 PathProgramCache]: Analyzing trace with hash 253062432, now seen corresponding path program 1 times [2022-12-06 07:33:50,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:50,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503067509] [2022-12-06 07:33:50,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:50,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:50,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-06 07:33:50,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:50,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503067509] [2022-12-06 07:33:50,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503067509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:50,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:50,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:50,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313799018] [2022-12-06 07:33:50,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:50,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:50,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:50,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:50,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:50,672 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:50,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:50,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:50,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:50,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:50,713 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:50,714 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:50,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:50,714 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:50,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:50,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:50,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:50,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:50,715 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:50,715 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:50,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:50,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:50,715 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:50,715 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:50,715 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:50,716 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:50,716 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:50,716 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:50,716 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:50,716 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:50,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:50,718 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:50,718 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:50,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:50,718 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:50,718 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:50,794 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:50,795 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:50,795 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:50,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:50,795 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:50,795 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:50,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2661 [2022-12-06 07:33:50,795 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-06 07:33:50,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:50,796 INFO L85 PathProgramCache]: Analyzing trace with hash 279844541, now seen corresponding path program 1 times [2022-12-06 07:33:50,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:50,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281626396] [2022-12-06 07:33:50,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:50,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:50,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:50,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:50,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281626396] [2022-12-06 07:33:50,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281626396] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:50,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:50,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:50,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72624601] [2022-12-06 07:33:50,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:50,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:50,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:50,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:50,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:50,866 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:50,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:50,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:50,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:50,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:50,908 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:50,909 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:50,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:50,909 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:50,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:50,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:50,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:50,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:50,910 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:50,910 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:50,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:50,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:50,911 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:50,911 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:50,911 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:50,911 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:50,911 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:50,911 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:50,911 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:50,911 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:50,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:50,913 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:50,913 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:50,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:50,914 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:50,914 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:50,989 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:50,990 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:50,990 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:50,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:50,990 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:50,990 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:50,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2662 [2022-12-06 07:33:50,990 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-06 07:33:50,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:50,990 INFO L85 PathProgramCache]: Analyzing trace with hash 310320734, now seen corresponding path program 1 times [2022-12-06 07:33:50,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:50,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533260025] [2022-12-06 07:33:50,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:50,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:51,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:51,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:51,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533260025] [2022-12-06 07:33:51,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533260025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:51,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:51,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:51,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847046578] [2022-12-06 07:33:51,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:51,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:51,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:51,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:51,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:51,057 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:51,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:51,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:51,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:51,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:51,092 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:51,092 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:51,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:51,093 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:51,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:51,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:51,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:51,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:51,093 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:51,093 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:51,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:51,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:51,094 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:51,094 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:51,094 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:51,094 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:51,094 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:51,095 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:51,095 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:51,095 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:51,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:51,097 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:51,097 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:51,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:51,097 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:51,097 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:51,174 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:51,175 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:33:51,175 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:51,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:51,175 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:51,175 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:51,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2663 [2022-12-06 07:33:51,176 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-06 07:33:51,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:51,176 INFO L85 PathProgramCache]: Analyzing trace with hash 337102843, now seen corresponding path program 1 times [2022-12-06 07:33:51,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:51,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142122530] [2022-12-06 07:33:51,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:51,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:51,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-06 07:33:51,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:51,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142122530] [2022-12-06 07:33:51,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142122530] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:51,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:51,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:51,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795132345] [2022-12-06 07:33:51,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:51,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:51,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:51,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:51,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:51,265 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:51,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:51,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:51,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:51,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:51,306 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:51,306 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:51,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:51,306 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:51,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:51,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:51,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:51,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:51,307 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:51,307 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:51,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:51,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:51,308 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:51,308 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:51,308 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:51,308 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:51,308 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:51,308 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:51,308 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:51,308 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:51,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:51,310 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:51,310 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:51,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:51,311 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:51,311 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:51,386 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:51,387 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:51,387 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:51,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:51,387 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:51,387 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:51,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2664 [2022-12-06 07:33:51,387 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-06 07:33:51,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:51,387 INFO L85 PathProgramCache]: Analyzing trace with hash 367579036, now seen corresponding path program 1 times [2022-12-06 07:33:51,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:51,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030039787] [2022-12-06 07:33:51,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:51,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:51,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-06 07:33:51,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:51,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030039787] [2022-12-06 07:33:51,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030039787] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:51,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:51,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:51,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879726676] [2022-12-06 07:33:51,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:51,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:51,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:51,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:51,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:51,453 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:51,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:51,453 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:51,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:51,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:51,491 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:51,491 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:51,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:51,492 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:51,492 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:51,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:51,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:51,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:51,492 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:51,492 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:51,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:51,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:51,493 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:51,493 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:51,493 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:51,493 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:51,493 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:51,493 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:51,493 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:51,494 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:51,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:51,496 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:51,496 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:51,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:51,496 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:51,496 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:51,573 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:51,575 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:33:51,575 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:51,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:51,575 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:51,575 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:51,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2665 [2022-12-06 07:33:51,575 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-06 07:33:51,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:51,575 INFO L85 PathProgramCache]: Analyzing trace with hash 394361145, now seen corresponding path program 1 times [2022-12-06 07:33:51,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:51,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065668679] [2022-12-06 07:33:51,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:51,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:51,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-06 07:33:51,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:51,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065668679] [2022-12-06 07:33:51,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065668679] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:51,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:51,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:51,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775143193] [2022-12-06 07:33:51,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:51,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:51,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:51,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:51,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:51,645 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:51,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:51,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:51,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:51,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:51,704 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:51,704 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:51,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:51,705 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:51,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:51,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:51,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:51,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:51,705 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:51,705 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:51,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:51,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:51,706 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:51,706 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:51,707 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:51,707 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:51,707 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:51,707 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:51,707 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:51,707 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:51,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:51,710 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:51,710 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:51,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:51,710 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:51,710 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:51,801 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:51,802 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 07:33:51,802 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:51,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:51,802 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:51,802 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:51,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2666 [2022-12-06 07:33:51,802 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-06 07:33:51,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:51,803 INFO L85 PathProgramCache]: Analyzing trace with hash 424837338, now seen corresponding path program 1 times [2022-12-06 07:33:51,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:51,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984857335] [2022-12-06 07:33:51,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:51,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:51,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-06 07:33:51,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:51,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984857335] [2022-12-06 07:33:51,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984857335] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:51,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:51,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:51,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884678750] [2022-12-06 07:33:51,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:51,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:51,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:51,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:51,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:51,889 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:51,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:51,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:51,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:51,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:51,939 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:51,939 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:51,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:51,940 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:51,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:51,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:51,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:51,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:51,941 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:51,941 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:51,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:51,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:51,942 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:51,942 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:51,942 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:51,942 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:51,942 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:51,942 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:51,942 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:51,942 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:51,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:51,945 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:51,945 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:51,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:51,946 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:51,946 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:52,039 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:52,040 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 07:33:52,041 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:52,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:52,041 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:52,041 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:52,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2667 [2022-12-06 07:33:52,041 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-06 07:33:52,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:52,041 INFO L85 PathProgramCache]: Analyzing trace with hash 451619447, now seen corresponding path program 1 times [2022-12-06 07:33:52,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:52,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914611257] [2022-12-06 07:33:52,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:52,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:52,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-06 07:33:52,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:52,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914611257] [2022-12-06 07:33:52,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914611257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:52,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:52,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:52,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623001635] [2022-12-06 07:33:52,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:52,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:52,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:52,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:52,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:52,110 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:52,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:52,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:52,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:52,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:52,152 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:52,152 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:52,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:52,153 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:52,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:52,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:52,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:52,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:52,153 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:52,153 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:52,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:52,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:52,154 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:52,154 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:52,154 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:52,154 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:52,154 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:52,155 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:52,155 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:52,155 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:52,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:52,157 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:52,157 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:52,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:52,157 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:52,157 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:52,233 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:52,234 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:33:52,234 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:52,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:52,234 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:52,234 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:52,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2668 [2022-12-06 07:33:52,234 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-06 07:33:52,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:52,234 INFO L85 PathProgramCache]: Analyzing trace with hash 482095640, now seen corresponding path program 1 times [2022-12-06 07:33:52,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:52,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668241980] [2022-12-06 07:33:52,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:52,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:52,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:52,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:52,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668241980] [2022-12-06 07:33:52,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668241980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:52,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:52,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:52,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303740052] [2022-12-06 07:33:52,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:52,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:52,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:52,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:52,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:52,303 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:52,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:52,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:52,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:52,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:52,341 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:52,341 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:52,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:52,341 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:52,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:52,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:52,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:52,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:52,342 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:52,342 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:52,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:52,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:52,343 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:52,343 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:52,343 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:52,343 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:52,343 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:52,343 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:52,353 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:52,353 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:52,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:52,356 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:52,356 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:52,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:52,356 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:52,356 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:52,431 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:52,432 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 07:33:52,433 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:52,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:52,433 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:52,433 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:52,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2669 [2022-12-06 07:33:52,433 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-06 07:33:52,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:52,433 INFO L85 PathProgramCache]: Analyzing trace with hash 508877749, now seen corresponding path program 1 times [2022-12-06 07:33:52,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:52,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540178000] [2022-12-06 07:33:52,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:52,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:52,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-06 07:33:52,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:52,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540178000] [2022-12-06 07:33:52,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540178000] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:52,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:52,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:52,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158123779] [2022-12-06 07:33:52,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:52,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:52,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:52,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:52,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:52,514 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:52,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:52,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:52,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:52,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:52,565 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:52,565 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:52,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:52,565 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:52,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:52,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:52,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:52,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:52,566 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:52,566 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:52,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:52,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:52,567 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:52,567 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:52,567 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:52,568 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:52,568 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:52,568 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:52,568 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:52,568 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:52,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:52,571 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:52,571 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:52,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:52,571 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:52,571 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:52,666 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:52,668 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 07:33:52,668 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:52,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:52,668 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:52,668 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:52,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2670 [2022-12-06 07:33:52,668 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-06 07:33:52,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:52,668 INFO L85 PathProgramCache]: Analyzing trace with hash 539353942, now seen corresponding path program 1 times [2022-12-06 07:33:52,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:52,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990031360] [2022-12-06 07:33:52,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:52,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:52,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:52,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-06 07:33:52,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:52,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990031360] [2022-12-06 07:33:52,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990031360] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:52,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:52,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:52,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557112716] [2022-12-06 07:33:52,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:52,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:52,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:52,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:52,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:52,751 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:52,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:52,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:52,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:52,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:52,796 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:52,796 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:52,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:52,797 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:52,797 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:52,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:52,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:52,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:52,797 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:52,797 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:52,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:52,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:52,798 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:52,798 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:52,798 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:52,798 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:52,798 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:52,799 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:52,799 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:52,799 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:52,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:52,801 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:52,801 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:52,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:52,801 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:52,801 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:52,875 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:52,876 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:52,876 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:52,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:52,877 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:52,877 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:52,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2671 [2022-12-06 07:33:52,877 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-06 07:33:52,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:52,877 INFO L85 PathProgramCache]: Analyzing trace with hash 566136051, now seen corresponding path program 1 times [2022-12-06 07:33:52,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:52,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028412745] [2022-12-06 07:33:52,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:52,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:52,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:52,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:52,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028412745] [2022-12-06 07:33:52,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028412745] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:52,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:52,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:52,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626651627] [2022-12-06 07:33:52,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:52,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:52,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:52,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:52,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:52,945 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:52,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:52,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:52,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:52,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:52,981 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:52,981 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:52,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:52,982 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:52,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:52,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:52,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:52,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:52,982 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:52,983 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:52,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:52,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:52,983 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:52,983 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:52,983 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:52,984 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:52,984 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:52,984 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:52,984 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:52,984 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:52,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:52,986 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:52,986 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:52,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:52,986 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:52,987 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:53,064 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:53,065 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:33:53,065 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:53,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:53,065 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:53,065 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:53,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2672 [2022-12-06 07:33:53,065 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-06 07:33:53,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:53,065 INFO L85 PathProgramCache]: Analyzing trace with hash 596612244, now seen corresponding path program 1 times [2022-12-06 07:33:53,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:53,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850466912] [2022-12-06 07:33:53,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:53,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:53,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-06 07:33:53,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:53,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850466912] [2022-12-06 07:33:53,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850466912] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:53,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:53,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:53,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78549067] [2022-12-06 07:33:53,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:53,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:53,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:53,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:53,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:53,134 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:53,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:53,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:53,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:53,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:53,172 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:53,172 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:53,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:53,172 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:53,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:53,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:53,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:53,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:53,173 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:53,173 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:53,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:53,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:53,174 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:53,174 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:53,174 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:53,174 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:53,174 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:53,174 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:53,174 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:53,174 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:53,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:53,176 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:53,176 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:53,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:53,177 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:53,177 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:53,251 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:53,252 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:53,252 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:53,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:53,252 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:53,252 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:53,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2673 [2022-12-06 07:33:53,252 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-06 07:33:53,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:53,253 INFO L85 PathProgramCache]: Analyzing trace with hash 623394353, now seen corresponding path program 1 times [2022-12-06 07:33:53,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:53,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466949604] [2022-12-06 07:33:53,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:53,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:53,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-06 07:33:53,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:53,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466949604] [2022-12-06 07:33:53,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466949604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:53,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:53,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:53,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299407181] [2022-12-06 07:33:53,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:53,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:53,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:53,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:53,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:53,321 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:53,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:53,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:53,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:53,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:53,362 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:53,362 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:53,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:53,363 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:53,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:53,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:53,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:53,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:53,363 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:53,363 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:53,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:53,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:53,364 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:53,364 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:53,364 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:53,364 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:53,364 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:53,364 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:53,364 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:53,364 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:53,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:53,366 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:53,367 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:53,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:53,367 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:53,367 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:53,443 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:53,444 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:33:53,444 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:53,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:53,444 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:53,444 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:53,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2674 [2022-12-06 07:33:53,444 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-06 07:33:53,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:53,444 INFO L85 PathProgramCache]: Analyzing trace with hash 653870546, now seen corresponding path program 1 times [2022-12-06 07:33:53,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:53,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526055111] [2022-12-06 07:33:53,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:53,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:53,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-06 07:33:53,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:53,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526055111] [2022-12-06 07:33:53,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526055111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:53,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:53,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:53,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524434409] [2022-12-06 07:33:53,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:53,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:53,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:53,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:53,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:53,525 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:53,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:53,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:53,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:53,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:53,561 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:53,561 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:53,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:53,562 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:53,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:53,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:53,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:53,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:53,562 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:53,562 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:53,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:53,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:53,563 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:53,563 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:53,563 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:53,563 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:53,563 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:53,563 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:53,563 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:53,564 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:53,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:53,566 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:53,566 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:53,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:53,566 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:53,566 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:53,640 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:53,641 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:53,642 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:53,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:53,642 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:53,642 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:53,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2675 [2022-12-06 07:33:53,642 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-06 07:33:53,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:53,642 INFO L85 PathProgramCache]: Analyzing trace with hash 680652655, now seen corresponding path program 1 times [2022-12-06 07:33:53,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:53,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928958793] [2022-12-06 07:33:53,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:53,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:53,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-06 07:33:53,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:53,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928958793] [2022-12-06 07:33:53,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928958793] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:53,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:53,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:53,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853913813] [2022-12-06 07:33:53,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:53,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:53,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:53,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:53,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:53,710 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:53,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:53,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:53,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:53,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:53,747 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:53,747 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:53,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:53,747 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:53,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:53,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:53,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:53,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:53,748 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:53,748 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:53,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:53,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:53,749 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:53,749 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:53,749 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:53,749 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:53,749 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:53,749 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:53,749 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:53,749 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:53,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:53,751 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:53,752 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:53,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:53,752 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:53,752 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:53,830 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:53,831 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:33:53,831 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:53,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:53,831 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:53,831 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:53,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2676 [2022-12-06 07:33:53,832 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-06 07:33:53,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:53,832 INFO L85 PathProgramCache]: Analyzing trace with hash 711128848, now seen corresponding path program 1 times [2022-12-06 07:33:53,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:53,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536728442] [2022-12-06 07:33:53,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:53,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:53,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-06 07:33:53,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:53,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536728442] [2022-12-06 07:33:53,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536728442] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:53,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:53,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:53,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640350945] [2022-12-06 07:33:53,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:53,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:53,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:53,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:53,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:53,898 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:53,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:53,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:53,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:53,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:53,934 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:53,934 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:53,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:53,935 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:53,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:53,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:53,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:53,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:53,935 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:53,935 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:53,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:53,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:53,936 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:53,936 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:53,936 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:53,936 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:53,936 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:53,937 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:53,937 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:53,937 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:53,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:53,939 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:53,939 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:53,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:53,939 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:53,939 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:54,013 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:54,014 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:54,014 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:54,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:54,014 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:54,014 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:54,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2677 [2022-12-06 07:33:54,014 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-06 07:33:54,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:54,014 INFO L85 PathProgramCache]: Analyzing trace with hash 737910957, now seen corresponding path program 1 times [2022-12-06 07:33:54,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:54,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458494900] [2022-12-06 07:33:54,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:54,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:54,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-06 07:33:54,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:54,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458494900] [2022-12-06 07:33:54,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458494900] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:54,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:54,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:54,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669745536] [2022-12-06 07:33:54,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:54,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:54,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:54,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:54,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:54,082 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:54,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:54,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:54,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:54,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:54,118 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:54,118 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:54,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:54,119 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:54,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:54,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:54,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:54,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:54,119 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:54,119 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:54,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:54,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:54,120 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:54,120 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:54,120 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:54,120 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:54,120 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:54,120 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:54,120 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:54,120 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:54,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:54,123 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:54,123 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:54,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:54,123 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:54,123 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:54,196 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:54,197 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:54,197 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:54,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:54,197 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:54,198 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:54,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2678 [2022-12-06 07:33:54,198 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-06 07:33:54,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:54,198 INFO L85 PathProgramCache]: Analyzing trace with hash 768387150, now seen corresponding path program 1 times [2022-12-06 07:33:54,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:54,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980273231] [2022-12-06 07:33:54,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:54,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:54,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-06 07:33:54,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:54,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980273231] [2022-12-06 07:33:54,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980273231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:54,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:54,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:54,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540241940] [2022-12-06 07:33:54,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:54,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:54,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:54,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:54,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:54,263 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:54,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:54,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:54,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:54,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:54,305 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:54,305 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:54,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:54,306 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:54,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:54,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:54,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:54,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:54,306 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:54,306 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:54,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:54,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:54,307 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:54,307 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:54,307 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:54,307 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:54,307 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:54,307 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:54,308 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:54,308 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:54,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:54,310 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:54,310 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:54,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:54,310 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:54,310 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:54,383 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:54,384 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:54,384 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:54,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:54,385 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:54,385 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:54,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2679 [2022-12-06 07:33:54,385 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-06 07:33:54,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:54,385 INFO L85 PathProgramCache]: Analyzing trace with hash 795169259, now seen corresponding path program 1 times [2022-12-06 07:33:54,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:54,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496377272] [2022-12-06 07:33:54,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:54,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:54,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-06 07:33:54,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:54,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496377272] [2022-12-06 07:33:54,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496377272] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:54,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:54,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:54,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529801516] [2022-12-06 07:33:54,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:54,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:54,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:54,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:54,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:54,454 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:54,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:54,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:54,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:54,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:54,490 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:54,491 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:54,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:54,491 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:54,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:54,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:54,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:54,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:54,492 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:54,492 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:54,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:54,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:54,492 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:54,493 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:54,493 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:54,493 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:54,493 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:54,493 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:54,493 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:54,493 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:54,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:54,495 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:54,495 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:54,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:54,496 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:54,496 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:54,572 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:54,573 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:33:54,573 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:54,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:54,574 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:54,583 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:54,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2680 [2022-12-06 07:33:54,583 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-06 07:33:54,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:54,584 INFO L85 PathProgramCache]: Analyzing trace with hash 825645452, now seen corresponding path program 1 times [2022-12-06 07:33:54,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:54,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207998382] [2022-12-06 07:33:54,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:54,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:54,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-06 07:33:54,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:54,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207998382] [2022-12-06 07:33:54,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207998382] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:54,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:54,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:54,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376231794] [2022-12-06 07:33:54,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:54,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:54,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:54,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:54,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:54,652 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:54,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:54,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:54,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:54,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:54,695 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:54,695 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:54,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:54,695 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:54,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:54,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:54,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:54,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:54,696 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:54,696 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:54,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:54,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:54,697 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:54,697 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:54,697 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:54,697 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:54,697 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:54,697 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:54,697 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:54,697 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:54,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:54,699 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:54,699 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:54,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:54,700 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:54,700 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:54,773 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:54,774 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:54,774 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:54,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:54,774 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:54,774 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:54,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2681 [2022-12-06 07:33:54,774 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-06 07:33:54,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:54,774 INFO L85 PathProgramCache]: Analyzing trace with hash 852427561, now seen corresponding path program 1 times [2022-12-06 07:33:54,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:54,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842341063] [2022-12-06 07:33:54,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:54,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:54,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-06 07:33:54,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:54,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842341063] [2022-12-06 07:33:54,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842341063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:54,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:54,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:54,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437119426] [2022-12-06 07:33:54,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:54,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:54,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:54,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:54,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:54,843 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:54,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:54,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:54,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:54,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:54,877 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:54,877 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:54,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:54,878 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:54,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:54,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:54,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:54,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:54,878 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:54,878 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:54,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:54,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:54,879 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:54,879 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:54,879 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:54,879 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:54,879 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:54,879 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:54,880 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:54,880 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:54,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:54,882 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:54,882 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:54,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:54,882 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:54,882 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:54,955 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:54,956 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:54,956 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:54,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:54,956 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:54,956 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:54,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2682 [2022-12-06 07:33:54,956 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-06 07:33:54,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:54,956 INFO L85 PathProgramCache]: Analyzing trace with hash 882903754, now seen corresponding path program 1 times [2022-12-06 07:33:54,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:54,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149186182] [2022-12-06 07:33:54,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:54,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:55,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-06 07:33:55,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:55,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149186182] [2022-12-06 07:33:55,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149186182] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:55,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:55,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:55,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662121713] [2022-12-06 07:33:55,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:55,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:55,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:55,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:55,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:55,022 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:55,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:55,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:55,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:55,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:55,063 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:55,063 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:55,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:55,063 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:55,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:55,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:55,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:55,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:55,064 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:55,064 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:55,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:55,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:55,065 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:55,065 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:55,065 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:55,065 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:55,065 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:55,065 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:55,065 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:55,065 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:55,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:55,068 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:55,068 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:55,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:55,068 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:55,068 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:55,142 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:55,143 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:55,143 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:55,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:55,143 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:55,143 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:55,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2683 [2022-12-06 07:33:55,143 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-06 07:33:55,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:55,144 INFO L85 PathProgramCache]: Analyzing trace with hash 909685863, now seen corresponding path program 1 times [2022-12-06 07:33:55,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:55,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432721065] [2022-12-06 07:33:55,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:55,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:55,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-06 07:33:55,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:55,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432721065] [2022-12-06 07:33:55,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432721065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:55,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:55,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:55,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144056518] [2022-12-06 07:33:55,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:55,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:55,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:55,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:55,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:55,213 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:55,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:55,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:55,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:55,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:55,254 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:55,254 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:55,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:55,255 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:55,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:55,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:55,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:55,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:55,255 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:55,256 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:55,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:55,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:55,256 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:55,256 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:55,256 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:55,256 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:55,257 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:55,257 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:55,257 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:55,257 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:55,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:55,259 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:55,259 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:55,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:55,259 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:55,259 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:55,334 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:55,335 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:55,335 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:55,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:55,335 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:55,335 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:55,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2684 [2022-12-06 07:33:55,335 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-06 07:33:55,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:55,335 INFO L85 PathProgramCache]: Analyzing trace with hash 940162056, now seen corresponding path program 1 times [2022-12-06 07:33:55,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:55,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995296127] [2022-12-06 07:33:55,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:55,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:55,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:55,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-06 07:33:55,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:55,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995296127] [2022-12-06 07:33:55,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995296127] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:55,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:55,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:55,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265275974] [2022-12-06 07:33:55,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:55,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:55,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:55,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:55,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:55,413 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:55,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:55,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:55,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:55,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:55,456 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:55,456 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:55,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:55,456 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:55,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:55,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:55,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:55,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:55,457 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:55,457 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:55,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:55,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:55,458 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:55,458 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:55,458 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:55,458 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:55,458 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:55,458 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:55,458 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:55,458 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:55,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:55,460 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:55,460 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:55,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:55,461 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:55,461 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:55,536 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:55,537 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:55,538 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:55,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:55,538 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:55,538 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:55,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2685 [2022-12-06 07:33:55,538 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-06 07:33:55,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:55,538 INFO L85 PathProgramCache]: Analyzing trace with hash 966944165, now seen corresponding path program 1 times [2022-12-06 07:33:55,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:55,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027180165] [2022-12-06 07:33:55,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:55,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:55,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-06 07:33:55,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:55,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027180165] [2022-12-06 07:33:55,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027180165] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:55,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:55,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:55,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179188528] [2022-12-06 07:33:55,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:55,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:55,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:55,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:55,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:55,622 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:55,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:55,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:55,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:55,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:55,684 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:55,684 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:55,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:55,685 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:55,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:55,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:55,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:55,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:55,685 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:55,685 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:55,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:55,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:55,686 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:55,686 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:55,686 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:55,686 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:55,686 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:55,687 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:55,687 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:55,687 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:55,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:55,689 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:55,689 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:55,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:55,689 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:55,689 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:55,783 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:55,784 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 07:33:55,784 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:55,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:55,784 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:55,784 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:55,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2686 [2022-12-06 07:33:55,785 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-06 07:33:55,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:55,785 INFO L85 PathProgramCache]: Analyzing trace with hash 997420358, now seen corresponding path program 1 times [2022-12-06 07:33:55,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:55,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727102943] [2022-12-06 07:33:55,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:55,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:55,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-06 07:33:55,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:55,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727102943] [2022-12-06 07:33:55,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727102943] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:55,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:55,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:55,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199671318] [2022-12-06 07:33:55,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:55,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:55,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:55,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:55,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:55,877 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:55,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:55,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:55,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:55,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:55,932 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:55,932 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:55,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:55,933 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:55,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:55,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:55,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:55,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:55,933 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:55,934 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:55,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:55,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:55,934 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:55,935 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:55,935 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:55,935 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:55,935 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:55,935 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:55,935 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:55,935 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:55,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:55,938 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:55,938 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:55,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:55,938 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:55,939 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:56,032 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:56,034 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 07:33:56,034 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:56,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:56,034 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:56,034 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:56,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2687 [2022-12-06 07:33:56,034 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-06 07:33:56,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:56,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1024202467, now seen corresponding path program 1 times [2022-12-06 07:33:56,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:56,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4579634] [2022-12-06 07:33:56,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:56,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:56,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-06 07:33:56,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:56,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4579634] [2022-12-06 07:33:56,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4579634] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:56,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:56,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:56,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946718903] [2022-12-06 07:33:56,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:56,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:56,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:56,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:56,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:56,130 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:56,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:56,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:56,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:56,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:56,187 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:56,187 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:56,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:56,188 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:56,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:56,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:56,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:56,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:56,189 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:56,189 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:56,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:56,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:56,190 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:56,190 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:56,190 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:56,190 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:56,190 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:56,190 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:56,190 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:56,190 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:56,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:56,193 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:56,193 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:56,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:56,194 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:56,194 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:56,279 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:56,280 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-06 07:33:56,280 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:56,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:56,280 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:56,280 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:56,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2688 [2022-12-06 07:33:56,280 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-06 07:33:56,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:56,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1054678660, now seen corresponding path program 1 times [2022-12-06 07:33:56,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:56,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013122094] [2022-12-06 07:33:56,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:56,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33: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-06 07:33:56,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:56,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013122094] [2022-12-06 07:33:56,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013122094] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:56,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:56,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:56,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198001418] [2022-12-06 07:33:56,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:56,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:56,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:56,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:56,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:56,347 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:56,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:56,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:56,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:56,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:56,389 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:56,389 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:56,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:56,389 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:56,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:56,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:56,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:56,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:56,390 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:56,390 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:56,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:56,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:56,391 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:56,391 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:56,391 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:56,391 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:56,391 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:56,391 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:56,391 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:56,391 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:56,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:56,393 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:56,393 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:56,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:56,394 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:56,394 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:56,470 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:56,471 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:33:56,471 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:56,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:56,471 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:56,471 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:56,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2689 [2022-12-06 07:33:56,471 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-06 07:33:56,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:56,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1081460769, now seen corresponding path program 1 times [2022-12-06 07:33:56,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:56,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365299805] [2022-12-06 07:33:56,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:56,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:56,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-06 07:33:56,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:56,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365299805] [2022-12-06 07:33:56,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365299805] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:56,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:56,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:56,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346741366] [2022-12-06 07:33:56,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:56,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:56,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:56,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:56,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:56,541 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:56,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:56,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:56,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:56,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:56,582 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:56,582 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:56,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:56,583 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:56,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:56,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:56,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:56,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:56,583 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:56,583 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:56,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:56,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:56,584 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:56,584 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:56,584 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:56,584 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:56,585 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:56,585 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:56,585 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:56,585 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:56,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:56,587 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:56,587 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:56,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:56,587 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:56,587 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:56,664 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:56,665 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:33:56,665 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:56,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:56,665 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:56,665 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:56,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2690 [2022-12-06 07:33:56,665 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-06 07:33:56,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:56,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1111936962, now seen corresponding path program 1 times [2022-12-06 07:33:56,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:56,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513575469] [2022-12-06 07:33:56,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:56,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:56,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:56,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:56,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513575469] [2022-12-06 07:33:56,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513575469] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:56,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:56,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:56,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974411660] [2022-12-06 07:33:56,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:56,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:56,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:56,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:56,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:56,732 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:56,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:56,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:56,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:56,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:56,769 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:56,769 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:56,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:56,769 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:56,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:56,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:56,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:56,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:56,770 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:56,770 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:56,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:56,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:56,771 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:56,771 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:56,771 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:56,771 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:56,771 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:56,771 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:56,771 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:56,771 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:56,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:56,773 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:56,773 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:56,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:56,774 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:56,774 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:56,847 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:56,848 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:56,848 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:56,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:56,848 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:56,848 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:56,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2691 [2022-12-06 07:33:56,849 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-06 07:33:56,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:56,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1138719071, now seen corresponding path program 1 times [2022-12-06 07:33:56,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:56,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186010028] [2022-12-06 07:33:56,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:56,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33: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-06 07:33:56,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:56,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186010028] [2022-12-06 07:33:56,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186010028] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:56,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:56,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:56,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17155942] [2022-12-06 07:33:56,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:56,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:56,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:56,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:56,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:56,926 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:56,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:56,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:56,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:56,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:56,962 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:56,962 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:56,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:56,962 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:56,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:56,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:56,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:56,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:56,963 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:56,963 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:56,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:56,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:56,964 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:56,964 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:56,964 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:56,964 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:56,964 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:56,964 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:56,964 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:56,964 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:56,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:56,966 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:56,967 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:56,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:56,967 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:56,967 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:57,040 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:57,041 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:57,041 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:57,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:57,042 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:57,042 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:57,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2692 [2022-12-06 07:33:57,042 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-06 07:33:57,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:57,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1169195264, now seen corresponding path program 1 times [2022-12-06 07:33:57,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:57,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841994870] [2022-12-06 07:33:57,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:57,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:57,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-06 07:33:57,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:57,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841994870] [2022-12-06 07:33:57,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841994870] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:57,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:57,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:57,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870900277] [2022-12-06 07:33:57,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:57,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:57,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:57,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:57,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:57,109 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:57,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:57,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:57,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:57,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:57,145 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:57,145 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:57,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:57,146 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:57,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:57,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:57,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:57,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:57,146 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:57,146 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:57,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:57,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:57,147 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:57,147 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:57,147 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:57,147 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:57,147 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:57,147 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:57,147 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:57,147 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:57,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:57,150 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:57,150 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:57,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 118 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:57,150 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:57,150 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:57,224 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:57,225 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:57,225 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:57,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:57,225 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:57,225 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:57,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2693 [2022-12-06 07:33:57,226 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-06 07:33:57,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:57,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1195977373, now seen corresponding path program 1 times [2022-12-06 07:33:57,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:57,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902931273] [2022-12-06 07:33:57,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:57,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:57,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-06 07:33:57,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:57,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902931273] [2022-12-06 07:33:57,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902931273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:57,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:57,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:57,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051670410] [2022-12-06 07:33:57,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:57,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:57,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:57,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:57,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:57,296 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:57,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:57,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:57,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:57,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:57,338 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:57,338 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:57,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:57,338 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:57,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:57,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:57,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:57,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:57,339 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:57,339 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:57,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:57,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:57,340 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:57,340 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:57,340 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:57,340 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:57,340 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:57,340 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:57,340 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:57,340 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:57,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:57,342 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:57,342 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:57,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:57,343 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:57,343 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:57,416 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:57,417 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:57,417 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:57,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:57,417 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:57,417 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:57,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2694 [2022-12-06 07:33:57,418 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-06 07:33:57,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:57,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1226453566, now seen corresponding path program 1 times [2022-12-06 07:33:57,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:57,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596781989] [2022-12-06 07:33:57,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:57,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:57,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-06 07:33:57,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:57,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596781989] [2022-12-06 07:33:57,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596781989] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:57,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:57,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:57,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455922606] [2022-12-06 07:33:57,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:57,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:57,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:57,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:57,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:57,486 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:57,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:57,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:57,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:57,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:57,527 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:57,527 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:57,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:57,527 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:57,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:57,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:57,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:57,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:57,528 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:57,528 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:57,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:57,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:57,529 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:57,529 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:57,529 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:57,529 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:57,529 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:57,529 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:57,529 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:57,529 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:57,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:57,531 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:57,531 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:57,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 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 116. Up to 16 conditions per place. [2022-12-06 07:33:57,532 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:57,532 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:57,609 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:57,610 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:33:57,610 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:57,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:57,610 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:57,610 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:57,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2695 [2022-12-06 07:33:57,610 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-06 07:33:57,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:57,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1253235675, now seen corresponding path program 1 times [2022-12-06 07:33:57,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:57,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075579259] [2022-12-06 07:33:57,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:57,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:57,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-06 07:33:57,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:57,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075579259] [2022-12-06 07:33:57,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075579259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:57,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:57,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:57,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772697037] [2022-12-06 07:33:57,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:57,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:57,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:57,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:57,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:57,682 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:57,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:57,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:57,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:57,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:57,718 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:57,718 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:57,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:57,718 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:57,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:57,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:57,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:57,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:57,719 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:57,719 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:57,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:57,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:57,720 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:57,720 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:57,720 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:57,720 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:57,720 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:57,720 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:57,720 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:57,720 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:57,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:57,722 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:57,723 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:57,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:57,723 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:57,723 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:57,796 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:57,798 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:57,798 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:57,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:57,798 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:57,798 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:57,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2696 [2022-12-06 07:33:57,798 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-06 07:33:57,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:57,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1283711868, now seen corresponding path program 1 times [2022-12-06 07:33:57,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:57,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121608567] [2022-12-06 07:33:57,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:57,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:57,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-06 07:33:57,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:57,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121608567] [2022-12-06 07:33:57,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121608567] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:57,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:57,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:57,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617513420] [2022-12-06 07:33:57,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:57,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:57,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:57,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:57,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:57,881 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:57,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:57,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:57,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:57,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:57,922 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:57,922 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:57,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:57,923 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:57,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:57,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:57,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:57,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:57,924 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:57,924 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:57,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:57,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:57,924 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:57,924 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:57,924 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:57,925 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:57,925 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:57,925 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:57,925 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:57,925 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:57,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:57,927 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:57,927 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:57,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:57,927 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:57,927 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:58,002 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:58,003 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:58,003 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:58,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:58,003 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:58,004 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:58,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2697 [2022-12-06 07:33:58,004 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-06 07:33:58,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:58,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1310493977, now seen corresponding path program 1 times [2022-12-06 07:33:58,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:58,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500982739] [2022-12-06 07:33:58,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:58,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:58,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-06 07:33:58,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:58,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500982739] [2022-12-06 07:33:58,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500982739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:58,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:58,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:58,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577466298] [2022-12-06 07:33:58,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:58,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:58,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:58,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:58,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:58,074 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:58,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:58,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:58,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:58,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:58,110 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:58,110 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:58,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:58,111 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:58,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:58,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:58,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:58,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:58,111 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:58,111 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:58,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:58,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:58,112 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:58,112 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:58,112 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:58,112 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:58,112 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:58,112 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:58,112 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:58,113 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:58,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:58,115 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:58,115 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:58,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:58,115 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:58,115 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:58,188 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:58,189 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:58,189 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:58,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:58,189 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:58,190 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:58,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2698 [2022-12-06 07:33:58,190 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-06 07:33:58,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:58,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1340970170, now seen corresponding path program 1 times [2022-12-06 07:33:58,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:58,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334921647] [2022-12-06 07:33:58,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:58,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:58,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-06 07:33:58,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:58,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334921647] [2022-12-06 07:33:58,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334921647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:58,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:58,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:58,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983409513] [2022-12-06 07:33:58,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:58,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:58,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:58,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:58,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:58,256 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:58,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:58,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:58,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:58,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:58,293 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:58,294 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:58,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:58,294 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:58,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:58,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:58,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:58,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:58,295 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:58,295 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:58,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:58,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:58,295 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:58,295 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:58,296 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:58,296 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:58,296 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:58,296 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:58,296 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:58,296 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:58,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:58,298 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:58,298 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:58,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:58,298 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:58,298 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:58,373 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:58,374 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:58,374 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:58,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:58,374 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:58,375 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:58,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2699 [2022-12-06 07:33:58,375 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-06 07:33:58,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:58,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1367752279, now seen corresponding path program 1 times [2022-12-06 07:33:58,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:58,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291865417] [2022-12-06 07:33:58,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:58,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:58,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-06 07:33:58,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:58,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291865417] [2022-12-06 07:33:58,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291865417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:58,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:58,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:58,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472505989] [2022-12-06 07:33:58,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:58,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:58,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:58,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:58,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:58,444 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:58,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:58,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:58,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:58,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:58,483 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:58,483 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:58,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 373 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:58,484 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:58,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:58,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:58,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:58,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:58,484 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:58,484 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:58,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:58,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:58,485 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:58,485 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:58,485 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:58,485 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:58,485 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:58,485 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:58,485 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:58,485 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:58,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:58,488 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:58,488 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:58,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:58,488 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:58,488 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:58,564 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:58,565 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:33:58,565 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:58,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:58,566 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:58,566 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:58,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2700 [2022-12-06 07:33:58,566 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-06 07:33:58,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:58,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1398228472, now seen corresponding path program 1 times [2022-12-06 07:33:58,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:58,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473792147] [2022-12-06 07:33:58,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:58,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:58,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-06 07:33:58,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:58,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473792147] [2022-12-06 07:33:58,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473792147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:58,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:58,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:58,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999276166] [2022-12-06 07:33:58,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:58,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:58,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:58,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:58,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:58,636 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:58,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:58,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:58,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:58,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:58,678 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:58,679 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:58,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:58,679 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:58,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:58,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:58,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:58,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:58,680 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:58,680 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:58,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:58,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:58,680 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:58,680 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:58,680 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:58,681 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:58,681 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:58,681 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:58,681 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:58,681 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:58,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:58,683 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:58,683 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:58,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:58,683 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:58,683 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:58,757 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:58,758 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:33:58,758 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:58,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:58,758 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:58,758 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:58,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2701 [2022-12-06 07:33:58,758 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-06 07:33:58,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:58,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1425010581, now seen corresponding path program 1 times [2022-12-06 07:33:58,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:58,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416865387] [2022-12-06 07:33:58,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:58,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:58,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-06 07:33:58,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:58,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416865387] [2022-12-06 07:33:58,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416865387] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:58,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:58,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:58,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770429485] [2022-12-06 07:33:58,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:58,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:58,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:58,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:58,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:58,830 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:58,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:58,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:58,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:58,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:58,872 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:58,872 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:58,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:58,873 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:58,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:58,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:58,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:58,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:58,873 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:58,873 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:58,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:58,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:58,874 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:58,874 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:58,874 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:58,874 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:58,874 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:58,874 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:58,875 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:58,875 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:58,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:58,877 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:58,877 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:58,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:58,877 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:58,877 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:58,953 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:58,954 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:33:58,954 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:58,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:58,954 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:58,954 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:58,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2702 [2022-12-06 07:33:58,954 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-06 07:33:58,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:58,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1455486774, now seen corresponding path program 1 times [2022-12-06 07:33:58,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:58,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556706860] [2022-12-06 07:33:58,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:58,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:59,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-06 07:33:59,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:59,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556706860] [2022-12-06 07:33:59,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556706860] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:59,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:59,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:59,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666412387] [2022-12-06 07:33:59,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:59,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:59,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:59,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:59,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:59,031 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:59,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:59,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:59,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:59,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:59,068 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:59,068 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:33:59,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:59,068 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:59,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:59,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:59,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:59,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:59,069 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:59,069 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:59,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:59,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:59,069 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:59,070 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:59,070 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:59,070 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:59,070 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:59,070 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:59,070 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:59,070 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:59,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:59,072 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:59,072 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:59,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:59,073 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:59,073 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:59,149 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:59,150 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:33:59,150 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:59,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:59,150 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:59,150 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:59,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2703 [2022-12-06 07:33:59,150 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-06 07:33:59,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:59,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1482268883, now seen corresponding path program 1 times [2022-12-06 07:33:59,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:59,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313357201] [2022-12-06 07:33:59,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:59,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:59,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:59,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:59,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:59,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313357201] [2022-12-06 07:33:59,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313357201] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:59,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:59,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:59,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977698998] [2022-12-06 07:33:59,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:59,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:59,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:59,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:59,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:59,221 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:59,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:59,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:59,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:59,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:59,256 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:59,256 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:59,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:59,257 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:59,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:59,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:59,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:59,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:59,257 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:59,257 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:59,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:59,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:59,258 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:59,258 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:59,258 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:59,258 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:59,258 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:59,258 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:59,258 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:59,259 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:59,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:59,261 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:59,261 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:59,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:59,261 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:59,261 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:59,335 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:59,336 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:33:59,336 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:59,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:59,336 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:59,336 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:59,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2704 [2022-12-06 07:33:59,337 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-06 07:33:59,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:59,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1512745076, now seen corresponding path program 1 times [2022-12-06 07:33:59,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:59,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920570829] [2022-12-06 07:33:59,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:59,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:59,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-06 07:33:59,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:59,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920570829] [2022-12-06 07:33:59,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920570829] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:59,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:59,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:59,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580413903] [2022-12-06 07:33:59,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:59,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:59,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:59,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:59,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:59,411 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:59,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:59,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:59,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:59,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:59,448 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:59,448 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:59,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:59,449 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:59,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:59,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:59,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:59,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:59,449 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:59,449 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:59,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:59,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:59,450 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:59,450 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:59,450 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:59,450 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:59,450 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:59,450 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:59,450 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:59,450 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:59,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:59,452 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:59,453 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:59,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:59,453 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:59,453 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:59,528 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:59,529 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:59,529 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:59,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:59,529 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:59,529 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:59,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2705 [2022-12-06 07:33:59,530 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-06 07:33:59,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:59,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1539527185, now seen corresponding path program 1 times [2022-12-06 07:33:59,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:59,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499016244] [2022-12-06 07:33:59,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:59,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:59,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:59,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-06 07:33:59,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:59,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499016244] [2022-12-06 07:33:59,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499016244] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:59,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:59,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:59,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991402746] [2022-12-06 07:33:59,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:59,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:59,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:59,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:59,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:59,598 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:59,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:59,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:59,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:59,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:59,639 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:33:59,640 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:33:59,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 356 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:33:59,640 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:33:59,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:59,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:59,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:59,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:59,641 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:59,641 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:59,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:59,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:59,641 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:59,641 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:59,642 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:59,642 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:59,642 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:59,642 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:59,642 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:59,642 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:59,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:59,644 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:33:59,644 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:33:59,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:33:59,644 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:59,644 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:59,720 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:59,721 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:59,721 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:33:59,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:59,721 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:59,721 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:59,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2706 [2022-12-06 07:33:59,721 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-06 07:33:59,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:59,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1570003378, now seen corresponding path program 1 times [2022-12-06 07:33:59,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:59,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516432557] [2022-12-06 07:33:59,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:59,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:59,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-06 07:33:59,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:59,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516432557] [2022-12-06 07:33:59,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516432557] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:59,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:59,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:59,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955537833] [2022-12-06 07:33:59,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:59,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:59,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:59,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:59,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:59,789 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:59,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:59,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:59,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:59,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:59,830 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:33:59,831 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:59,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:33:59,831 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:33:59,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:59,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:59,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:59,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:33:59,832 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:33:59,832 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:33:59,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:33:59,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:59,832 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:59,832 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:33:59,833 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:33:59,833 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:59,833 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:59,833 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:59,833 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:59,833 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:59,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:59,835 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:33:59,835 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:33:59,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:33:59,835 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:33:59,835 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:33:59,911 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:59,912 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:33:59,912 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:33:59,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:59,912 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:59,912 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:59,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2707 [2022-12-06 07:33:59,912 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-06 07:33:59,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:59,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1596785487, now seen corresponding path program 1 times [2022-12-06 07:33:59,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:59,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316986886] [2022-12-06 07:33:59,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:59,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:59,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-06 07:33:59,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:59,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316986886] [2022-12-06 07:33:59,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316986886] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:59,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:59,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:59,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169901819] [2022-12-06 07:33:59,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:59,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:59,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:59,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:59,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:59,996 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:33:59,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:59,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:59,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:33:59,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:00,033 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:00,034 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:00,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:00,034 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:00,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:00,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:00,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:00,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:00,035 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:00,035 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:00,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:00,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:00,035 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:00,035 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:00,036 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:00,036 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:00,036 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:00,036 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:00,036 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:00,036 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:00,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:00,038 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:00,038 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:00,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:00,038 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:00,038 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:00,114 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:00,115 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:00,115 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:00,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:00,115 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:00,115 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:00,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2708 [2022-12-06 07:34:00,115 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-06 07:34:00,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:00,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1627261680, now seen corresponding path program 1 times [2022-12-06 07:34:00,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:00,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314595893] [2022-12-06 07:34:00,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:00,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:00,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-06 07:34:00,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:00,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314595893] [2022-12-06 07:34:00,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314595893] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:00,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:00,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:00,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305038456] [2022-12-06 07:34:00,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:00,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:00,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:00,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:00,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:00,181 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:00,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:00,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:00,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:00,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:00,222 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:00,222 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:00,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:00,223 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:00,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:00,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:00,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:00,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:00,223 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:00,223 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:00,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:00,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:00,224 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:00,224 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:00,224 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:00,224 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:00,224 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:00,224 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:00,224 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:00,224 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:00,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:00,227 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:00,227 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:00,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:00,227 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:00,227 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:00,300 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:00,301 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:00,301 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:00,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:00,301 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:00,301 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:00,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2709 [2022-12-06 07:34:00,301 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-06 07:34:00,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:00,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1654043789, now seen corresponding path program 1 times [2022-12-06 07:34:00,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:00,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742527344] [2022-12-06 07:34:00,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:00,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:00,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:00,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-06 07:34:00,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:00,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742527344] [2022-12-06 07:34:00,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742527344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:00,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:00,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:00,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426520298] [2022-12-06 07:34:00,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:00,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:00,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:00,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:00,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:00,370 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:00,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:00,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:00,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:00,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:00,406 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:00,406 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:00,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:00,407 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:00,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:00,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:00,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:00,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:00,407 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:00,407 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:00,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:00,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:00,408 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:00,408 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:00,408 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:00,408 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:00,408 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:00,408 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:00,408 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:00,408 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:00,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:00,410 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:00,410 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:00,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:00,411 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:00,411 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:00,484 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:00,485 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:00,485 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:00,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:00,485 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:00,485 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:00,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2710 [2022-12-06 07:34:00,486 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-06 07:34:00,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:00,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1684519982, now seen corresponding path program 1 times [2022-12-06 07:34:00,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:00,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224830695] [2022-12-06 07:34:00,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:00,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:00,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:00,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:00,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224830695] [2022-12-06 07:34:00,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224830695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:00,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:00,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:00,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511174629] [2022-12-06 07:34:00,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:00,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:00,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:00,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:00,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:00,552 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:00,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:00,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:00,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:00,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:00,587 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:00,587 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:00,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:00,588 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:00,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:00,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:00,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:00,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:00,588 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:00,588 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:00,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:00,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:00,589 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:00,589 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:00,589 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:00,589 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:00,589 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:00,589 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:00,589 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:00,590 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:00,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:00,592 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:00,592 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:00,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:00,592 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:00,592 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:00,668 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:00,669 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:34:00,669 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:00,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:00,669 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:00,669 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:00,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2711 [2022-12-06 07:34:00,670 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-06 07:34:00,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:00,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1711302091, now seen corresponding path program 1 times [2022-12-06 07:34:00,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:00,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131811344] [2022-12-06 07:34:00,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:00,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:00,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-06 07:34:00,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:00,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131811344] [2022-12-06 07:34:00,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131811344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:00,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:00,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:00,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480965707] [2022-12-06 07:34:00,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:00,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:00,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:00,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:00,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:00,740 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:00,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:00,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:00,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:00,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:00,782 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:00,782 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:00,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:00,783 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:00,783 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:00,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:00,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:00,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:00,784 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:00,784 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:00,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:00,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:00,784 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:00,784 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:00,785 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:00,785 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:00,785 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:00,785 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:00,785 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:00,785 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:00,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:00,787 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:00,787 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:00,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:00,788 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:00,788 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:00,862 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:00,863 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:00,863 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:00,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:00,863 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:00,863 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:00,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2712 [2022-12-06 07:34:00,864 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-06 07:34:00,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:00,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1741778284, now seen corresponding path program 1 times [2022-12-06 07:34:00,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:00,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560699510] [2022-12-06 07:34:00,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:00,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:00,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-06 07:34:00,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:00,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560699510] [2022-12-06 07:34:00,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560699510] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:00,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:00,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:00,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723913123] [2022-12-06 07:34:00,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:00,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:00,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:00,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:00,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:00,933 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:00,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:00,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:00,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:00,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:00,975 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:00,975 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:00,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:00,975 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:00,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:00,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:00,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:00,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:00,976 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:00,976 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:00,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:00,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:00,977 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:00,977 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:00,977 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:00,977 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:00,977 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:00,977 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:00,977 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:00,977 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:00,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:00,979 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:00,979 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:00,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:00,980 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:00,980 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:01,053 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:01,054 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:01,054 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:01,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:01,054 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:01,054 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:01,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2713 [2022-12-06 07:34:01,054 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-06 07:34:01,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:01,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1768560393, now seen corresponding path program 1 times [2022-12-06 07:34:01,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:01,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415945544] [2022-12-06 07:34:01,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:01,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:01,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-06 07:34:01,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:01,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415945544] [2022-12-06 07:34:01,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415945544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:01,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:01,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:01,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100860430] [2022-12-06 07:34:01,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:01,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:01,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:01,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:01,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:01,135 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:01,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:01,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:01,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:01,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:01,175 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:01,175 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:01,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:01,175 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:01,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:01,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:01,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:01,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:01,176 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:01,176 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:01,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:01,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:01,177 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:01,177 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:01,177 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:01,177 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:01,177 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:01,177 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:01,177 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:01,177 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:01,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:01,179 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:01,179 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:01,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:01,180 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:01,180 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:01,254 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:01,255 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:01,255 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:01,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:01,255 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:01,255 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:01,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2714 [2022-12-06 07:34:01,255 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-06 07:34:01,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:01,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1799036586, now seen corresponding path program 1 times [2022-12-06 07:34:01,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:01,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176319927] [2022-12-06 07:34:01,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:01,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:01,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-06 07:34:01,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:01,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176319927] [2022-12-06 07:34:01,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176319927] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:01,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:01,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:01,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656912209] [2022-12-06 07:34:01,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:01,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:01,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:01,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:01,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:01,321 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:01,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:01,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:01,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:01,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:01,358 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:01,358 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:01,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:01,359 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:01,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:01,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:01,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:01,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:01,359 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:01,359 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:01,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:01,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:01,360 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:01,360 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:01,360 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:01,360 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:01,360 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:01,360 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:01,360 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:01,361 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:01,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:01,363 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:01,363 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:01,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:01,363 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:01,363 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:01,439 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:01,440 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:34:01,440 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:01,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:01,440 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:01,440 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:01,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2715 [2022-12-06 07:34:01,441 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-06 07:34:01,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:01,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1825818695, now seen corresponding path program 1 times [2022-12-06 07:34:01,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:01,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119662686] [2022-12-06 07:34:01,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:01,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:01,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-06 07:34:01,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:01,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119662686] [2022-12-06 07:34:01,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119662686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:01,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:01,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:01,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182705415] [2022-12-06 07:34:01,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:01,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:01,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:01,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:01,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:01,513 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:01,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:01,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:01,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:01,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:01,554 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:01,554 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:01,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:01,554 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:01,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:01,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:01,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:01,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:01,555 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:01,555 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:01,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:01,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:01,556 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:01,556 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:01,556 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:01,556 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:01,556 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:01,556 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:01,556 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:01,556 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:01,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:01,558 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:01,558 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:01,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:01,559 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:01,559 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:01,632 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:01,633 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:01,633 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:01,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:01,633 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:01,633 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:01,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2716 [2022-12-06 07:34:01,634 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-06 07:34:01,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:01,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1856294888, now seen corresponding path program 1 times [2022-12-06 07:34:01,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:01,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005296636] [2022-12-06 07:34:01,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:01,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:01,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-06 07:34:01,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:01,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005296636] [2022-12-06 07:34:01,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005296636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:01,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:01,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:01,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378890578] [2022-12-06 07:34:01,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:01,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:01,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:01,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:01,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:01,714 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:01,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:01,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:01,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:01,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:01,764 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:01,764 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:01,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:01,765 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:01,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:01,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:01,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:01,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:01,765 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:01,765 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:01,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:01,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:01,766 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:01,766 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:01,766 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:01,766 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:01,766 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:01,767 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:01,767 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:01,767 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:01,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:01,769 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:01,769 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:01,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:01,769 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:01,769 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:01,852 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:01,853 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 07:34:01,853 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:01,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:01,854 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:01,854 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:01,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2717 [2022-12-06 07:34:01,854 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-06 07:34:01,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:01,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1883076997, now seen corresponding path program 1 times [2022-12-06 07:34:01,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:01,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149344990] [2022-12-06 07:34:01,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:01,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:01,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-06 07:34:01,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:01,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149344990] [2022-12-06 07:34:01,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149344990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:01,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:01,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:01,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230219063] [2022-12-06 07:34:01,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:01,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:01,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:01,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:01,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:01,923 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:01,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:01,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:01,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:01,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:01,963 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:01,964 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:01,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:01,964 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:01,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:01,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:01,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:01,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:01,965 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:01,965 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:01,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:01,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:01,965 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:01,965 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:01,965 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:01,966 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:01,966 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:01,966 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:01,966 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:01,966 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:01,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:01,968 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:01,968 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:01,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:01,968 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:01,968 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:02,042 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:02,043 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:02,043 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:02,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:02,043 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:02,043 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:02,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2718 [2022-12-06 07:34:02,043 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-06 07:34:02,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:02,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1913553190, now seen corresponding path program 1 times [2022-12-06 07:34:02,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:02,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815754476] [2022-12-06 07:34:02,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:02,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:02,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-06 07:34:02,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:02,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815754476] [2022-12-06 07:34:02,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815754476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:02,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:02,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:02,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880175073] [2022-12-06 07:34:02,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:02,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:02,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:02,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:02,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:02,127 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:02,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:02,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:02,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:02,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:02,168 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:02,168 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:02,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:02,169 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:02,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:02,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:02,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:02,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:02,169 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:02,169 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:02,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:02,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:02,170 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:02,170 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:02,170 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:02,170 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:02,170 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:02,171 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:02,171 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:02,171 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:02,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:02,173 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:02,173 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:02,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:02,173 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:02,173 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:02,247 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:02,248 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:02,248 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:02,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:02,248 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:02,248 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:02,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2719 [2022-12-06 07:34:02,248 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-06 07:34:02,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:02,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1940335299, now seen corresponding path program 1 times [2022-12-06 07:34:02,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:02,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947688951] [2022-12-06 07:34:02,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:02,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:02,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-06 07:34:02,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:02,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947688951] [2022-12-06 07:34:02,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947688951] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:02,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:02,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:02,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387251023] [2022-12-06 07:34:02,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:02,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:02,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:02,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:02,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:02,312 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:02,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:02,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:02,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:02,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:02,355 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:02,356 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:02,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:02,356 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:02,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:02,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:02,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:02,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:02,357 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:02,357 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:02,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:02,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:02,357 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:02,358 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:02,358 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:02,358 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:02,358 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:02,358 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:02,358 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:02,358 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:02,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:02,360 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:02,360 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:02,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:02,361 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:02,361 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:02,435 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:02,436 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:02,436 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:02,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:02,436 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:02,436 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:02,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2720 [2022-12-06 07:34:02,436 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-06 07:34:02,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:02,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1970811492, now seen corresponding path program 1 times [2022-12-06 07:34:02,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:02,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709611474] [2022-12-06 07:34:02,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:02,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:02,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:02,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-06 07:34:02,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:02,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709611474] [2022-12-06 07:34:02,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709611474] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:02,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:02,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:02,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87662421] [2022-12-06 07:34:02,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:02,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:02,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:02,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:02,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:02,502 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:02,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:02,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:02,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:02,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:02,538 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:02,538 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:02,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:02,538 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:02,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:02,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:02,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:02,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:02,539 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:02,539 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:02,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:02,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:02,540 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:02,540 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:02,540 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:02,540 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:02,540 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:02,540 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:02,540 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:02,540 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:02,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:02,542 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:02,542 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:02,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:02,543 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:02,543 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:02,616 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:02,617 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:02,617 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:02,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:02,617 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:02,617 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:02,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2721 [2022-12-06 07:34:02,618 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-06 07:34:02,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:02,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1997593601, now seen corresponding path program 1 times [2022-12-06 07:34:02,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:02,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705815732] [2022-12-06 07:34:02,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:02,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:02,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-06 07:34:02,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:02,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705815732] [2022-12-06 07:34:02,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705815732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:02,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:02,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:02,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035106458] [2022-12-06 07:34:02,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:02,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:02,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:02,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:02,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:02,692 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:02,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:02,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:02,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:02,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:02,733 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:02,733 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:02,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:02,734 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:02,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:02,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:02,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:02,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:02,734 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:02,734 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:02,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:02,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:02,735 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:02,735 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:02,735 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:02,735 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:02,735 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:02,735 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:02,735 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:02,735 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:02,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:02,738 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:02,738 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:02,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:02,738 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:02,738 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:02,810 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:02,811 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:34:02,811 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:02,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:02,812 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:02,812 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:02,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2722 [2022-12-06 07:34:02,812 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-06 07:34:02,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:02,812 INFO L85 PathProgramCache]: Analyzing trace with hash 2028069794, now seen corresponding path program 1 times [2022-12-06 07:34:02,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:02,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763578397] [2022-12-06 07:34:02,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:02,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:02,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-06 07:34:02,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:02,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763578397] [2022-12-06 07:34:02,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763578397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:02,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:02,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:02,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707515885] [2022-12-06 07:34:02,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:02,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:02,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:02,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:02,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:02,878 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:02,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:02,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:02,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:02,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:02,920 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:02,920 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:02,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:02,920 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:02,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:02,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:02,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:02,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:02,921 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:02,921 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:02,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:02,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:02,922 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:02,922 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:02,922 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:02,922 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:02,922 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:02,922 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:02,922 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:02,922 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:02,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:02,924 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:02,924 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:02,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:02,925 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:02,925 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:02,999 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:03,000 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:03,000 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:03,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:03,000 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:03,000 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:03,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2723 [2022-12-06 07:34:03,000 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-06 07:34:03,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:03,000 INFO L85 PathProgramCache]: Analyzing trace with hash 2054851903, now seen corresponding path program 1 times [2022-12-06 07:34:03,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:03,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988046546] [2022-12-06 07:34:03,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:03,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:03,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-06 07:34:03,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:03,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988046546] [2022-12-06 07:34:03,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988046546] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:03,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:03,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:03,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386636194] [2022-12-06 07:34:03,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:03,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:03,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:03,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:03,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:03,072 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:03,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:03,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:03,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:03,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:03,113 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:03,113 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:03,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:03,114 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:03,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:03,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:03,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:03,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:03,114 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:03,114 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:03,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:03,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:03,115 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:03,115 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:03,115 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:03,115 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:03,115 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:03,116 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:03,116 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:03,116 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:03,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:03,118 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:03,118 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:03,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:03,118 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:03,118 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:03,194 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:03,195 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:34:03,195 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:03,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:03,195 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:03,195 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:03,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2724 [2022-12-06 07:34:03,195 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-06 07:34:03,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:03,196 INFO L85 PathProgramCache]: Analyzing trace with hash 2085328096, now seen corresponding path program 1 times [2022-12-06 07:34:03,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:03,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944599502] [2022-12-06 07:34:03,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:03,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:03,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:03,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-06 07:34:03,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:03,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944599502] [2022-12-06 07:34:03,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944599502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:03,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:03,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:03,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378309205] [2022-12-06 07:34:03,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:03,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:03,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:03,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:03,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:03,275 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:03,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:03,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:03,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:03,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:03,312 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:03,313 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:03,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:03,313 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:03,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:03,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:03,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:03,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:03,314 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:03,314 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:03,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:03,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:03,314 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:03,314 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:03,315 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:03,315 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:03,315 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:03,315 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:03,315 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:03,315 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:03,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:03,317 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:03,317 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:03,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:03,317 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:03,317 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:03,392 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:03,393 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:03,393 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:03,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:03,393 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:03,393 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:03,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2725 [2022-12-06 07:34:03,393 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-06 07:34:03,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:03,393 INFO L85 PathProgramCache]: Analyzing trace with hash 2112110205, now seen corresponding path program 1 times [2022-12-06 07:34:03,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:03,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773749015] [2022-12-06 07:34:03,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:03,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:03,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-06 07:34:03,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:03,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773749015] [2022-12-06 07:34:03,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773749015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:03,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:03,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:03,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612375712] [2022-12-06 07:34:03,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:03,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:03,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:03,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:03,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:03,466 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:03,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:03,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:03,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:03,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:03,508 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:03,508 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:03,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:03,509 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:03,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:03,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:03,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:03,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:03,509 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:03,509 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:03,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:03,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:03,510 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:03,510 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:03,510 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:03,510 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:03,510 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:03,511 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:03,511 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:03,511 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:03,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:03,513 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:03,513 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:03,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:03,513 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:03,513 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:03,588 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:03,589 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:03,589 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:03,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:03,589 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:03,589 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:03,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2726 [2022-12-06 07:34:03,589 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-06 07:34:03,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:03,589 INFO L85 PathProgramCache]: Analyzing trace with hash 2142586398, now seen corresponding path program 1 times [2022-12-06 07:34:03,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:03,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582964979] [2022-12-06 07:34:03,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:03,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:03,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-06 07:34:03,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:03,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582964979] [2022-12-06 07:34:03,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582964979] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:03,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:03,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:03,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657243017] [2022-12-06 07:34:03,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:03,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:03,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:03,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:03,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:03,658 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:03,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:03,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:03,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:03,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:03,700 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:03,700 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:03,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:03,701 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:03,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:03,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:03,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:03,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:03,701 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:03,702 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:03,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:03,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:03,702 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:03,702 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:03,702 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:03,702 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:03,702 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:03,703 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:03,703 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:03,703 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:03,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:03,705 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:03,705 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:03,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:03,705 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:03,705 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:03,780 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:03,781 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:03,781 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:03,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:03,781 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:03,782 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:03,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2727 [2022-12-06 07:34:03,782 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-06 07:34:03,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:03,782 INFO L85 PathProgramCache]: Analyzing trace with hash -2125598789, now seen corresponding path program 1 times [2022-12-06 07:34:03,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:03,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618646141] [2022-12-06 07:34:03,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:03,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:03,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:03,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-06 07:34:03,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:03,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618646141] [2022-12-06 07:34:03,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618646141] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:03,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:03,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:03,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007813714] [2022-12-06 07:34:03,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:03,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:03,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:03,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:03,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:03,852 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:03,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:03,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:03,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:03,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:03,888 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:03,888 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:03,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:03,889 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:03,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:03,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:03,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:03,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:03,889 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:03,889 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:03,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:03,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:03,890 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:03,890 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:03,890 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:03,890 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:03,890 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:03,890 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:03,890 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:03,890 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:03,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:03,893 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:03,893 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:03,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:03,893 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:03,893 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:03,968 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:03,969 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:03,969 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:03,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:03,969 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:03,969 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:03,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2728 [2022-12-06 07:34:03,969 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-06 07:34:03,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:03,970 INFO L85 PathProgramCache]: Analyzing trace with hash -2095122596, now seen corresponding path program 1 times [2022-12-06 07:34:03,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:03,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266867925] [2022-12-06 07:34:03,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:03,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:04,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-06 07:34:04,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:04,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266867925] [2022-12-06 07:34:04,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266867925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:04,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:04,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:04,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722802053] [2022-12-06 07:34:04,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:04,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:04,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:04,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:04,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:04,038 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:04,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:04,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:04,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:04,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:04,081 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:04,081 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:04,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:04,082 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:04,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:04,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:04,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:04,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:04,082 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:04,082 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:04,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:04,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:04,083 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:04,083 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:04,083 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:04,083 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:04,083 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:04,083 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:04,083 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:04,084 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:04,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:04,086 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:04,086 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:04,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:04,086 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:04,086 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:04,163 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:04,164 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:34:04,164 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:04,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:04,164 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:04,164 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:04,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2729 [2022-12-06 07:34:04,164 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-06 07:34:04,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:04,164 INFO L85 PathProgramCache]: Analyzing trace with hash -2068340487, now seen corresponding path program 1 times [2022-12-06 07:34:04,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:04,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5421240] [2022-12-06 07:34:04,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:04,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:04,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:04,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-06 07:34:04,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:04,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5421240] [2022-12-06 07:34:04,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5421240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:04,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:04,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:04,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941961450] [2022-12-06 07:34:04,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:04,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:04,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:04,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:04,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:04,234 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:04,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:04,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:04,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:04,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:04,284 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:04,284 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:04,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:04,284 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:04,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:04,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:04,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:04,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:04,285 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:04,285 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:04,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:04,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:04,286 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:04,286 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:04,286 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:04,286 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:04,286 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:04,286 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:04,286 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:04,286 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:04,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:04,288 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:04,288 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:04,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:04,289 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:04,289 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:04,365 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:04,366 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:34:04,366 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:04,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:04,366 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:04,366 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:04,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2730 [2022-12-06 07:34:04,366 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-06 07:34:04,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:04,366 INFO L85 PathProgramCache]: Analyzing trace with hash -2037864294, now seen corresponding path program 1 times [2022-12-06 07:34:04,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:04,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444655463] [2022-12-06 07:34:04,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:04,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34: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-06 07:34:04,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:04,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444655463] [2022-12-06 07:34:04,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444655463] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:04,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:04,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:04,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552152216] [2022-12-06 07:34:04,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:04,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:04,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:04,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:04,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:04,434 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:04,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:04,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:04,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:04,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:04,477 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:04,478 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:04,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:04,478 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:04,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:04,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:04,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:04,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:04,479 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:04,479 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:04,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:04,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:04,479 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:04,480 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:04,480 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:04,480 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:04,480 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:04,480 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:04,480 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:04,480 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:04,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:04,482 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:04,482 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:04,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:04,483 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:04,483 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:04,559 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:04,560 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:34:04,561 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:04,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:04,561 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:04,561 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:04,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2731 [2022-12-06 07:34:04,561 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-06 07:34:04,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:04,561 INFO L85 PathProgramCache]: Analyzing trace with hash -2011082185, now seen corresponding path program 1 times [2022-12-06 07:34:04,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:04,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224959168] [2022-12-06 07:34:04,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:04,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:04,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-06 07:34:04,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:04,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224959168] [2022-12-06 07:34:04,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224959168] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:04,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:04,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:04,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425128284] [2022-12-06 07:34:04,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:04,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:04,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:04,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:04,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:04,633 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:04,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:04,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:04,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:04,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:04,674 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:04,675 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:04,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:04,675 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:04,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:04,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:04,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:04,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:04,676 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:04,676 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:04,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:04,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:04,677 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:04,677 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:04,677 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:04,677 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:04,677 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:04,677 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:04,677 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:04,677 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:04,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:04,679 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:04,679 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:04,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:04,680 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:04,680 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:04,755 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:04,756 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:04,756 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:04,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:04,756 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:04,757 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:04,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2732 [2022-12-06 07:34:04,757 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-06 07:34:04,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:04,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1980605992, now seen corresponding path program 1 times [2022-12-06 07:34:04,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:04,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894480279] [2022-12-06 07:34:04,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:04,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34: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-06 07:34:04,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:04,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894480279] [2022-12-06 07:34:04,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894480279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:04,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:04,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:04,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338291571] [2022-12-06 07:34:04,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:04,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:04,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:04,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:04,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:04,823 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:04,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:04,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:04,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:04,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:04,859 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:04,859 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:04,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:04,860 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:04,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:04,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:04,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:04,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:04,860 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:04,860 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:04,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:04,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:04,861 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:04,861 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:04,861 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:04,861 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:04,861 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:04,861 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:04,861 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:04,861 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:04,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:04,864 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:04,864 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:04,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 118 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:04,864 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:04,864 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:04,939 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:04,940 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:04,940 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:04,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:04,940 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:04,940 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:04,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2733 [2022-12-06 07:34:04,940 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-06 07:34:04,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:04,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1953823883, now seen corresponding path program 1 times [2022-12-06 07:34:04,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:04,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838622768] [2022-12-06 07:34:04,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:04,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:05,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-06 07:34:05,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:05,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838622768] [2022-12-06 07:34:05,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838622768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:05,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:05,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:05,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853613826] [2022-12-06 07:34:05,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:05,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:05,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:05,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:05,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:05,011 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:05,011 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:05,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:05,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:05,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:05,047 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:05,047 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:05,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:05,047 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:05,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:05,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:05,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:05,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:05,048 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:05,048 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:05,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:05,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:05,049 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:05,049 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:05,049 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:05,049 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:05,049 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:05,049 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:05,049 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:05,049 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:05,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:05,051 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:05,051 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:05,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:05,052 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:05,052 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:05,126 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:05,127 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:05,127 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:05,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:05,128 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:05,128 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:05,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2734 [2022-12-06 07:34:05,128 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-06 07:34:05,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:05,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1923347690, now seen corresponding path program 1 times [2022-12-06 07:34:05,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:05,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013925118] [2022-12-06 07:34:05,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:05,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:05,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:05,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-06 07:34:05,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:05,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013925118] [2022-12-06 07:34:05,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013925118] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:05,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:05,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:05,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535892157] [2022-12-06 07:34:05,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:05,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:05,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:05,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:05,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:05,198 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:05,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:05,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:05,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:05,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:05,238 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:05,239 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:05,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:05,239 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:05,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:05,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:05,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:05,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:05,240 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:05,240 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:05,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:05,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:05,240 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:05,241 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:05,241 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:05,241 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:05,241 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:05,241 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:05,241 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:05,241 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:05,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:05,243 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:05,243 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:05,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 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 116. Up to 16 conditions per place. [2022-12-06 07:34:05,243 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:05,244 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:05,318 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:05,319 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:05,319 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:05,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:05,319 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:05,319 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:05,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2735 [2022-12-06 07:34:05,319 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-06 07:34:05,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:05,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1896565581, now seen corresponding path program 1 times [2022-12-06 07:34:05,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:05,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150788145] [2022-12-06 07:34:05,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:05,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:05,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-06 07:34:05,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:05,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150788145] [2022-12-06 07:34:05,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150788145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:05,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:05,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:05,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116039032] [2022-12-06 07:34:05,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:05,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:05,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:05,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:05,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:05,409 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:05,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:05,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:05,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:05,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:05,450 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:05,450 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:05,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 355 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:05,450 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:05,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:05,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:05,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:05,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:05,451 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:05,451 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:05,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:05,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:05,452 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:05,452 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:05,452 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:05,452 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:05,452 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:05,452 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:05,452 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:05,452 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:05,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:05,454 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:05,454 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:05,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:05,455 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:05,455 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:05,528 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:05,529 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:05,529 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:05,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:05,530 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:05,530 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:05,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2736 [2022-12-06 07:34:05,530 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-06 07:34:05,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:05,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1866089388, now seen corresponding path program 1 times [2022-12-06 07:34:05,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:05,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35948427] [2022-12-06 07:34:05,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:05,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:05,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-06 07:34:05,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:05,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35948427] [2022-12-06 07:34:05,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35948427] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:05,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:05,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:05,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334487793] [2022-12-06 07:34:05,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:05,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:05,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:05,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:05,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:05,596 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:05,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:05,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:05,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:05,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:05,636 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:05,637 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:05,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:05,637 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:05,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:05,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:05,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:05,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:05,638 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:05,638 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:05,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:05,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:05,638 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:05,638 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:05,638 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:05,639 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:05,639 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:05,639 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:05,639 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:05,639 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:05,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:05,641 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:05,641 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:05,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 113 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:05,641 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:05,641 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:05,716 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:05,717 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:05,717 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:05,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:05,717 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:05,717 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:05,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2737 [2022-12-06 07:34:05,717 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-06 07:34:05,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:05,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1839307279, now seen corresponding path program 1 times [2022-12-06 07:34:05,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:05,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774633738] [2022-12-06 07:34:05,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:05,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:05,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:05,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:05,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774633738] [2022-12-06 07:34:05,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774633738] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:05,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:05,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:05,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272453677] [2022-12-06 07:34:05,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:05,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:05,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:05,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:05,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:05,786 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:05,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:05,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:05,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:05,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:05,827 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:05,827 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:05,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:05,827 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:05,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:05,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:05,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:05,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:05,828 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:05,828 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:05,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:05,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:05,829 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:05,829 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:05,829 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:05,829 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:05,829 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:05,829 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:05,829 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:05,829 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:05,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:05,831 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:05,831 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:05,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:05,832 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:05,832 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:05,905 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:05,906 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:05,906 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:05,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:05,906 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:05,906 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:05,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2738 [2022-12-06 07:34:05,906 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-06 07:34:05,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:05,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1808831086, now seen corresponding path program 1 times [2022-12-06 07:34:05,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:05,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404049962] [2022-12-06 07:34:05,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:05,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:05,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-06 07:34:05,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:05,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404049962] [2022-12-06 07:34:05,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404049962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:05,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:05,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:05,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017005328] [2022-12-06 07:34:05,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:05,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:05,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:05,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:05,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:05,976 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:05,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:05,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:05,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:05,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:06,022 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:06,022 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:06,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:06,023 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:06,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:06,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:06,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:06,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:06,023 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:06,024 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:06,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:06,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:06,024 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:06,024 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:06,024 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:06,024 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:06,024 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:06,025 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:06,025 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:06,025 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:06,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:06,027 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:06,027 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:06,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 120 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:06,027 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:06,027 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:06,100 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:06,101 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:06,101 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:06,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:06,101 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:06,101 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:06,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2739 [2022-12-06 07:34:06,101 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-06 07:34:06,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:06,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1782048977, now seen corresponding path program 1 times [2022-12-06 07:34:06,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:06,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448228917] [2022-12-06 07:34:06,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:06,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:06,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-06 07:34:06,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:06,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448228917] [2022-12-06 07:34:06,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448228917] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:06,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:06,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:06,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752087434] [2022-12-06 07:34:06,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:06,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:06,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:06,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:06,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:06,172 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:06,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:06,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:06,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:06,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:06,211 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:06,211 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:06,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:06,211 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:06,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:06,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:06,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:06,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:06,212 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:06,212 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:06,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:06,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:06,213 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:06,213 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:06,213 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:06,213 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:06,213 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:06,213 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:06,213 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:06,213 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:06,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:06,215 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:06,215 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:06,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:06,216 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:06,216 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:06,299 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:06,300 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 07:34:06,300 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:06,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:06,300 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:06,300 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:06,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2740 [2022-12-06 07:34:06,300 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-06 07:34:06,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:06,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1751572784, now seen corresponding path program 1 times [2022-12-06 07:34:06,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:06,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425917547] [2022-12-06 07:34:06,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:06,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:06,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-06 07:34:06,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:06,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425917547] [2022-12-06 07:34:06,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425917547] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:06,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:06,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:06,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738295073] [2022-12-06 07:34:06,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:06,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:06,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:06,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:06,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:06,380 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:06,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:06,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:06,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:06,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:06,428 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:06,429 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:06,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:06,429 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:06,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:06,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:06,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:06,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:06,430 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:06,430 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:06,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:06,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:06,430 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:06,430 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:06,431 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:06,431 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:06,431 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:06,431 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:06,431 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:06,431 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:06,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:06,433 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:06,433 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:06,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:06,433 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:06,433 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:06,509 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:06,510 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:06,510 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:06,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:06,510 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:06,510 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:06,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2741 [2022-12-06 07:34:06,510 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-06 07:34:06,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:06,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1724790675, now seen corresponding path program 1 times [2022-12-06 07:34:06,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:06,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871922570] [2022-12-06 07:34:06,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:06,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:06,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-06 07:34:06,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:06,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871922570] [2022-12-06 07:34:06,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871922570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:06,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:06,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:06,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417413432] [2022-12-06 07:34:06,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:06,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:06,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:06,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:06,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:06,581 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:06,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:06,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:06,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:06,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:06,622 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:06,622 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:06,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:06,623 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:06,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:06,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:06,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:06,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:06,623 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:06,623 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:06,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:06,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:06,624 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:06,624 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:06,624 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:06,624 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:06,624 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:06,625 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:06,625 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:06,625 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:06,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:06,627 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:06,627 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:06,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:06,627 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:06,627 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:06,700 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:06,701 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:06,701 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:06,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:06,701 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:06,701 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:06,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2742 [2022-12-06 07:34:06,701 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-06 07:34:06,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:06,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1694314482, now seen corresponding path program 1 times [2022-12-06 07:34:06,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:06,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28359599] [2022-12-06 07:34:06,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:06,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:06,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-06 07:34:06,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:06,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28359599] [2022-12-06 07:34:06,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28359599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:06,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:06,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:06,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418039758] [2022-12-06 07:34:06,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:06,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:06,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:06,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:06,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:06,769 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:06,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:06,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:06,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:06,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:06,805 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:06,805 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:06,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:06,805 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:06,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:06,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:06,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:06,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:06,806 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:06,806 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:06,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:06,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:06,807 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:06,807 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:06,807 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:06,807 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:06,807 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:06,807 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:06,807 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:06,807 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:06,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:06,809 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:06,809 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:06,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:06,810 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:06,810 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:06,883 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:06,884 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:06,884 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:06,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:06,884 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:06,884 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:06,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2743 [2022-12-06 07:34:06,885 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-06 07:34:06,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:06,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1667532373, now seen corresponding path program 1 times [2022-12-06 07:34:06,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:06,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759988440] [2022-12-06 07:34:06,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:06,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:06,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:06,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-06 07:34:06,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:06,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759988440] [2022-12-06 07:34:06,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759988440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:06,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:06,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:06,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905405408] [2022-12-06 07:34:06,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:06,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:06,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:06,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:06,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:06,956 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:06,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:06,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:06,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:06,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:06,993 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:06,993 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:06,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 356 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:06,993 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:06,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:06,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:06,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:06,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:06,994 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:06,994 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:06,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:06,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:06,995 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:06,995 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:06,995 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:06,995 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:06,995 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:06,995 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:06,995 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:06,995 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:06,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:06,997 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:06,997 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:06,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:06,998 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:06,998 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:07,072 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:07,073 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:07,073 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:07,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:07,073 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:07,073 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:07,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2744 [2022-12-06 07:34:07,073 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-06 07:34:07,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:07,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1637056180, now seen corresponding path program 1 times [2022-12-06 07:34:07,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:07,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816742068] [2022-12-06 07:34:07,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:07,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:07,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:07,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-06 07:34:07,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:07,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816742068] [2022-12-06 07:34:07,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816742068] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:07,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:07,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:07,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083598950] [2022-12-06 07:34:07,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:07,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:07,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:07,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:07,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:07,141 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:07,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:07,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:07,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:07,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:07,176 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:07,177 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:07,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:07,177 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:07,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:07,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:07,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:07,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:07,178 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:07,178 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:07,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:07,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:07,178 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:07,178 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:07,179 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:07,179 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:07,179 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:07,179 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:07,179 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:07,179 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:07,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:07,181 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:07,181 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:07,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 116 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:07,181 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:07,181 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:07,257 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:07,258 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:07,258 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:07,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:07,258 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:07,258 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:07,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2745 [2022-12-06 07:34:07,258 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-06 07:34:07,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:07,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1610274071, now seen corresponding path program 1 times [2022-12-06 07:34:07,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:07,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949024182] [2022-12-06 07:34:07,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:07,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:07,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-06 07:34:07,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:07,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949024182] [2022-12-06 07:34:07,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949024182] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:07,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:07,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:07,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170769121] [2022-12-06 07:34:07,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:07,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:07,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:07,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:07,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:07,328 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:07,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:07,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:07,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:07,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:07,370 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:07,370 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:07,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:07,370 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:07,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:07,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:07,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:07,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:07,371 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:07,371 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:07,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:07,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:07,372 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:07,372 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:07,372 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:07,372 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:07,372 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:07,372 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:07,372 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:07,372 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:07,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:07,374 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:07,374 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:07,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:07,375 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:07,375 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:07,455 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:07,457 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 07:34:07,457 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:07,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:07,457 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:07,457 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:07,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2746 [2022-12-06 07:34:07,457 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-06 07:34:07,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:07,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1579797878, now seen corresponding path program 1 times [2022-12-06 07:34:07,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:07,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135568056] [2022-12-06 07:34:07,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:07,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:07,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:07,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-06 07:34:07,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:07,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135568056] [2022-12-06 07:34:07,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135568056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:07,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:07,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:07,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039185152] [2022-12-06 07:34:07,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:07,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:07,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:07,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:07,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:07,543 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:07,543 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:07,543 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:07,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:07,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:07,581 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:07,581 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:07,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:07,581 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:07,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:07,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:07,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:07,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:07,582 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:07,582 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:07,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:07,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:07,583 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:07,583 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:07,583 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:07,583 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:07,583 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:07,583 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:07,583 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:07,583 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:07,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:07,585 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:07,585 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:07,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:07,586 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:07,586 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:07,661 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:07,662 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:07,662 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:07,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:07,662 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:07,662 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:07,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2747 [2022-12-06 07:34:07,662 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-06 07:34:07,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:07,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1553015769, now seen corresponding path program 1 times [2022-12-06 07:34:07,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:07,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545040209] [2022-12-06 07:34:07,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:07,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:07,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-06 07:34:07,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:07,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545040209] [2022-12-06 07:34:07,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545040209] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:07,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:07,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:07,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727255845] [2022-12-06 07:34:07,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:07,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:07,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:07,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:07,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:07,733 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:07,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:07,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:07,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:07,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:07,769 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:07,769 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:07,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:07,769 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:07,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:07,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:07,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:07,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:07,770 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:07,770 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:07,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:07,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:07,771 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:07,771 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:07,771 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:07,771 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:07,771 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:07,771 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:07,771 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:07,771 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:07,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:07,773 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:07,773 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:07,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:07,774 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:07,774 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:07,850 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:07,851 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:34:07,851 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:07,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:07,851 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:07,851 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:07,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2748 [2022-12-06 07:34:07,851 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-06 07:34:07,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:07,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1522539576, now seen corresponding path program 1 times [2022-12-06 07:34:07,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:07,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269046265] [2022-12-06 07:34:07,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:07,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:07,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:07,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-06 07:34:07,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:07,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269046265] [2022-12-06 07:34:07,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269046265] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:07,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:07,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:07,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930980941] [2022-12-06 07:34:07,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:07,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:07,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:07,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:07,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:07,918 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:07,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:07,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:07,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:07,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:07,960 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:07,960 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:07,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:07,961 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:07,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:07,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:07,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:07,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:07,961 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:07,961 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:07,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:07,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:07,962 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:07,962 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:07,962 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:07,962 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:07,962 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:07,963 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:07,963 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:07,963 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:07,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:07,965 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:07,965 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:07,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:07,965 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:07,965 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:08,039 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:08,040 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:08,040 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:08,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:08,040 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:08,040 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:08,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2749 [2022-12-06 07:34:08,040 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-06 07:34:08,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:08,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1495757467, now seen corresponding path program 1 times [2022-12-06 07:34:08,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:08,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014069994] [2022-12-06 07:34:08,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:08,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:08,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-06 07:34:08,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:08,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014069994] [2022-12-06 07:34:08,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014069994] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:08,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:08,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:08,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322778202] [2022-12-06 07:34:08,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:08,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:08,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:08,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:08,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:08,134 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:08,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:08,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:08,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:08,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:08,185 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:08,185 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:08,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:08,185 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:08,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:08,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:08,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:08,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:08,186 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:08,186 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:08,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:08,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:08,187 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:08,187 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:08,187 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:08,187 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:08,188 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:08,188 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:08,188 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:08,188 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:08,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:08,191 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:08,191 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:08,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:08,191 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:08,191 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:08,282 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:08,283 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:34:08,283 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:08,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:08,283 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:08,283 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:08,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2750 [2022-12-06 07:34:08,284 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-06 07:34:08,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:08,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1465281274, now seen corresponding path program 1 times [2022-12-06 07:34:08,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:08,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395575168] [2022-12-06 07:34:08,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:08,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:08,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-06 07:34:08,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:08,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395575168] [2022-12-06 07:34:08,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395575168] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:08,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:08,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:08,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581737194] [2022-12-06 07:34:08,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:08,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:08,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:08,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:08,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:08,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:08,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:08,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:08,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:08,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:08,427 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:08,427 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:08,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:08,427 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:08,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:08,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:08,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:08,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:08,428 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:08,428 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:08,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:08,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:08,429 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:08,429 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:08,429 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:08,429 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:08,429 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:08,430 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:08,430 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:08,430 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:08,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:08,433 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:08,433 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:08,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:08,434 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:08,434 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:08,518 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:08,519 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-06 07:34:08,519 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:08,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:08,520 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:08,520 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:08,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2751 [2022-12-06 07:34:08,520 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-06 07:34:08,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:08,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1438499165, now seen corresponding path program 1 times [2022-12-06 07:34:08,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:08,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173088258] [2022-12-06 07:34:08,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:08,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:08,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-06 07:34:08,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:08,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173088258] [2022-12-06 07:34:08,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173088258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:08,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:08,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:08,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37062626] [2022-12-06 07:34:08,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:08,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:08,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:08,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:08,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:08,590 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:08,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:08,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:08,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:08,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:08,629 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:08,629 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:08,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 370 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:08,629 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:08,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:08,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:08,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:08,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:08,630 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:08,630 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:08,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:08,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:08,631 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:08,631 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:08,631 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:08,631 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:08,631 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:08,631 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:08,631 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:08,631 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:08,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:08,644 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:08,644 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:08,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:08,644 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:08,644 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:08,720 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:08,721 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-06 07:34:08,721 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:08,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:08,721 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:08,721 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:08,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2752 [2022-12-06 07:34:08,721 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-06 07:34:08,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:08,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1408022972, now seen corresponding path program 1 times [2022-12-06 07:34:08,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:08,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475337935] [2022-12-06 07:34:08,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:08,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:08,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-06 07:34:08,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:08,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475337935] [2022-12-06 07:34:08,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475337935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:08,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:08,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:08,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023482120] [2022-12-06 07:34:08,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:08,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:08,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:08,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:08,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:08,790 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:08,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:08,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:08,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:08,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:08,831 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:08,831 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:08,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:08,832 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:08,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:08,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:08,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:08,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:08,833 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:08,833 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:08,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:08,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:08,833 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:08,833 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:08,833 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:08,834 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:08,834 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:08,834 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:08,834 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:08,834 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:08,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:08,836 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:08,836 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:08,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:08,837 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:08,837 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:08,914 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:08,915 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:34:08,915 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:08,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:08,915 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:08,915 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:08,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2753 [2022-12-06 07:34:08,915 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-06 07:34:08,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:08,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1381240863, now seen corresponding path program 1 times [2022-12-06 07:34:08,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:08,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189214692] [2022-12-06 07:34:08,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:08,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:08,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-06 07:34:08,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:08,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189214692] [2022-12-06 07:34:08,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189214692] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:08,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:08,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:08,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95035513] [2022-12-06 07:34:08,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:08,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:08,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:08,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:08,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:08,984 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:08,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:08,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:08,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:08,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:09,020 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:09,020 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:09,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:09,020 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:09,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:09,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:09,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:09,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:09,021 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:09,021 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:09,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:09,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:09,022 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:09,022 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:09,022 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:09,022 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:09,022 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:09,022 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:09,022 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:09,022 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:09,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:09,024 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:09,025 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:09,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:09,025 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:09,025 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:09,099 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:09,100 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:09,100 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:09,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:09,100 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:09,100 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:09,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2754 [2022-12-06 07:34:09,100 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-06 07:34:09,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:09,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1350764670, now seen corresponding path program 1 times [2022-12-06 07:34:09,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:09,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995004924] [2022-12-06 07:34:09,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:09,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:09,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-06 07:34:09,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:09,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995004924] [2022-12-06 07:34:09,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995004924] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:09,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:09,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:09,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812645483] [2022-12-06 07:34:09,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:09,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:09,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:09,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:09,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:09,169 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:09,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:09,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:09,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:09,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:09,206 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:09,206 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:09,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:09,207 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:09,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:09,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:09,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:09,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:09,208 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:09,208 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:09,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:09,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:09,208 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:09,208 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:09,209 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:09,209 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:09,209 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:09,209 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:09,209 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:09,209 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:09,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:09,211 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:09,211 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:09,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:09,212 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:09,212 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:09,286 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:09,287 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:09,287 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:09,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:09,287 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:09,287 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:09,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2755 [2022-12-06 07:34:09,287 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-06 07:34:09,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:09,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1323982561, now seen corresponding path program 1 times [2022-12-06 07:34:09,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:09,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161993797] [2022-12-06 07:34:09,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:09,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:09,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-06 07:34:09,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:09,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161993797] [2022-12-06 07:34:09,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161993797] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:09,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:09,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:09,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035326312] [2022-12-06 07:34:09,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:09,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:09,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:09,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:09,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:09,358 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:09,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:09,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:09,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:09,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:09,395 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:09,395 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:09,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:09,396 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:09,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:09,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:09,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:09,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:09,396 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:09,396 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:09,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:09,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:09,397 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:09,397 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:09,397 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:09,397 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:09,398 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:09,398 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:09,398 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:09,398 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:09,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:09,400 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:09,400 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:09,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:09,400 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:09,400 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:09,476 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:09,478 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:34:09,478 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:09,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:09,478 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:09,478 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:09,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2756 [2022-12-06 07:34:09,478 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-06 07:34:09,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:09,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1293506368, now seen corresponding path program 1 times [2022-12-06 07:34:09,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:09,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532119682] [2022-12-06 07:34:09,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:09,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:09,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-06 07:34:09,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:09,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532119682] [2022-12-06 07:34:09,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532119682] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:09,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:09,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:09,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024510778] [2022-12-06 07:34:09,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:09,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:09,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:09,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:09,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:09,548 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:09,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:09,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:09,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:09,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:09,589 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:09,589 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:09,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:09,590 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:09,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:09,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:09,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:09,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:09,590 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:09,590 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:09,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:09,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:09,591 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:09,591 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:09,591 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:09,591 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:09,591 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:09,592 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:09,592 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:09,592 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:09,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:09,594 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:09,594 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:09,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:09,594 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:09,594 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:09,669 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:09,670 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:09,670 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:09,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:09,670 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:09,670 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:09,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2757 [2022-12-06 07:34:09,670 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-06 07:34:09,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:09,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1266724259, now seen corresponding path program 1 times [2022-12-06 07:34:09,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:09,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103509067] [2022-12-06 07:34:09,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:09,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:09,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:09,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-06 07:34:09,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:09,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103509067] [2022-12-06 07:34:09,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103509067] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:09,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:09,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:09,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313518542] [2022-12-06 07:34:09,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:09,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:09,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:09,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:09,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:09,754 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:09,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:09,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:09,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:09,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:09,796 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:09,796 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:09,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:09,796 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:09,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:09,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:09,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:09,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:09,797 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:09,797 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:09,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:09,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:09,797 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:09,798 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:09,798 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:09,798 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:09,798 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:09,798 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:09,798 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:09,798 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:09,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:09,800 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:09,800 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:09,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:09,801 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:09,801 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:09,875 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:09,876 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:09,876 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:09,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:09,877 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:09,877 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:09,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2758 [2022-12-06 07:34:09,877 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-06 07:34:09,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:09,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1236248066, now seen corresponding path program 1 times [2022-12-06 07:34:09,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:09,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839584350] [2022-12-06 07:34:09,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:09,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:09,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-06 07:34:09,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:09,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839584350] [2022-12-06 07:34:09,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839584350] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:09,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:09,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:09,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500299818] [2022-12-06 07:34:09,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:09,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:09,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:09,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:09,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:09,944 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:09,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:09,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:09,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:09,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:09,980 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:09,981 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:09,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:09,981 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:09,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:09,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:09,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:09,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:09,982 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:09,982 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:09,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:09,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:09,982 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:09,982 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:09,983 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:09,983 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:09,983 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:09,983 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:09,983 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:09,983 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:09,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:09,985 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:09,985 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:09,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:09,985 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:09,985 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:10,071 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:10,072 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 07:34:10,072 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:10,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:10,072 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:10,072 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:10,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2759 [2022-12-06 07:34:10,072 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-06 07:34:10,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:10,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1209465957, now seen corresponding path program 1 times [2022-12-06 07:34:10,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:10,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996187179] [2022-12-06 07:34:10,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:10,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:10,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-06 07:34:10,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:10,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996187179] [2022-12-06 07:34:10,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996187179] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:10,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:10,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:10,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611942803] [2022-12-06 07:34:10,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:10,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:10,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:10,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:10,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:10,145 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:10,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:10,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:10,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:10,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:10,187 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:10,187 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:10,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:10,187 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:10,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:10,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:10,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:10,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:10,188 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:10,188 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:10,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:10,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:10,189 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:10,189 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:10,189 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:10,189 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:10,189 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:10,189 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:10,189 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:10,189 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:10,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:10,192 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:10,192 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:10,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:10,192 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:10,192 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:10,267 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:10,268 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:10,268 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:10,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:10,268 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:10,268 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:10,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2760 [2022-12-06 07:34:10,269 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-06 07:34:10,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:10,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1178989764, now seen corresponding path program 1 times [2022-12-06 07:34:10,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:10,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935645336] [2022-12-06 07:34:10,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:10,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:10,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-06 07:34:10,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:10,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935645336] [2022-12-06 07:34:10,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935645336] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:10,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:10,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:10,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027271973] [2022-12-06 07:34:10,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:10,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:10,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:10,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:10,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:10,338 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:10,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:10,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:10,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:10,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:10,381 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:10,381 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:10,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:10,381 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:10,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:10,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:10,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:10,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:10,382 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:10,382 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:10,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:10,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:10,383 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:10,383 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:10,383 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:10,383 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:10,383 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:10,383 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:10,383 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:10,383 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:10,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:10,385 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:10,385 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:10,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:10,386 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:10,386 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:10,461 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:10,462 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:10,462 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:10,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:10,462 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:10,462 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:10,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2761 [2022-12-06 07:34:10,462 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-06 07:34:10,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:10,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1152207655, now seen corresponding path program 1 times [2022-12-06 07:34:10,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:10,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429340952] [2022-12-06 07:34:10,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:10,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:10,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-06 07:34:10,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:10,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429340952] [2022-12-06 07:34:10,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429340952] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:10,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:10,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:10,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009395475] [2022-12-06 07:34:10,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:10,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:10,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:10,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:10,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:10,536 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:10,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:10,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:10,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:10,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:10,575 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:10,575 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:10,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 380 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:10,576 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:10,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:10,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:10,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:10,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:10,576 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:10,576 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:10,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:10,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:10,577 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:10,577 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:10,577 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:10,577 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:10,577 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:10,577 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:10,577 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:10,577 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:10,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:10,580 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:10,580 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:10,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:10,580 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:10,580 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:10,655 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:10,656 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:10,656 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:10,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:10,656 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:10,656 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:10,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2762 [2022-12-06 07:34:10,656 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-06 07:34:10,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:10,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1121731462, now seen corresponding path program 1 times [2022-12-06 07:34:10,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:10,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472485771] [2022-12-06 07:34:10,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:10,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:10,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:10,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:10,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472485771] [2022-12-06 07:34:10,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472485771] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:10,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:10,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:10,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514587203] [2022-12-06 07:34:10,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:10,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:10,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:10,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:10,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:10,728 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:10,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:10,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:10,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:10,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:10,772 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:10,772 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:10,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:10,773 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:10,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:10,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:10,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:10,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:10,773 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:10,773 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:10,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:10,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:10,785 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:10,785 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:10,785 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:10,785 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:10,785 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:10,785 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:10,785 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:10,785 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:10,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:10,788 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:10,788 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:10,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:10,788 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:10,788 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:10,864 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:10,866 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:34:10,866 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:10,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:10,866 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:10,866 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:10,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2763 [2022-12-06 07:34:10,866 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-06 07:34:10,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:10,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1094949353, now seen corresponding path program 1 times [2022-12-06 07:34:10,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:10,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632838849] [2022-12-06 07:34:10,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:10,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:10,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-06 07:34:10,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:10,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632838849] [2022-12-06 07:34:10,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632838849] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:10,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:10,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:10,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386347643] [2022-12-06 07:34:10,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:10,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:10,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:10,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:10,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:10,940 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:10,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:10,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:10,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:10,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:10,975 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:10,975 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:10,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:10,976 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:10,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:10,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:10,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:10,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:10,976 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:10,976 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:10,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:10,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:10,977 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:10,977 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:10,977 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:10,977 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:10,977 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:10,978 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:10,978 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:10,978 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:10,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:10,980 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:10,980 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:10,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:10,980 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:10,980 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:11,056 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:11,057 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:34:11,057 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:11,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:11,057 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:11,057 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:11,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2764 [2022-12-06 07:34:11,057 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-06 07:34:11,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:11,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1064473160, now seen corresponding path program 1 times [2022-12-06 07:34:11,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:11,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820298180] [2022-12-06 07:34:11,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:11,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:11,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-06 07:34:11,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:11,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820298180] [2022-12-06 07:34:11,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820298180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:11,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:11,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:11,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931605659] [2022-12-06 07:34:11,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:11,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:11,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:11,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:11,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:11,125 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:11,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:11,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:11,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:11,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:11,163 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:11,163 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:11,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:11,164 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:11,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:11,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:11,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:11,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:11,164 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:11,164 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:11,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:11,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:11,165 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:11,165 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:11,165 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:11,165 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:11,165 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:11,165 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:11,165 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:11,165 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:11,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:11,168 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:11,168 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:11,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:11,168 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:11,168 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:11,243 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:11,244 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:11,244 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:11,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:11,244 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:11,244 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:11,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2765 [2022-12-06 07:34:11,245 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-06 07:34:11,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:11,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1037691051, now seen corresponding path program 1 times [2022-12-06 07:34:11,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:11,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045095219] [2022-12-06 07:34:11,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:11,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:11,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-06 07:34:11,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:11,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045095219] [2022-12-06 07:34:11,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045095219] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:11,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:11,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:11,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497160214] [2022-12-06 07:34:11,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:11,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:11,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:11,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:11,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:11,314 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:11,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:11,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:11,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:11,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:11,353 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:11,353 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:11,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:11,354 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:11,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:11,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:11,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:11,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:11,354 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:11,354 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:11,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:11,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:11,355 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:11,355 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:11,355 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:11,355 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:11,355 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:11,355 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:11,356 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:11,356 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:11,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:11,358 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:11,358 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:11,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:11,358 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:11,358 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:11,433 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:11,434 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:11,434 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:11,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:11,434 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:11,434 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:11,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2766 [2022-12-06 07:34:11,434 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-06 07:34:11,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:11,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1007214858, now seen corresponding path program 1 times [2022-12-06 07:34:11,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:11,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088992638] [2022-12-06 07:34:11,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:11,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:11,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-06 07:34:11,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:11,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088992638] [2022-12-06 07:34:11,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088992638] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:11,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:11,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:11,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978330233] [2022-12-06 07:34:11,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:11,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:11,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:11,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:11,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:11,504 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:11,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:11,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:11,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:11,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:11,541 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:11,541 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:11,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:11,541 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:11,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:11,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:11,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:11,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:11,542 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:11,542 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:11,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:11,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:11,543 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:11,543 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:11,543 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:11,543 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:11,543 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:11,543 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:11,543 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:11,543 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:11,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:11,545 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:11,545 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:11,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:11,546 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:11,546 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:11,621 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:11,622 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:11,622 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:11,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:11,623 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:11,623 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:11,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2767 [2022-12-06 07:34:11,623 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-06 07:34:11,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:11,623 INFO L85 PathProgramCache]: Analyzing trace with hash -980432749, now seen corresponding path program 1 times [2022-12-06 07:34:11,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:11,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357334564] [2022-12-06 07:34:11,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:11,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:11,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-06 07:34:11,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:11,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357334564] [2022-12-06 07:34:11,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357334564] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:11,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:11,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:11,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253153386] [2022-12-06 07:34:11,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:11,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:11,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:11,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:11,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:11,693 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:11,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:11,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:11,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:11,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:11,728 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:11,728 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:11,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:11,728 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:11,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:11,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:11,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:11,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:11,729 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:11,729 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:11,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:11,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:11,730 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:11,730 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:11,730 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:11,730 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:11,730 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:11,730 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:11,730 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:11,730 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:11,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:11,733 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:11,733 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:11,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:11,733 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:11,733 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:11,807 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:11,809 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:11,809 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:11,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:11,809 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:11,809 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:11,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2768 [2022-12-06 07:34:11,809 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-06 07:34:11,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:11,809 INFO L85 PathProgramCache]: Analyzing trace with hash -949956556, now seen corresponding path program 1 times [2022-12-06 07:34:11,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:11,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402619951] [2022-12-06 07:34:11,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:11,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:11,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-06 07:34:11,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:11,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402619951] [2022-12-06 07:34:11,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402619951] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:11,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:11,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:11,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793134967] [2022-12-06 07:34:11,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:11,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:11,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:11,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:11,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:11,891 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:11,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:11,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:11,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:11,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:11,929 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:11,929 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:11,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:11,930 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:11,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:11,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:11,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:11,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:11,930 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:11,930 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:11,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:11,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:11,931 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:11,931 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:11,931 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:11,931 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:11,931 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:11,931 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:11,931 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:11,931 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:11,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:11,933 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:11,934 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:11,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:11,934 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:11,934 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:12,009 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:12,010 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:12,010 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:12,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:12,010 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:12,010 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:12,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2769 [2022-12-06 07:34:12,011 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-06 07:34:12,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:12,011 INFO L85 PathProgramCache]: Analyzing trace with hash -923174447, now seen corresponding path program 1 times [2022-12-06 07:34:12,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:12,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116188096] [2022-12-06 07:34:12,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:12,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:12,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:12,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-06 07:34:12,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:12,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116188096] [2022-12-06 07:34:12,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116188096] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:12,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:12,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:12,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998977792] [2022-12-06 07:34:12,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:12,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:12,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:12,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:12,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:12,081 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:12,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:12,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:12,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:12,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:12,117 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:12,117 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:12,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:12,118 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:12,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:12,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:12,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:12,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:12,118 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:12,118 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:12,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:12,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:12,119 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:12,119 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:12,119 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:12,119 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:12,119 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:12,119 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:12,119 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:12,119 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:12,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:12,122 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:12,122 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:12,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 144 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:12,122 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:12,122 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:12,196 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:12,197 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:12,197 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:12,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:12,197 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:12,197 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:12,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2770 [2022-12-06 07:34:12,198 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-06 07:34:12,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:12,198 INFO L85 PathProgramCache]: Analyzing trace with hash -892698254, now seen corresponding path program 1 times [2022-12-06 07:34:12,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:12,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115709500] [2022-12-06 07:34:12,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:12,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:12,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-06 07:34:12,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:12,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115709500] [2022-12-06 07:34:12,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115709500] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:12,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:12,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:12,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048175882] [2022-12-06 07:34:12,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:12,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:12,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:12,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:12,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:12,264 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:12,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:12,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:12,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:12,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:12,301 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:12,301 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:12,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:12,301 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:12,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:12,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:12,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:12,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:12,302 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:12,302 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:12,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:12,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:12,302 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:12,303 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:12,303 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:12,303 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:12,303 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:12,303 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:12,303 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:12,303 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:12,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:12,305 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:12,305 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:12,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:12,306 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:12,306 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:12,380 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:12,381 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:12,382 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:12,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:12,382 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:12,382 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:12,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2771 [2022-12-06 07:34:12,382 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-06 07:34:12,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:12,382 INFO L85 PathProgramCache]: Analyzing trace with hash -865916145, now seen corresponding path program 1 times [2022-12-06 07:34:12,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:12,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655659543] [2022-12-06 07:34:12,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:12,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:12,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-06 07:34:12,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:12,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655659543] [2022-12-06 07:34:12,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655659543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:12,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:12,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:12,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38378414] [2022-12-06 07:34:12,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:12,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:12,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:12,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:12,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:12,452 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:12,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:12,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:12,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:12,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:12,491 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:12,491 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:12,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:12,491 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:12,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:12,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:12,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:12,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:12,492 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:12,492 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:12,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:12,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:12,493 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:12,493 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:12,493 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:12,493 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:12,493 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:12,493 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:12,493 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:12,493 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:12,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:12,495 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:12,495 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:12,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:12,496 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:12,496 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:12,571 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:12,572 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:12,572 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:12,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:12,572 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:12,572 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:12,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2772 [2022-12-06 07:34:12,572 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-06 07:34:12,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:12,573 INFO L85 PathProgramCache]: Analyzing trace with hash -835439952, now seen corresponding path program 1 times [2022-12-06 07:34:12,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:12,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494484921] [2022-12-06 07:34:12,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:12,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:12,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:12,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-06 07:34:12,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:12,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494484921] [2022-12-06 07:34:12,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494484921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:12,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:12,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:12,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781134706] [2022-12-06 07:34:12,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:12,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:12,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:12,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:12,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:12,640 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:12,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:12,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:12,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:12,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:12,682 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:12,683 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:12,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:12,683 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:12,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:12,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:12,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:12,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:12,684 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:12,684 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:12,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:12,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:12,684 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:12,684 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:12,685 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:12,685 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:12,685 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:12,685 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:12,685 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:12,685 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:12,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:12,687 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:12,687 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:12,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:12,687 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:12,687 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:12,763 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:12,764 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:12,764 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:12,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:12,764 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:12,764 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:12,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2773 [2022-12-06 07:34:12,764 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-06 07:34:12,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:12,765 INFO L85 PathProgramCache]: Analyzing trace with hash -808657843, now seen corresponding path program 1 times [2022-12-06 07:34:12,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:12,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514391559] [2022-12-06 07:34:12,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:12,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:12,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-06 07:34:12,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:12,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514391559] [2022-12-06 07:34:12,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514391559] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:12,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:12,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:12,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921032774] [2022-12-06 07:34:12,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:12,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:12,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:12,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:12,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:12,835 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:12,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:12,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:12,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:12,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:12,871 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:12,871 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:12,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:12,872 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:12,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:12,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:12,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:12,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:12,872 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:12,872 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:12,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:12,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:12,873 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:12,873 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:12,873 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:12,873 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:12,873 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:12,873 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:12,873 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:12,873 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:12,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:12,886 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:12,886 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:12,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:12,886 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:12,886 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:12,960 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:12,961 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 07:34:12,961 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:12,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:12,962 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:12,962 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:12,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2774 [2022-12-06 07:34:12,962 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-06 07:34:12,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:12,962 INFO L85 PathProgramCache]: Analyzing trace with hash -778181650, now seen corresponding path program 1 times [2022-12-06 07:34:12,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:12,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153107008] [2022-12-06 07:34:12,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:12,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:13,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-06 07:34:13,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:13,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153107008] [2022-12-06 07:34:13,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153107008] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:13,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:13,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:13,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822380762] [2022-12-06 07:34:13,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:13,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:13,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:13,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:13,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:13,030 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:13,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:13,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:13,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:13,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:13,073 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:13,074 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:13,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:13,074 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:13,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:13,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:13,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:13,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:13,075 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:13,075 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:13,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:13,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:13,075 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:13,075 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:13,075 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:13,076 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:13,076 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:13,076 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:13,076 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:13,076 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:13,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:13,078 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:13,078 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:13,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:13,078 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:13,078 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:13,153 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:13,154 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:13,154 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:13,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:13,154 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:13,154 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:13,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2775 [2022-12-06 07:34:13,155 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-06 07:34:13,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:13,155 INFO L85 PathProgramCache]: Analyzing trace with hash -751399541, now seen corresponding path program 1 times [2022-12-06 07:34:13,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:13,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622625329] [2022-12-06 07:34:13,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:13,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:13,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-06 07:34:13,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:13,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622625329] [2022-12-06 07:34:13,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622625329] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:13,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:13,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:13,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261939918] [2022-12-06 07:34:13,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:13,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:13,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:13,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:13,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:13,229 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:13,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:13,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:13,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:13,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:13,273 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:13,273 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:13,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:13,274 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:13,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:13,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:13,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:13,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:13,274 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:13,274 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:13,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:13,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:13,275 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:13,275 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:13,275 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:13,275 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:13,275 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:13,275 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:13,275 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:13,276 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:13,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:13,278 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:13,278 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:13,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:13,278 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:13,278 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:13,352 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:13,353 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:13,353 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:13,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:13,353 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:13,353 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:13,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2776 [2022-12-06 07:34:13,353 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-06 07:34:13,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:13,353 INFO L85 PathProgramCache]: Analyzing trace with hash -720923348, now seen corresponding path program 1 times [2022-12-06 07:34:13,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:13,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832576800] [2022-12-06 07:34:13,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:13,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:13,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-06 07:34:13,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:13,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832576800] [2022-12-06 07:34:13,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832576800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:13,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:13,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:13,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965188429] [2022-12-06 07:34:13,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:13,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:13,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:13,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:13,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:13,421 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:13,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:13,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:13,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:13,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:13,464 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:13,465 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:13,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:13,465 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:13,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:13,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:13,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:13,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:13,466 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:13,466 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:13,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:13,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:13,466 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:13,466 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:13,467 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:13,467 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:13,467 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:13,467 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:13,467 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:13,467 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:13,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:13,469 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:13,469 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:13,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:13,469 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:13,469 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:13,552 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:13,553 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-06 07:34:13,553 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:13,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:13,553 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:13,553 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:13,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2777 [2022-12-06 07:34:13,553 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-06 07:34:13,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:13,553 INFO L85 PathProgramCache]: Analyzing trace with hash -694141239, now seen corresponding path program 1 times [2022-12-06 07:34:13,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:13,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424469655] [2022-12-06 07:34:13,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:13,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:13,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:13,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:13,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424469655] [2022-12-06 07:34:13,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424469655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:13,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:13,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:13,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987423121] [2022-12-06 07:34:13,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:13,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:13,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:13,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:13,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:13,623 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:13,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:13,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:13,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:13,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:13,659 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:13,659 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:13,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:13,659 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:13,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:13,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:13,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:13,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:13,660 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:13,660 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:13,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:13,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:13,661 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:13,661 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:13,661 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:13,661 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:13,661 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:13,661 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:13,661 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:13,661 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:13,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:13,663 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:13,664 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:13,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:13,664 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:13,664 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:13,739 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:13,740 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:13,740 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:13,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:13,740 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:13,740 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:13,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2778 [2022-12-06 07:34:13,740 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-06 07:34:13,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:13,740 INFO L85 PathProgramCache]: Analyzing trace with hash -663665046, now seen corresponding path program 1 times [2022-12-06 07:34:13,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:13,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952590942] [2022-12-06 07:34:13,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:13,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:13,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-06 07:34:13,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:13,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952590942] [2022-12-06 07:34:13,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952590942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:13,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:13,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:13,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596572534] [2022-12-06 07:34:13,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:13,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:13,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:13,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:13,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:13,805 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:13,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:13,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:13,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:13,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:13,847 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:13,847 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:13,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 350 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:13,848 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:13,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:13,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:13,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:13,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:13,848 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:13,849 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:13,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:13,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:13,849 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:13,849 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:13,849 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:13,849 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:13,849 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:13,850 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:13,850 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:13,850 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:13,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:13,852 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:13,852 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:13,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 122 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:13,852 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:13,852 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:13,924 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:13,925 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:34:13,925 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:13,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:13,925 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:13,925 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:13,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2779 [2022-12-06 07:34:13,925 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-06 07:34:13,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:13,926 INFO L85 PathProgramCache]: Analyzing trace with hash -636882937, now seen corresponding path program 1 times [2022-12-06 07:34:13,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:13,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67713420] [2022-12-06 07:34:13,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:13,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:14,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:14,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:14,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67713420] [2022-12-06 07:34:14,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67713420] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:14,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:14,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:14,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633310191] [2022-12-06 07:34:14,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:14,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:14,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:14,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:14,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:14,011 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:14,011 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:14,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:14,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:14,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:14,047 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:14,047 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:14,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:14,047 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:14,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:14,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:14,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:14,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:14,048 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:14,048 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:14,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:14,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:14,048 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:14,049 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:14,049 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:14,049 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:14,049 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:14,049 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:14,049 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:14,049 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:14,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:14,051 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:14,051 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:14,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:14,052 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:14,052 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:14,125 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:14,126 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:14,126 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:14,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:14,127 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:14,127 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:14,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2780 [2022-12-06 07:34:14,127 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-06 07:34:14,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:14,127 INFO L85 PathProgramCache]: Analyzing trace with hash -606406744, now seen corresponding path program 1 times [2022-12-06 07:34:14,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:14,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216595279] [2022-12-06 07:34:14,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:14,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:14,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:14,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:14,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216595279] [2022-12-06 07:34:14,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216595279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:14,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:14,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:14,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114143788] [2022-12-06 07:34:14,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:14,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:14,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:14,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:14,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:14,193 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:14,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:14,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:14,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:14,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:14,235 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:14,235 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:14,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:14,236 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:14,236 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:14,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:14,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:14,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:14,236 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:14,237 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:14,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:14,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:14,237 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:14,237 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:14,237 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:14,237 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:14,237 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:14,238 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:14,238 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:14,238 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:14,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:14,240 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:14,240 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:14,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:14,240 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:14,240 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:14,315 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:14,316 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:14,317 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:14,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:14,317 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:14,317 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:14,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2781 [2022-12-06 07:34:14,317 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-06 07:34:14,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:14,317 INFO L85 PathProgramCache]: Analyzing trace with hash -579624635, now seen corresponding path program 1 times [2022-12-06 07:34:14,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:14,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017847531] [2022-12-06 07:34:14,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:14,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:14,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-06 07:34:14,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:14,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017847531] [2022-12-06 07:34:14,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017847531] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:14,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:14,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:14,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969210115] [2022-12-06 07:34:14,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:14,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:14,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:14,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:14,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:14,385 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:14,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:14,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:14,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:14,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:14,420 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:14,421 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:14,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 356 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:14,421 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:14,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:14,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:14,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:14,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:14,421 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:14,422 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:14,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:14,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:14,422 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:14,422 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:14,422 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:14,422 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:14,422 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:14,423 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:14,423 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:14,423 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:14,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:14,425 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:14,425 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:14,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:14,425 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:14,425 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:14,498 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:14,499 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:14,499 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:14,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:14,499 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:14,499 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:14,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2782 [2022-12-06 07:34:14,499 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-06 07:34:14,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:14,499 INFO L85 PathProgramCache]: Analyzing trace with hash -549148442, now seen corresponding path program 1 times [2022-12-06 07:34:14,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:14,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145131155] [2022-12-06 07:34:14,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:14,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:14,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-06 07:34:14,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:14,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145131155] [2022-12-06 07:34:14,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145131155] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:14,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:14,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:14,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550580544] [2022-12-06 07:34:14,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:14,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:14,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:14,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:14,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:14,569 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:14,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:14,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:14,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:14,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:14,611 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:14,612 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:14,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:14,612 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:14,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:14,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:14,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:14,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:14,613 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:14,613 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:14,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:14,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:14,613 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:14,613 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:14,614 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:14,614 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:14,614 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:14,614 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:14,614 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:14,614 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:14,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:14,616 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:14,616 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:14,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:14,616 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:14,616 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:14,691 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:14,692 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:14,692 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:14,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:14,692 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:14,692 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:14,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2783 [2022-12-06 07:34:14,692 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-06 07:34:14,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:14,693 INFO L85 PathProgramCache]: Analyzing trace with hash -522366333, now seen corresponding path program 1 times [2022-12-06 07:34:14,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:14,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011875120] [2022-12-06 07:34:14,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:14,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:14,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-06 07:34:14,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:14,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011875120] [2022-12-06 07:34:14,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011875120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:14,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:14,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:14,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154245242] [2022-12-06 07:34:14,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:14,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:14,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:14,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:14,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:14,763 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:14,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:14,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:14,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:14,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:14,798 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:14,798 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:14,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:14,799 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:14,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:14,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:14,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:14,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:14,800 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:14,800 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:14,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:14,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:14,800 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:14,800 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:14,800 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:14,801 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:14,801 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:14,801 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:14,801 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:14,801 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:14,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:14,803 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:14,803 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:14,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:14,803 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:14,803 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:14,878 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:14,879 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:14,879 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:14,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:14,879 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:14,879 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:14,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2784 [2022-12-06 07:34:14,879 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-06 07:34:14,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:14,880 INFO L85 PathProgramCache]: Analyzing trace with hash -491890140, now seen corresponding path program 1 times [2022-12-06 07:34:14,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:14,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748244043] [2022-12-06 07:34:14,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:14,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:14,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-06 07:34:14,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:14,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748244043] [2022-12-06 07:34:14,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748244043] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:14,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:14,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:14,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125755664] [2022-12-06 07:34:14,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:14,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:14,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:14,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:14,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:14,947 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:14,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:14,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:14,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:14,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:14,984 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:14,984 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:14,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:14,985 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:14,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:14,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:14,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:14,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:14,985 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:14,985 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:14,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:14,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:14,986 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:14,986 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:14,986 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:14,986 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:14,986 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:14,986 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:14,986 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:14,986 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:14,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:14,999 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:14,999 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:14,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:14,999 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:14,999 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:15,073 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:15,074 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 07:34:15,074 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:15,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:15,074 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:15,074 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:15,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2785 [2022-12-06 07:34:15,074 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-06 07:34:15,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:15,074 INFO L85 PathProgramCache]: Analyzing trace with hash -465108031, now seen corresponding path program 1 times [2022-12-06 07:34:15,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:15,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609995274] [2022-12-06 07:34:15,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:15,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:15,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-06 07:34:15,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:15,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609995274] [2022-12-06 07:34:15,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609995274] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:15,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:15,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:15,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667212086] [2022-12-06 07:34:15,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:15,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:15,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:15,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:15,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:15,141 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:15,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:15,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:15,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:15,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:15,182 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:15,182 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:15,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:15,183 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:15,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:15,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:15,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:15,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:15,183 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:15,183 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:15,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:15,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:15,184 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:15,184 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:15,184 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:15,184 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:15,184 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:15,185 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:15,185 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:15,185 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:15,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:15,187 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:15,187 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:15,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:15,187 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:15,187 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:15,261 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:15,262 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:15,262 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:15,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:15,262 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:15,262 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:15,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2786 [2022-12-06 07:34:15,262 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-06 07:34:15,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:15,262 INFO L85 PathProgramCache]: Analyzing trace with hash -434631838, now seen corresponding path program 1 times [2022-12-06 07:34:15,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:15,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097101342] [2022-12-06 07:34:15,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:15,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:15,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-06 07:34:15,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:15,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097101342] [2022-12-06 07:34:15,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097101342] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:15,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:15,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:15,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664318407] [2022-12-06 07:34:15,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:15,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:15,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:15,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:15,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:15,327 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:15,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:15,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:15,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:15,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:15,363 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:15,363 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:15,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:15,363 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:15,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:15,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:15,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:15,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:15,364 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:15,364 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:15,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:15,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:15,365 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:15,365 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:15,365 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:15,365 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:15,365 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:15,365 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:15,365 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:15,365 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:15,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:15,367 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:15,367 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:15,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:15,368 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:15,368 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:15,443 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:15,444 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:15,444 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:15,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:15,444 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:15,444 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:15,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2787 [2022-12-06 07:34:15,444 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-06 07:34:15,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:15,445 INFO L85 PathProgramCache]: Analyzing trace with hash -407849729, now seen corresponding path program 1 times [2022-12-06 07:34:15,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:15,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113941580] [2022-12-06 07:34:15,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:15,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:15,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-06 07:34:15,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:15,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113941580] [2022-12-06 07:34:15,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113941580] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:15,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:15,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:15,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936511936] [2022-12-06 07:34:15,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:15,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:15,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:15,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:15,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:15,514 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:15,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:15,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:15,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:15,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:15,555 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:15,556 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:15,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:15,556 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:15,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:15,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:15,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:15,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:15,557 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:15,557 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:15,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:15,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:15,557 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:15,557 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:15,558 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:15,558 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:15,558 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:15,558 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:15,558 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:15,558 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:15,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:15,560 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:15,560 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:15,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:15,560 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:15,560 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:15,635 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:15,636 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:15,637 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:15,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:15,637 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:15,637 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:15,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2788 [2022-12-06 07:34:15,637 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-06 07:34:15,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:15,637 INFO L85 PathProgramCache]: Analyzing trace with hash -377373536, now seen corresponding path program 1 times [2022-12-06 07:34:15,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:15,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318261633] [2022-12-06 07:34:15,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:15,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:15,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:15,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-06 07:34:15,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:15,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318261633] [2022-12-06 07:34:15,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318261633] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:15,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:15,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:15,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273548229] [2022-12-06 07:34:15,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:15,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:15,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:15,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:15,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:15,705 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:15,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:15,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:15,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:15,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:15,747 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:15,747 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:15,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:15,747 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:15,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:15,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:15,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:15,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:15,748 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:15,748 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:15,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:15,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:15,749 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:15,749 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:15,749 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:15,749 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:15,749 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:15,749 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:15,749 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:15,749 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:15,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:15,752 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:15,752 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:15,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:15,752 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:15,752 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:15,825 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:15,826 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:15,826 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:15,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:15,827 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:15,827 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:15,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2789 [2022-12-06 07:34:15,827 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-06 07:34:15,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:15,827 INFO L85 PathProgramCache]: Analyzing trace with hash -350591427, now seen corresponding path program 1 times [2022-12-06 07:34:15,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:15,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115734981] [2022-12-06 07:34:15,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:15,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:15,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-06 07:34:15,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:15,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115734981] [2022-12-06 07:34:15,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115734981] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:15,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:15,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:15,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800008297] [2022-12-06 07:34:15,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:15,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:15,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:15,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:15,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:15,898 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:15,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:15,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:15,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:15,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:15,939 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:15,939 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:15,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:15,940 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:15,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:15,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:15,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:15,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:15,940 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:15,940 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:15,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:15,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:15,941 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:15,941 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:15,941 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:15,941 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:15,941 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:15,942 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:15,942 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:15,942 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:15,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:15,944 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:15,944 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:15,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:15,944 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:15,944 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:16,017 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:16,018 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:16,018 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:16,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:16,018 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:16,018 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:16,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2790 [2022-12-06 07:34:16,018 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-06 07:34:16,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:16,019 INFO L85 PathProgramCache]: Analyzing trace with hash -320115234, now seen corresponding path program 1 times [2022-12-06 07:34:16,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:16,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186009567] [2022-12-06 07:34:16,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:16,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:16,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-06 07:34:16,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:16,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186009567] [2022-12-06 07:34:16,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186009567] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:16,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:16,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:16,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652238414] [2022-12-06 07:34:16,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:16,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:16,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:16,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:16,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:16,100 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:16,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:16,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:16,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:16,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:16,136 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:16,136 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:16,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:16,137 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:16,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:16,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:16,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:16,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:16,137 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:16,137 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:16,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:16,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:16,138 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:16,138 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:16,138 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:16,138 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:16,138 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:16,138 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:16,138 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:16,139 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:16,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:16,141 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:16,141 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:16,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:16,141 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:16,141 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:16,216 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:16,217 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:16,217 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:16,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:16,217 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:16,217 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:16,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2791 [2022-12-06 07:34:16,217 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-06 07:34:16,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:16,217 INFO L85 PathProgramCache]: Analyzing trace with hash -293333125, now seen corresponding path program 1 times [2022-12-06 07:34:16,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:16,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722889936] [2022-12-06 07:34:16,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:16,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:16,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-06 07:34:16,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:16,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722889936] [2022-12-06 07:34:16,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722889936] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:16,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:16,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:16,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910275751] [2022-12-06 07:34:16,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:16,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:16,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:16,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:16,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:16,286 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:16,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:16,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:16,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:16,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:16,327 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:16,327 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:16,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:16,327 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:16,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:16,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:16,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:16,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:16,328 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:16,328 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:16,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:16,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:16,329 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:16,329 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:16,329 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:16,329 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:16,329 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:16,329 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:16,329 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:16,329 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:16,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:16,331 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:16,331 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:16,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:16,332 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:16,332 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:16,405 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:16,406 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:16,406 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:16,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:16,406 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:16,406 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:16,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2792 [2022-12-06 07:34:16,406 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-06 07:34:16,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:16,406 INFO L85 PathProgramCache]: Analyzing trace with hash -262856932, now seen corresponding path program 1 times [2022-12-06 07:34:16,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:16,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33736859] [2022-12-06 07:34:16,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:16,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:16,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:16,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:16,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33736859] [2022-12-06 07:34:16,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33736859] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:16,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:16,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:16,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503074418] [2022-12-06 07:34:16,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:16,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:16,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:16,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:16,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:16,474 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:16,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:16,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:16,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:16,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:16,515 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:16,515 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:16,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:16,515 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:16,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:16,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:16,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:16,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:16,516 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:16,516 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:16,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:16,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:16,517 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:16,517 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:16,517 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:16,517 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:16,517 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:16,517 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:16,517 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:16,517 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:16,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:16,519 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:16,519 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:16,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:16,520 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:16,520 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:16,593 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:16,595 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:16,595 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:16,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:16,595 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:16,595 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:16,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2793 [2022-12-06 07:34:16,595 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-06 07:34:16,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:16,595 INFO L85 PathProgramCache]: Analyzing trace with hash -236074823, now seen corresponding path program 1 times [2022-12-06 07:34:16,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:16,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707764306] [2022-12-06 07:34:16,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:16,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:16,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-06 07:34:16,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:16,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707764306] [2022-12-06 07:34:16,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707764306] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:16,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:16,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:16,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075366314] [2022-12-06 07:34:16,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:16,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:16,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:16,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:16,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:16,666 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:16,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:16,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:16,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:16,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:16,702 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:16,702 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:16,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:16,702 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:16,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:16,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:16,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:16,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:16,703 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:16,703 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:16,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:16,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:16,703 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:16,704 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:16,704 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:16,704 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:16,704 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:16,704 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:16,704 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:16,704 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:16,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:16,706 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:16,706 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:16,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:16,706 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:16,706 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:16,780 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:16,781 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:16,781 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:16,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:16,781 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:16,781 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:16,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2794 [2022-12-06 07:34:16,781 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-06 07:34:16,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:16,781 INFO L85 PathProgramCache]: Analyzing trace with hash -205598630, now seen corresponding path program 1 times [2022-12-06 07:34:16,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:16,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113246805] [2022-12-06 07:34:16,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:16,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:16,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-06 07:34:16,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:16,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113246805] [2022-12-06 07:34:16,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113246805] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:16,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:16,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:16,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209592430] [2022-12-06 07:34:16,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:16,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:16,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:16,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:16,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:16,848 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:16,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:16,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:16,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:16,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:16,888 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:16,888 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:16,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:16,888 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:16,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:16,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:16,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:16,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:16,889 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:16,889 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:16,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:16,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:16,890 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:16,890 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:16,890 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:16,890 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:16,890 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:16,890 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:16,890 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:16,890 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:16,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:16,892 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:16,892 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:16,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:16,893 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:16,893 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:16,967 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:16,968 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:16,968 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:16,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:16,968 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:16,968 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:16,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2795 [2022-12-06 07:34:16,968 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-06 07:34:16,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:16,968 INFO L85 PathProgramCache]: Analyzing trace with hash -178816521, now seen corresponding path program 1 times [2022-12-06 07:34:16,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:16,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460789968] [2022-12-06 07:34:16,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:16,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:17,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-06 07:34:17,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:17,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460789968] [2022-12-06 07:34:17,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460789968] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:17,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:17,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:17,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582166719] [2022-12-06 07:34:17,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:17,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:17,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:17,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:17,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:17,038 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:17,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:17,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:17,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:17,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:17,078 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:17,079 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:17,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:17,079 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:17,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:17,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:17,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:17,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:17,080 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:17,089 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:17,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:17,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:17,090 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:17,090 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:17,091 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:17,091 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:17,091 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:17,091 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:17,091 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:17,091 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:17,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:17,093 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:17,093 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:17,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:17,094 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:17,094 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:17,168 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:17,169 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:17,169 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:17,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:17,169 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:17,170 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:17,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2796 [2022-12-06 07:34:17,170 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-06 07:34:17,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:17,170 INFO L85 PathProgramCache]: Analyzing trace with hash -148340328, now seen corresponding path program 1 times [2022-12-06 07:34:17,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:17,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196096746] [2022-12-06 07:34:17,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:17,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:17,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-06 07:34:17,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:17,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196096746] [2022-12-06 07:34:17,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196096746] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:17,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:17,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:17,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481803110] [2022-12-06 07:34:17,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:17,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:17,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:17,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:17,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:17,235 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:17,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:17,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:17,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:17,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:17,277 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:17,277 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:17,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:17,277 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:17,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:17,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:17,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:17,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:17,278 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:17,278 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:17,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:17,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:17,278 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:17,279 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:17,279 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:17,279 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:17,279 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:17,279 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:17,279 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:17,279 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:17,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:17,281 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:17,281 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:17,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:17,281 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:17,281 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:17,354 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:17,354 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:34:17,355 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:17,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:17,355 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:17,355 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:17,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2797 [2022-12-06 07:34:17,355 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-06 07:34:17,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:17,355 INFO L85 PathProgramCache]: Analyzing trace with hash -121558219, now seen corresponding path program 1 times [2022-12-06 07:34:17,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:17,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525608707] [2022-12-06 07:34:17,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:17,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:17,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-06 07:34:17,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:17,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525608707] [2022-12-06 07:34:17,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525608707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:17,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:17,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:17,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062500358] [2022-12-06 07:34:17,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:17,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:17,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:17,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:17,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:17,423 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:17,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:17,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:17,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:17,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:17,457 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:17,457 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:17,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:17,458 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:17,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:17,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:17,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:17,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:17,458 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:17,458 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:17,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:17,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:17,459 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:17,459 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:17,459 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:17,459 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:17,459 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:17,459 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:17,459 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:17,459 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:17,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:17,461 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:17,462 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:17,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:17,462 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:17,462 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:17,536 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:17,538 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:17,538 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:17,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:17,538 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:17,538 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:17,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2798 [2022-12-06 07:34:17,538 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-06 07:34:17,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:17,538 INFO L85 PathProgramCache]: Analyzing trace with hash -91082026, now seen corresponding path program 1 times [2022-12-06 07:34:17,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:17,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203265729] [2022-12-06 07:34:17,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:17,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:17,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:17,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:17,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203265729] [2022-12-06 07:34:17,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203265729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:17,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:17,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:17,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344866867] [2022-12-06 07:34:17,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:17,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:17,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:17,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:17,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:17,605 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:17,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:17,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:17,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:17,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:17,648 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:17,648 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:17,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:17,649 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:17,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:17,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:17,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:17,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:17,649 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:17,649 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:17,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:17,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:17,650 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:17,650 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:17,650 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:17,650 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:17,650 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:17,650 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:17,650 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:17,650 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:17,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:17,653 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:17,653 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:17,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:17,653 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:17,653 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:17,728 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:17,729 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:17,729 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:17,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:17,729 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:17,729 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:17,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2799 [2022-12-06 07:34:17,729 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-06 07:34:17,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:17,730 INFO L85 PathProgramCache]: Analyzing trace with hash -64299917, now seen corresponding path program 1 times [2022-12-06 07:34:17,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:17,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570690528] [2022-12-06 07:34:17,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:17,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:17,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:17,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-06 07:34:17,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:17,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570690528] [2022-12-06 07:34:17,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570690528] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:17,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:17,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:17,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654751246] [2022-12-06 07:34:17,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:17,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:17,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:17,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:17,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:17,800 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:17,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:17,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:17,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:17,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:17,839 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:17,839 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:17,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:17,840 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:17,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:17,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:17,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:17,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:17,840 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:17,840 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:17,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:17,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:17,841 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:17,841 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:17,841 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:17,841 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:17,841 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:17,841 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:17,841 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:17,841 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:17,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:17,844 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:17,844 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:17,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:17,844 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:17,844 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:17,917 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:17,918 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:17,919 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:17,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:17,919 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:17,919 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:17,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2800 [2022-12-06 07:34:17,919 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-06 07:34:17,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:17,919 INFO L85 PathProgramCache]: Analyzing trace with hash -33823724, now seen corresponding path program 1 times [2022-12-06 07:34:17,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:17,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911624463] [2022-12-06 07:34:17,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:17,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:17,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-06 07:34:17,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:17,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911624463] [2022-12-06 07:34:17,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911624463] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:17,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:17,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:17,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992759076] [2022-12-06 07:34:17,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:17,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:17,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:17,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:17,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:17,987 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:17,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:17,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:17,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:17,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:18,023 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:18,023 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:18,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:18,024 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:18,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:18,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:18,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:18,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:18,024 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:18,024 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:18,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:18,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:18,025 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:18,025 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:18,025 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:18,025 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:18,025 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:18,025 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:18,025 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:18,026 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:18,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:18,028 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:18,028 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:18,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:18,028 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:18,028 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:18,105 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:18,106 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:34:18,106 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:18,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:18,106 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:18,106 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:18,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2801 [2022-12-06 07:34:18,106 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-06 07:34:18,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:18,107 INFO L85 PathProgramCache]: Analyzing trace with hash -7041615, now seen corresponding path program 1 times [2022-12-06 07:34:18,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:18,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756448779] [2022-12-06 07:34:18,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:18,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:18,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-06 07:34:18,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:18,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756448779] [2022-12-06 07:34:18,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756448779] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:18,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:18,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:18,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864919234] [2022-12-06 07:34:18,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:18,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:18,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:18,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:18,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:18,190 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:18,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:18,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:18,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:18,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:18,231 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:18,231 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:18,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:18,232 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:18,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:18,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:18,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:18,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:18,232 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:18,233 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:18,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:18,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:18,233 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:18,233 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:18,233 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:18,233 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:18,234 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:18,234 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:18,234 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:18,234 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:18,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:18,236 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:18,236 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:18,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:18,236 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:18,236 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:18,310 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:18,311 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:18,311 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:18,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:18,311 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:18,311 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:18,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2802 [2022-12-06 07:34:18,312 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-06 07:34:18,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:18,312 INFO L85 PathProgramCache]: Analyzing trace with hash 23434578, now seen corresponding path program 1 times [2022-12-06 07:34:18,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:18,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2849796] [2022-12-06 07:34:18,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:18,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:18,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-06 07:34:18,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:18,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2849796] [2022-12-06 07:34:18,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2849796] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:18,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:18,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:18,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079670046] [2022-12-06 07:34:18,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:18,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:18,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:18,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:18,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:18,380 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:18,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:18,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:18,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:18,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:18,415 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:18,415 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:18,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:18,416 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:18,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:18,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:18,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:18,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:18,416 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:18,416 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:18,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:18,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:18,417 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:18,417 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:18,417 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:18,417 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:18,417 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:18,417 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:18,418 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:18,418 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:18,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:18,420 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:18,420 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:18,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:18,420 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:18,420 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:18,494 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:18,495 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:18,495 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:18,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:18,495 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:18,495 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:18,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2803 [2022-12-06 07:34:18,495 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-06 07:34:18,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:18,495 INFO L85 PathProgramCache]: Analyzing trace with hash 50216687, now seen corresponding path program 1 times [2022-12-06 07:34:18,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:18,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025020224] [2022-12-06 07:34:18,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:18,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:18,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-06 07:34:18,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:18,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025020224] [2022-12-06 07:34:18,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025020224] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:18,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:18,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:18,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634049930] [2022-12-06 07:34:18,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:18,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:18,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:18,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:18,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:18,566 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:18,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:18,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:18,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:18,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:18,606 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:18,607 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:18,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:18,607 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:18,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:18,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:18,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:18,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:18,608 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:18,608 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:18,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:18,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:18,608 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:18,608 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:18,608 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:18,608 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:18,609 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:18,609 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:18,609 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:18,609 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:18,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:18,611 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:18,611 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:18,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:18,611 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:18,611 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:18,683 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:18,684 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:34:18,684 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:18,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:18,684 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:18,684 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:18,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2804 [2022-12-06 07:34:18,685 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-06 07:34:18,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:18,685 INFO L85 PathProgramCache]: Analyzing trace with hash 80692880, now seen corresponding path program 1 times [2022-12-06 07:34:18,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:18,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634518084] [2022-12-06 07:34:18,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:18,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:18,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-06 07:34:18,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:18,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634518084] [2022-12-06 07:34:18,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634518084] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:18,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:18,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:18,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236458474] [2022-12-06 07:34:18,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:18,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:18,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:18,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:18,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:18,750 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:18,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:18,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:18,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:18,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:18,793 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:18,793 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:18,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:18,793 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:18,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:18,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:18,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:18,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:18,794 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:18,794 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:18,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:18,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:18,795 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:18,795 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:18,795 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:18,795 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:18,795 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:18,795 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:18,795 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:18,795 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:18,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:18,797 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:18,797 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:18,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:18,798 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:18,798 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:18,872 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:18,873 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:18,873 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:18,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:18,873 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:18,873 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:18,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2805 [2022-12-06 07:34:18,873 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-06 07:34:18,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:18,874 INFO L85 PathProgramCache]: Analyzing trace with hash 107474989, now seen corresponding path program 1 times [2022-12-06 07:34:18,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:18,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959314016] [2022-12-06 07:34:18,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:18,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:18,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-06 07:34:18,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:18,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959314016] [2022-12-06 07:34:18,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959314016] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:18,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:18,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:18,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123283676] [2022-12-06 07:34:18,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:18,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:18,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:18,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:18,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:18,946 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:18,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:18,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:18,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:18,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:18,987 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:18,988 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:18,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:18,988 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:18,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:18,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:18,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:18,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:18,989 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:18,989 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:18,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:18,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:18,989 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:18,989 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:18,990 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:18,990 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:18,990 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:18,990 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:18,990 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:18,990 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:18,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:18,992 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:18,992 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:18,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:18,992 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:18,992 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:19,067 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:19,068 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:19,068 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:19,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:19,068 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:19,068 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:19,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2806 [2022-12-06 07:34:19,068 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-06 07:34:19,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:19,068 INFO L85 PathProgramCache]: Analyzing trace with hash 137951182, now seen corresponding path program 1 times [2022-12-06 07:34:19,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:19,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629967526] [2022-12-06 07:34:19,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:19,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:19,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-06 07:34:19,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:19,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629967526] [2022-12-06 07:34:19,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629967526] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:19,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:19,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:19,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027700707] [2022-12-06 07:34:19,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:19,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:19,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:19,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:19,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:19,136 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:19,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:19,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:19,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:19,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:19,172 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:19,172 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:19,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:19,173 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:19,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:19,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:19,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:19,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:19,173 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:19,173 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:19,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:19,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:19,174 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:19,174 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:19,174 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:19,174 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:19,174 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:19,175 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:19,175 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:19,175 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:19,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:19,177 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:19,177 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:19,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:19,188 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:19,188 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:19,263 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:19,264 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-06 07:34:19,264 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:19,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:19,264 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:19,265 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:19,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2807 [2022-12-06 07:34:19,265 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-06 07:34:19,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:19,265 INFO L85 PathProgramCache]: Analyzing trace with hash 164733291, now seen corresponding path program 1 times [2022-12-06 07:34:19,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:19,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375535885] [2022-12-06 07:34:19,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:19,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:19,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-06 07:34:19,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:19,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375535885] [2022-12-06 07:34:19,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375535885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:19,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:19,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:19,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635643792] [2022-12-06 07:34:19,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:19,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:19,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:19,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:19,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:19,336 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:19,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:19,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:19,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:19,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:19,378 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:19,378 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:19,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:19,378 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:19,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:19,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:19,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:19,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:19,379 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:19,379 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:19,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:19,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:19,379 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:19,380 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:19,380 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:19,380 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:19,380 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:19,380 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:19,380 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:19,380 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:19,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:19,382 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:19,382 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:19,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:19,383 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:19,383 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:19,458 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:19,459 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:19,459 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:19,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:19,460 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:19,460 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:19,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2808 [2022-12-06 07:34:19,460 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-06 07:34:19,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:19,460 INFO L85 PathProgramCache]: Analyzing trace with hash 195209484, now seen corresponding path program 1 times [2022-12-06 07:34:19,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:19,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711621711] [2022-12-06 07:34:19,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:19,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:19,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:19,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:19,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711621711] [2022-12-06 07:34:19,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711621711] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:19,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:19,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:19,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871311626] [2022-12-06 07:34:19,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:19,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:19,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:19,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:19,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:19,547 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:19,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:19,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:19,547 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:19,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:19,589 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:19,590 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:19,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:19,590 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:19,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:19,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:19,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:19,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:19,591 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:19,591 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:19,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:19,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:19,592 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:19,592 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:19,592 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:19,593 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:19,593 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:19,593 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:19,593 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:19,593 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:19,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:19,596 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:19,596 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:19,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:19,596 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:19,596 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:19,685 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:19,686 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-06 07:34:19,686 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:19,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:19,686 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:19,686 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:19,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2809 [2022-12-06 07:34:19,686 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-06 07:34:19,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:19,686 INFO L85 PathProgramCache]: Analyzing trace with hash 221991593, now seen corresponding path program 1 times [2022-12-06 07:34:19,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:19,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556585620] [2022-12-06 07:34:19,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:19,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:19,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-06 07:34:19,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:19,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556585620] [2022-12-06 07:34:19,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556585620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:19,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:19,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:19,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124787291] [2022-12-06 07:34:19,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:19,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:19,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:19,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:19,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:19,761 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:19,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:19,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:19,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:19,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:19,804 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:19,804 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:19,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:19,805 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:19,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:19,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:19,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:19,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:19,805 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:19,805 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:19,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:19,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:19,806 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:19,806 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:19,806 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:19,806 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:19,806 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:19,806 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:19,807 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:19,807 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:19,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:19,809 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:19,809 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:19,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:19,809 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:19,809 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:19,886 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:19,887 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:34:19,887 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:19,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:19,887 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:19,887 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:19,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2810 [2022-12-06 07:34:19,887 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-06 07:34:19,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:19,887 INFO L85 PathProgramCache]: Analyzing trace with hash 252467786, now seen corresponding path program 1 times [2022-12-06 07:34:19,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:19,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471430048] [2022-12-06 07:34:19,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:19,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:19,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-06 07:34:19,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:19,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471430048] [2022-12-06 07:34:19,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471430048] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:19,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:19,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:19,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184576553] [2022-12-06 07:34:19,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:19,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:19,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:19,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:19,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:19,959 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:19,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:19,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:19,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:19,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:19,997 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:19,997 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:19,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:19,998 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:19,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:19,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:19,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:19,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:19,998 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:19,999 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:19,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:19,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:19,999 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:19,999 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:19,999 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:20,000 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:20,000 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:20,000 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:20,000 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:20,000 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:20,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:20,002 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:20,002 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:20,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:20,003 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:20,003 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:20,084 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:20,085 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 07:34:20,085 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:20,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:20,085 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:20,085 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:20,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2811 [2022-12-06 07:34:20,086 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-06 07:34:20,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:20,086 INFO L85 PathProgramCache]: Analyzing trace with hash 279249895, now seen corresponding path program 1 times [2022-12-06 07:34:20,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:20,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175000065] [2022-12-06 07:34:20,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:20,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:20,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-06 07:34:20,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:20,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175000065] [2022-12-06 07:34:20,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175000065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:20,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:20,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:20,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115333978] [2022-12-06 07:34:20,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:20,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:20,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:20,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:20,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:20,158 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:20,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:20,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:20,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:20,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:20,201 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:20,201 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:20,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:20,201 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:20,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:20,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:20,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:20,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:20,202 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:20,202 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:20,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:20,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:20,203 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:20,203 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:20,203 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:20,203 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:20,203 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:20,203 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:20,203 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:20,203 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:20,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:20,205 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:20,205 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:20,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:20,206 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:20,206 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:20,280 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:20,281 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:20,281 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:20,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:20,281 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:20,281 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:20,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2812 [2022-12-06 07:34:20,282 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-06 07:34:20,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:20,283 INFO L85 PathProgramCache]: Analyzing trace with hash 309726088, now seen corresponding path program 1 times [2022-12-06 07:34:20,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:20,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790555291] [2022-12-06 07:34:20,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:20,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:20,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-06 07:34:20,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:20,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790555291] [2022-12-06 07:34:20,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790555291] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:20,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:20,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:20,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247798694] [2022-12-06 07:34:20,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:20,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:20,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:20,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:20,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:20,373 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:20,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:20,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:20,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:20,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:20,416 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:20,416 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:20,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:20,417 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:20,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:20,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:20,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:20,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:20,417 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:20,417 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:20,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:20,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:20,418 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:20,418 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:20,418 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:20,418 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:20,418 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:20,419 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:20,419 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:20,419 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:20,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:20,421 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:20,421 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:20,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:20,421 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:20,421 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:20,496 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:20,497 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:20,497 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:20,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:20,498 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:20,498 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:20,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2813 [2022-12-06 07:34:20,498 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-06 07:34:20,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:20,498 INFO L85 PathProgramCache]: Analyzing trace with hash 336508197, now seen corresponding path program 1 times [2022-12-06 07:34:20,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:20,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592569850] [2022-12-06 07:34:20,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:20,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:20,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-06 07:34:20,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:20,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592569850] [2022-12-06 07:34:20,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592569850] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:20,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:20,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:20,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805012560] [2022-12-06 07:34:20,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:20,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:20,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:20,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:20,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:20,568 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:20,568 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:20,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:20,568 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:20,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:20,605 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:20,605 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:20,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:20,605 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:20,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:20,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:20,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:20,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:20,606 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:20,606 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:20,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:20,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:20,607 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:20,607 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:20,607 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:20,607 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:20,607 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:20,607 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:20,607 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:20,607 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:20,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:20,609 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:20,609 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:20,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:20,610 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:20,610 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:20,687 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:20,688 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:34:20,688 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:20,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:20,688 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:20,688 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:20,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2814 [2022-12-06 07:34:20,688 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-06 07:34:20,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:20,689 INFO L85 PathProgramCache]: Analyzing trace with hash 366984390, now seen corresponding path program 1 times [2022-12-06 07:34:20,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:20,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102272377] [2022-12-06 07:34:20,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:20,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:20,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-06 07:34:20,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:20,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102272377] [2022-12-06 07:34:20,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102272377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:20,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:20,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:20,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147865406] [2022-12-06 07:34:20,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:20,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:20,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:20,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:20,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:20,768 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:20,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:20,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:20,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:20,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:20,812 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:20,813 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:20,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:20,813 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:20,813 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:20,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:20,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:20,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:20,814 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:20,814 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:20,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:20,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:20,814 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:20,814 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:20,815 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:20,815 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:20,815 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:20,815 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:20,815 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:20,815 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:20,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:20,817 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:20,817 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:20,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:20,817 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:20,817 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:20,893 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:20,894 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:20,894 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:20,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:20,894 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:20,894 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:20,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2815 [2022-12-06 07:34:20,894 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-06 07:34:20,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:20,894 INFO L85 PathProgramCache]: Analyzing trace with hash 393766499, now seen corresponding path program 1 times [2022-12-06 07:34:20,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:20,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039598414] [2022-12-06 07:34:20,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:20,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:20,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:20,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:20,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039598414] [2022-12-06 07:34:20,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039598414] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:20,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:20,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:20,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603948252] [2022-12-06 07:34:20,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:20,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:20,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:20,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:20,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:20,966 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:20,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:20,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:20,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:20,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:21,002 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:21,002 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:21,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:21,003 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:21,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:21,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:21,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:21,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:21,003 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:21,003 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:21,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:21,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:21,004 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:21,004 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:21,005 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:21,005 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:21,005 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:21,005 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:21,005 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:21,005 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:21,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:21,008 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:21,008 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:21,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:21,008 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:21,008 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:21,088 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:21,089 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:34:21,090 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:21,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:21,090 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:21,090 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:21,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2816 [2022-12-06 07:34:21,090 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-06 07:34:21,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:21,090 INFO L85 PathProgramCache]: Analyzing trace with hash 424242692, now seen corresponding path program 1 times [2022-12-06 07:34:21,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:21,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092270388] [2022-12-06 07:34:21,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:21,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:21,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-06 07:34:21,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:21,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092270388] [2022-12-06 07:34:21,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092270388] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:21,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:21,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:21,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192228101] [2022-12-06 07:34:21,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:21,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:21,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:21,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:21,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:21,168 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:21,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:21,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:21,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:21,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:21,211 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:21,211 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:21,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:21,212 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:21,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:21,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:21,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:21,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:21,213 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:21,213 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:21,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:21,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:21,213 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:21,213 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:21,214 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:21,214 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:21,214 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:21,214 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:21,214 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:21,214 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:21,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:21,216 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:21,216 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:21,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:21,216 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:21,216 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:21,293 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:21,294 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:34:21,295 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:21,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:21,295 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:21,295 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:21,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2817 [2022-12-06 07:34:21,295 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-06 07:34:21,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:21,295 INFO L85 PathProgramCache]: Analyzing trace with hash 451024801, now seen corresponding path program 1 times [2022-12-06 07:34:21,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:21,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134101903] [2022-12-06 07:34:21,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:21,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:21,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-06 07:34:21,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:21,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134101903] [2022-12-06 07:34:21,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134101903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:21,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:21,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:21,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384840525] [2022-12-06 07:34:21,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:21,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:21,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:21,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:21,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:21,368 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:21,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:21,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:21,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:21,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:21,419 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:21,419 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:21,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:21,419 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:21,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:21,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:21,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:21,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:21,420 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:21,420 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:21,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:21,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:21,421 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:21,421 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:21,421 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:21,421 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:21,421 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:21,421 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:21,421 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:21,421 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:21,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:21,423 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:21,423 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:21,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:21,424 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:21,424 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:21,500 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:21,501 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:34:21,501 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:21,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:21,501 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:21,501 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:21,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2818 [2022-12-06 07:34:21,501 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-06 07:34:21,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:21,501 INFO L85 PathProgramCache]: Analyzing trace with hash 481500994, now seen corresponding path program 1 times [2022-12-06 07:34:21,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:21,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792395952] [2022-12-06 07:34:21,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:21,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:21,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-06 07:34:21,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:21,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792395952] [2022-12-06 07:34:21,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792395952] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:21,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:21,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:21,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139094370] [2022-12-06 07:34:21,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:21,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:21,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:21,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:21,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:21,570 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:21,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:21,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:21,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:21,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:21,607 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:21,607 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:21,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:21,608 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:21,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:21,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:21,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:21,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:21,608 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:21,608 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:21,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:21,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:21,609 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:21,609 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:21,609 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:21,609 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:21,609 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:21,609 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:21,609 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:21,610 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:21,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:21,612 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:21,612 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:21,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:21,612 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:21,612 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:21,687 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:21,688 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:21,689 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:21,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:21,689 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:21,689 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:21,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2819 [2022-12-06 07:34:21,689 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-06 07:34:21,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:21,689 INFO L85 PathProgramCache]: Analyzing trace with hash 508283103, now seen corresponding path program 1 times [2022-12-06 07:34:21,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:21,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045029054] [2022-12-06 07:34:21,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:21,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:21,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-06 07:34:21,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:21,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045029054] [2022-12-06 07:34:21,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045029054] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:21,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:21,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:21,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13151595] [2022-12-06 07:34:21,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:21,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:21,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:21,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:21,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:21,759 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:21,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:21,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:21,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:21,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:21,798 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:21,798 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:21,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:21,799 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:21,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:21,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:21,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:21,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:21,799 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:21,799 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:21,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:21,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:21,800 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:21,800 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:21,800 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:21,800 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:21,800 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:21,800 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:21,800 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:21,800 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:21,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:21,803 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:21,803 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:21,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:21,803 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:21,803 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:21,879 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:21,880 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:34:21,880 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:21,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:21,880 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:21,880 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:21,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2820 [2022-12-06 07:34:21,880 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-06 07:34:21,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:21,880 INFO L85 PathProgramCache]: Analyzing trace with hash 538759296, now seen corresponding path program 1 times [2022-12-06 07:34:21,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:21,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023997175] [2022-12-06 07:34:21,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:21,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:21,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:21,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:21,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023997175] [2022-12-06 07:34:21,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023997175] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:21,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:21,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:21,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131695770] [2022-12-06 07:34:21,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:21,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:21,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:21,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:21,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:21,948 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:21,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:21,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:21,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:21,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:21,990 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:21,990 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:21,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:21,990 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:21,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:21,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:21,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:21,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:21,991 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:21,991 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:21,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:21,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:21,991 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:21,992 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:21,992 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:21,992 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:21,992 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:21,992 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:21,992 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:21,992 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:21,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:21,994 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:21,994 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:21,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:21,995 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:21,995 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:22,068 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:22,070 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:22,070 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:22,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:22,070 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:22,070 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:22,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2821 [2022-12-06 07:34:22,070 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-06 07:34:22,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:22,070 INFO L85 PathProgramCache]: Analyzing trace with hash 565541405, now seen corresponding path program 1 times [2022-12-06 07:34:22,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:22,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351382376] [2022-12-06 07:34:22,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:22,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:22,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-06 07:34:22,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:22,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351382376] [2022-12-06 07:34:22,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351382376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:22,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:22,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:22,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274310396] [2022-12-06 07:34:22,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:22,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:22,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:22,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:22,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:22,143 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:22,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:22,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:22,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:22,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:22,184 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:22,184 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:22,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:22,185 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:22,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:22,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:22,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:22,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:22,185 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:22,185 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:22,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:22,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:22,186 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:22,186 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:22,186 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:22,186 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:22,186 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:22,187 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:22,187 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:22,187 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:22,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:22,189 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:22,189 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:22,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:22,189 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:22,189 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:22,264 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:22,265 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:22,265 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:22,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:22,265 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:22,265 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:22,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2822 [2022-12-06 07:34:22,265 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-06 07:34:22,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:22,265 INFO L85 PathProgramCache]: Analyzing trace with hash 596017598, now seen corresponding path program 1 times [2022-12-06 07:34:22,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:22,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003933286] [2022-12-06 07:34:22,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:22,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:22,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-06 07:34:22,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:22,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003933286] [2022-12-06 07:34:22,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003933286] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:22,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:22,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:22,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130294150] [2022-12-06 07:34:22,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:22,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:22,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:22,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:22,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:22,332 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:22,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:22,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:22,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:22,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:22,369 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:22,369 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:22,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:22,369 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:22,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:22,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:22,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:22,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:22,370 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:22,370 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:22,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:22,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:22,371 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:22,371 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:22,371 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:22,371 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:22,371 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:22,371 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:22,371 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:22,371 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:22,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:22,373 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:22,373 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:22,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:22,374 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:22,374 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:22,449 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:22,450 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:22,450 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:22,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:22,450 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:22,451 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:22,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2823 [2022-12-06 07:34:22,451 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-06 07:34:22,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:22,451 INFO L85 PathProgramCache]: Analyzing trace with hash 622799707, now seen corresponding path program 1 times [2022-12-06 07:34:22,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:22,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006739136] [2022-12-06 07:34:22,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:22,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:22,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-06 07:34:22,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:22,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006739136] [2022-12-06 07:34:22,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006739136] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:22,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:22,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:22,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632540168] [2022-12-06 07:34:22,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:22,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:22,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:22,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:22,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:22,538 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:22,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:22,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:22,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:22,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:22,579 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:22,580 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:22,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:22,580 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:22,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:22,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:22,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:22,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:22,581 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:22,581 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:22,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:22,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:22,581 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:22,582 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:22,582 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:22,582 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:22,582 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:22,582 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:22,582 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:22,582 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:22,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:22,584 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:22,584 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:22,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:22,585 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:22,585 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:22,660 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:22,661 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:22,661 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:22,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:22,661 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:22,661 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:22,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2824 [2022-12-06 07:34:22,662 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-06 07:34:22,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:22,662 INFO L85 PathProgramCache]: Analyzing trace with hash 653275900, now seen corresponding path program 1 times [2022-12-06 07:34:22,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:22,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186757462] [2022-12-06 07:34:22,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:22,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:22,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:22,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:22,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:22,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186757462] [2022-12-06 07:34:22,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186757462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:22,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:22,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:22,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735756960] [2022-12-06 07:34:22,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:22,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:22,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:22,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:22,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:22,732 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:22,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:22,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:22,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:22,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:22,775 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:22,775 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:22,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:22,775 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:22,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:22,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:22,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:22,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:22,776 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:22,776 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:22,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:22,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:22,777 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:22,777 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:22,777 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:22,777 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:22,777 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:22,777 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:22,777 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:22,777 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:22,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:22,779 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:22,779 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:22,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 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 116. Up to 16 conditions per place. [2022-12-06 07:34:22,780 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:22,780 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:22,855 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:22,856 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:22,856 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:22,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:22,856 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:22,856 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:22,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2825 [2022-12-06 07:34:22,856 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-06 07:34:22,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:22,856 INFO L85 PathProgramCache]: Analyzing trace with hash 680058009, now seen corresponding path program 1 times [2022-12-06 07:34:22,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:22,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198810856] [2022-12-06 07:34:22,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:22,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:22,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-06 07:34:22,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:22,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198810856] [2022-12-06 07:34:22,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198810856] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:22,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:22,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:22,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238231805] [2022-12-06 07:34:22,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:22,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:22,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:22,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:22,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:22,927 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:22,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:22,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:22,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:22,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:22,968 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:22,968 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:22,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:22,969 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:22,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:22,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:22,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:22,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:22,969 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:22,969 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:22,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:22,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:22,970 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:22,970 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:22,970 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:22,970 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:22,970 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:22,971 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:22,971 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:22,971 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:22,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:22,973 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:22,973 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:22,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:22,973 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:22,973 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:23,048 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:23,049 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:23,049 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:23,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:23,049 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:23,049 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:23,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2826 [2022-12-06 07:34:23,049 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-06 07:34:23,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:23,049 INFO L85 PathProgramCache]: Analyzing trace with hash 710534202, now seen corresponding path program 1 times [2022-12-06 07:34:23,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:23,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014061464] [2022-12-06 07:34:23,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:23,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:23,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-06 07:34:23,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:23,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014061464] [2022-12-06 07:34:23,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014061464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:23,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:23,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:23,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552915398] [2022-12-06 07:34:23,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:23,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:23,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:23,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:23,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:23,119 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:23,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:23,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:23,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:23,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:23,164 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:23,164 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:23,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:23,165 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:23,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:23,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:23,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:23,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:23,165 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:23,165 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:23,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:23,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:23,166 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:23,166 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:23,166 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:23,166 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:23,166 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:23,167 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:23,167 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:23,167 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:23,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:23,169 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:23,169 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:23,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:23,170 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:23,170 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:23,246 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:23,247 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:34:23,247 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:23,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:23,247 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:23,247 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:23,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2827 [2022-12-06 07:34:23,247 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-06 07:34:23,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:23,247 INFO L85 PathProgramCache]: Analyzing trace with hash 737316311, now seen corresponding path program 1 times [2022-12-06 07:34:23,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:23,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865413429] [2022-12-06 07:34:23,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:23,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:23,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-06 07:34:23,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:23,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865413429] [2022-12-06 07:34:23,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865413429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:23,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:23,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:23,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293075880] [2022-12-06 07:34:23,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:23,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:23,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:23,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:23,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:23,319 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:23,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:23,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:23,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:23,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:23,355 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:23,355 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:23,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:23,356 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:23,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:23,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:23,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:23,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:23,356 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:23,356 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:23,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:23,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:23,357 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:23,357 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:23,357 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:23,357 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:23,357 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:23,358 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:23,358 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:23,358 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:23,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:23,360 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:23,360 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:23,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:23,360 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:23,360 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:23,436 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:23,437 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:34:23,437 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:23,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:23,437 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:23,437 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:23,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2828 [2022-12-06 07:34:23,437 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-06 07:34:23,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:23,437 INFO L85 PathProgramCache]: Analyzing trace with hash 767792504, now seen corresponding path program 1 times [2022-12-06 07:34:23,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:23,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841790413] [2022-12-06 07:34:23,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:23,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:23,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-06 07:34:23,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:23,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841790413] [2022-12-06 07:34:23,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841790413] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:23,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:23,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:23,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531828940] [2022-12-06 07:34:23,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:23,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:23,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:23,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:23,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:23,507 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:23,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:23,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:23,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:23,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:23,555 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:23,555 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:23,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:23,556 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:23,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:23,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:23,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:23,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:23,556 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:23,556 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:23,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:23,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:23,557 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:23,557 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:23,557 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:23,557 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:23,557 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:23,557 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:23,557 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:23,557 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:23,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:23,559 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:23,560 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:23,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:23,560 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:23,560 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:23,634 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:23,635 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:23,635 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:23,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:23,635 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:23,635 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:23,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2829 [2022-12-06 07:34:23,635 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-06 07:34:23,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:23,635 INFO L85 PathProgramCache]: Analyzing trace with hash 794574613, now seen corresponding path program 1 times [2022-12-06 07:34:23,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:23,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468602648] [2022-12-06 07:34:23,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:23,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:23,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-06 07:34:23,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:23,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468602648] [2022-12-06 07:34:23,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468602648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:23,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:23,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:23,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425837619] [2022-12-06 07:34:23,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:23,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:23,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:23,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:23,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:23,703 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:23,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:23,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:23,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:23,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:23,740 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:23,740 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:23,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:23,740 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:23,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:23,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:23,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:23,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:23,741 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:23,741 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:23,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:23,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:23,741 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:23,742 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:23,742 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:23,742 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:23,742 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:23,742 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:23,742 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:23,742 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:23,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:23,744 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:23,744 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:23,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:23,745 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:23,745 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:23,819 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:23,820 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:23,820 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:23,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:23,820 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:23,820 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:23,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2830 [2022-12-06 07:34:23,821 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-06 07:34:23,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:23,821 INFO L85 PathProgramCache]: Analyzing trace with hash 825050806, now seen corresponding path program 1 times [2022-12-06 07:34:23,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:23,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838557660] [2022-12-06 07:34:23,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:23,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:23,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-06 07:34:23,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:23,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838557660] [2022-12-06 07:34:23,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838557660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:23,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:23,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:23,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561582062] [2022-12-06 07:34:23,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:23,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:23,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:23,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:23,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:23,888 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:23,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:23,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:23,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:23,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:23,925 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:23,925 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:23,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:23,925 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:23,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:23,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:23,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:23,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:23,926 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:23,926 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:23,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:23,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:23,927 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:23,927 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:23,927 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:23,927 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:23,927 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:23,927 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:23,927 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:23,927 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:23,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:23,929 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:23,929 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:23,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:23,930 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:23,930 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:24,004 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:24,006 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:24,006 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:24,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:24,006 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:24,006 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:24,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2831 [2022-12-06 07:34:24,006 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-06 07:34:24,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:24,006 INFO L85 PathProgramCache]: Analyzing trace with hash 851832915, now seen corresponding path program 1 times [2022-12-06 07:34:24,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:24,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510712835] [2022-12-06 07:34:24,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:24,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:24,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-06 07:34:24,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:24,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510712835] [2022-12-06 07:34:24,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510712835] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:24,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:24,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:24,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542193417] [2022-12-06 07:34:24,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:24,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:24,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:24,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:24,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:24,075 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:24,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:24,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:24,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:24,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:24,117 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:24,117 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:24,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:24,117 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:24,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:24,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:24,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:24,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:24,118 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:24,118 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:24,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:24,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:24,118 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:24,119 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:24,119 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:24,119 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:24,119 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:24,119 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:24,119 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:24,119 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:24,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:24,121 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:24,121 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:24,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:24,121 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:24,121 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:24,196 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:24,197 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:24,197 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:24,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:24,197 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:24,197 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:24,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2832 [2022-12-06 07:34:24,198 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-06 07:34:24,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:24,198 INFO L85 PathProgramCache]: Analyzing trace with hash 882309108, now seen corresponding path program 1 times [2022-12-06 07:34:24,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:24,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228671775] [2022-12-06 07:34:24,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:24,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:24,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-06 07:34:24,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:24,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228671775] [2022-12-06 07:34:24,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228671775] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:24,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:24,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:24,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124326857] [2022-12-06 07:34:24,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:24,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:24,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:24,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:24,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:24,267 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:24,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:24,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:24,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:24,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:24,305 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:24,305 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:24,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:24,305 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:24,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:24,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:24,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:24,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:24,306 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:24,306 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:24,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:24,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:24,307 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:24,307 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:24,307 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:24,307 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:24,307 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:24,307 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:24,307 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:24,307 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:24,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:24,309 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:24,309 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:24,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:24,310 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:24,310 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:24,384 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:24,385 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:24,385 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:24,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:24,385 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:24,385 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:24,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2833 [2022-12-06 07:34:24,386 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-06 07:34:24,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:24,386 INFO L85 PathProgramCache]: Analyzing trace with hash 909091217, now seen corresponding path program 1 times [2022-12-06 07:34:24,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:24,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591487794] [2022-12-06 07:34:24,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:24,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:24,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-06 07:34:24,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:24,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591487794] [2022-12-06 07:34:24,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591487794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:24,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:24,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:24,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221011295] [2022-12-06 07:34:24,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:24,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:24,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:24,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:24,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:24,457 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:24,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:24,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:24,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:24,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:24,498 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:24,498 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:24,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:24,499 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:24,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:24,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:24,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:24,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:24,499 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:24,500 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:24,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:24,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:24,500 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:24,500 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:24,500 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:24,500 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:24,501 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:24,501 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:24,501 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:24,501 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:24,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:24,503 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:24,503 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:24,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:24,503 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:24,503 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:24,579 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:24,581 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:34:24,581 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:24,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:24,581 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:24,581 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:24,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2834 [2022-12-06 07:34:24,581 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-06 07:34:24,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:24,581 INFO L85 PathProgramCache]: Analyzing trace with hash 939567410, now seen corresponding path program 1 times [2022-12-06 07:34:24,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:24,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831544397] [2022-12-06 07:34:24,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:24,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:24,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-06 07:34:24,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:24,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831544397] [2022-12-06 07:34:24,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831544397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:24,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:24,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:24,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864724574] [2022-12-06 07:34:24,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:24,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:24,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:24,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:24,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:24,658 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:24,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:24,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:24,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:24,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:24,694 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:24,694 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:24,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:24,694 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:24,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:24,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:24,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:24,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:24,695 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:24,695 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:24,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:24,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:24,696 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:24,696 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:24,696 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:24,696 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:24,696 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:24,696 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:24,696 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:24,696 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:24,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:24,698 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:24,698 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:24,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:24,699 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:24,699 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:24,773 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:24,774 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:24,774 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:24,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:24,774 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:24,774 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:24,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2835 [2022-12-06 07:34:24,775 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-06 07:34:24,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:24,775 INFO L85 PathProgramCache]: Analyzing trace with hash 966349519, now seen corresponding path program 1 times [2022-12-06 07:34:24,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:24,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591274529] [2022-12-06 07:34:24,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:24,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:24,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-06 07:34:24,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:24,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591274529] [2022-12-06 07:34:24,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591274529] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:24,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:24,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:24,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276699480] [2022-12-06 07:34:24,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:24,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:24,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:24,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:24,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:24,844 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:24,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:24,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:24,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:24,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:24,879 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:24,880 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:24,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:24,880 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:24,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:24,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:24,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:24,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:24,881 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:24,881 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:24,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:24,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:24,881 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:24,881 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:24,881 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:24,882 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:24,882 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:24,882 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:24,882 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:24,882 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:24,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:24,884 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:24,884 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:24,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:24,884 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:24,884 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:24,958 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:24,959 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:24,959 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:24,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:24,959 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:24,959 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:24,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2836 [2022-12-06 07:34:24,959 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-06 07:34:24,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:24,959 INFO L85 PathProgramCache]: Analyzing trace with hash 996825712, now seen corresponding path program 1 times [2022-12-06 07:34:24,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:24,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071606490] [2022-12-06 07:34:24,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:24,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:25,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-06 07:34:25,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:25,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071606490] [2022-12-06 07:34:25,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071606490] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:25,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:25,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:25,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282782192] [2022-12-06 07:34:25,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:25,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:25,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:25,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:25,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:25,028 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:25,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:25,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:25,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:25,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:25,069 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:25,069 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:25,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:25,069 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:25,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:25,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:25,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:25,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:25,070 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:25,070 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:25,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:25,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:25,070 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:25,070 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:25,071 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:25,071 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:25,071 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:25,071 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:25,071 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:25,071 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:25,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:25,073 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:25,073 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:25,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:25,073 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:25,073 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:25,148 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:25,149 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:25,149 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:25,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:25,149 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:25,149 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:25,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2837 [2022-12-06 07:34:25,149 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-06 07:34:25,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:25,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1023607821, now seen corresponding path program 1 times [2022-12-06 07:34:25,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:25,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240841220] [2022-12-06 07:34:25,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:25,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:25,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-06 07:34:25,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:25,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240841220] [2022-12-06 07:34:25,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240841220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:25,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:25,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:25,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045819208] [2022-12-06 07:34:25,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:25,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:25,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:25,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:25,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:25,219 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:25,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:25,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:25,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:25,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:25,260 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:25,260 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:25,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:25,260 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:25,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:25,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:25,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:25,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:25,261 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:25,261 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:25,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:25,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:25,262 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:25,262 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:25,262 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:25,262 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:25,262 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:25,262 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:25,262 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:25,262 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:25,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:25,264 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:25,265 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:25,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:25,265 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:25,265 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:25,339 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:25,340 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:25,340 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:25,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:25,340 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:25,340 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:25,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2838 [2022-12-06 07:34:25,340 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-06 07:34:25,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:25,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1054084014, now seen corresponding path program 1 times [2022-12-06 07:34:25,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:25,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225273241] [2022-12-06 07:34:25,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:25,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:25,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-06 07:34:25,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:25,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225273241] [2022-12-06 07:34:25,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225273241] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:25,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:25,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:25,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680392247] [2022-12-06 07:34:25,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:25,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:25,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:25,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:25,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:25,407 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:25,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:25,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:25,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:25,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:25,448 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:25,448 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:25,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:25,449 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:25,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:25,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:25,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:25,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:25,449 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:25,449 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:25,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:25,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:25,450 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:25,450 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:25,450 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:25,450 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:25,450 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:25,450 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:25,450 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:25,450 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:25,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:25,452 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:25,453 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:25,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:25,453 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:25,453 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:25,526 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:25,528 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:25,528 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:25,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:25,528 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:25,528 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:25,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2839 [2022-12-06 07:34:25,528 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-06 07:34:25,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:25,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1080866123, now seen corresponding path program 1 times [2022-12-06 07:34:25,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:25,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091326834] [2022-12-06 07:34:25,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:25,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:25,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-06 07:34:25,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:25,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091326834] [2022-12-06 07:34:25,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091326834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:25,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:25,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:25,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647344953] [2022-12-06 07:34:25,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:25,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:25,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:25,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:25,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:25,597 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:25,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:25,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:25,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:25,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:25,648 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:25,649 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:25,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:25,649 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:25,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:25,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:25,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:25,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:25,650 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:25,650 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:25,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:25,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:25,650 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:25,650 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:25,650 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:25,651 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:25,651 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:25,651 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:25,651 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:25,651 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:25,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:25,653 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:25,653 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:25,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:25,653 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:25,653 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:25,728 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:25,729 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:25,729 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:25,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:25,729 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:25,729 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:25,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2840 [2022-12-06 07:34:25,729 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-06 07:34:25,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:25,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1111342316, now seen corresponding path program 1 times [2022-12-06 07:34:25,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:25,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798112221] [2022-12-06 07:34:25,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:25,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:25,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:25,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-06 07:34:25,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:25,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798112221] [2022-12-06 07:34:25,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798112221] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:25,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:25,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:25,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072341971] [2022-12-06 07:34:25,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:25,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:25,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:25,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:25,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:25,795 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:25,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:25,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:25,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:25,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:25,831 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:25,831 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:25,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:25,832 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:25,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:25,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:25,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:25,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:25,832 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:25,832 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:25,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:25,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:25,833 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:25,833 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:25,833 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:25,833 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:25,833 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:25,834 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:25,834 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:25,834 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:25,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:25,836 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:25,836 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:25,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:25,836 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:25,836 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:25,911 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:25,912 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:25,912 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:25,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:25,913 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:25,913 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:25,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2841 [2022-12-06 07:34:25,913 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-06 07:34:25,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:25,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1138124425, now seen corresponding path program 1 times [2022-12-06 07:34:25,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:25,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472874756] [2022-12-06 07:34:25,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:25,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:25,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-06 07:34:25,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:25,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472874756] [2022-12-06 07:34:25,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472874756] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:25,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:25,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:25,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204809394] [2022-12-06 07:34:25,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:25,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:25,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:25,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:25,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:25,983 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:25,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:25,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:25,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:25,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:26,018 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:26,019 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:26,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:26,019 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:26,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:26,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:26,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:26,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:26,020 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:26,020 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:26,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:26,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:26,020 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:26,020 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:26,021 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:26,021 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:26,021 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:26,021 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:26,021 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:26,021 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:26,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:26,023 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:26,023 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:26,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:26,023 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:26,023 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:26,098 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:26,099 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:26,099 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:26,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:26,099 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:26,099 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:26,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2842 [2022-12-06 07:34:26,099 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-06 07:34:26,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:26,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1168600618, now seen corresponding path program 1 times [2022-12-06 07:34:26,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:26,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506716435] [2022-12-06 07:34:26,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:26,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34: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-06 07:34:26,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:26,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506716435] [2022-12-06 07:34:26,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506716435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:26,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:26,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:26,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959459787] [2022-12-06 07:34:26,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:26,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:26,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:26,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:26,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:26,167 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:26,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:26,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:26,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:26,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:26,210 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:26,211 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:26,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:26,211 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:26,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:26,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:26,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:26,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:26,212 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:26,212 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:26,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:26,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:26,212 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:26,212 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:26,213 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:26,213 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:26,213 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:26,213 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:26,213 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:26,213 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:26,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:26,215 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:26,215 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:26,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:26,216 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:26,216 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:26,290 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:26,292 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:26,292 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:26,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:26,292 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:26,292 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:26,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2843 [2022-12-06 07:34:26,292 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-06 07:34:26,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:26,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1195382727, now seen corresponding path program 1 times [2022-12-06 07:34:26,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:26,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703290971] [2022-12-06 07:34:26,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:26,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:26,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-06 07:34:26,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:26,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703290971] [2022-12-06 07:34:26,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703290971] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:26,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:26,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:26,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42324279] [2022-12-06 07:34:26,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:26,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:26,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:26,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:26,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:26,362 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:26,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:26,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:26,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:26,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:26,397 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:26,397 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:26,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:26,397 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:26,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:26,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:26,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:26,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:26,398 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:26,398 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:26,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:26,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:26,398 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:26,399 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:26,399 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:26,399 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:26,399 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:26,399 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:26,399 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:26,399 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:26,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:26,401 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:26,401 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:26,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:26,402 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:26,402 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:26,475 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:26,476 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:26,476 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:26,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:26,477 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:26,477 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:26,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2844 [2022-12-06 07:34:26,477 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-06 07:34:26,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:26,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1225858920, now seen corresponding path program 1 times [2022-12-06 07:34:26,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:26,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803491940] [2022-12-06 07:34:26,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:26,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:26,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-06 07:34:26,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:26,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803491940] [2022-12-06 07:34:26,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803491940] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:26,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:26,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:26,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930014253] [2022-12-06 07:34:26,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:26,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:26,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:26,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:26,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:26,544 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:26,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:26,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:26,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:26,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:26,586 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:26,586 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:26,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:26,586 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:26,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:26,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:26,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:26,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:26,587 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:26,587 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:26,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:26,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:26,588 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:26,588 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:26,588 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:26,588 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:26,588 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:26,588 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:26,588 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:26,588 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:26,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:26,590 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:26,591 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:26,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:26,591 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:26,591 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:26,665 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:26,666 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:26,667 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:26,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:26,667 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:26,667 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:26,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2845 [2022-12-06 07:34:26,667 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-06 07:34:26,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:26,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1252641029, now seen corresponding path program 1 times [2022-12-06 07:34:26,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:26,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902307191] [2022-12-06 07:34:26,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:26,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:26,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-06 07:34:26,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:26,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902307191] [2022-12-06 07:34:26,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902307191] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:26,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:26,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:26,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418166784] [2022-12-06 07:34:26,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:26,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:26,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:26,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:26,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:26,752 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:26,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:26,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:26,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:26,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:26,786 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:26,786 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:26,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:26,787 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:26,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:26,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:26,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:26,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:26,788 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:26,788 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:26,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:26,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:26,788 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:26,788 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:26,788 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:26,789 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:26,789 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:26,789 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:26,789 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:26,789 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:26,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:26,791 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:26,791 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:26,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:26,791 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:26,791 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:26,865 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:26,866 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:26,866 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:26,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:26,866 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:26,866 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:26,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2846 [2022-12-06 07:34:26,867 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-06 07:34:26,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:26,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1283117222, now seen corresponding path program 1 times [2022-12-06 07:34:26,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:26,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664222489] [2022-12-06 07:34:26,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:26,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:26,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-06 07:34:26,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:26,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664222489] [2022-12-06 07:34:26,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664222489] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:26,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:26,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:26,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110722920] [2022-12-06 07:34:26,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:26,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:26,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:26,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:26,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:26,933 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:26,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:26,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:26,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:26,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:26,974 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:26,974 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:26,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:26,975 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:26,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:26,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:26,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:26,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:26,975 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:26,975 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:26,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:26,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:26,976 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:26,976 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:26,976 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:26,976 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:26,976 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:26,977 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:26,977 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:26,977 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:26,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:26,979 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:26,979 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:26,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:26,979 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:26,979 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:27,052 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:27,053 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:27,054 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:27,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:27,054 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:27,054 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:27,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2847 [2022-12-06 07:34:27,054 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-06 07:34:27,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:27,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1309899331, now seen corresponding path program 1 times [2022-12-06 07:34:27,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:27,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141619935] [2022-12-06 07:34:27,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:27,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:27,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-06 07:34:27,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:27,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141619935] [2022-12-06 07:34:27,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141619935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:27,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:27,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:27,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952215505] [2022-12-06 07:34:27,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:27,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:27,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:27,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:27,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:27,129 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:27,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:27,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:27,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:27,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:27,165 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:27,166 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:27,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:27,166 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:27,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:27,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:27,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:27,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:27,167 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:27,167 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:27,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:27,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:27,167 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:27,167 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:27,168 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:27,168 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:27,168 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:27,168 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:27,168 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:27,168 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:27,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:27,170 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:27,170 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:27,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:27,170 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:27,170 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:27,244 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:27,245 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:27,245 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:27,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:27,245 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:27,245 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:27,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2848 [2022-12-06 07:34:27,246 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-06 07:34:27,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:27,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1340375524, now seen corresponding path program 1 times [2022-12-06 07:34:27,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:27,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588072443] [2022-12-06 07:34:27,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:27,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:27,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-06 07:34:27,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:27,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588072443] [2022-12-06 07:34:27,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588072443] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:27,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:27,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:27,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964322066] [2022-12-06 07:34:27,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:27,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:27,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:27,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:27,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:27,314 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:27,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:27,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:27,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:27,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:27,355 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:27,355 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:27,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:27,356 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:27,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:27,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:27,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:27,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:27,356 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:27,356 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:27,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:27,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:27,357 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:27,357 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:27,357 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:27,357 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:27,357 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:27,357 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:27,357 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:27,357 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:27,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:27,360 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:27,360 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:27,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:27,360 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:27,360 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:27,434 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:27,435 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:27,435 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:27,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:27,435 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:27,435 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:27,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2849 [2022-12-06 07:34:27,435 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-06 07:34:27,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:27,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1367157633, now seen corresponding path program 1 times [2022-12-06 07:34:27,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:27,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889735695] [2022-12-06 07:34:27,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:27,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:27,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-06 07:34:27,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:27,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889735695] [2022-12-06 07:34:27,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889735695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:27,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:27,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:27,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629363736] [2022-12-06 07:34:27,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:27,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:27,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:27,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:27,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:27,506 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:27,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:27,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:27,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:27,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:27,542 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:27,542 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:27,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:27,542 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:27,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:27,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:27,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:27,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:27,543 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:27,543 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:27,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:27,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:27,544 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:27,544 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:27,544 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:27,544 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:27,544 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:27,544 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:27,544 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:27,544 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:27,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:27,546 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:27,546 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:27,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:27,547 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:27,547 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:27,621 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:27,622 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:27,623 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:27,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:27,623 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:27,623 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:27,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2850 [2022-12-06 07:34:27,623 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-06 07:34:27,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:27,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1397633826, now seen corresponding path program 1 times [2022-12-06 07:34:27,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:27,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767479379] [2022-12-06 07:34:27,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:27,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:27,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-06 07:34:27,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:27,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767479379] [2022-12-06 07:34:27,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767479379] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:27,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:27,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:27,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72072762] [2022-12-06 07:34:27,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:27,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:27,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:27,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:27,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:27,690 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:27,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:27,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:27,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:27,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:27,742 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:27,742 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:27,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:27,742 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:27,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:27,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:27,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:27,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:27,743 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:27,743 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:27,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:27,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:27,744 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:27,744 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:27,744 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:27,744 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:27,744 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:27,744 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:27,744 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:27,744 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:27,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:27,746 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:27,746 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:27,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:27,747 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:27,747 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:27,819 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:27,820 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:34:27,820 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:27,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:27,821 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:27,821 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:27,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2851 [2022-12-06 07:34:27,821 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-06 07:34:27,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:27,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1424415935, now seen corresponding path program 1 times [2022-12-06 07:34:27,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:27,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994559090] [2022-12-06 07:34:27,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:27,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:27,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-06 07:34:27,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:27,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994559090] [2022-12-06 07:34:27,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994559090] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:27,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:27,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:27,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475859725] [2022-12-06 07:34:27,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:27,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:27,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:27,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:27,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:27,889 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:27,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:27,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:27,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:27,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:27,930 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:27,930 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:27,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:27,931 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:27,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:27,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:27,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:27,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:27,931 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:27,931 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:27,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:27,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:27,932 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:27,932 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:27,932 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:27,932 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:27,932 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:27,932 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:27,932 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:27,932 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:27,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:27,935 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:27,935 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:27,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:27,935 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:27,935 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:28,009 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:28,010 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:28,010 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:28,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:28,010 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:28,010 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:28,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2852 [2022-12-06 07:34:28,010 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-06 07:34:28,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:28,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1454892128, now seen corresponding path program 1 times [2022-12-06 07:34:28,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:28,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273519076] [2022-12-06 07:34:28,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:28,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:28,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-06 07:34:28,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:28,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273519076] [2022-12-06 07:34:28,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273519076] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:28,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:28,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:28,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425620463] [2022-12-06 07:34:28,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:28,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:28,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:28,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:28,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:28,078 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:28,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:28,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:28,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:28,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:28,114 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:28,114 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:28,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:28,115 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:28,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:28,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:28,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:28,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:28,115 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:28,115 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:28,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:28,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:28,116 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:28,116 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:28,116 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:28,116 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:28,116 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:28,116 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:28,117 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:28,117 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:28,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:28,119 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:28,119 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:28,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:28,119 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:28,119 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:28,193 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:28,194 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:28,194 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:28,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:28,195 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:28,195 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:28,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2853 [2022-12-06 07:34:28,195 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-06 07:34:28,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:28,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1481674237, now seen corresponding path program 1 times [2022-12-06 07:34:28,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:28,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701307972] [2022-12-06 07:34:28,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:28,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34: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-06 07:34:28,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:28,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701307972] [2022-12-06 07:34:28,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701307972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:28,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:28,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:28,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583984297] [2022-12-06 07:34:28,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:28,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:28,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:28,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:28,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:28,265 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:28,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:28,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:28,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:28,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:28,304 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:28,304 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:28,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:28,305 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:28,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:28,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:28,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:28,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:28,305 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:28,305 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:28,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:28,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:28,306 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:28,306 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:28,306 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:28,306 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:28,306 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:28,306 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:28,307 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:28,307 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:28,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:28,309 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:28,309 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:28,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:28,309 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:28,309 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:28,383 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:28,384 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:28,384 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:28,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:28,384 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:28,384 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:28,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2854 [2022-12-06 07:34:28,384 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-06 07:34:28,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:28,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1512150430, now seen corresponding path program 1 times [2022-12-06 07:34:28,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:28,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583572789] [2022-12-06 07:34:28,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:28,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:28,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-06 07:34:28,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:28,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583572789] [2022-12-06 07:34:28,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583572789] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:28,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:28,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:28,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645920416] [2022-12-06 07:34:28,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:28,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:28,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:28,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:28,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:28,450 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:28,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:28,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:28,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:28,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:28,492 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:28,492 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:28,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:28,493 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:28,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:28,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:28,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:28,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:28,493 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:28,493 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:28,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:28,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:28,494 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:28,494 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:28,494 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:28,494 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:28,494 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:28,494 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:28,494 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:28,495 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:28,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:28,497 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:28,497 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:28,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:28,497 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:28,497 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:28,570 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:28,571 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:28,571 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:28,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:28,571 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:28,572 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:28,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2855 [2022-12-06 07:34:28,572 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-06 07:34:28,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:28,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1538932539, now seen corresponding path program 1 times [2022-12-06 07:34:28,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:28,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930338902] [2022-12-06 07:34:28,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:28,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:28,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:28,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:28,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930338902] [2022-12-06 07:34:28,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930338902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:28,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:28,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:28,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430896339] [2022-12-06 07:34:28,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:28,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:28,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:28,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:28,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:28,642 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:28,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:28,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:28,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:28,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:28,677 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:28,677 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:28,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:28,678 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:28,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:28,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:28,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:28,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:28,678 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:28,678 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:28,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:28,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:28,679 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:28,679 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:28,679 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:28,679 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:28,679 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:28,680 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:28,680 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:28,680 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:28,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:28,682 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:28,682 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:28,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:28,682 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:28,682 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:28,757 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:28,758 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:28,758 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:28,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:28,758 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:28,758 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:28,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2856 [2022-12-06 07:34:28,758 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-06 07:34:28,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:28,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1569408732, now seen corresponding path program 1 times [2022-12-06 07:34:28,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:28,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449606894] [2022-12-06 07:34:28,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:28,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34: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-06 07:34:28,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:28,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449606894] [2022-12-06 07:34:28,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449606894] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:28,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:28,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:28,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521812404] [2022-12-06 07:34:28,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:28,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:28,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:28,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:28,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:28,837 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:28,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:28,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:28,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:28,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:28,873 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:28,873 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:28,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:28,874 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:28,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:28,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:28,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:28,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:28,874 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:28,874 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:28,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:28,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:28,875 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:28,875 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:28,875 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:28,875 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:28,875 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:28,875 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:28,875 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:28,876 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:28,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:28,878 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:28,878 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:28,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:28,878 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:28,878 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:28,951 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:28,952 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:28,953 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:28,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:28,953 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:28,953 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:28,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2857 [2022-12-06 07:34:28,953 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-06 07:34:28,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:28,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1596190841, now seen corresponding path program 1 times [2022-12-06 07:34:28,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:28,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597075649] [2022-12-06 07:34:28,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:28,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:29,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-06 07:34:29,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:29,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597075649] [2022-12-06 07:34:29,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597075649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:29,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:29,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:29,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088514979] [2022-12-06 07:34:29,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:29,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:29,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:29,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:29,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:29,024 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:29,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:29,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:29,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:29,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:29,065 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:29,065 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:29,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:29,065 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:29,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:29,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:29,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:29,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:29,066 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:29,066 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:29,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:29,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:29,067 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:29,067 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:29,067 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:29,067 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:29,067 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:29,067 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:29,067 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:29,067 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:29,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:29,069 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:29,069 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:29,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:29,070 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:29,070 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:29,144 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:29,145 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:29,145 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:29,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:29,146 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:29,146 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:29,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2858 [2022-12-06 07:34:29,146 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-06 07:34:29,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:29,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1626667034, now seen corresponding path program 1 times [2022-12-06 07:34:29,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:29,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433272740] [2022-12-06 07:34:29,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:29,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:29,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:29,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:29,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433272740] [2022-12-06 07:34:29,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433272740] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:29,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:29,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:29,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101159972] [2022-12-06 07:34:29,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:29,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:29,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:29,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:29,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:29,212 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:29,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:29,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:29,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:29,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:29,248 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:29,248 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:29,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:29,249 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:29,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:29,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:29,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:29,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:29,249 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:29,249 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:29,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:29,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:29,250 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:29,250 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:29,250 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:29,250 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:29,250 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:29,251 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:29,251 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:29,251 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:29,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:29,253 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:29,253 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:29,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:29,253 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:29,253 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:29,326 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:29,327 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:29,327 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:29,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:29,327 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:29,327 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:29,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2859 [2022-12-06 07:34:29,327 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-06 07:34:29,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:29,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1653449143, now seen corresponding path program 1 times [2022-12-06 07:34:29,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:29,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766960323] [2022-12-06 07:34:29,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:29,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:29,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-06 07:34:29,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:29,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766960323] [2022-12-06 07:34:29,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766960323] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:29,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:29,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:29,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394683536] [2022-12-06 07:34:29,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:29,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:29,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:29,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:29,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:29,396 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:29,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:29,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:29,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:29,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:29,431 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:29,431 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:29,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:29,432 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:29,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:29,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:29,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:29,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:29,432 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:29,432 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:29,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:29,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:29,433 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:29,433 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:29,433 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:29,433 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:29,433 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:29,433 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:29,433 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:29,434 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:29,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:29,436 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:29,436 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:29,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:29,436 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:29,436 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:29,510 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:29,511 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:29,511 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:29,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:29,511 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:29,511 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:29,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2860 [2022-12-06 07:34:29,511 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-06 07:34:29,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:29,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1683925336, now seen corresponding path program 1 times [2022-12-06 07:34:29,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:29,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320629181] [2022-12-06 07:34:29,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:29,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:29,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-06 07:34:29,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:29,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320629181] [2022-12-06 07:34:29,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320629181] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:29,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:29,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:29,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642513275] [2022-12-06 07:34:29,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:29,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:29,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:29,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:29,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:29,584 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:29,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:29,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:29,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:29,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:29,620 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:29,621 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:29,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:29,621 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:29,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:29,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:29,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:29,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:29,622 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:29,622 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:29,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:29,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:29,622 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:29,622 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:29,623 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:29,623 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:29,623 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:29,623 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:29,623 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:29,623 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:29,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:29,625 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:29,625 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:29,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:29,625 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:29,625 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:29,699 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:29,700 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:29,700 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:29,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:29,700 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:29,700 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:29,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2861 [2022-12-06 07:34:29,700 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-06 07:34:29,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:29,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1710707445, now seen corresponding path program 1 times [2022-12-06 07:34:29,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:29,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73363618] [2022-12-06 07:34:29,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:29,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:29,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-06 07:34:29,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:29,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73363618] [2022-12-06 07:34:29,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73363618] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:29,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:29,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:29,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642898586] [2022-12-06 07:34:29,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:29,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:29,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:29,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:29,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:29,783 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:29,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:29,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:29,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:29,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:29,819 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:29,820 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:29,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:29,820 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:29,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:29,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:29,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:29,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:29,821 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:29,821 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:29,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:29,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:29,821 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:29,821 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:29,821 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:29,822 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:29,822 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:29,822 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:29,822 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:29,822 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:29,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:29,824 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:29,824 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:29,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:29,824 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:29,824 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:29,898 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:29,900 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:29,900 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:29,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:29,900 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:29,900 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:29,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2862 [2022-12-06 07:34:29,900 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-06 07:34:29,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:29,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1741183638, now seen corresponding path program 1 times [2022-12-06 07:34:29,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:29,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297546455] [2022-12-06 07:34:29,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:29,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:29,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-06 07:34:29,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:29,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297546455] [2022-12-06 07:34:29,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297546455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:29,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:29,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:29,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065076740] [2022-12-06 07:34:29,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:29,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:29,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:29,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:29,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:29,967 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:29,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:29,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:29,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:29,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:30,011 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:30,011 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:30,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:30,012 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:30,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:30,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:30,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:30,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:30,012 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:30,012 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:30,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:30,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:30,013 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:30,013 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:30,013 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:30,013 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:30,013 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:30,013 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:30,013 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:30,014 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:30,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:30,016 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:30,016 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:30,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:30,016 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:30,016 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:30,090 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:30,091 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:30,091 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:30,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:30,092 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:30,092 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:30,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2863 [2022-12-06 07:34:30,092 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-06 07:34:30,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:30,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1767965747, now seen corresponding path program 1 times [2022-12-06 07:34:30,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:30,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597435188] [2022-12-06 07:34:30,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:30,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:30,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-06 07:34:30,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:30,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597435188] [2022-12-06 07:34:30,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597435188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:30,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:30,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:30,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918387090] [2022-12-06 07:34:30,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:30,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:30,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:30,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:30,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:30,162 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:30,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:30,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:30,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:30,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:30,203 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:30,203 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:30,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:30,204 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:30,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:30,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:30,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:30,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:30,204 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:30,204 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:30,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:30,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:30,205 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:30,205 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:30,205 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:30,205 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:30,205 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:30,206 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:30,206 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:30,206 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:30,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:30,208 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:30,208 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:30,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:30,208 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:30,208 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:30,280 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:30,281 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:34:30,281 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:30,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:30,281 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:30,281 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:30,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2864 [2022-12-06 07:34:30,281 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-06 07:34:30,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:30,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1798441940, now seen corresponding path program 1 times [2022-12-06 07:34:30,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:30,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663529327] [2022-12-06 07:34:30,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:30,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:30,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-06 07:34:30,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:30,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663529327] [2022-12-06 07:34:30,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663529327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:30,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:30,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:30,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666915263] [2022-12-06 07:34:30,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:30,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:30,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:30,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:30,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:30,349 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:30,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:30,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:30,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:30,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:30,385 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:30,385 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:30,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:30,386 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:30,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:30,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:30,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:30,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:30,386 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:30,386 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:30,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:30,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:30,387 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:30,387 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:30,387 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:30,387 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:30,387 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:30,387 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:30,387 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:30,387 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:30,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:30,389 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:30,390 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:30,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:30,390 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:30,390 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:30,463 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:30,464 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:30,464 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:30,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:30,464 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:30,465 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:30,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2865 [2022-12-06 07:34:30,465 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-06 07:34:30,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:30,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1825224049, now seen corresponding path program 1 times [2022-12-06 07:34:30,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:30,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256305784] [2022-12-06 07:34:30,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:30,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:30,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-06 07:34:30,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:30,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256305784] [2022-12-06 07:34:30,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256305784] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:30,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:30,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:30,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729446150] [2022-12-06 07:34:30,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:30,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:30,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:30,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:30,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:30,534 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:30,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:30,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:30,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:30,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:30,574 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:30,575 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:30,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:30,575 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:30,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:30,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:30,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:30,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:30,576 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:30,576 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:30,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:30,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:30,576 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:30,576 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:30,577 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:30,577 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:30,577 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:30,577 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:30,577 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:30,577 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:30,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:30,579 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:30,579 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:30,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:30,580 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:30,580 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:30,653 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:30,654 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:30,654 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:30,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:30,654 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:30,654 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:30,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2866 [2022-12-06 07:34:30,654 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-06 07:34:30,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:30,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1855700242, now seen corresponding path program 1 times [2022-12-06 07:34:30,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:30,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297017018] [2022-12-06 07:34:30,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:30,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:30,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-06 07:34:30,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:30,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297017018] [2022-12-06 07:34:30,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297017018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:30,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:30,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:30,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563098983] [2022-12-06 07:34:30,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:30,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:30,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:30,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:30,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:30,721 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:30,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:30,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:30,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:30,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:30,761 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:30,761 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:30,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:30,761 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:30,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:30,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:30,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:30,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:30,762 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:30,762 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:30,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:30,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:30,762 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:30,763 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:30,763 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:30,763 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:30,763 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:30,763 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:30,763 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:30,763 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:30,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:30,765 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:30,765 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:30,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:30,765 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:30,766 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:30,838 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:30,839 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:34:30,839 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:30,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:30,839 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:30,839 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:30,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2867 [2022-12-06 07:34:30,839 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-06 07:34:30,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:30,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1882482351, now seen corresponding path program 1 times [2022-12-06 07:34:30,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:30,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201903817] [2022-12-06 07:34:30,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:30,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:30,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-06 07:34:30,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:30,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201903817] [2022-12-06 07:34:30,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201903817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:30,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:30,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:30,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321424620] [2022-12-06 07:34:30,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:30,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:30,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:30,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:30,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:30,917 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:30,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:30,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:30,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:30,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:30,953 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:30,953 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:30,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:30,953 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:30,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:30,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:30,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:30,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:30,954 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:30,954 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:30,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:30,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:30,954 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:30,955 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:30,955 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:30,955 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:30,955 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:30,955 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:30,955 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:30,955 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:30,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:30,957 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:30,957 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:30,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:30,957 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:30,957 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:31,030 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:31,031 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:34:31,031 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:31,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:31,032 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:31,032 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:31,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2868 [2022-12-06 07:34:31,032 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-06 07:34:31,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:31,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1912958544, now seen corresponding path program 1 times [2022-12-06 07:34:31,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:31,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413254077] [2022-12-06 07:34:31,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:31,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:31,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-06 07:34:31,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:31,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413254077] [2022-12-06 07:34:31,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413254077] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:31,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:31,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:31,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915481738] [2022-12-06 07:34:31,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:31,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:31,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:31,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:31,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:31,099 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:31,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:31,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:31,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:31,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:31,139 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:31,139 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:31,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:31,139 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:31,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:31,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:31,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:31,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:31,140 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:31,140 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:31,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:31,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:31,141 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:31,141 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:31,141 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:31,141 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:31,141 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:31,141 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:31,141 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:31,141 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:31,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:31,143 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:31,143 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:31,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:31,144 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:31,144 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:31,216 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:31,217 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:34:31,217 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:31,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:31,217 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:31,217 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:31,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2869 [2022-12-06 07:34:31,217 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-06 07:34:31,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:31,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1939740653, now seen corresponding path program 1 times [2022-12-06 07:34:31,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:31,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984357896] [2022-12-06 07:34:31,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:31,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:31,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-06 07:34:31,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:31,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984357896] [2022-12-06 07:34:31,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984357896] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:31,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:31,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:31,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909764015] [2022-12-06 07:34:31,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:31,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:31,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:31,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:31,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:31,285 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:31,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:31,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:31,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:31,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:31,321 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:31,321 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:31,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 370 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:31,321 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:31,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:31,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:31,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:31,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:31,322 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:31,322 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:31,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:31,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:31,322 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:31,323 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:31,323 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:31,323 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:31,323 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:31,323 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:31,323 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:31,323 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:31,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:31,325 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:31,325 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:31,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:31,325 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:31,325 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:31,399 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:31,400 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:31,400 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:31,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:31,400 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:31,400 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:31,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2870 [2022-12-06 07:34:31,400 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-06 07:34:31,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:31,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1970216846, now seen corresponding path program 1 times [2022-12-06 07:34:31,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:31,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089584455] [2022-12-06 07:34:31,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:31,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:31,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-06 07:34:31,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:31,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089584455] [2022-12-06 07:34:31,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089584455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:31,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:31,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:31,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659485857] [2022-12-06 07:34:31,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:31,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:31,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:31,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:31,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:31,467 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:31,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:31,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:31,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:31,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:31,509 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:31,509 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:31,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:31,509 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:31,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:31,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:31,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:31,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:31,510 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:31,510 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:31,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:31,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:31,511 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:31,511 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:31,511 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:31,511 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:31,511 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:31,511 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:31,511 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:31,511 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:31,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:31,513 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:31,513 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:31,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:31,514 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:31,514 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:31,586 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:31,587 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:34:31,587 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:31,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:31,587 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:31,587 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:31,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2871 [2022-12-06 07:34:31,587 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-06 07:34:31,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:31,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1996998955, now seen corresponding path program 1 times [2022-12-06 07:34:31,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:31,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460063215] [2022-12-06 07:34:31,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:31,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:31,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-06 07:34:31,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:31,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460063215] [2022-12-06 07:34:31,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460063215] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:31,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:31,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:31,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487669782] [2022-12-06 07:34:31,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:31,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:31,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:31,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:31,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:31,657 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:31,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:31,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:31,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:31,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:31,692 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:31,692 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:31,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:31,693 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:31,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:31,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:31,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:31,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:31,693 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:31,693 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:31,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:31,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:31,694 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:31,694 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:31,694 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:31,694 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:31,694 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:31,694 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:31,694 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:31,694 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:31,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:31,696 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:31,696 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:31,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:31,697 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:31,697 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:31,770 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:31,771 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:31,772 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:31,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:31,772 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:31,772 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:31,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2872 [2022-12-06 07:34:31,772 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-06 07:34:31,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:31,772 INFO L85 PathProgramCache]: Analyzing trace with hash 2027475148, now seen corresponding path program 1 times [2022-12-06 07:34:31,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:31,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622480515] [2022-12-06 07:34:31,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:31,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:31,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-06 07:34:31,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:31,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622480515] [2022-12-06 07:34:31,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622480515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:31,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:31,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:31,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540067750] [2022-12-06 07:34:31,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:31,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:31,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:31,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:31,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:31,854 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:31,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:31,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:31,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:31,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:31,891 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:31,891 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:31,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:31,892 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:31,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:31,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:31,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:31,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:31,892 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:31,892 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:31,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:31,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:31,893 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:31,893 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:31,893 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:31,893 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:31,893 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:31,893 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:31,893 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:31,893 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:31,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:31,896 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:31,896 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:31,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:31,896 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:31,896 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:31,970 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:31,971 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:31,971 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:31,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:31,971 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:31,972 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:31,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2873 [2022-12-06 07:34:31,972 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-06 07:34:31,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:31,972 INFO L85 PathProgramCache]: Analyzing trace with hash 2054257257, now seen corresponding path program 1 times [2022-12-06 07:34:31,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:31,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024772987] [2022-12-06 07:34:31,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:31,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:32,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-06 07:34:32,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:32,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024772987] [2022-12-06 07:34:32,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024772987] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:32,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:32,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:32,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076267124] [2022-12-06 07:34:32,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:32,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:32,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:32,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:32,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:32,041 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:32,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:32,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:32,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:32,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:32,076 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:32,076 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:32,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:32,077 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:32,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:32,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:32,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:32,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:32,077 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:32,078 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:32,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:32,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:32,078 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:32,078 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:32,078 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:32,078 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:32,079 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:32,079 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:32,079 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:32,079 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:32,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:32,081 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:32,081 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:32,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:32,081 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:32,081 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:32,155 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:32,156 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:32,156 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:32,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:32,156 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:32,156 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:32,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2874 [2022-12-06 07:34:32,156 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-06 07:34:32,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:32,156 INFO L85 PathProgramCache]: Analyzing trace with hash 2084733450, now seen corresponding path program 1 times [2022-12-06 07:34:32,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:32,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684605098] [2022-12-06 07:34:32,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:32,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:32,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-06 07:34:32,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:32,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684605098] [2022-12-06 07:34:32,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684605098] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:32,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:32,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:32,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420514940] [2022-12-06 07:34:32,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:32,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:32,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:32,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:32,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:32,226 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:32,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:32,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:32,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:32,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:32,263 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:32,263 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:32,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:32,263 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:32,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:32,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:32,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:32,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:32,264 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:32,264 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:32,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:32,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:32,265 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:32,265 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:32,265 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:32,265 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:32,265 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:32,265 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:32,265 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:32,265 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:32,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:32,267 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:32,267 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:32,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:32,268 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:32,268 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:32,341 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:32,342 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:32,342 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:32,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:32,342 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:32,343 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:32,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2875 [2022-12-06 07:34:32,343 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-06 07:34:32,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:32,343 INFO L85 PathProgramCache]: Analyzing trace with hash 2111515559, now seen corresponding path program 1 times [2022-12-06 07:34:32,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:32,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576417816] [2022-12-06 07:34:32,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:32,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:32,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-06 07:34:32,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:32,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576417816] [2022-12-06 07:34:32,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576417816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:32,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:32,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:32,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521647144] [2022-12-06 07:34:32,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:32,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:32,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:32,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:32,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:32,412 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:32,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:32,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:32,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:32,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:32,452 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:32,452 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:32,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:32,452 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:32,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:32,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:32,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:32,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:32,453 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:32,453 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:32,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:32,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:32,454 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:32,454 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:32,454 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:32,454 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:32,454 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:32,454 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:32,454 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:32,454 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:32,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:32,456 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:32,456 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:32,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:32,457 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:32,457 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:32,531 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:32,533 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:32,533 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:32,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:32,533 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:32,533 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:32,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2876 [2022-12-06 07:34:32,533 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-06 07:34:32,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:32,533 INFO L85 PathProgramCache]: Analyzing trace with hash 2141991752, now seen corresponding path program 1 times [2022-12-06 07:34:32,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:32,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353535909] [2022-12-06 07:34:32,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:32,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:32,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34: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-06 07:34:32,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:32,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353535909] [2022-12-06 07:34:32,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353535909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:32,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:32,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:32,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909625797] [2022-12-06 07:34:32,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:32,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:32,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:32,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:32,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:32,601 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:32,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:32,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:32,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:32,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:32,639 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:32,639 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:32,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:32,639 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:32,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:32,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:32,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:32,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:32,640 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:32,640 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:32,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:32,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:32,641 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:32,641 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:32,641 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:32,641 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:32,641 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:32,641 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:32,641 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:32,641 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:32,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:32,643 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:32,644 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:32,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:32,644 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:32,644 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:32,718 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:32,719 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:32,719 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:32,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:32,719 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:32,719 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:32,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2877 [2022-12-06 07:34:32,719 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-06 07:34:32,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:32,719 INFO L85 PathProgramCache]: Analyzing trace with hash -2126193435, now seen corresponding path program 1 times [2022-12-06 07:34:32,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:32,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702044589] [2022-12-06 07:34:32,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:32,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:32,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-06 07:34:32,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:32,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702044589] [2022-12-06 07:34:32,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702044589] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:32,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:32,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:32,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715954884] [2022-12-06 07:34:32,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:32,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:32,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:32,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:32,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:32,792 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:32,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:32,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:32,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:32,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:32,828 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:32,828 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:32,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:32,829 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:32,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:32,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:32,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:32,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:32,829 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:32,829 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:32,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:32,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:32,830 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:32,830 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:32,830 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:32,830 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:32,830 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:32,830 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:32,831 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:32,831 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:32,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:32,833 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:32,833 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:32,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:32,833 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:32,833 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:32,908 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:32,909 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:32,910 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:32,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:32,910 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:32,910 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:32,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2878 [2022-12-06 07:34:32,910 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-06 07:34:32,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:32,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2095717242, now seen corresponding path program 1 times [2022-12-06 07:34:32,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:32,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955742295] [2022-12-06 07:34:32,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:32,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:32,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-06 07:34:32,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:32,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955742295] [2022-12-06 07:34:32,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955742295] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:32,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:32,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:32,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945773712] [2022-12-06 07:34:32,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:32,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:32,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:32,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:32,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:32,986 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:32,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:32,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:32,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:32,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:33,024 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:33,024 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:33,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:33,025 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:33,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:33,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:33,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:33,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:33,025 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:33,025 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:33,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:33,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:33,026 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:33,026 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:33,026 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:33,026 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:33,026 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:33,027 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:33,027 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:33,027 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:33,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:33,029 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:33,029 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:33,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:33,029 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:33,029 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:33,104 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:33,105 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:33,105 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:33,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:33,105 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:33,105 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:33,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2879 [2022-12-06 07:34:33,105 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-06 07:34:33,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:33,105 INFO L85 PathProgramCache]: Analyzing trace with hash -2068935133, now seen corresponding path program 1 times [2022-12-06 07:34:33,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:33,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969636693] [2022-12-06 07:34:33,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:33,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:33,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-06 07:34:33,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:33,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969636693] [2022-12-06 07:34:33,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969636693] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:33,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:33,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:33,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293794410] [2022-12-06 07:34:33,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:33,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:33,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:33,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:33,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:33,176 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:33,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:33,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:33,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:33,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:33,216 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:33,216 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:33,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:33,216 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:33,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:33,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:33,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:33,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:33,217 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:33,217 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:33,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:33,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:33,218 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:33,218 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:33,218 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:33,218 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:33,218 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:33,218 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:33,218 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:33,218 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:33,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:33,220 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:33,220 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:33,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:33,221 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:33,221 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:33,296 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:33,297 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:33,297 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:33,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:33,297 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:33,297 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:33,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2880 [2022-12-06 07:34:33,297 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-06 07:34:33,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:33,297 INFO L85 PathProgramCache]: Analyzing trace with hash -2038458940, now seen corresponding path program 1 times [2022-12-06 07:34:33,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:33,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726278854] [2022-12-06 07:34:33,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:33,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:33,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-06 07:34:33,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:33,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726278854] [2022-12-06 07:34:33,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726278854] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:33,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:33,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:33,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377479888] [2022-12-06 07:34:33,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:33,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:33,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:33,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:33,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:33,366 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:33,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:33,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:33,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:33,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:33,405 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:33,405 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:33,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:33,406 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:33,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:33,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:33,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:33,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:33,407 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:33,407 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:33,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:33,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:33,408 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:33,408 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:33,408 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:33,408 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:33,408 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:33,408 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:33,408 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:33,408 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:33,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:33,411 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:33,411 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:33,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:33,411 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:33,411 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:33,485 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:33,486 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:33,486 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:33,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:33,486 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:33,486 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:33,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2881 [2022-12-06 07:34:33,486 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-06 07:34:33,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:33,486 INFO L85 PathProgramCache]: Analyzing trace with hash -2011676831, now seen corresponding path program 1 times [2022-12-06 07:34:33,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:33,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272913917] [2022-12-06 07:34:33,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:33,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:33,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-06 07:34:33,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:33,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272913917] [2022-12-06 07:34:33,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272913917] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:33,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:33,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:33,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100567802] [2022-12-06 07:34:33,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:33,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:33,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:33,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:33,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:33,558 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:33,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:33,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:33,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:33,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:33,593 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:33,593 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:33,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:33,594 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:33,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:33,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:33,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:33,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:33,594 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:33,595 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:33,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:33,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:33,595 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:33,595 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:33,595 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:33,595 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:33,596 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:33,596 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:33,596 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:33,596 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:33,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:33,598 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:33,598 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:33,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:33,598 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:33,598 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:33,672 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:33,673 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:33,673 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:33,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:33,673 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:33,673 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:33,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2882 [2022-12-06 07:34:33,673 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-06 07:34:33,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:33,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1981200638, now seen corresponding path program 1 times [2022-12-06 07:34:33,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:33,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570515119] [2022-12-06 07:34:33,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:33,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:33,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:33,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-06 07:34:33,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:33,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570515119] [2022-12-06 07:34:33,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570515119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:33,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:33,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:33,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833996859] [2022-12-06 07:34:33,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:33,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:33,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:33,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:33,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:33,742 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:33,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:33,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:33,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:33,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:33,779 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:33,779 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:33,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 349 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:33,779 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:33,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:33,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:33,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:33,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:33,780 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:33,780 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:33,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:33,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:33,781 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:33,781 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:33,781 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:33,781 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:33,781 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:33,781 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:33,781 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:33,781 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:33,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:33,783 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:33,783 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:33,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:33,784 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:33,784 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:33,856 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:33,858 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:33,858 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:33,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:33,858 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:33,858 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:33,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2883 [2022-12-06 07:34:33,858 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-06 07:34:33,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:33,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1954418529, now seen corresponding path program 1 times [2022-12-06 07:34:33,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:33,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052699468] [2022-12-06 07:34:33,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:33,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:33,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-06 07:34:33,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:33,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052699468] [2022-12-06 07:34:33,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052699468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:33,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:33,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:33,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765771094] [2022-12-06 07:34:33,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:33,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:33,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:33,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:33,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:33,941 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:33,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:33,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:33,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:33,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:33,976 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:33,977 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:33,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:33,977 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:33,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:33,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:33,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:33,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:33,977 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:33,977 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:33,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:33,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:33,978 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:33,978 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:33,978 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:33,978 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:33,978 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:33,979 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:33,979 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:33,979 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:33,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:33,981 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:33,981 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:33,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:33,981 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:33,981 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:34,052 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:34,053 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:34:34,053 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:34,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:34,053 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:34,054 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:34,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2884 [2022-12-06 07:34:34,054 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-06 07:34:34,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:34,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1923942336, now seen corresponding path program 1 times [2022-12-06 07:34:34,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:34,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823139104] [2022-12-06 07:34:34,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:34,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:34,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-06 07:34:34,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:34,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823139104] [2022-12-06 07:34:34,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823139104] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:34,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:34,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:34,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795025802] [2022-12-06 07:34:34,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:34,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:34,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:34,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:34,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:34,118 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:34,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:34,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:34,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:34,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:34,159 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:34,159 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:34,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:34,160 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:34,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:34,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:34,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:34,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:34,160 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:34,160 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:34,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:34,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:34,161 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:34,161 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:34,161 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:34,161 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:34,161 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:34,161 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:34,161 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:34,161 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:34,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:34,163 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:34,164 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:34,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:34,164 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:34,164 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:34,238 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:34,239 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:34,239 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:34,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:34,239 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:34,239 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:34,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2885 [2022-12-06 07:34:34,239 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-06 07:34:34,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:34,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1897160227, now seen corresponding path program 1 times [2022-12-06 07:34:34,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:34,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73696786] [2022-12-06 07:34:34,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:34,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:34,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-06 07:34:34,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:34,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73696786] [2022-12-06 07:34:34,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73696786] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:34,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:34,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:34,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251883474] [2022-12-06 07:34:34,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:34,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:34,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:34,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:34,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:34,308 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:34,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:34,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:34,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:34,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:34,343 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:34,343 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:34,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:34,344 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:34,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:34,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:34,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:34,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:34,344 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:34,344 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:34,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:34,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:34,345 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:34,345 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:34,345 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:34,345 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:34,345 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:34,345 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:34,345 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:34,346 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:34,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:34,348 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:34,348 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:34,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:34,348 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:34,348 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:34,421 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:34,422 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:34,422 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:34,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:34,422 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:34,422 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:34,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2886 [2022-12-06 07:34:34,422 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-06 07:34:34,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:34,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1866684034, now seen corresponding path program 1 times [2022-12-06 07:34:34,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:34,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433937052] [2022-12-06 07:34:34,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:34,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:34,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-06 07:34:34,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:34,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433937052] [2022-12-06 07:34:34,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433937052] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:34,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:34,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:34,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353251960] [2022-12-06 07:34:34,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:34,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:34,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:34,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:34,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:34,487 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:34,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:34,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:34,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:34,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:34,529 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:34,529 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:34,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:34,529 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:34,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:34,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:34,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:34,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:34,530 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:34,530 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:34,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:34,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:34,530 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:34,530 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:34,531 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:34,531 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:34,531 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:34,531 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:34,531 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:34,531 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:34,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:34,533 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:34,533 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:34,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:34,533 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:34,533 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:34,607 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:34,608 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:34,608 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:34,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:34,608 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:34,608 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:34,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2887 [2022-12-06 07:34:34,608 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-06 07:34:34,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:34,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1839901925, now seen corresponding path program 1 times [2022-12-06 07:34:34,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:34,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072727674] [2022-12-06 07:34:34,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:34,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:34,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-06 07:34:34,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:34,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072727674] [2022-12-06 07:34:34,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072727674] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:34,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:34,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:34,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571643121] [2022-12-06 07:34:34,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:34,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:34,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:34,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:34,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:34,678 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:34,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:34,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:34,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:34,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:34,718 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:34,718 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:34,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:34,719 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:34,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:34,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:34,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:34,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:34,719 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:34,719 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:34,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:34,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:34,720 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:34,720 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:34,720 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:34,720 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:34,720 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:34,720 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:34,720 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:34,721 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:34,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:34,723 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:34,723 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:34,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:34,723 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:34,723 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:34,796 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:34,797 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:34,798 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:34,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:34,798 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:34,798 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:34,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2888 [2022-12-06 07:34:34,798 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-06 07:34:34,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:34,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1809425732, now seen corresponding path program 1 times [2022-12-06 07:34:34,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:34,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679756546] [2022-12-06 07:34:34,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:34,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:34,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-06 07:34:34,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:34,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679756546] [2022-12-06 07:34:34,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679756546] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:34,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:34,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:34,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245954301] [2022-12-06 07:34:34,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:34,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:34,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:34,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:34,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:34,869 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:34,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:34,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:34,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:34,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:34,905 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:34,905 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:34,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:34,905 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:34,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:34,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:34,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:34,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:34,906 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:34,906 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:34,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:34,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:34,906 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:34,906 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:34,907 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:34,907 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:34,907 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:34,907 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:34,907 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:34,907 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:34,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:34,909 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:34,909 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:34,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:34,910 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:34,910 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:34,983 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:34,984 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:34,985 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:34,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:34,985 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:34,985 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:34,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2889 [2022-12-06 07:34:34,985 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-06 07:34:34,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:34,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1782643623, now seen corresponding path program 1 times [2022-12-06 07:34:34,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:34,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769670938] [2022-12-06 07:34:34,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:34,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:35,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-06 07:34:35,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:35,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769670938] [2022-12-06 07:34:35,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769670938] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:35,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:35,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:35,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431700105] [2022-12-06 07:34:35,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:35,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:35,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:35,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:35,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:35,061 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:35,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:35,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:35,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:35,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:35,102 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:35,102 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:35,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:35,102 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:35,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:35,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:35,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:35,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:35,103 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:35,103 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:35,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:35,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:35,104 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:35,104 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:35,104 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:35,104 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:35,104 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:35,104 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:35,104 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:35,104 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:35,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:35,106 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:35,106 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:35,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:35,107 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:35,107 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:35,180 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:35,181 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:35,182 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:35,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:35,182 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:35,182 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:35,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2890 [2022-12-06 07:34:35,182 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-06 07:34:35,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:35,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1752167430, now seen corresponding path program 1 times [2022-12-06 07:34:35,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:35,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128778295] [2022-12-06 07:34:35,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:35,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:35,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-06 07:34:35,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:35,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128778295] [2022-12-06 07:34:35,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128778295] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:35,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:35,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:35,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296316181] [2022-12-06 07:34:35,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:35,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:35,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:35,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:35,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:35,250 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:35,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:35,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:35,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:35,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:35,291 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:35,291 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:35,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:35,291 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:35,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:35,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:35,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:35,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:35,292 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:35,292 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:35,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:35,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:35,293 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:35,293 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:35,293 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:35,293 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:35,293 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:35,293 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:35,293 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:35,293 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:35,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:35,295 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:35,296 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:35,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 118 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:35,296 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:35,296 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:35,369 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:35,371 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:35,371 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:35,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:35,371 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:35,371 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:35,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2891 [2022-12-06 07:34:35,371 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-06 07:34:35,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:35,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1725385321, now seen corresponding path program 1 times [2022-12-06 07:34:35,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:35,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381934663] [2022-12-06 07:34:35,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:35,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:35,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-06 07:34:35,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:35,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381934663] [2022-12-06 07:34:35,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381934663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:35,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:35,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:35,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630077945] [2022-12-06 07:34:35,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:35,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:35,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:35,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:35,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:35,441 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:35,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:35,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:35,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:35,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:35,477 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:35,477 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:35,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:35,478 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:35,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:35,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:35,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:35,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:35,478 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:35,478 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:35,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:35,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:35,479 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:35,479 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:35,479 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:35,479 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:35,479 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:35,479 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:35,480 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:35,480 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:35,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:35,482 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:35,482 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:35,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:35,482 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:35,482 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:35,556 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:35,557 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:35,557 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:35,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:35,557 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:35,557 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:35,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2892 [2022-12-06 07:34:35,557 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-06 07:34:35,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:35,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1694909128, now seen corresponding path program 1 times [2022-12-06 07:34:35,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:35,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173190773] [2022-12-06 07:34:35,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:35,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:35,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-06 07:34:35,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:35,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173190773] [2022-12-06 07:34:35,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173190773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:35,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:35,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:35,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850764209] [2022-12-06 07:34:35,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:35,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:35,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:35,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:35,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:35,624 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:35,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:35,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:35,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:35,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:35,660 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:35,660 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:35,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:35,661 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:35,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:35,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:35,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:35,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:35,661 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:35,661 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:35,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:35,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:35,662 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:35,662 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:35,662 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:35,662 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:35,662 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:35,662 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:35,663 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:35,663 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:35,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:35,665 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:35,665 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:35,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:35,665 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:35,665 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:35,737 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:35,738 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:34:35,738 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:35,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:35,738 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:35,739 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:35,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2893 [2022-12-06 07:34:35,739 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-06 07:34:35,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:35,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1668127019, now seen corresponding path program 1 times [2022-12-06 07:34:35,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:35,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493675992] [2022-12-06 07:34:35,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:35,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:35,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-06 07:34:35,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:35,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493675992] [2022-12-06 07:34:35,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493675992] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:35,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:35,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:35,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785358186] [2022-12-06 07:34:35,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:35,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:35,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:35,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:35,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:35,808 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:35,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:35,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:35,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:35,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:35,844 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:35,844 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:35,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:35,845 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:35,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:35,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:35,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:35,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:35,845 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:35,845 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:35,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:35,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:35,846 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:35,846 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:35,846 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:35,846 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:35,846 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:35,846 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:35,847 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:35,847 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:35,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:35,849 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:35,849 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:35,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:35,849 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:35,849 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:35,924 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:35,925 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:35,925 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:35,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:35,925 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:35,925 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:35,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2894 [2022-12-06 07:34:35,926 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-06 07:34:35,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:35,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1637650826, now seen corresponding path program 1 times [2022-12-06 07:34:35,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:35,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850887688] [2022-12-06 07:34:35,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:35,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:36,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-06 07:34:36,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:36,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850887688] [2022-12-06 07:34:36,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850887688] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:36,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:36,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:36,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116739655] [2022-12-06 07:34:36,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:36,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:36,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:36,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:36,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:36,007 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:36,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:36,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:36,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:36,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:36,048 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:36,048 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:36,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:36,049 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:36,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:36,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:36,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:36,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:36,049 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:36,049 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:36,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:36,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:36,050 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:36,050 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:36,050 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:36,050 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:36,050 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:36,050 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:36,050 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:36,050 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:36,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:36,053 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:36,053 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:36,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:36,053 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:36,053 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:36,127 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:36,128 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:36,128 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:36,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:36,128 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:36,128 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:36,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2895 [2022-12-06 07:34:36,128 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-06 07:34:36,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:36,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1610868717, now seen corresponding path program 1 times [2022-12-06 07:34:36,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:36,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709326358] [2022-12-06 07:34:36,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:36,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:36,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-06 07:34:36,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:36,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709326358] [2022-12-06 07:34:36,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709326358] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:36,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:36,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:36,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816066758] [2022-12-06 07:34:36,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:36,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:36,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:36,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:36,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:36,198 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:36,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:36,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:36,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:36,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:36,238 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:36,238 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:36,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:36,238 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:36,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:36,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:36,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:36,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:36,239 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:36,239 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:36,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:36,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:36,240 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:36,240 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:36,240 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:36,240 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:36,240 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:36,240 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:36,240 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:36,240 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:36,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:36,242 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:36,242 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:36,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:36,243 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:36,243 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:36,316 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:36,317 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:36,317 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:36,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:36,317 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:36,317 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:36,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2896 [2022-12-06 07:34:36,317 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-06 07:34:36,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:36,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1580392524, now seen corresponding path program 1 times [2022-12-06 07:34:36,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:36,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996860569] [2022-12-06 07:34:36,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:36,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:36,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:36,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-06 07:34:36,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:36,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996860569] [2022-12-06 07:34:36,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996860569] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:36,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:36,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:36,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879341372] [2022-12-06 07:34:36,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:36,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:36,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:36,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:36,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:36,384 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:36,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:36,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:36,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:36,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:36,426 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:36,426 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:36,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:36,426 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:36,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:36,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:36,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:36,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:36,427 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:36,427 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:36,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:36,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:36,427 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:36,428 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:36,428 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:36,428 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:36,428 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:36,428 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:36,428 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:36,428 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:36,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:36,430 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:36,430 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:36,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:36,430 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:36,431 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:36,504 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:36,505 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:36,505 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:36,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:36,505 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:36,505 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:36,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2897 [2022-12-06 07:34:36,505 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-06 07:34:36,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:36,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1553610415, now seen corresponding path program 1 times [2022-12-06 07:34:36,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:36,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678880639] [2022-12-06 07:34:36,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:36,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:36,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-06 07:34:36,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:36,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678880639] [2022-12-06 07:34:36,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678880639] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:36,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:36,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:36,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731443963] [2022-12-06 07:34:36,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:36,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:36,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:36,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:36,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:36,574 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:36,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:36,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:36,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:36,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:36,615 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:36,615 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:36,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:36,615 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:36,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:36,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:36,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:36,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:36,616 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:36,616 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:36,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:36,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:36,616 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:36,617 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:36,617 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:36,617 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:36,617 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:36,617 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:36,617 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:36,617 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:36,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:36,619 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:36,619 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:36,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:36,619 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:36,620 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:36,692 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:36,693 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:34:36,693 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:36,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:36,693 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:36,693 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:36,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2898 [2022-12-06 07:34:36,693 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-06 07:34:36,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:36,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1523134222, now seen corresponding path program 1 times [2022-12-06 07:34:36,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:36,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391081755] [2022-12-06 07:34:36,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:36,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:36,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-06 07:34:36,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:36,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391081755] [2022-12-06 07:34:36,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391081755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:36,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:36,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:36,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062525914] [2022-12-06 07:34:36,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:36,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:36,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:36,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:36,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:36,771 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:36,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:36,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:36,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:36,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:36,826 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:36,827 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:36,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:36,827 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:36,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:36,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:36,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:36,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:36,828 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:36,828 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:36,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:36,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:36,829 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:36,829 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:36,829 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:36,829 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:36,829 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:36,829 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:36,829 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:36,830 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:36,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:36,832 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:36,832 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:36,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:36,833 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:36,833 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:36,924 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:36,925 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:34:36,926 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:36,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:36,926 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:36,926 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:36,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2899 [2022-12-06 07:34:36,926 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-06 07:34:36,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:36,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1496352113, now seen corresponding path program 1 times [2022-12-06 07:34:36,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:36,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160946869] [2022-12-06 07:34:36,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:36,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:37,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-06 07:34:37,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:37,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160946869] [2022-12-06 07:34:37,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160946869] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:37,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:37,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:37,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928290910] [2022-12-06 07:34:37,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:37,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:37,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:37,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:37,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:37,019 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:37,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:37,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:37,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:37,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:37,063 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:37,063 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:37,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:37,064 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:37,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:37,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:37,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:37,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:37,064 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:37,065 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:37,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:37,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:37,065 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:37,065 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:37,066 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:37,066 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:37,066 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:37,066 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:37,066 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:37,066 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:37,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:37,069 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:37,069 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:37,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:37,069 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:37,069 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:37,180 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:37,181 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-06 07:34:37,182 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:37,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:37,182 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:37,182 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:37,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2900 [2022-12-06 07:34:37,182 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-06 07:34:37,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:37,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1465875920, now seen corresponding path program 1 times [2022-12-06 07:34:37,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:37,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383186364] [2022-12-06 07:34:37,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:37,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:37,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:37,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-06 07:34:37,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:37,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383186364] [2022-12-06 07:34:37,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383186364] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:37,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:37,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:37,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598562169] [2022-12-06 07:34:37,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:37,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:37,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:37,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:37,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:37,273 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:37,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:37,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:37,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:37,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:37,315 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:37,315 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:37,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:37,315 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:37,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:37,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:37,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:37,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:37,316 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:37,316 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:37,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:37,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:37,316 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:37,316 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:37,317 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:37,317 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:37,317 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:37,317 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:37,317 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:37,317 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:37,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:37,319 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:37,319 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:37,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:37,319 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:37,320 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:37,391 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:37,392 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:34:37,392 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:37,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:37,392 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:37,392 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:37,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2901 [2022-12-06 07:34:37,392 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-06 07:34:37,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:37,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1439093811, now seen corresponding path program 1 times [2022-12-06 07:34:37,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:37,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970887308] [2022-12-06 07:34:37,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:37,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:37,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-06 07:34:37,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:37,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970887308] [2022-12-06 07:34:37,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970887308] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:37,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:37,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:37,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765305517] [2022-12-06 07:34:37,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:37,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:37,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:37,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:37,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:37,461 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:37,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:37,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:37,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:37,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:37,502 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:37,502 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:37,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:37,502 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:37,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:37,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:37,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:37,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:37,503 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:37,503 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:37,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:37,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:37,503 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:37,503 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:37,503 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:37,504 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:37,504 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:37,504 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:37,504 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:37,504 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:37,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:37,506 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:37,506 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:37,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:37,506 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:37,506 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:37,579 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:37,580 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:34:37,580 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:37,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:37,580 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:37,580 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:37,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2902 [2022-12-06 07:34:37,580 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-06 07:34:37,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:37,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1408617618, now seen corresponding path program 1 times [2022-12-06 07:34:37,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:37,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791047983] [2022-12-06 07:34:37,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:37,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:37,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:37,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-06 07:34:37,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:37,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791047983] [2022-12-06 07:34:37,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791047983] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:37,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:37,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:37,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007489780] [2022-12-06 07:34:37,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:37,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:37,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:37,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:37,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:37,647 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:37,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:37,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:37,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:37,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:37,689 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:37,689 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:37,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 349 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:37,689 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:37,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:37,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:37,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:37,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:37,691 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:37,691 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:37,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:37,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:37,692 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:37,692 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:37,692 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:37,692 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:37,693 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:37,693 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:37,693 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:37,693 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:37,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:37,696 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:37,696 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:37,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:37,696 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:37,696 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:37,768 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:37,769 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:37,769 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:37,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:37,769 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:37,770 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:37,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2903 [2022-12-06 07:34:37,770 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-06 07:34:37,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:37,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1381835509, now seen corresponding path program 1 times [2022-12-06 07:34:37,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:37,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737097104] [2022-12-06 07:34:37,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:37,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34: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-06 07:34:37,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:37,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737097104] [2022-12-06 07:34:37,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737097104] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:37,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:37,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:37,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427023978] [2022-12-06 07:34:37,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:37,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:37,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:37,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:37,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:37,835 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:37,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:37,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:37,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:37,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:37,876 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:37,876 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:37,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:37,876 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:37,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:37,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:37,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:37,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:37,877 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:37,877 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:37,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:37,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:37,878 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:37,878 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:37,878 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:37,878 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:37,878 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:37,878 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:37,878 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:37,878 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:37,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:37,880 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:37,880 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:37,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:37,881 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:37,881 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:37,954 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:37,955 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:37,955 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:37,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:37,955 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:37,955 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:37,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2904 [2022-12-06 07:34:37,955 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-06 07:34:37,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:37,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1351359316, now seen corresponding path program 1 times [2022-12-06 07:34:37,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:37,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53446942] [2022-12-06 07:34:37,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:37,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:38,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-06 07:34:38,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:38,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53446942] [2022-12-06 07:34:38,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53446942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:38,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:38,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:38,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803118385] [2022-12-06 07:34:38,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:38,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:38,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:38,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:38,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:38,021 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:38,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:38,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:38,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:38,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:38,062 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:38,062 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:38,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:38,062 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:38,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:38,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:38,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:38,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:38,063 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:38,063 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:38,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:38,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:38,064 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:38,064 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:38,064 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:38,064 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:38,064 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:38,064 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:38,064 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:38,064 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:38,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:38,066 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:38,066 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:38,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:38,067 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:38,067 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:38,140 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:38,141 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:38,141 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:38,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:38,141 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:38,141 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:38,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2905 [2022-12-06 07:34:38,141 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-06 07:34:38,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:38,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1324577207, now seen corresponding path program 1 times [2022-12-06 07:34:38,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:38,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30235045] [2022-12-06 07:34:38,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:38,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:38,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:38,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-06 07:34:38,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:38,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30235045] [2022-12-06 07:34:38,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30235045] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:38,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:38,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:38,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888173658] [2022-12-06 07:34:38,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:38,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:38,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:38,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:38,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:38,226 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:38,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:38,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:38,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:38,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:38,261 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:38,261 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:38,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:38,262 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:38,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:38,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:38,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:38,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:38,262 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:38,262 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:38,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:38,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:38,263 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:38,263 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:38,263 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:38,263 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:38,263 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:38,263 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:38,263 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:38,264 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:38,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:38,266 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:38,266 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:38,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:38,266 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:38,266 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:38,340 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:38,341 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:38,341 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:38,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:38,341 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:38,341 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:38,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2906 [2022-12-06 07:34:38,342 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-06 07:34:38,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:38,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1294101014, now seen corresponding path program 1 times [2022-12-06 07:34:38,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:38,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56227574] [2022-12-06 07:34:38,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:38,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:38,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-06 07:34:38,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:38,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56227574] [2022-12-06 07:34:38,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56227574] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:38,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:38,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:38,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790192506] [2022-12-06 07:34:38,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:38,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:38,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:38,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:38,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:38,406 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:38,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:38,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:38,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:38,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:38,447 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:38,447 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:38,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:38,447 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:38,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:38,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:38,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:38,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:38,448 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:38,448 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:38,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:38,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:38,449 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:38,449 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:38,449 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:38,449 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:38,449 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:38,449 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:38,449 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:38,449 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:38,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:38,451 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:38,451 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:38,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:38,452 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:38,452 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:38,523 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:38,525 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:34:38,525 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:38,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:38,525 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:38,525 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:38,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2907 [2022-12-06 07:34:38,525 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-06 07:34:38,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:38,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1267318905, now seen corresponding path program 1 times [2022-12-06 07:34:38,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:38,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399365610] [2022-12-06 07:34:38,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:38,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:38,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-06 07:34:38,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:38,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399365610] [2022-12-06 07:34:38,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399365610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:38,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:38,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:38,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577429892] [2022-12-06 07:34:38,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:38,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:38,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:38,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:38,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:38,621 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:38,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:38,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:38,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:38,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:38,658 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:38,658 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:38,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:38,659 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:38,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:38,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:38,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:38,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:38,659 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:38,659 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:38,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:38,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:38,660 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:38,660 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:38,660 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:38,660 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:38,660 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:38,660 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:38,660 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:38,660 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:38,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:38,663 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:38,663 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:38,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:38,663 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:38,663 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:38,735 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:38,737 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:38,737 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:38,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:38,737 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:38,737 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:38,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2908 [2022-12-06 07:34:38,737 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-06 07:34:38,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:38,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1236842712, now seen corresponding path program 1 times [2022-12-06 07:34:38,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:38,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139547455] [2022-12-06 07:34:38,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:38,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:38,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-06 07:34:38,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:38,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139547455] [2022-12-06 07:34:38,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139547455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:38,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:38,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:38,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231564304] [2022-12-06 07:34:38,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:38,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:38,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:38,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:38,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:38,804 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:38,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:38,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:38,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:38,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:38,846 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:38,846 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:38,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:38,847 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:38,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:38,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:38,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:38,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:38,847 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:38,847 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:38,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:38,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:38,848 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:38,848 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:38,848 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:38,848 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:38,848 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:38,848 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:38,848 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:38,848 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:38,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:38,851 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:38,851 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:38,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:38,851 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:38,851 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:38,926 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:38,927 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:38,927 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:38,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:38,927 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:38,928 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:38,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2909 [2022-12-06 07:34:38,928 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-06 07:34:38,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:38,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1210060603, now seen corresponding path program 1 times [2022-12-06 07:34:38,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:38,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483343] [2022-12-06 07:34:38,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:38,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:38,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:38,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-06 07:34:38,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:38,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483343] [2022-12-06 07:34:38,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483343] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:38,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:38,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:38,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901112356] [2022-12-06 07:34:38,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:38,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:38,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:38,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:38,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:38,996 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:38,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:38,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:38,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:38,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:39,037 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:39,037 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:39,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:39,038 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:39,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:39,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:39,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:39,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:39,038 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:39,038 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:39,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:39,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:39,039 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:39,039 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:39,039 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:39,039 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:39,039 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:39,039 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:39,039 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:39,039 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:39,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:39,041 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:39,041 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:39,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:39,042 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:39,042 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:39,116 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:39,117 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:39,117 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:39,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:39,117 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:39,117 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:39,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2910 [2022-12-06 07:34:39,117 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-06 07:34:39,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:39,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1179584410, now seen corresponding path program 1 times [2022-12-06 07:34:39,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:39,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615538262] [2022-12-06 07:34:39,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:39,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:39,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-06 07:34:39,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:39,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615538262] [2022-12-06 07:34:39,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615538262] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:39,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:39,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:39,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121883249] [2022-12-06 07:34:39,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:39,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:39,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:39,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:39,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:39,187 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:39,187 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:39,187 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:39,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:39,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:39,235 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:39,235 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:39,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:39,235 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:39,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:39,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:39,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:39,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:39,236 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:39,236 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:39,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:39,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:39,237 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:39,237 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:39,237 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:39,237 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:39,237 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:39,237 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:39,237 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:39,237 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:39,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:39,239 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:39,239 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:39,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:39,240 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:39,240 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:39,314 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:39,315 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:39,315 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:39,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:39,315 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:39,315 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:39,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2911 [2022-12-06 07:34:39,315 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-06 07:34:39,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:39,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1152802301, now seen corresponding path program 1 times [2022-12-06 07:34:39,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:39,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987860753] [2022-12-06 07:34:39,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:39,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:39,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-06 07:34:39,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:39,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987860753] [2022-12-06 07:34:39,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987860753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:39,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:39,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:39,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212817684] [2022-12-06 07:34:39,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:39,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:39,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:39,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:39,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:39,385 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:39,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:39,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:39,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:39,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:39,426 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:39,426 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:39,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:39,427 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:39,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:39,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:39,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:39,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:39,427 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:39,427 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:39,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:39,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:39,428 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:39,428 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:39,428 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:39,428 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:39,428 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:39,428 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:39,428 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:39,429 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:39,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:39,431 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:39,431 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:39,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:39,431 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:39,431 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:39,505 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:39,506 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:39,506 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:39,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:39,506 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:39,506 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:39,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2912 [2022-12-06 07:34:39,506 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-06 07:34:39,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:39,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1122326108, now seen corresponding path program 1 times [2022-12-06 07:34:39,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:39,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113375] [2022-12-06 07:34:39,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:39,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:39,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-06 07:34:39,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:39,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113375] [2022-12-06 07:34:39,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113375] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:39,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:39,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:39,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339675762] [2022-12-06 07:34:39,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:39,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:39,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:39,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:39,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:39,575 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:39,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:39,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:39,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:39,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:39,618 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:39,618 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:39,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:39,618 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:39,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:39,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:39,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:39,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:39,619 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:39,619 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:39,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:39,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:39,620 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:39,620 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:39,620 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:39,620 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:39,620 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:39,620 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:39,620 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:39,620 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:39,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:39,622 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:39,623 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:39,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:39,623 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:39,623 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:39,698 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:39,699 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:39,699 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:39,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:39,699 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:39,699 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:39,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2913 [2022-12-06 07:34:39,700 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-06 07:34:39,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:39,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1095543999, now seen corresponding path program 1 times [2022-12-06 07:34:39,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:39,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531490695] [2022-12-06 07:34:39,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:39,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:39,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-06 07:34:39,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:39,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531490695] [2022-12-06 07:34:39,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531490695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:39,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:39,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:39,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778685913] [2022-12-06 07:34:39,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:39,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:39,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:39,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:39,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:39,770 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:39,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:39,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:39,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:39,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:39,809 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:39,809 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:39,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:39,810 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:39,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:39,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:39,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:39,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:39,810 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:39,810 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:39,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:39,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:39,811 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:39,811 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:39,811 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:39,811 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:39,811 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:39,811 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:39,812 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:39,812 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:39,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:39,814 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:39,814 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:39,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:39,814 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:39,814 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:39,888 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:39,890 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:39,890 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:39,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:39,890 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:39,890 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:39,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2914 [2022-12-06 07:34:39,890 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-06 07:34:39,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:39,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1065067806, now seen corresponding path program 1 times [2022-12-06 07:34:39,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:39,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279573261] [2022-12-06 07:34:39,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:39,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:39,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-06 07:34:39,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:39,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279573261] [2022-12-06 07:34:39,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279573261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:39,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:39,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:39,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012651755] [2022-12-06 07:34:39,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:39,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:39,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:39,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:39,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:39,957 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:39,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:39,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:39,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:39,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:39,993 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:39,993 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:39,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:39,994 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:39,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:39,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:39,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:39,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:39,994 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:39,995 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:39,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:39,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:39,995 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:39,995 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:39,995 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:39,995 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:39,996 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:39,996 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:39,996 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:39,996 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:39,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:39,998 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:39,998 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:39,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:39,998 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:39,998 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:40,074 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:40,075 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:34:40,075 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:40,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:40,075 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:40,075 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:40,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2915 [2022-12-06 07:34:40,075 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-06 07:34:40,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:40,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1038285697, now seen corresponding path program 1 times [2022-12-06 07:34:40,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:40,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076557273] [2022-12-06 07:34:40,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:40,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:40,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-06 07:34:40,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:40,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076557273] [2022-12-06 07:34:40,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076557273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:40,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:40,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:40,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460186179] [2022-12-06 07:34:40,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:40,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:40,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:40,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:40,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:40,149 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:40,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:40,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:40,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:40,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:40,190 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:40,190 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:40,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:40,191 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:40,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:40,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:40,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:40,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:40,191 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:40,191 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:40,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:40,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:40,192 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:40,192 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:40,192 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:40,192 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:40,192 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:40,192 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:40,192 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:40,192 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:40,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:40,195 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:40,195 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:40,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:40,195 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:40,195 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:40,271 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:40,272 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:34:40,272 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:40,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:40,272 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:40,273 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:40,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2916 [2022-12-06 07:34:40,273 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-06 07:34:40,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:40,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1007809504, now seen corresponding path program 1 times [2022-12-06 07:34:40,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:40,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324858468] [2022-12-06 07:34:40,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:40,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:40,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:40,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:40,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324858468] [2022-12-06 07:34:40,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324858468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:40,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:40,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:40,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148446181] [2022-12-06 07:34:40,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:40,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:40,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:40,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:40,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:40,353 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:40,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:40,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:40,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:40,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:40,396 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:40,397 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:40,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:40,397 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:40,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:40,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:40,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:40,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:40,398 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:40,398 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:40,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:40,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:40,398 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:40,398 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:40,399 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:40,399 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:40,399 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:40,399 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:40,399 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:40,399 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:40,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:40,401 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:40,401 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:40,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:40,402 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:40,402 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:40,477 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:40,479 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:34:40,479 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:40,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:40,479 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:40,479 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:40,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2917 [2022-12-06 07:34:40,479 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-06 07:34:40,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:40,479 INFO L85 PathProgramCache]: Analyzing trace with hash -981027395, now seen corresponding path program 1 times [2022-12-06 07:34:40,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:40,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169572928] [2022-12-06 07:34:40,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:40,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:40,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:40,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:40,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169572928] [2022-12-06 07:34:40,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169572928] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:40,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:40,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:40,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492186462] [2022-12-06 07:34:40,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:40,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:40,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:40,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:40,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:40,552 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:40,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:40,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:40,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:40,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:40,593 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:40,593 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:40,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:40,594 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:40,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:40,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:40,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:40,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:40,594 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:40,594 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:40,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:40,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:40,595 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:40,595 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:40,595 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:40,595 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:40,595 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:40,595 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:40,595 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:40,596 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:40,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:40,598 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:40,598 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:40,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:40,598 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:40,598 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:40,674 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:40,675 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:34:40,676 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:40,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:40,676 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:40,676 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:40,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2918 [2022-12-06 07:34:40,676 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-06 07:34:40,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:40,676 INFO L85 PathProgramCache]: Analyzing trace with hash -950551202, now seen corresponding path program 1 times [2022-12-06 07:34:40,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:40,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521572403] [2022-12-06 07:34:40,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:40,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:40,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-06 07:34:40,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:40,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521572403] [2022-12-06 07:34:40,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521572403] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:40,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:40,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:40,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831887415] [2022-12-06 07:34:40,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:40,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:40,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:40,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:40,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:40,748 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:40,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:40,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:40,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:40,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:40,789 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:40,789 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:40,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:40,790 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:40,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:40,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:40,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:40,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:40,790 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:40,790 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:40,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:40,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:40,791 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:40,791 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:40,791 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:40,791 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:40,791 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:40,792 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:40,792 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:40,792 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:40,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:40,794 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:40,794 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:40,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:40,794 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:40,794 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:40,871 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:40,873 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:34:40,873 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:40,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:40,873 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:40,873 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:40,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2919 [2022-12-06 07:34:40,873 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-06 07:34:40,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:40,873 INFO L85 PathProgramCache]: Analyzing trace with hash -923769093, now seen corresponding path program 1 times [2022-12-06 07:34:40,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:40,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788660510] [2022-12-06 07:34:40,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:40,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:40,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-06 07:34:40,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:40,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788660510] [2022-12-06 07:34:40,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788660510] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:40,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:40,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:40,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860519121] [2022-12-06 07:34:40,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:40,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:40,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:40,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:40,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:40,948 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:40,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:40,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:40,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:40,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:40,984 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:40,984 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:40,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:40,984 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:40,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:40,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:40,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:40,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:40,985 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:40,985 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:40,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:40,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:40,985 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:40,986 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:40,986 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:40,986 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:40,986 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:40,986 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:40,986 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:40,986 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:40,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:40,988 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:40,988 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:40,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:40,989 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:40,989 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:41,063 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:41,064 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:41,064 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:41,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:41,064 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:41,064 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:41,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2920 [2022-12-06 07:34:41,065 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-06 07:34:41,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:41,065 INFO L85 PathProgramCache]: Analyzing trace with hash -893292900, now seen corresponding path program 1 times [2022-12-06 07:34:41,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:41,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129597904] [2022-12-06 07:34:41,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:41,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:41,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-06 07:34:41,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:41,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129597904] [2022-12-06 07:34:41,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129597904] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:41,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:41,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:41,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965616151] [2022-12-06 07:34:41,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:41,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:41,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:41,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:41,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:41,133 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:41,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:41,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:41,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:41,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:41,174 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:41,174 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:41,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:41,175 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:41,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:41,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:41,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:41,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:41,175 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:41,175 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:41,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:41,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:41,176 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:41,176 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:41,176 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:41,176 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:41,176 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:41,177 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:41,177 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:41,177 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:41,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:41,179 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:41,179 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:41,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:41,179 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:41,179 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:41,253 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:41,254 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:41,254 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:41,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:41,254 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:41,254 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:41,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2921 [2022-12-06 07:34:41,254 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-06 07:34:41,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:41,255 INFO L85 PathProgramCache]: Analyzing trace with hash -866510791, now seen corresponding path program 1 times [2022-12-06 07:34:41,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:41,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22300542] [2022-12-06 07:34:41,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:41,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:41,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:41,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:41,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22300542] [2022-12-06 07:34:41,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22300542] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:41,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:41,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:41,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620567035] [2022-12-06 07:34:41,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:41,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:41,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:41,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:41,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:41,341 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:41,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:41,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:41,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:41,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:41,382 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:41,382 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:41,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:41,382 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:41,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:41,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:41,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:41,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:41,383 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:41,383 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:41,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:41,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:41,384 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:41,384 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:41,384 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:41,384 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:41,384 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:41,384 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:41,384 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:41,384 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:41,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:41,386 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:41,386 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:41,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:41,387 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:41,387 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:41,461 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:41,462 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:41,462 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:41,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:41,463 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:41,463 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:41,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2922 [2022-12-06 07:34:41,463 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-06 07:34:41,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:41,463 INFO L85 PathProgramCache]: Analyzing trace with hash -836034598, now seen corresponding path program 1 times [2022-12-06 07:34:41,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:41,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915328471] [2022-12-06 07:34:41,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:41,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:41,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34: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-06 07:34:41,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:41,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915328471] [2022-12-06 07:34:41,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915328471] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:41,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:41,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:41,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248527945] [2022-12-06 07:34:41,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:41,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:41,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:41,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:41,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:41,529 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:41,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:41,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:41,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:41,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:41,572 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:41,572 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:41,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:41,572 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:41,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:41,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:41,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:41,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:41,573 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:41,573 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:41,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:41,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:41,574 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:41,574 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:41,574 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:41,574 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:41,574 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:41,574 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:41,574 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:41,574 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:41,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:41,576 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:41,577 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:41,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:41,577 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:41,577 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:41,651 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:41,653 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:41,653 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:41,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:41,653 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:41,653 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:41,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2923 [2022-12-06 07:34:41,653 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-06 07:34:41,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:41,653 INFO L85 PathProgramCache]: Analyzing trace with hash -809252489, now seen corresponding path program 1 times [2022-12-06 07:34:41,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:41,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490600195] [2022-12-06 07:34:41,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:41,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:41,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-06 07:34:41,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:41,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490600195] [2022-12-06 07:34:41,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490600195] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:41,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:41,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:41,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247845533] [2022-12-06 07:34:41,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:41,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:41,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:41,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:41,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:41,723 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:41,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:41,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:41,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:41,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:41,757 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:41,757 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:41,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 372 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:41,758 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:41,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:41,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:41,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:41,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:41,758 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:41,758 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:41,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:41,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:41,759 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:41,759 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:41,759 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:41,759 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:41,759 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:41,760 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:41,760 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:41,760 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:41,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:41,762 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:41,762 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:41,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:41,762 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:41,762 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:41,837 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:41,838 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:41,838 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:41,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:41,839 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:41,839 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:41,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2924 [2022-12-06 07:34:41,839 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-06 07:34:41,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:41,839 INFO L85 PathProgramCache]: Analyzing trace with hash -778776296, now seen corresponding path program 1 times [2022-12-06 07:34:41,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:41,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031862141] [2022-12-06 07:34:41,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:41,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:41,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-06 07:34:41,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:41,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031862141] [2022-12-06 07:34:41,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031862141] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:41,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:41,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:41,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173052410] [2022-12-06 07:34:41,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:41,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:41,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:41,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:41,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:41,907 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:41,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:41,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:41,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:41,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:41,950 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:41,950 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:41,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:41,951 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:41,951 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:41,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:41,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:41,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:41,951 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:41,951 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:41,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:41,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:41,952 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:41,952 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:41,952 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:41,952 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:41,952 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:41,952 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:41,952 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:41,952 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:41,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:41,955 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:41,955 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:41,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:41,955 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:41,955 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:42,030 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:42,031 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:42,031 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:42,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:42,031 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:42,031 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:42,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2925 [2022-12-06 07:34:42,031 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-06 07:34:42,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:42,031 INFO L85 PathProgramCache]: Analyzing trace with hash -751994187, now seen corresponding path program 1 times [2022-12-06 07:34:42,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:42,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023508990] [2022-12-06 07:34:42,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:42,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:42,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:42,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:42,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023508990] [2022-12-06 07:34:42,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023508990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:42,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:42,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:42,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057738047] [2022-12-06 07:34:42,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:42,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:42,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:42,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:42,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:42,104 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:42,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:42,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:42,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:42,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:42,140 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:42,140 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:42,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:42,141 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:42,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:42,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:42,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:42,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:42,141 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:42,141 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:42,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:42,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:42,142 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:42,142 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:42,142 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:42,142 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:42,142 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:42,142 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:42,142 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:42,142 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:42,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:42,145 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:42,145 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:42,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:42,145 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:42,145 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:42,221 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:42,222 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:34:42,222 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:42,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:42,222 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:42,222 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:42,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2926 [2022-12-06 07:34:42,222 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-06 07:34:42,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:42,223 INFO L85 PathProgramCache]: Analyzing trace with hash -721517994, now seen corresponding path program 1 times [2022-12-06 07:34:42,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:42,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302639020] [2022-12-06 07:34:42,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:42,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:42,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:42,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-06 07:34:42,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:42,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302639020] [2022-12-06 07:34:42,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302639020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:42,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:42,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:42,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150293837] [2022-12-06 07:34:42,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:42,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:42,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:42,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:42,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:42,291 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:42,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:42,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:42,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:42,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:42,333 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:42,333 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:42,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:42,333 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:42,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:42,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:42,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:42,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:42,334 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:42,334 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:42,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:42,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:42,335 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:42,335 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:42,335 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:42,335 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:42,335 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:42,335 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:42,335 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:42,335 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:42,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:42,338 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:42,338 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:42,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:42,338 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:42,338 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:42,411 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:42,412 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:42,413 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:42,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:42,413 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:42,413 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:42,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2927 [2022-12-06 07:34:42,413 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-06 07:34:42,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:42,413 INFO L85 PathProgramCache]: Analyzing trace with hash -694735885, now seen corresponding path program 1 times [2022-12-06 07:34:42,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:42,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472871626] [2022-12-06 07:34:42,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:42,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:42,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:42,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:42,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472871626] [2022-12-06 07:34:42,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472871626] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:42,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:42,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:42,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360672808] [2022-12-06 07:34:42,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:42,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:42,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:42,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:42,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:42,504 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:42,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:42,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:42,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:42,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:42,543 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:42,543 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:42,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:42,544 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:42,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:42,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:42,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:42,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:42,545 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:42,545 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:42,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:42,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:42,545 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:42,546 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:42,546 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:42,546 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:42,546 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:42,546 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:42,546 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:42,546 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:42,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:42,549 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:42,549 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:42,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:42,549 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:42,549 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:42,628 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:42,629 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 07:34:42,629 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:42,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:42,629 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:42,629 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:42,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2928 [2022-12-06 07:34:42,630 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-06 07:34:42,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:42,630 INFO L85 PathProgramCache]: Analyzing trace with hash -664259692, now seen corresponding path program 1 times [2022-12-06 07:34:42,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:42,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427356862] [2022-12-06 07:34:42,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:42,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:42,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:42,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:42,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427356862] [2022-12-06 07:34:42,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427356862] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:42,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:42,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:42,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060782061] [2022-12-06 07:34:42,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:42,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:42,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:42,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:42,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:42,712 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:42,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:42,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:42,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:42,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:42,759 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:42,759 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:42,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:42,760 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:42,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:42,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:42,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:42,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:42,761 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:42,761 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:42,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:42,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:42,761 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:42,762 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:42,762 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:42,762 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:42,762 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:42,762 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:42,762 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:42,762 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:42,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:42,765 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:42,765 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:42,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:42,765 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:42,765 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:42,841 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:42,842 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:34:42,842 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:42,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:42,842 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:42,842 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:42,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2929 [2022-12-06 07:34:42,843 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-06 07:34:42,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:42,843 INFO L85 PathProgramCache]: Analyzing trace with hash -637477583, now seen corresponding path program 1 times [2022-12-06 07:34:42,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:42,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677783611] [2022-12-06 07:34:42,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:42,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:42,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-06 07:34:42,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:42,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677783611] [2022-12-06 07:34:42,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677783611] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:42,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:42,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:42,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333373682] [2022-12-06 07:34:42,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:42,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:42,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:42,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:42,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:42,915 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:42,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:42,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:42,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:42,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:42,956 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:42,957 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:42,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:42,957 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:42,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:42,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:42,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:42,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:42,958 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:42,958 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:42,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:42,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:42,959 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:42,959 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:42,959 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:42,959 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:42,959 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:42,959 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:42,959 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:42,959 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:42,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:42,961 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:42,961 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:42,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:42,962 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:42,962 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:43,038 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:43,039 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:34:43,039 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:43,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:43,039 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:43,039 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:43,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2930 [2022-12-06 07:34:43,039 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-06 07:34:43,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:43,040 INFO L85 PathProgramCache]: Analyzing trace with hash -607001390, now seen corresponding path program 1 times [2022-12-06 07:34:43,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:43,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133172077] [2022-12-06 07:34:43,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:43,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:43,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-06 07:34:43,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:43,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133172077] [2022-12-06 07:34:43,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133172077] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:43,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:43,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:43,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97787413] [2022-12-06 07:34:43,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:43,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:43,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:43,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:43,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:43,110 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:43,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:43,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:43,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:43,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:43,152 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:43,152 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:43,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:43,153 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:43,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:43,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:43,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:43,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:43,153 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:43,153 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:43,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:43,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:43,154 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:43,154 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:43,154 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:43,154 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:43,154 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:43,154 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:43,154 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:43,155 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:43,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:43,157 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:43,157 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:43,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:43,157 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:43,157 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:43,230 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:43,231 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:43,231 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:43,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:43,231 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:43,231 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:43,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2931 [2022-12-06 07:34:43,231 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-06 07:34:43,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:43,232 INFO L85 PathProgramCache]: Analyzing trace with hash -580219281, now seen corresponding path program 1 times [2022-12-06 07:34:43,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:43,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640300402] [2022-12-06 07:34:43,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:43,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:43,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-06 07:34:43,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:43,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640300402] [2022-12-06 07:34:43,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640300402] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:43,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:43,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:43,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682057081] [2022-12-06 07:34:43,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:43,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:43,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:43,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:43,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:43,304 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:43,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:43,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:43,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:43,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:43,345 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:43,345 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:43,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:43,346 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:43,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:43,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:43,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:43,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:43,346 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:43,346 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:43,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:43,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:43,347 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:43,347 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:43,347 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:43,347 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:43,347 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:43,347 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:43,347 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:43,348 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:43,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:43,350 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:43,350 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:43,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:43,350 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:43,350 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:43,426 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:43,428 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:34:43,428 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:43,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:43,428 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:43,428 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:43,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2932 [2022-12-06 07:34:43,428 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-06 07:34:43,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:43,428 INFO L85 PathProgramCache]: Analyzing trace with hash -549743088, now seen corresponding path program 1 times [2022-12-06 07:34:43,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:43,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547926021] [2022-12-06 07:34:43,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:43,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:43,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-06 07:34:43,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:43,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547926021] [2022-12-06 07:34:43,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547926021] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:43,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:43,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:43,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000003091] [2022-12-06 07:34:43,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:43,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:43,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:43,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:43,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:43,499 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:43,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:43,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:43,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:43,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:43,546 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:43,546 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:43,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:43,547 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:43,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:43,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:43,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:43,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:43,547 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:43,547 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:43,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:43,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:43,548 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:43,548 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:43,548 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:43,548 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:43,548 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:43,548 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:43,548 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:43,549 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:43,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:43,551 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:43,551 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:43,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:43,551 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:43,551 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:43,626 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:43,627 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:43,627 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:43,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:43,627 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:43,627 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:43,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2933 [2022-12-06 07:34:43,627 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-06 07:34:43,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:43,627 INFO L85 PathProgramCache]: Analyzing trace with hash -522960979, now seen corresponding path program 1 times [2022-12-06 07:34:43,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:43,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370876768] [2022-12-06 07:34:43,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:43,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:43,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:43,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-06 07:34:43,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:43,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370876768] [2022-12-06 07:34:43,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370876768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:43,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:43,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:43,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488765584] [2022-12-06 07:34:43,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:43,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:43,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:43,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:43,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:43,744 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:43,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:43,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:43,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:43,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:43,800 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:43,800 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:43,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:43,801 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:43,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:43,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:43,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:43,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:43,802 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:43,803 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:43,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:43,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:43,803 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:43,803 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:43,804 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:43,804 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:43,804 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:43,804 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:43,804 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:43,804 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:43,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:43,806 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:43,806 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:43,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:43,807 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:43,807 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:43,881 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:43,883 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:43,883 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:43,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:43,883 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:43,883 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:43,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2934 [2022-12-06 07:34:43,883 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-06 07:34:43,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:43,883 INFO L85 PathProgramCache]: Analyzing trace with hash -492484786, now seen corresponding path program 1 times [2022-12-06 07:34:43,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:43,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301914194] [2022-12-06 07:34:43,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:43,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:43,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-06 07:34:43,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:43,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301914194] [2022-12-06 07:34:43,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301914194] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:43,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:43,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:43,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3331689] [2022-12-06 07:34:43,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:43,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:43,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:43,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:43,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:43,952 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:43,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:43,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:43,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:43,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:43,988 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:43,989 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:43,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:43,989 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:43,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:43,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:43,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:43,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:43,990 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:43,990 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:43,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:43,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:43,990 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:43,990 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:43,991 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:43,991 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:43,991 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:43,991 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:43,991 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:43,991 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:43,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:43,993 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:43,993 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:43,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:43,994 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:43,994 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:44,069 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:44,070 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:44,070 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:44,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:44,070 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:44,070 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:44,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2935 [2022-12-06 07:34:44,071 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-06 07:34:44,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:44,071 INFO L85 PathProgramCache]: Analyzing trace with hash -465702677, now seen corresponding path program 1 times [2022-12-06 07:34:44,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:44,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507662672] [2022-12-06 07:34:44,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:44,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:44,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-06 07:34:44,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:44,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507662672] [2022-12-06 07:34:44,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507662672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:44,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:44,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:44,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864525285] [2022-12-06 07:34:44,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:44,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:44,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:44,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:44,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:44,143 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:44,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:44,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:44,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:44,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:44,184 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:44,184 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:44,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:44,185 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:44,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:44,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:44,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:44,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:44,185 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:44,185 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:44,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:44,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:44,186 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:44,186 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:44,186 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:44,186 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:44,186 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:44,186 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:44,186 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:44,187 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:44,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:44,189 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:44,189 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:44,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:44,189 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:44,189 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:44,263 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:44,265 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:44,265 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:44,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:44,265 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:44,265 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:44,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2936 [2022-12-06 07:34:44,265 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-06 07:34:44,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:44,265 INFO L85 PathProgramCache]: Analyzing trace with hash -435226484, now seen corresponding path program 1 times [2022-12-06 07:34:44,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:44,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119910835] [2022-12-06 07:34:44,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:44,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:44,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-06 07:34:44,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:44,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119910835] [2022-12-06 07:34:44,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119910835] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:44,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:44,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:44,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757848355] [2022-12-06 07:34:44,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:44,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:44,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:44,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:44,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:44,331 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:44,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:44,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:44,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:44,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:44,371 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:44,371 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:44,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:44,372 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:44,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:44,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:44,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:44,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:44,372 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:44,373 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:44,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:44,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:44,373 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:44,373 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:44,373 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:44,373 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:44,373 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:44,374 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:44,374 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:44,374 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:44,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:44,376 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:44,376 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:44,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:44,376 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:44,376 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:44,449 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:44,451 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:44,451 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:44,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:44,451 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:44,451 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:44,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2937 [2022-12-06 07:34:44,451 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-06 07:34:44,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:44,451 INFO L85 PathProgramCache]: Analyzing trace with hash -408444375, now seen corresponding path program 1 times [2022-12-06 07:34:44,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:44,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856435131] [2022-12-06 07:34:44,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:44,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:44,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-06 07:34:44,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:44,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856435131] [2022-12-06 07:34:44,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856435131] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:44,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:44,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:44,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108326908] [2022-12-06 07:34:44,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:44,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:44,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:44,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:44,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:44,522 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:44,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:44,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:44,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:44,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:44,562 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:44,563 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:44,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:44,563 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:44,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:44,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:44,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:44,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:44,564 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:44,564 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:44,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:44,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:44,564 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:44,564 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:44,565 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:44,565 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:44,565 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:44,565 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:44,565 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:44,565 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:44,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:44,567 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:44,567 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:44,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:44,567 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:44,568 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:44,642 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:44,644 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:44,644 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:44,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:44,644 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:44,644 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:44,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2938 [2022-12-06 07:34:44,644 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-06 07:34:44,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:44,644 INFO L85 PathProgramCache]: Analyzing trace with hash -377968182, now seen corresponding path program 1 times [2022-12-06 07:34:44,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:44,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338806412] [2022-12-06 07:34:44,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:44,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:44,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-06 07:34:44,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:44,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338806412] [2022-12-06 07:34:44,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338806412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:44,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:44,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:44,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465339460] [2022-12-06 07:34:44,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:44,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:44,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:44,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:44,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:44,711 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:44,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:44,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:44,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:44,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:44,746 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:44,747 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:44,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:44,747 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:44,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:44,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:44,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:44,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:44,748 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:44,748 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:44,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:44,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:44,748 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:44,748 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:44,748 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:44,749 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:44,749 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:44,749 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:44,749 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:44,749 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:44,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:44,751 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:44,751 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:44,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:44,751 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:44,751 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:44,825 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:44,826 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:44,826 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:44,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:44,826 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:44,826 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:44,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2939 [2022-12-06 07:34:44,826 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-06 07:34:44,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:44,826 INFO L85 PathProgramCache]: Analyzing trace with hash -351186073, now seen corresponding path program 1 times [2022-12-06 07:34:44,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:44,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54134348] [2022-12-06 07:34:44,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:44,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:44,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-06 07:34:44,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:44,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54134348] [2022-12-06 07:34:44,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54134348] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:44,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:44,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:44,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181488945] [2022-12-06 07:34:44,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:44,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:44,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:44,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:44,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:44,897 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:44,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:44,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:44,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:44,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:44,937 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:44,937 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:44,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:44,938 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:44,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:44,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:44,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:44,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:44,938 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:44,939 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:44,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:44,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:44,939 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:44,939 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:44,939 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:44,939 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:44,940 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:44,940 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:44,940 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:44,940 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:44,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:44,942 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:44,942 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:44,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:44,942 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:44,942 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:45,016 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:45,018 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:45,018 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:45,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:45,018 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:45,018 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:45,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2940 [2022-12-06 07:34:45,018 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-06 07:34:45,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:45,018 INFO L85 PathProgramCache]: Analyzing trace with hash -320709880, now seen corresponding path program 1 times [2022-12-06 07:34:45,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:45,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002151022] [2022-12-06 07:34:45,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:45,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:45,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-06 07:34:45,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:45,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002151022] [2022-12-06 07:34:45,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002151022] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:45,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:45,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:45,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903840567] [2022-12-06 07:34:45,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:45,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:45,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:45,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:45,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:45,096 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:45,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:45,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:45,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:45,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:45,139 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:45,139 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:45,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:45,139 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:45,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:45,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:45,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:45,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:45,140 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:45,140 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:45,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:45,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:45,141 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:45,141 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:45,141 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:45,141 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:45,141 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:45,141 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:45,141 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:45,141 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:45,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:45,143 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:45,143 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:45,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:45,144 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:45,144 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:45,218 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:45,219 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:45,219 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:45,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:45,219 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:45,219 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:45,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2941 [2022-12-06 07:34:45,220 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-06 07:34:45,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:45,220 INFO L85 PathProgramCache]: Analyzing trace with hash -293927771, now seen corresponding path program 1 times [2022-12-06 07:34:45,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:45,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015202436] [2022-12-06 07:34:45,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:45,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:45,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-06 07:34:45,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:45,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015202436] [2022-12-06 07:34:45,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015202436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:45,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:45,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:45,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738606327] [2022-12-06 07:34:45,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:45,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:45,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:45,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:45,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:45,292 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:45,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:45,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:45,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:45,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:45,332 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:45,332 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:45,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:45,333 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:45,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:45,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:45,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:45,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:45,333 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:45,333 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:45,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:45,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:45,334 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:45,334 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:45,334 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:45,334 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:45,334 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:45,334 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:45,334 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:45,335 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:45,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:45,337 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:45,337 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:45,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:45,337 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:45,337 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:45,411 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:45,412 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:45,413 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:45,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:45,413 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:45,413 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:45,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2942 [2022-12-06 07:34:45,413 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-06 07:34:45,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:45,413 INFO L85 PathProgramCache]: Analyzing trace with hash -263451578, now seen corresponding path program 1 times [2022-12-06 07:34:45,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:45,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828648547] [2022-12-06 07:34:45,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:45,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:45,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-06 07:34:45,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:45,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828648547] [2022-12-06 07:34:45,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828648547] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:45,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:45,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:45,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717969921] [2022-12-06 07:34:45,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:45,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:45,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:45,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:45,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:45,479 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:45,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:45,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:45,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:45,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:45,514 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:45,514 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:45,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 349 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:45,515 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:45,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:45,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:45,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:45,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:45,516 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:45,516 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:45,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:45,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:45,516 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:45,516 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:45,516 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:45,517 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:45,517 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:45,517 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:45,517 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:45,517 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:45,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:45,519 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:45,519 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:45,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:45,519 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:45,519 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:45,591 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:45,593 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:34:45,593 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:45,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:45,593 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:45,593 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:45,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2943 [2022-12-06 07:34:45,593 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-06 07:34:45,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:45,593 INFO L85 PathProgramCache]: Analyzing trace with hash -236669469, now seen corresponding path program 1 times [2022-12-06 07:34:45,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:45,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424924588] [2022-12-06 07:34:45,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:45,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:45,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-06 07:34:45,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:45,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424924588] [2022-12-06 07:34:45,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424924588] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:45,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:45,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:45,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147970167] [2022-12-06 07:34:45,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:45,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:45,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:45,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:45,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:45,662 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:45,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:45,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:45,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:45,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:45,703 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:45,703 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:45,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:45,703 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:45,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:45,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:45,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:45,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:45,704 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:45,704 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:45,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:45,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:45,704 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:45,705 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:45,705 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:45,705 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:45,705 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:45,705 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:45,705 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:45,705 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:45,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:45,707 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:45,707 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:45,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:45,707 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:45,708 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:45,780 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:45,781 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:34:45,781 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:45,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:45,782 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:45,782 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:45,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2944 [2022-12-06 07:34:45,782 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-06 07:34:45,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:45,782 INFO L85 PathProgramCache]: Analyzing trace with hash -206193276, now seen corresponding path program 1 times [2022-12-06 07:34:45,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:45,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657121877] [2022-12-06 07:34:45,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:45,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:45,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-06 07:34:45,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:45,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657121877] [2022-12-06 07:34:45,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657121877] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:45,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:45,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:45,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846888606] [2022-12-06 07:34:45,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:45,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:45,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:45,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:45,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:45,848 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:45,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:45,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:45,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:45,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:45,889 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:45,890 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:45,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:45,890 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:45,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:45,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:45,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:45,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:45,891 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:45,891 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:45,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:45,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:45,891 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:45,891 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:45,891 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:45,892 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:45,892 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:45,892 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:45,892 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:45,892 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:45,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:45,894 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:45,894 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:45,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:45,894 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:45,894 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:45,968 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:45,969 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:45,969 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:45,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:45,969 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:45,970 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:45,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2945 [2022-12-06 07:34:45,970 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-06 07:34:45,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:45,970 INFO L85 PathProgramCache]: Analyzing trace with hash -179411167, now seen corresponding path program 1 times [2022-12-06 07:34:45,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:45,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764757919] [2022-12-06 07:34:45,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:45,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:46,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-06 07:34:46,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:46,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764757919] [2022-12-06 07:34:46,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764757919] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:46,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:46,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:46,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155392217] [2022-12-06 07:34:46,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:46,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:46,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:46,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:46,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:46,040 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:46,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:46,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:46,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:46,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:46,075 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:46,075 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:46,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:46,076 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:46,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:46,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:46,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:46,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:46,076 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:46,076 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:46,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:46,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:46,077 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:46,077 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:46,077 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:46,077 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:46,077 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:46,077 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:46,077 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:46,078 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:46,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:46,080 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:46,080 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:46,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:46,080 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:46,080 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:46,154 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:46,155 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:46,155 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:46,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:46,156 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:46,156 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:46,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2946 [2022-12-06 07:34:46,156 INFO L420 AbstractCegarLoop]: === Iteration 2948 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:46,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:46,156 INFO L85 PathProgramCache]: Analyzing trace with hash -148934974, now seen corresponding path program 1 times [2022-12-06 07:34:46,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:46,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527636827] [2022-12-06 07:34:46,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:46,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:46,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:46,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-06 07:34:46,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:46,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527636827] [2022-12-06 07:34:46,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527636827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:46,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:46,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:46,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550067848] [2022-12-06 07:34:46,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:46,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:46,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:46,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:46,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:46,236 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:46,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:46,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:46,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:46,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:46,272 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:46,272 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:46,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:46,273 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:46,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:46,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:46,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:46,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:46,273 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:46,273 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:46,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:46,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:46,274 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:46,274 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:46,274 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:46,274 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:46,274 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:46,274 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:46,274 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:46,274 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:46,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:46,276 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:46,277 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:46,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:46,277 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:46,277 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:46,350 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:46,351 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:46,351 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:46,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:46,351 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:46,351 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:46,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2947 [2022-12-06 07:34:46,351 INFO L420 AbstractCegarLoop]: === Iteration 2949 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:46,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:46,352 INFO L85 PathProgramCache]: Analyzing trace with hash -122152865, now seen corresponding path program 1 times [2022-12-06 07:34:46,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:46,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190142009] [2022-12-06 07:34:46,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:46,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:46,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:46,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-06 07:34:46,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:46,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190142009] [2022-12-06 07:34:46,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190142009] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:46,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:46,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:46,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934695178] [2022-12-06 07:34:46,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:46,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:46,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:46,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:46,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:46,421 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:46,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:46,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:46,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:46,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:46,457 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:46,457 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:46,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:46,457 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:46,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:46,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:46,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:46,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:46,458 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:46,458 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:46,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:46,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:46,459 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:46,459 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:46,459 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:46,459 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:46,459 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:46,459 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:46,459 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:46,459 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:46,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:46,461 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:46,461 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:46,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:46,462 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:46,462 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:46,534 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:46,535 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:34:46,535 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:46,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:46,536 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:46,536 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:46,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2948 [2022-12-06 07:34:46,536 INFO L420 AbstractCegarLoop]: === Iteration 2950 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:46,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:46,536 INFO L85 PathProgramCache]: Analyzing trace with hash -91676672, now seen corresponding path program 1 times [2022-12-06 07:34:46,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:46,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793402359] [2022-12-06 07:34:46,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:46,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:46,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:46,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:46,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:46,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793402359] [2022-12-06 07:34:46,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793402359] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:46,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:46,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:46,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006307841] [2022-12-06 07:34:46,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:46,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:46,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:46,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:46,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:46,606 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:46,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:46,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:46,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:46,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:46,648 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:46,648 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:46,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:46,649 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:46,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:46,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:46,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:46,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:46,649 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:46,649 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:46,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:46,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:46,650 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:46,650 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:46,650 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:46,650 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:46,650 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:46,650 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:46,650 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:46,650 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:46,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:46,652 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:46,653 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:46,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:46,653 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:46,653 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:46,727 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:46,728 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:46,728 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:46,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:46,729 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:46,729 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:46,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2949 [2022-12-06 07:34:46,729 INFO L420 AbstractCegarLoop]: === Iteration 2951 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:46,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:46,729 INFO L85 PathProgramCache]: Analyzing trace with hash -64894563, now seen corresponding path program 1 times [2022-12-06 07:34:46,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:46,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581994643] [2022-12-06 07:34:46,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:46,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:46,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-06 07:34:46,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:46,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581994643] [2022-12-06 07:34:46,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581994643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:46,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:46,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:46,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047723046] [2022-12-06 07:34:46,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:46,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:46,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:46,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:46,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:46,800 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:46,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:46,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:46,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:46,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:46,839 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:46,839 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:46,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:46,840 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:46,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:46,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:46,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:46,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:46,840 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:46,840 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:46,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:46,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:46,841 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:46,841 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:46,841 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:46,841 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:46,841 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:46,841 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:46,841 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:46,841 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:46,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:46,843 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:46,844 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:46,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:46,844 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:46,844 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:46,917 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:46,918 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:46,918 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:46,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:46,918 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:46,918 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:46,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2950 [2022-12-06 07:34:46,919 INFO L420 AbstractCegarLoop]: === Iteration 2952 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:46,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:46,919 INFO L85 PathProgramCache]: Analyzing trace with hash -34418370, now seen corresponding path program 1 times [2022-12-06 07:34:46,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:46,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274304436] [2022-12-06 07:34:46,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:46,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:46,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-06 07:34:46,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:46,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274304436] [2022-12-06 07:34:46,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274304436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:46,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:46,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:46,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680424289] [2022-12-06 07:34:46,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:46,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:46,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:46,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:46,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:46,985 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:46,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:46,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:46,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:46,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:47,022 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:47,022 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:47,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:47,022 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:47,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:47,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:47,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:47,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:47,023 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:47,023 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:47,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:47,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:47,023 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:47,024 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:47,024 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:47,024 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:47,024 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:47,024 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:47,024 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:47,024 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:47,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:47,026 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:47,026 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:47,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:47,026 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:47,026 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:47,100 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:47,101 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:47,101 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:47,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:47,101 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:47,102 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:47,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2951 [2022-12-06 07:34:47,102 INFO L420 AbstractCegarLoop]: === Iteration 2953 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:47,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:47,102 INFO L85 PathProgramCache]: Analyzing trace with hash -7636261, now seen corresponding path program 1 times [2022-12-06 07:34:47,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:47,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005841417] [2022-12-06 07:34:47,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:47,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:47,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-06 07:34:47,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:47,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005841417] [2022-12-06 07:34:47,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005841417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:47,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:47,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:47,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369220439] [2022-12-06 07:34:47,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:47,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:47,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:47,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:47,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:47,170 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:47,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:47,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:47,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:47,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:47,211 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:47,211 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:47,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:47,212 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:47,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:47,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:47,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:47,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:47,212 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:47,212 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:47,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:47,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:47,213 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:47,213 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:47,213 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:47,213 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:47,213 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:47,213 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:47,213 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:47,213 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:47,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:47,216 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:47,216 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:47,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:47,216 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:47,216 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:47,291 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:47,293 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:34:47,293 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:47,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:47,293 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:47,293 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:47,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2952 [2022-12-06 07:34:47,293 INFO L420 AbstractCegarLoop]: === Iteration 2954 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:47,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:47,293 INFO L85 PathProgramCache]: Analyzing trace with hash 22839932, now seen corresponding path program 1 times [2022-12-06 07:34:47,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:47,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36817740] [2022-12-06 07:34:47,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:47,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:47,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-06 07:34:47,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:47,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36817740] [2022-12-06 07:34:47,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36817740] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:47,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:47,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:47,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838155469] [2022-12-06 07:34:47,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:47,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:47,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:47,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:47,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:47,360 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:47,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:47,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:47,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:47,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:47,395 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:47,395 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:47,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:47,396 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:47,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:47,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:47,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:47,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:47,396 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:47,396 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:47,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:47,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:47,397 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:47,397 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:47,397 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:47,397 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:47,397 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:47,397 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:47,398 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:47,398 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:47,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:47,400 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:47,400 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:47,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:47,400 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:47,400 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:47,474 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:47,475 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:47,475 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:47,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:47,475 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:47,475 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:47,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2953 [2022-12-06 07:34:47,475 INFO L420 AbstractCegarLoop]: === Iteration 2955 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:47,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:47,475 INFO L85 PathProgramCache]: Analyzing trace with hash 49622041, now seen corresponding path program 1 times [2022-12-06 07:34:47,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:47,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860531549] [2022-12-06 07:34:47,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:47,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:47,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-06 07:34:47,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:47,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860531549] [2022-12-06 07:34:47,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860531549] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:47,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:47,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:47,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107723392] [2022-12-06 07:34:47,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:47,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:47,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:47,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:47,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:47,557 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:47,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:47,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:47,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:47,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:47,597 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:47,597 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:47,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:47,598 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:47,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:47,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:47,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:47,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:47,598 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:47,598 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:47,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:47,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:47,599 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:47,599 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:47,599 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:47,599 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:47,599 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:47,600 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:47,600 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:47,600 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:47,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:47,602 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:47,602 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:47,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:47,602 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:47,602 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:47,676 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:47,677 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:47,677 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:47,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:47,677 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:47,677 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:47,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2954 [2022-12-06 07:34:47,677 INFO L420 AbstractCegarLoop]: === Iteration 2956 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:47,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:47,678 INFO L85 PathProgramCache]: Analyzing trace with hash 80098234, now seen corresponding path program 1 times [2022-12-06 07:34:47,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:47,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364902616] [2022-12-06 07:34:47,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:47,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:47,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-06 07:34:47,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:47,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364902616] [2022-12-06 07:34:47,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364902616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:47,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:47,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:47,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054637942] [2022-12-06 07:34:47,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:47,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:47,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:47,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:47,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:47,743 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:47,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:47,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:47,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:47,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:47,778 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:47,778 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:47,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:47,779 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:47,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:47,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:47,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:47,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:47,779 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:47,779 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:47,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:47,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:47,780 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:47,780 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:47,780 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:47,780 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:47,780 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:47,781 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:47,781 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:47,781 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:47,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:47,783 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:47,783 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:47,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:47,783 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:47,783 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:47,856 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:47,857 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:47,857 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:47,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:47,857 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:47,857 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:47,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2955 [2022-12-06 07:34:47,857 INFO L420 AbstractCegarLoop]: === Iteration 2957 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:47,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:47,858 INFO L85 PathProgramCache]: Analyzing trace with hash 106880343, now seen corresponding path program 1 times [2022-12-06 07:34:47,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:47,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871288356] [2022-12-06 07:34:47,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:47,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:47,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:47,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:47,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871288356] [2022-12-06 07:34:47,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871288356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:47,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:47,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:47,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771153935] [2022-12-06 07:34:47,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:47,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:47,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:47,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:47,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:47,926 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:47,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:47,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:47,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:47,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:47,961 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:47,961 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:47,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:47,962 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:47,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:47,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:47,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:47,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:47,962 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:47,962 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:47,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:47,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:47,963 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:47,963 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:47,963 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:47,963 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:47,963 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:47,964 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:47,964 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:47,964 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:47,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:47,966 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:47,966 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:47,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:47,966 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:47,966 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:48,039 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:48,040 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:48,040 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:48,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:48,040 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:48,040 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:48,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2956 [2022-12-06 07:34:48,041 INFO L420 AbstractCegarLoop]: === Iteration 2958 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:48,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:48,041 INFO L85 PathProgramCache]: Analyzing trace with hash 137356536, now seen corresponding path program 1 times [2022-12-06 07:34:48,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:48,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005720255] [2022-12-06 07:34:48,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:48,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:48,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:48,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:48,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005720255] [2022-12-06 07:34:48,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005720255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:48,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:48,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:48,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667854836] [2022-12-06 07:34:48,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:48,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:48,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:48,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:48,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:48,108 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:48,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:48,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:48,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:48,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:48,149 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:48,149 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:48,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:48,150 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:48,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:48,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:48,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:48,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:48,150 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:48,150 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:48,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:48,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:48,151 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:48,151 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:48,151 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:48,151 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:48,151 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:48,151 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:48,151 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:48,151 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:48,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:48,153 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:48,154 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:48,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:48,154 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:48,154 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:48,227 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:48,228 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:48,228 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:48,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:48,228 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:48,228 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:48,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2957 [2022-12-06 07:34:48,228 INFO L420 AbstractCegarLoop]: === Iteration 2959 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:48,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:48,228 INFO L85 PathProgramCache]: Analyzing trace with hash 164138645, now seen corresponding path program 1 times [2022-12-06 07:34:48,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:48,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087976843] [2022-12-06 07:34:48,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:48,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:48,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-06 07:34:48,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:48,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087976843] [2022-12-06 07:34:48,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087976843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:48,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:48,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:48,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053596167] [2022-12-06 07:34:48,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:48,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:48,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:48,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:48,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:48,297 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:48,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:48,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:48,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:48,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:48,333 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:48,333 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:48,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:48,334 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:48,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:48,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:48,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:48,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:48,334 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:48,334 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:48,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:48,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:48,335 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:48,335 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:48,335 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:48,335 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:48,335 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:48,335 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:48,335 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:48,336 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:48,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:48,338 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:48,338 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:48,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:48,338 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:48,338 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:48,411 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:48,412 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:48,412 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:48,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:48,413 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:48,413 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:48,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2958 [2022-12-06 07:34:48,413 INFO L420 AbstractCegarLoop]: === Iteration 2960 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:48,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:48,413 INFO L85 PathProgramCache]: Analyzing trace with hash 194614838, now seen corresponding path program 1 times [2022-12-06 07:34:48,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:48,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625325517] [2022-12-06 07:34:48,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:48,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:48,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-06 07:34:48,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:48,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625325517] [2022-12-06 07:34:48,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625325517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:48,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:48,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:48,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178899917] [2022-12-06 07:34:48,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:48,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:48,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:48,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:48,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:48,481 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:48,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:48,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:48,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:48,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:48,517 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:48,517 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:48,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:48,517 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:48,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:48,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:48,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:48,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:48,518 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:48,518 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:48,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:48,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:48,519 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:48,519 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:48,519 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:48,519 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:48,519 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:48,519 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:48,519 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:48,519 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:48,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:48,521 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:48,521 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:48,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:48,522 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:48,522 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:48,595 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:48,596 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:48,596 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:48,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:48,596 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:48,596 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:48,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2959 [2022-12-06 07:34:48,596 INFO L420 AbstractCegarLoop]: === Iteration 2961 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:48,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:48,597 INFO L85 PathProgramCache]: Analyzing trace with hash 221396947, now seen corresponding path program 1 times [2022-12-06 07:34:48,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:48,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330287079] [2022-12-06 07:34:48,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:48,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:48,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-06 07:34:48,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:48,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330287079] [2022-12-06 07:34:48,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330287079] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:48,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:48,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:48,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049993939] [2022-12-06 07:34:48,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:48,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:48,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:48,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:48,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:48,680 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:48,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:48,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:48,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:48,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:48,720 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:48,721 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:48,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:48,721 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:48,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:48,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:48,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:48,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:48,721 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:48,722 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:48,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:48,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:48,722 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:48,722 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:48,722 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:48,722 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:48,723 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:48,723 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:48,723 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:48,723 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:48,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:48,725 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:48,725 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:48,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:48,725 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:48,725 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:48,817 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:48,819 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 07:34:48,819 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:48,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:48,819 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:48,819 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:48,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2960 [2022-12-06 07:34:48,819 INFO L420 AbstractCegarLoop]: === Iteration 2962 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:48,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:48,819 INFO L85 PathProgramCache]: Analyzing trace with hash 251873140, now seen corresponding path program 1 times [2022-12-06 07:34:48,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:48,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916425378] [2022-12-06 07:34:48,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:48,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:48,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:48,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:48,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916425378] [2022-12-06 07:34:48,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916425378] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:48,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:48,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:48,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250355397] [2022-12-06 07:34:48,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:48,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:48,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:48,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:48,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:48,886 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:48,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:48,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:48,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:48,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:48,921 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:48,922 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:48,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:48,922 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:48,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:48,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:48,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:48,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:48,923 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:48,923 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:48,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:48,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:48,923 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:48,923 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:48,923 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:48,924 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:48,924 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:48,924 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:48,924 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:48,924 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:48,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:48,926 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:48,926 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:48,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:48,926 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:48,926 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:48,999 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:49,000 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:34:49,001 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:49,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:49,001 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:49,001 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:49,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2961 [2022-12-06 07:34:49,001 INFO L420 AbstractCegarLoop]: === Iteration 2963 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:49,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:49,001 INFO L85 PathProgramCache]: Analyzing trace with hash 278655249, now seen corresponding path program 1 times [2022-12-06 07:34:49,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:49,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976874681] [2022-12-06 07:34:49,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:49,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34: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-06 07:34:49,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:49,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976874681] [2022-12-06 07:34:49,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976874681] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:49,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:49,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:49,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902049167] [2022-12-06 07:34:49,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:49,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:49,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:49,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:49,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:49,072 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:49,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:49,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:49,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:49,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:49,112 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:49,113 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:49,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:49,113 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:49,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:49,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:49,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:49,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:49,113 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:49,114 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:49,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:49,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:49,114 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:49,114 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:49,114 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:49,114 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:49,114 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:49,115 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:49,115 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:49,115 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:49,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:49,117 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:49,117 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:49,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:49,117 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:49,117 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:49,191 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:49,192 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:49,192 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:49,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:49,192 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:49,192 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:49,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2962 [2022-12-06 07:34:49,192 INFO L420 AbstractCegarLoop]: === Iteration 2964 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:49,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:49,193 INFO L85 PathProgramCache]: Analyzing trace with hash 309131442, now seen corresponding path program 1 times [2022-12-06 07:34:49,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:49,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839482391] [2022-12-06 07:34:49,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:49,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:49,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-06 07:34:49,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:49,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839482391] [2022-12-06 07:34:49,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839482391] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:49,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:49,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:49,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787572064] [2022-12-06 07:34:49,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:49,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:49,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:49,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:49,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:49,258 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:49,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:49,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:49,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:49,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:49,298 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:49,299 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:49,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:49,299 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:49,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:49,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:49,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:49,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:49,300 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:49,300 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:49,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:49,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:49,300 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:49,300 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:49,300 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:49,300 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:49,301 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:49,301 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:49,301 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:49,301 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:49,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:49,303 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:49,303 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:49,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:49,303 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:49,303 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:49,376 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:49,377 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:49,378 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:49,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:49,378 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:49,378 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:49,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2963 [2022-12-06 07:34:49,378 INFO L420 AbstractCegarLoop]: === Iteration 2965 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:49,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:49,378 INFO L85 PathProgramCache]: Analyzing trace with hash 335913551, now seen corresponding path program 1 times [2022-12-06 07:34:49,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:49,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729931132] [2022-12-06 07:34:49,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:49,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:49,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-06 07:34:49,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:49,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729931132] [2022-12-06 07:34:49,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729931132] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:49,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:49,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:49,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291537760] [2022-12-06 07:34:49,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:49,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:49,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:49,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:49,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:49,447 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:49,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:49,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:49,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:49,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:49,488 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:49,488 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:49,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:49,488 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:49,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:49,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:49,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:49,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:49,489 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:49,489 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:49,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:49,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:49,489 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:49,490 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:49,490 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:49,490 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:49,490 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:49,490 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:49,490 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:49,490 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:49,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:49,492 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:49,492 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:49,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:49,492 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:49,492 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:49,565 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:49,566 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:34:49,566 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:49,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:49,566 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:49,566 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:49,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2964 [2022-12-06 07:34:49,566 INFO L420 AbstractCegarLoop]: === Iteration 2966 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:49,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:49,566 INFO L85 PathProgramCache]: Analyzing trace with hash 366389744, now seen corresponding path program 1 times [2022-12-06 07:34:49,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:49,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494309368] [2022-12-06 07:34:49,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:49,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:49,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-06 07:34:49,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:49,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494309368] [2022-12-06 07:34:49,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494309368] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:49,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:49,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:49,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727340124] [2022-12-06 07:34:49,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:49,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:49,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:49,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:49,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:49,632 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:49,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:49,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:49,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:49,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:49,673 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:49,674 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:49,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:49,674 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:49,674 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:49,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:49,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:49,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:49,675 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:49,675 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:49,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:49,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:49,675 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:49,675 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:49,676 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:49,676 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:49,676 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:49,676 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:49,676 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:49,676 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:49,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:49,678 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:49,678 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:49,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:49,678 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:49,678 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:49,753 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:49,754 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:49,754 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:49,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:49,754 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:49,754 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:49,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2965 [2022-12-06 07:34:49,754 INFO L420 AbstractCegarLoop]: === Iteration 2967 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:49,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:49,754 INFO L85 PathProgramCache]: Analyzing trace with hash 393171853, now seen corresponding path program 1 times [2022-12-06 07:34:49,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:49,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914371448] [2022-12-06 07:34:49,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:49,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:49,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-06 07:34:49,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:49,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914371448] [2022-12-06 07:34:49,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914371448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:49,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:49,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:49,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301220600] [2022-12-06 07:34:49,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:49,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:49,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:49,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:49,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:49,824 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:49,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:49,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:49,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:49,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:49,864 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:49,864 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:49,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:49,865 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:49,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:49,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:49,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:49,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:49,865 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:49,866 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:49,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:49,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:49,866 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:49,866 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:49,866 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:49,866 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:49,867 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:49,867 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:49,867 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:49,867 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:49,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:49,869 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:49,869 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:49,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:49,869 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:49,869 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:49,943 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:49,944 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:49,944 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:49,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:49,944 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:49,944 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:49,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2966 [2022-12-06 07:34:49,944 INFO L420 AbstractCegarLoop]: === Iteration 2968 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:49,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:49,944 INFO L85 PathProgramCache]: Analyzing trace with hash 423648046, now seen corresponding path program 1 times [2022-12-06 07:34:49,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:49,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898269887] [2022-12-06 07:34:49,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:49,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:50,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-06 07:34:50,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:50,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898269887] [2022-12-06 07:34:50,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898269887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:50,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:50,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:50,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795498860] [2022-12-06 07:34:50,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:50,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:50,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:50,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:50,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:50,024 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:50,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:50,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:50,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:50,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:50,066 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:50,066 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:50,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:50,066 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:50,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:50,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:50,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:50,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:50,067 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:50,067 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:50,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:50,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:50,068 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:50,068 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:50,068 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:50,068 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:50,068 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:50,068 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:50,068 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:50,068 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:50,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:50,070 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:50,070 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:50,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 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 116. Up to 16 conditions per place. [2022-12-06 07:34:50,071 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:50,071 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:50,144 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:50,146 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:50,146 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:50,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:50,146 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:50,146 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:50,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2967 [2022-12-06 07:34:50,146 INFO L420 AbstractCegarLoop]: === Iteration 2969 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:50,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:50,146 INFO L85 PathProgramCache]: Analyzing trace with hash 450430155, now seen corresponding path program 1 times [2022-12-06 07:34:50,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:50,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995685212] [2022-12-06 07:34:50,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:50,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:50,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-06 07:34:50,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:50,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995685212] [2022-12-06 07:34:50,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995685212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:50,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:50,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:50,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713118713] [2022-12-06 07:34:50,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:50,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:50,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:50,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:50,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:50,215 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:50,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:50,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:50,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:50,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:50,250 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:50,250 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:50,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:50,251 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:50,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:50,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:50,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:50,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:50,251 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:50,251 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:50,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:50,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:50,252 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:50,252 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:50,252 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:50,252 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:50,252 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:50,252 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:50,252 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:50,252 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:50,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:50,255 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:50,255 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:50,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:50,255 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:50,255 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:50,329 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:50,330 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:50,330 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:50,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:50,330 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:50,330 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:50,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2968 [2022-12-06 07:34:50,330 INFO L420 AbstractCegarLoop]: === Iteration 2970 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:50,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:50,330 INFO L85 PathProgramCache]: Analyzing trace with hash 480906348, now seen corresponding path program 1 times [2022-12-06 07:34:50,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:50,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319707526] [2022-12-06 07:34:50,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:50,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:50,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-06 07:34:50,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:50,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319707526] [2022-12-06 07:34:50,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319707526] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:50,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:50,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:50,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004720174] [2022-12-06 07:34:50,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:50,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:50,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:50,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:50,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:50,398 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:50,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:50,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:50,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:50,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:50,440 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:50,440 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:50,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:50,440 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:50,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:50,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:50,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:50,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:50,441 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:50,441 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:50,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:50,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:50,441 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:50,441 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:50,442 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:50,442 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:50,442 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:50,442 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:50,442 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:50,442 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:50,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:50,444 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:50,444 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:50,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:50,444 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:50,444 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:50,519 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:50,520 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:50,520 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:50,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:50,520 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:50,520 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:50,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2969 [2022-12-06 07:34:50,520 INFO L420 AbstractCegarLoop]: === Iteration 2971 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:50,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:50,520 INFO L85 PathProgramCache]: Analyzing trace with hash 507688457, now seen corresponding path program 1 times [2022-12-06 07:34:50,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:50,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754597996] [2022-12-06 07:34:50,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:50,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:50,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-06 07:34:50,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:50,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754597996] [2022-12-06 07:34:50,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754597996] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:50,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:50,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:50,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473902293] [2022-12-06 07:34:50,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:50,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:50,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:50,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:50,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:50,591 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:50,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:50,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:50,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:50,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:50,625 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:50,625 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:50,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 380 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:50,626 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:50,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:50,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:50,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:50,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:50,626 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:50,626 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:50,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:50,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:50,627 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:50,627 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:50,627 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:50,627 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:50,627 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:50,627 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:50,628 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:50,628 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:50,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:50,630 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:50,630 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:50,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:50,630 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:50,630 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:50,704 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:50,705 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:50,705 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:50,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:50,705 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:50,705 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:50,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2970 [2022-12-06 07:34:50,706 INFO L420 AbstractCegarLoop]: === Iteration 2972 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:50,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:50,706 INFO L85 PathProgramCache]: Analyzing trace with hash 538164650, now seen corresponding path program 1 times [2022-12-06 07:34:50,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:50,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859024964] [2022-12-06 07:34:50,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:50,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:50,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:50,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:50,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859024964] [2022-12-06 07:34:50,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859024964] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:50,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:50,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:50,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403935329] [2022-12-06 07:34:50,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:50,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:50,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:50,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:50,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:50,775 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:50,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:50,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:50,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:50,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:50,816 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:50,816 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:50,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:50,817 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:50,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:50,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:50,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:50,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:50,817 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:50,817 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:50,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:50,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:50,818 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:50,818 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:50,818 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:50,818 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:50,818 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:50,818 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:50,819 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:50,819 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:50,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:50,821 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:50,821 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:50,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:50,821 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:50,821 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:50,894 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:50,895 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:50,896 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:50,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:50,896 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:50,896 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:50,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2971 [2022-12-06 07:34:50,896 INFO L420 AbstractCegarLoop]: === Iteration 2973 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:50,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:50,896 INFO L85 PathProgramCache]: Analyzing trace with hash 564946759, now seen corresponding path program 1 times [2022-12-06 07:34:50,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:50,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776898769] [2022-12-06 07:34:50,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:50,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:50,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:50,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-06 07:34:50,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:50,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776898769] [2022-12-06 07:34:50,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776898769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:50,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:50,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:50,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150146952] [2022-12-06 07:34:50,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:50,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:50,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:50,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:50,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:50,967 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:50,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:50,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:50,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:50,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:51,007 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:51,008 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:51,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:51,008 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:51,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:51,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:51,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:51,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:51,009 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:51,009 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:51,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:51,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:51,009 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:51,009 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:51,009 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:51,010 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:51,010 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:51,010 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:51,010 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:51,010 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:51,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:51,012 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:51,012 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:51,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:51,012 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:51,012 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:51,090 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:51,091 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:34:51,091 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:51,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:51,091 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:51,091 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:51,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2972 [2022-12-06 07:34:51,092 INFO L420 AbstractCegarLoop]: === Iteration 2974 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:51,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:51,092 INFO L85 PathProgramCache]: Analyzing trace with hash 595422952, now seen corresponding path program 1 times [2022-12-06 07:34:51,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:51,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777080963] [2022-12-06 07:34:51,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:51,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:51,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-06 07:34:51,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:51,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777080963] [2022-12-06 07:34:51,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777080963] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:51,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:51,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:51,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096164430] [2022-12-06 07:34:51,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:51,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:51,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:51,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:51,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:51,190 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:51,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:51,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:51,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:51,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:51,231 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:51,231 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:51,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:51,232 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:51,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:51,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:51,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:51,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:51,232 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:51,232 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:51,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:51,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:51,233 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:51,233 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:51,233 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:51,233 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:51,233 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:51,233 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:51,233 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:51,233 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:51,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:51,235 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:51,235 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:51,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:51,236 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:51,236 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:51,308 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:51,309 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:34:51,309 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:51,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:51,309 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:51,310 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:51,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2973 [2022-12-06 07:34:51,310 INFO L420 AbstractCegarLoop]: === Iteration 2975 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:51,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:51,310 INFO L85 PathProgramCache]: Analyzing trace with hash 622205061, now seen corresponding path program 1 times [2022-12-06 07:34:51,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:51,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723779183] [2022-12-06 07:34:51,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:51,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:51,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34: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-06 07:34:51,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:51,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723779183] [2022-12-06 07:34:51,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723779183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:51,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:51,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:51,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229162762] [2022-12-06 07:34:51,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:51,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:51,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:51,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:51,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:51,380 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:51,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:51,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:51,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:51,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:51,416 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:51,416 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:51,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:51,417 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:51,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:51,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:51,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:51,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:51,417 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:51,417 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:51,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:51,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:51,418 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:51,418 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:51,418 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:51,418 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:51,418 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:51,418 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:51,418 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:51,419 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:51,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:51,421 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:51,421 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:51,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:51,421 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:51,421 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:51,493 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:51,494 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:34:51,494 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:51,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:51,494 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:51,494 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:51,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2974 [2022-12-06 07:34:51,494 INFO L420 AbstractCegarLoop]: === Iteration 2976 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:51,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:51,495 INFO L85 PathProgramCache]: Analyzing trace with hash 652681254, now seen corresponding path program 1 times [2022-12-06 07:34:51,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:51,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467831633] [2022-12-06 07:34:51,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:51,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:51,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-06 07:34:51,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:51,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467831633] [2022-12-06 07:34:51,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467831633] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:51,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:51,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:51,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440662210] [2022-12-06 07:34:51,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:51,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:51,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:51,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:51,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:51,563 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:51,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:51,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:51,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:51,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:51,604 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:51,604 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:51,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:51,604 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:51,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:51,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:51,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:51,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:51,605 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:51,605 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:51,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:51,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:51,606 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:51,606 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:51,606 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:51,606 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:51,606 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:51,606 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:51,606 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:51,606 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:51,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:51,608 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:51,608 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:51,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:51,608 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:51,609 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:51,681 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:51,682 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:34:51,682 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:51,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:51,682 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:51,682 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:51,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2975 [2022-12-06 07:34:51,683 INFO L420 AbstractCegarLoop]: === Iteration 2977 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:51,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:51,683 INFO L85 PathProgramCache]: Analyzing trace with hash 679463363, now seen corresponding path program 1 times [2022-12-06 07:34:51,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:51,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923899974] [2022-12-06 07:34:51,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:51,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:51,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-06 07:34:51,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:51,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923899974] [2022-12-06 07:34:51,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923899974] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:51,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:51,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:51,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890427698] [2022-12-06 07:34:51,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:51,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:51,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:51,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:51,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:51,754 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:51,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:51,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:51,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:51,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:51,806 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:51,806 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:51,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:51,806 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:51,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:51,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:51,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:51,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:51,807 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:51,807 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:51,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:51,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:51,808 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:51,808 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:51,808 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:51,808 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:51,808 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:51,808 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:51,809 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:51,809 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:51,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:51,811 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:51,811 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:51,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:51,812 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:51,812 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:51,905 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:51,906 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 07:34:51,906 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:51,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:51,906 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:51,906 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:51,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2976 [2022-12-06 07:34:51,906 INFO L420 AbstractCegarLoop]: === Iteration 2978 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:51,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:51,907 INFO L85 PathProgramCache]: Analyzing trace with hash 709939556, now seen corresponding path program 1 times [2022-12-06 07:34:51,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:51,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522911129] [2022-12-06 07:34:51,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:51,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:51,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-06 07:34:51,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:51,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522911129] [2022-12-06 07:34:51,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522911129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:51,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:51,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:51,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709641475] [2022-12-06 07:34:51,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:51,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:51,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:51,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:51,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:51,990 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:51,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:51,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:51,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:51,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:52,037 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:52,037 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:52,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:52,038 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:52,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:52,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:52,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:52,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:52,038 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:52,038 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:52,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:52,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:52,039 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:52,039 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:52,039 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:52,040 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:52,040 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:52,040 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:52,040 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:52,040 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:52,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:52,043 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:52,043 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:52,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:52,043 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:52,043 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:52,134 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:52,136 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 07:34:52,136 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:52,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:52,136 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:52,136 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:52,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2977 [2022-12-06 07:34:52,136 INFO L420 AbstractCegarLoop]: === Iteration 2979 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:52,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:52,136 INFO L85 PathProgramCache]: Analyzing trace with hash 736721665, now seen corresponding path program 1 times [2022-12-06 07:34:52,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:52,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484668554] [2022-12-06 07:34:52,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:52,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:52,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-06 07:34:52,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:52,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484668554] [2022-12-06 07:34:52,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484668554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:52,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:52,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:52,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311620016] [2022-12-06 07:34:52,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:52,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:52,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:52,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:52,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:52,228 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:52,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:52,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:52,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:52,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:52,284 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:52,284 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:52,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:52,285 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:52,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:52,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:52,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:52,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:52,285 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:52,285 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:52,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:52,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:52,286 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:52,286 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:52,286 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:52,286 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:52,286 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:52,287 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:52,287 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:52,287 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:52,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:52,290 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:52,290 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:52,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:52,290 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:52,290 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:52,374 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:52,376 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-06 07:34:52,376 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:52,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:52,376 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:52,376 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:52,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2978 [2022-12-06 07:34:52,376 INFO L420 AbstractCegarLoop]: === Iteration 2980 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:52,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:52,376 INFO L85 PathProgramCache]: Analyzing trace with hash 767197858, now seen corresponding path program 1 times [2022-12-06 07:34:52,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:52,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163895610] [2022-12-06 07:34:52,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:52,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:52,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-06 07:34:52,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:52,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163895610] [2022-12-06 07:34:52,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163895610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:52,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:52,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:52,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959359866] [2022-12-06 07:34:52,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:52,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:52,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:52,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:52,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:52,443 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:52,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:52,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:52,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:52,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:52,479 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:52,479 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:52,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:52,480 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:52,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:52,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:52,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:52,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:52,480 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:52,480 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:52,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:52,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:52,481 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:52,481 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:52,481 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:52,481 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:52,481 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:52,481 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:52,481 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:52,481 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:52,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:52,483 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:52,484 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:52,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:52,484 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:52,484 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:52,556 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:52,558 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:52,558 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:52,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:52,558 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:52,558 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:52,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2979 [2022-12-06 07:34:52,558 INFO L420 AbstractCegarLoop]: === Iteration 2981 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:52,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:52,558 INFO L85 PathProgramCache]: Analyzing trace with hash 793979967, now seen corresponding path program 1 times [2022-12-06 07:34:52,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:52,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088862825] [2022-12-06 07:34:52,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:52,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:52,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-06 07:34:52,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:52,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088862825] [2022-12-06 07:34:52,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088862825] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:52,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:52,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:52,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022642004] [2022-12-06 07:34:52,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:52,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:52,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:52,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:52,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:52,646 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:52,646 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:52,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:52,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:52,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:52,694 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:52,694 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:52,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:52,694 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:52,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:52,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:52,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:52,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:52,695 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:52,695 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:52,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:52,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:52,696 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:52,696 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:52,696 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:52,696 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:52,696 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:52,696 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:52,697 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:52,697 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:52,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:52,699 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:52,699 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:52,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:52,700 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:52,700 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:52,780 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:52,781 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 07:34:52,781 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:52,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:52,781 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:52,781 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:52,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2980 [2022-12-06 07:34:52,782 INFO L420 AbstractCegarLoop]: === Iteration 2982 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:52,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:52,782 INFO L85 PathProgramCache]: Analyzing trace with hash 824456160, now seen corresponding path program 1 times [2022-12-06 07:34:52,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:52,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069983159] [2022-12-06 07:34:52,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:52,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:52,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-06 07:34:52,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:52,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069983159] [2022-12-06 07:34:52,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069983159] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:52,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:52,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:52,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397004733] [2022-12-06 07:34:52,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:52,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:52,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:52,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:52,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:52,847 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:52,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:52,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:52,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:52,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:52,887 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:52,887 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:52,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:52,888 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:52,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:52,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:52,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:52,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:52,888 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:52,888 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:52,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:52,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:52,889 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:52,889 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:52,889 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:52,889 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:52,889 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:52,889 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:52,889 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:52,890 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:52,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:52,892 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:52,892 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:52,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:52,892 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:52,892 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:52,966 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:52,967 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:52,967 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:52,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:52,967 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:52,967 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:52,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2981 [2022-12-06 07:34:52,967 INFO L420 AbstractCegarLoop]: === Iteration 2983 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:52,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:52,968 INFO L85 PathProgramCache]: Analyzing trace with hash 851238269, now seen corresponding path program 1 times [2022-12-06 07:34:52,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:52,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43164662] [2022-12-06 07:34:52,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:52,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34: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-06 07:34:53,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:53,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43164662] [2022-12-06 07:34:53,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43164662] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:53,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:53,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:53,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408972356] [2022-12-06 07:34:53,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:53,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:53,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:53,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:53,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:53,041 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:53,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:53,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:53,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:53,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:53,082 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:53,082 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:53,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 370 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:53,082 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:53,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:53,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:53,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:53,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:53,083 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:53,083 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:53,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:53,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:53,084 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:53,084 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:53,084 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:53,084 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:53,084 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:53,084 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:53,084 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:53,084 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:53,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:53,086 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:53,086 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:53,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:53,087 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:53,087 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:53,159 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:53,160 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:34:53,160 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:53,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:53,160 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:53,160 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:53,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2982 [2022-12-06 07:34:53,161 INFO L420 AbstractCegarLoop]: === Iteration 2984 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:53,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:53,161 INFO L85 PathProgramCache]: Analyzing trace with hash 881714462, now seen corresponding path program 1 times [2022-12-06 07:34:53,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:53,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131363103] [2022-12-06 07:34:53,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:53,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:53,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:53,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-06 07:34:53,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:53,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131363103] [2022-12-06 07:34:53,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131363103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:53,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:53,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:53,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118654536] [2022-12-06 07:34:53,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:53,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:53,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:53,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:53,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:53,226 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:53,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:53,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:53,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:53,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:53,268 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:53,269 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:53,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:53,269 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:53,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:53,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:53,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:53,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:53,270 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:53,270 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:53,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:53,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:53,270 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:53,270 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:53,270 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:53,271 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:53,271 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:53,271 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:53,271 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:53,271 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:53,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:53,273 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:53,273 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:53,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:53,273 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:53,273 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:53,349 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:53,350 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:53,350 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:53,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:53,350 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:53,350 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:53,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2983 [2022-12-06 07:34:53,350 INFO L420 AbstractCegarLoop]: === Iteration 2985 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:53,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:53,350 INFO L85 PathProgramCache]: Analyzing trace with hash 908496571, now seen corresponding path program 1 times [2022-12-06 07:34:53,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:53,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856761966] [2022-12-06 07:34:53,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:53,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:53,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-06 07:34:53,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:53,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856761966] [2022-12-06 07:34:53,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856761966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:53,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:53,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:53,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966490851] [2022-12-06 07:34:53,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:53,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:53,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:53,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:53,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:53,420 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:53,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:53,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:53,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:53,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:53,455 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:53,455 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:53,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:53,456 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:53,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:53,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:53,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:53,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:53,456 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:53,456 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:53,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:53,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:53,457 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:53,457 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:53,457 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:53,457 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:53,457 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:53,458 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:53,458 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:53,458 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:53,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:53,460 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:53,460 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:53,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 144 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:53,460 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:53,460 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:53,534 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:53,535 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:53,535 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:53,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:53,535 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:53,535 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:53,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2984 [2022-12-06 07:34:53,535 INFO L420 AbstractCegarLoop]: === Iteration 2986 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:53,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:53,535 INFO L85 PathProgramCache]: Analyzing trace with hash 938972764, now seen corresponding path program 1 times [2022-12-06 07:34:53,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:53,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254301902] [2022-12-06 07:34:53,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:53,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:53,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:53,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-06 07:34:53,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:53,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254301902] [2022-12-06 07:34:53,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254301902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:53,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:53,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:53,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460148418] [2022-12-06 07:34:53,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:53,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:53,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:53,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:53,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:53,610 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:53,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:53,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:53,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:53,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:53,650 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:53,651 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:53,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:53,651 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:53,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:53,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:53,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:53,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:53,652 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:53,652 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:53,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:53,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:53,652 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:53,652 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:53,652 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:53,652 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:53,653 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:53,653 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:53,653 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:53,653 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:53,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:53,655 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:53,655 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:53,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:53,655 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:53,655 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:53,729 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:53,731 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:53,731 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:53,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:53,731 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:53,731 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:53,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2985 [2022-12-06 07:34:53,731 INFO L420 AbstractCegarLoop]: === Iteration 2987 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:53,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:53,731 INFO L85 PathProgramCache]: Analyzing trace with hash 965754873, now seen corresponding path program 1 times [2022-12-06 07:34:53,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:53,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725220001] [2022-12-06 07:34:53,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:53,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:53,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-06 07:34:53,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:53,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725220001] [2022-12-06 07:34:53,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725220001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:53,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:53,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:53,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912973061] [2022-12-06 07:34:53,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:53,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:53,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:53,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:53,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:53,804 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:53,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:53,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:53,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:53,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:53,854 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:53,854 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:53,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:53,854 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:53,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:53,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:53,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:53,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:53,855 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:53,855 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:53,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:53,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:53,856 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:53,856 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:53,856 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:53,856 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:53,856 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:53,856 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:53,856 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:53,856 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:53,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:53,858 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:53,858 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:53,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:53,859 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:53,859 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:53,957 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:53,958 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-06 07:34:53,958 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:53,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:53,959 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:53,959 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:53,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2986 [2022-12-06 07:34:53,959 INFO L420 AbstractCegarLoop]: === Iteration 2988 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:53,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:53,959 INFO L85 PathProgramCache]: Analyzing trace with hash 996231066, now seen corresponding path program 1 times [2022-12-06 07:34:53,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:53,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906047809] [2022-12-06 07:34:53,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:53,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:54,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-06 07:34:54,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:54,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906047809] [2022-12-06 07:34:54,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906047809] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:54,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:54,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:54,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212576015] [2022-12-06 07:34:54,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:54,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:54,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:54,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:54,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:54,034 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:54,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:54,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:54,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:54,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:54,075 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:54,075 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:54,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:54,076 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:54,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:54,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:54,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:54,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:54,076 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:54,076 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:54,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:54,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:54,077 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:54,077 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:54,077 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:54,077 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:54,077 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:54,078 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:54,078 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:54,078 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:54,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:54,080 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:54,080 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:54,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:54,080 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:54,080 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:54,154 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:54,155 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:54,155 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:54,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:54,155 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:54,155 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:54,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2987 [2022-12-06 07:34:54,155 INFO L420 AbstractCegarLoop]: === Iteration 2989 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:54,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:54,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1023013175, now seen corresponding path program 1 times [2022-12-06 07:34:54,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:54,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334273558] [2022-12-06 07:34:54,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:54,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:54,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:54,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:54,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334273558] [2022-12-06 07:34:54,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334273558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:54,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:54,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:54,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449594383] [2022-12-06 07:34:54,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:54,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:54,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:54,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:54,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:54,227 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:54,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:54,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:54,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:54,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:54,267 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:54,267 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:54,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:54,268 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:54,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:54,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:54,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:54,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:54,268 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:54,268 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:54,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:54,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:54,269 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:54,269 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:54,269 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:54,269 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:54,269 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:54,269 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:54,269 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:54,269 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:54,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:54,272 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:54,272 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:54,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:54,272 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:54,272 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:54,345 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:54,346 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:54,346 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:54,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:54,347 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:54,347 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:54,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2988 [2022-12-06 07:34:54,347 INFO L420 AbstractCegarLoop]: === Iteration 2990 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:54,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:54,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1053489368, now seen corresponding path program 1 times [2022-12-06 07:34:54,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:54,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800105307] [2022-12-06 07:34:54,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:54,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:54,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-06 07:34:54,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:54,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800105307] [2022-12-06 07:34:54,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800105307] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:54,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:54,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:54,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122345594] [2022-12-06 07:34:54,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:54,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:54,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:54,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:54,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:54,414 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:54,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:54,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:54,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:54,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:54,454 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:54,454 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:54,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:54,454 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:54,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:54,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:54,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:54,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:54,455 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:54,455 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:54,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:54,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:54,456 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:54,456 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:54,456 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:54,456 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:54,456 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:54,456 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:54,456 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:54,456 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:54,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:54,458 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:54,458 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:54,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 118 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:54,459 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:54,459 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:54,532 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:54,533 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:54,533 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:54,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:54,533 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:54,533 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:54,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2989 [2022-12-06 07:34:54,534 INFO L420 AbstractCegarLoop]: === Iteration 2991 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:54,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:54,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1080271477, now seen corresponding path program 1 times [2022-12-06 07:34:54,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:54,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494374947] [2022-12-06 07:34:54,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:54,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:54,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:54,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:54,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494374947] [2022-12-06 07:34:54,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494374947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:54,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:54,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:54,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767918229] [2022-12-06 07:34:54,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:54,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:54,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:54,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:54,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:54,605 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:54,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:54,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:54,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:54,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:54,646 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:54,646 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:54,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 371 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:54,646 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:54,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:54,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:54,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:54,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:54,647 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:54,647 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:54,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:54,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:54,648 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:54,648 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:54,648 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:54,648 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:54,648 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:54,648 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:54,648 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:54,648 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:54,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:54,650 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:54,650 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:54,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:54,651 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:54,651 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:54,724 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:54,726 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:54,726 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:54,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:54,726 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:54,726 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:54,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2990 [2022-12-06 07:34:54,726 INFO L420 AbstractCegarLoop]: === Iteration 2992 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:54,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:54,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1110747670, now seen corresponding path program 1 times [2022-12-06 07:34:54,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:54,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973004878] [2022-12-06 07:34:54,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:54,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:54,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:54,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-06 07:34:54,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:54,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973004878] [2022-12-06 07:34:54,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973004878] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:54,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:54,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:54,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526737523] [2022-12-06 07:34:54,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:54,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:54,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:54,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:54,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:54,795 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:54,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:54,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:54,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:54,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:54,838 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:54,838 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:54,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:54,839 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:54,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:54,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:54,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:54,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:54,839 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:54,839 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:54,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:54,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:54,840 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:54,840 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:54,840 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:54,840 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:54,840 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:54,841 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:54,841 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:54,841 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:54,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:54,843 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:54,843 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:54,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:54,843 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:54,843 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:54,918 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:54,919 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:54,919 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:54,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:54,919 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:54,919 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:54,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2991 [2022-12-06 07:34:54,919 INFO L420 AbstractCegarLoop]: === Iteration 2993 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:54,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:54,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1137529779, now seen corresponding path program 1 times [2022-12-06 07:34:54,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:54,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624812762] [2022-12-06 07:34:54,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:54,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:54,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-06 07:34:54,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:54,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624812762] [2022-12-06 07:34:54,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624812762] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:54,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:54,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:54,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064673806] [2022-12-06 07:34:54,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:54,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:54,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:54,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:54,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:54,991 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:54,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:54,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:54,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:54,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:55,027 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:55,028 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:55,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:55,028 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:55,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:55,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:55,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:55,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:55,029 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:55,029 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:55,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:55,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:55,029 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:55,029 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:55,029 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:55,030 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:55,030 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:55,030 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:55,030 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:55,030 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:55,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:55,032 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:55,032 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:55,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:55,032 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:55,032 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:55,105 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:55,106 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:34:55,106 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:55,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:55,107 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:55,107 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:55,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2992 [2022-12-06 07:34:55,107 INFO L420 AbstractCegarLoop]: === Iteration 2994 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:55,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:55,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1168005972, now seen corresponding path program 1 times [2022-12-06 07:34:55,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:55,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246727282] [2022-12-06 07:34:55,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:55,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:55,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-06 07:34:55,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:55,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246727282] [2022-12-06 07:34:55,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246727282] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:55,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:55,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:55,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082276791] [2022-12-06 07:34:55,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:55,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:55,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:55,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:55,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:55,190 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:55,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:55,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:55,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:55,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:55,233 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:55,233 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:55,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:55,233 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:55,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:55,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:55,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:55,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:55,234 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:55,234 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:55,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:55,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:55,235 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:55,235 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:55,235 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:55,235 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:55,235 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:55,235 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:55,235 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:55,235 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:55,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:55,237 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:55,238 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:55,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:55,238 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:55,238 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:55,312 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:55,313 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:55,313 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:55,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:55,314 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:55,314 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:55,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2993 [2022-12-06 07:34:55,314 INFO L420 AbstractCegarLoop]: === Iteration 2995 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:55,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:55,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1194788081, now seen corresponding path program 1 times [2022-12-06 07:34:55,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:55,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925390808] [2022-12-06 07:34:55,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:55,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:55,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-06 07:34:55,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:55,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925390808] [2022-12-06 07:34:55,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925390808] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:55,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:55,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:55,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046329219] [2022-12-06 07:34:55,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:55,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:55,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:55,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:55,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:55,383 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:55,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:55,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:55,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:55,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:55,423 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:55,424 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:55,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:55,424 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:55,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:55,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:55,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:55,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:55,425 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:55,425 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:55,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:55,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:55,425 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:55,425 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:55,426 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:55,426 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:55,426 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:55,426 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:55,426 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:55,426 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:55,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:55,428 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:55,428 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:55,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:55,428 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:55,428 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:55,502 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:55,504 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:55,504 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:55,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:55,504 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:55,504 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:55,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2994 [2022-12-06 07:34:55,504 INFO L420 AbstractCegarLoop]: === Iteration 2996 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:55,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:55,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1225264274, now seen corresponding path program 1 times [2022-12-06 07:34:55,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:55,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959223602] [2022-12-06 07:34:55,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:55,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:55,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:55,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-06 07:34:55,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:55,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959223602] [2022-12-06 07:34:55,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959223602] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:55,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:55,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:55,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042199771] [2022-12-06 07:34:55,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:55,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:55,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:55,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:55,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:55,571 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:55,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:55,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:55,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:55,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:55,607 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:55,607 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:55,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:55,607 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:55,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:55,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:55,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:55,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:55,608 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:55,608 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:55,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:55,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:55,609 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:55,609 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:55,609 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:55,609 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:55,609 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:55,609 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:55,609 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:55,609 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:55,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:55,611 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:55,612 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:55,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:55,612 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:55,612 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:55,684 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:55,686 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:55,686 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:55,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:55,686 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:55,686 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:55,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2995 [2022-12-06 07:34:55,686 INFO L420 AbstractCegarLoop]: === Iteration 2997 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:55,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:55,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1252046383, now seen corresponding path program 1 times [2022-12-06 07:34:55,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:55,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308951909] [2022-12-06 07:34:55,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:55,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:55,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-06 07:34:55,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:55,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308951909] [2022-12-06 07:34:55,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308951909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:55,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:55,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:55,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136650934] [2022-12-06 07:34:55,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:55,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:55,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:55,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:55,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:55,758 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:55,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:55,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:55,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:55,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:55,792 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:55,792 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:55,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:55,793 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:55,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:55,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:55,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:55,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:55,793 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:55,793 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:55,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:55,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:55,794 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:55,794 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:55,794 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:55,794 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:55,794 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:55,794 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:55,794 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:55,794 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:55,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:55,797 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:55,797 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:55,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:55,797 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:55,797 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:55,870 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:55,872 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:55,872 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:55,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:55,872 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:55,872 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:55,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2996 [2022-12-06 07:34:55,872 INFO L420 AbstractCegarLoop]: === Iteration 2998 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:55,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:55,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1282522576, now seen corresponding path program 1 times [2022-12-06 07:34:55,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:55,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362325039] [2022-12-06 07:34:55,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:55,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:55,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-06 07:34:55,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:55,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362325039] [2022-12-06 07:34:55,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362325039] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:55,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:55,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:55,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198433519] [2022-12-06 07:34:55,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:55,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:55,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:55,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:55,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:55,949 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:55,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:55,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:55,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:55,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:55,991 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:55,992 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:55,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:55,992 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:55,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:55,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:55,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:55,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:55,993 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:55,993 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:55,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:55,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:55,993 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:55,993 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:55,993 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:55,994 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:55,994 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:55,994 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:55,994 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:55,994 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:55,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:55,996 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:55,996 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:55,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:55,996 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:55,996 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:56,071 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:56,072 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:56,072 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:56,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:56,072 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:56,072 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:56,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2997 [2022-12-06 07:34:56,072 INFO L420 AbstractCegarLoop]: === Iteration 2999 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:56,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:56,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1309304685, now seen corresponding path program 1 times [2022-12-06 07:34:56,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:56,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540259322] [2022-12-06 07:34:56,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:56,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:56,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-06 07:34:56,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:56,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540259322] [2022-12-06 07:34:56,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540259322] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:56,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:56,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:56,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138870308] [2022-12-06 07:34:56,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:56,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:56,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:56,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:56,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:56,142 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:56,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:56,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:56,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:56,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:56,178 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:56,178 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:56,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:56,178 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:56,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:56,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:56,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:56,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:56,179 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:56,179 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:56,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:56,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:56,180 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:56,180 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:56,180 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:56,180 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:56,180 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:56,180 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:56,180 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:56,180 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:56,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:56,182 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:56,182 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:56,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:56,183 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:56,183 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:56,256 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:56,257 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:56,257 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:56,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:56,258 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:56,258 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:56,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2998 [2022-12-06 07:34:56,258 INFO L420 AbstractCegarLoop]: === Iteration 3000 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:56,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:56,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1339780878, now seen corresponding path program 1 times [2022-12-06 07:34:56,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:56,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695375595] [2022-12-06 07:34:56,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:56,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34: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-06 07:34:56,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:56,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695375595] [2022-12-06 07:34:56,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695375595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:56,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:56,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:56,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031476486] [2022-12-06 07:34:56,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:56,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:56,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:56,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:56,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:56,325 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:56,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:56,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:56,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:56,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:56,376 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:56,377 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:56,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:56,377 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:56,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:56,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:56,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:56,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:56,377 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:56,377 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:56,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:56,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:56,378 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:56,378 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:56,378 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:56,378 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:56,378 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:56,379 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:56,379 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:56,379 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:56,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:56,381 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:56,381 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:56,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 118 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:56,381 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:56,381 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:56,454 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:56,456 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:56,456 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:56,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:56,456 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:56,456 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:56,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2999 [2022-12-06 07:34:56,456 INFO L420 AbstractCegarLoop]: === Iteration 3001 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:56,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:56,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1366562987, now seen corresponding path program 1 times [2022-12-06 07:34:56,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:56,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906717383] [2022-12-06 07:34:56,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:56,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:56,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-06 07:34:56,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:56,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906717383] [2022-12-06 07:34:56,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906717383] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:56,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:56,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:56,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155212333] [2022-12-06 07:34:56,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:56,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:56,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:56,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:56,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:56,525 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:56,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:56,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:56,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:56,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:56,565 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:56,565 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:56,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:56,566 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:56,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:56,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:56,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:56,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:56,566 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:56,566 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:56,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:56,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:56,567 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:56,567 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:56,567 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:56,567 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:56,567 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:56,567 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:56,567 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:56,567 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:56,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:56,569 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:56,569 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:56,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:56,570 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:56,570 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:56,642 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:56,643 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:34:56,643 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:56,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:56,643 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:56,643 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:56,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3000 [2022-12-06 07:34:56,643 INFO L420 AbstractCegarLoop]: === Iteration 3002 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:56,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:56,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1397039180, now seen corresponding path program 1 times [2022-12-06 07:34:56,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:56,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391225330] [2022-12-06 07:34:56,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:56,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:56,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-06 07:34:56,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:56,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391225330] [2022-12-06 07:34:56,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391225330] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:56,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:56,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:56,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465792501] [2022-12-06 07:34:56,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:56,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:56,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:56,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:56,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:56,710 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:56,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:56,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:56,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:56,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:56,746 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:56,746 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:56,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:56,747 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:56,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:56,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:56,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:56,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:56,747 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:56,747 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:56,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:56,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:56,748 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:56,748 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:56,748 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:56,748 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:56,748 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:56,748 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:56,748 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:56,748 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:56,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:56,750 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:56,750 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:56,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:56,751 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:56,751 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:56,826 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:56,827 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:56,827 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:56,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:56,827 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:56,827 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:56,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3001 [2022-12-06 07:34:56,827 INFO L420 AbstractCegarLoop]: === Iteration 3003 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:56,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:56,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1423821289, now seen corresponding path program 1 times [2022-12-06 07:34:56,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:56,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71036768] [2022-12-06 07:34:56,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:56,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:56,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-06 07:34:56,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:56,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71036768] [2022-12-06 07:34:56,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71036768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:56,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:56,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:56,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894001730] [2022-12-06 07:34:56,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:56,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:56,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:56,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:56,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:56,895 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:56,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:56,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:56,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:56,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:56,935 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:56,935 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:56,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:56,936 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:56,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:56,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:56,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:56,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:56,936 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:56,936 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:56,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:56,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:56,937 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:56,937 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:56,937 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:56,937 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:56,937 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:56,938 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:56,938 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:56,938 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:56,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:56,940 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:56,940 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:56,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:56,940 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:56,940 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:57,014 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:57,015 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:57,016 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:57,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:57,016 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:57,016 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:57,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3002 [2022-12-06 07:34:57,016 INFO L420 AbstractCegarLoop]: === Iteration 3004 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:57,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:57,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1454297482, now seen corresponding path program 1 times [2022-12-06 07:34:57,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:57,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557409636] [2022-12-06 07:34:57,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:57,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:57,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-06 07:34:57,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:57,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557409636] [2022-12-06 07:34:57,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557409636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:57,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:57,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:57,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87285645] [2022-12-06 07:34:57,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:57,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:57,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:57,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:57,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:57,087 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:57,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:57,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:57,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:57,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:57,127 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:57,127 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:57,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:57,128 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:57,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:57,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:57,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:57,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:57,128 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:57,128 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:57,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:57,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:57,129 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:57,129 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:57,129 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:57,129 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:57,129 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:57,129 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:57,129 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:57,130 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:57,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:57,132 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:57,132 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:57,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:57,132 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:57,132 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:57,205 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:57,206 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:57,207 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:57,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:57,207 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:57,207 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:57,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3003 [2022-12-06 07:34:57,207 INFO L420 AbstractCegarLoop]: === Iteration 3005 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:57,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:57,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1481079591, now seen corresponding path program 1 times [2022-12-06 07:34:57,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:57,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172096872] [2022-12-06 07:34:57,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:57,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:57,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-06 07:34:57,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:57,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172096872] [2022-12-06 07:34:57,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172096872] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:57,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:57,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:57,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670313796] [2022-12-06 07:34:57,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:57,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:57,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:57,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:57,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:57,277 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:57,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:57,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:57,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:57,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:57,318 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:57,318 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:57,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:57,319 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:57,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:57,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:57,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:57,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:57,320 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:57,320 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:57,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:57,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:57,320 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:57,320 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:57,320 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:57,321 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:57,321 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:57,321 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:57,321 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:57,321 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:57,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:57,323 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:57,323 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:57,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:57,323 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:57,323 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:57,397 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:57,399 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:57,399 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:57,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:57,399 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:57,399 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:57,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3004 [2022-12-06 07:34:57,399 INFO L420 AbstractCegarLoop]: === Iteration 3006 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:57,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:57,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1511555784, now seen corresponding path program 1 times [2022-12-06 07:34:57,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:57,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782084725] [2022-12-06 07:34:57,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:57,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:57,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:57,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-06 07:34:57,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:57,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782084725] [2022-12-06 07:34:57,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782084725] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:57,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:57,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:57,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84982500] [2022-12-06 07:34:57,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:57,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:57,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:57,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:57,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:57,467 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:57,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:57,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:57,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:57,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:57,509 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:57,509 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:57,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:57,509 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:57,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:57,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:57,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:57,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:57,510 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:57,510 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:57,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:57,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:57,511 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:57,511 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:57,511 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:57,511 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:57,511 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:57,511 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:57,511 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:57,511 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:57,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:57,513 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:57,513 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:57,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:57,514 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:57,514 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:57,588 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:57,590 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:57,590 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:57,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:57,590 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:57,590 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:57,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3005 [2022-12-06 07:34:57,590 INFO L420 AbstractCegarLoop]: === Iteration 3007 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:57,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:57,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1538337893, now seen corresponding path program 1 times [2022-12-06 07:34:57,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:57,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123108534] [2022-12-06 07:34:57,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:57,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:57,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:57,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:57,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123108534] [2022-12-06 07:34:57,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123108534] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:57,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:57,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:57,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658723447] [2022-12-06 07:34:57,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:57,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:57,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:57,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:57,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:57,676 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:57,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:57,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:57,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:57,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:57,716 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:57,716 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:57,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:57,717 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:57,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:57,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:57,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:57,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:57,717 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:57,717 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:57,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:57,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:57,718 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:57,718 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:57,718 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:57,718 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:57,718 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:57,718 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:57,718 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:57,718 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:57,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:57,720 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:57,720 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:57,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:57,721 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:57,721 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:57,794 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:57,795 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:57,795 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:57,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:57,795 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:57,795 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:57,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3006 [2022-12-06 07:34:57,795 INFO L420 AbstractCegarLoop]: === Iteration 3008 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:57,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:57,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1568814086, now seen corresponding path program 1 times [2022-12-06 07:34:57,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:57,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771265072] [2022-12-06 07:34:57,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:57,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:57,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-06 07:34:57,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:57,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771265072] [2022-12-06 07:34:57,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771265072] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:57,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:57,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:57,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749672586] [2022-12-06 07:34:57,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:57,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:57,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:57,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:57,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:57,865 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:57,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:57,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:57,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:57,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:57,907 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:57,908 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:34:57,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:57,908 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:57,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:57,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:57,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:57,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:57,909 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:57,909 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:57,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:57,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:57,909 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:57,909 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:57,910 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:57,910 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:57,910 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:57,910 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:57,910 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:57,910 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:57,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:57,912 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:57,912 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:57,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:57,912 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:57,912 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:57,986 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:57,987 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:57,987 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:57,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:57,987 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:57,987 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:57,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3007 [2022-12-06 07:34:57,988 INFO L420 AbstractCegarLoop]: === Iteration 3009 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:57,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:57,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1595596195, now seen corresponding path program 1 times [2022-12-06 07:34:57,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:57,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678841429] [2022-12-06 07:34:57,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:57,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:58,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-06 07:34:58,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:58,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678841429] [2022-12-06 07:34:58,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678841429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:58,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:58,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:58,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502097659] [2022-12-06 07:34:58,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:58,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:58,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:58,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:58,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:58,060 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:58,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:58,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:58,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:58,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:58,096 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:58,096 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:58,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:58,096 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:58,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:58,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:58,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:58,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:58,097 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:58,097 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:58,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:58,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:58,098 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:58,098 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:58,098 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:58,098 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:58,098 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:58,098 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:58,098 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:58,098 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:58,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:58,101 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:58,101 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:58,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:58,101 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:58,101 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:58,176 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:58,177 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:58,177 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:58,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:58,177 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:58,177 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:58,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3008 [2022-12-06 07:34:58,177 INFO L420 AbstractCegarLoop]: === Iteration 3010 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:58,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:58,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1626072388, now seen corresponding path program 1 times [2022-12-06 07:34:58,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:58,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008431735] [2022-12-06 07:34:58,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:58,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:58,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-06 07:34:58,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:58,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008431735] [2022-12-06 07:34:58,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008431735] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:58,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:58,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:58,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835515355] [2022-12-06 07:34:58,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:58,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:58,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:58,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:58,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:58,244 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:58,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:58,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:58,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:58,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:58,280 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:58,280 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:58,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:58,281 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:58,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:58,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:58,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:58,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:58,281 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:58,281 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:58,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:58,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:58,282 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:58,282 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:58,282 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:58,282 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:58,282 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:58,282 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:58,283 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:58,283 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:58,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:58,285 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:58,285 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:58,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:58,285 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:58,285 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:58,360 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:58,362 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:34:58,362 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:58,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:58,362 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:58,362 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:58,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3009 [2022-12-06 07:34:58,362 INFO L420 AbstractCegarLoop]: === Iteration 3011 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:58,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:58,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1652854497, now seen corresponding path program 1 times [2022-12-06 07:34:58,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:58,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963236491] [2022-12-06 07:34:58,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:58,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:58,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-06 07:34:58,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:58,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963236491] [2022-12-06 07:34:58,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963236491] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:58,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:58,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:58,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582284768] [2022-12-06 07:34:58,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:58,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:58,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:58,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:58,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:58,432 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:58,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:58,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:58,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:58,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:58,466 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:58,466 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:58,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:58,467 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:58,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:58,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:58,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:58,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:58,467 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:58,467 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:58,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:58,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:58,468 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:58,468 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:58,468 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:58,468 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:58,468 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:58,468 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:58,469 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:58,469 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:58,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:58,471 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:58,471 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:58,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:58,471 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:58,471 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:58,544 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:58,546 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:34:58,546 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:58,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:58,546 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:58,546 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:58,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3010 [2022-12-06 07:34:58,546 INFO L420 AbstractCegarLoop]: === Iteration 3012 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:58,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:58,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1683330690, now seen corresponding path program 1 times [2022-12-06 07:34:58,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:58,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042554394] [2022-12-06 07:34:58,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:58,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:58,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:58,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:58,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042554394] [2022-12-06 07:34:58,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042554394] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:58,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:58,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:58,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503182782] [2022-12-06 07:34:58,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:58,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:58,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:58,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:58,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:58,617 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:58,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:58,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:58,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:58,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:58,654 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:58,654 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:58,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:58,654 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:58,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:58,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:58,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:58,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:58,655 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:58,655 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:58,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:58,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:58,656 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:58,656 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:58,656 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:58,656 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:58,656 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:58,656 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:58,656 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:58,656 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:58,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:58,658 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:58,658 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:58,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:58,659 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:58,659 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:58,733 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:58,735 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:58,735 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:58,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:58,735 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:58,735 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:58,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3011 [2022-12-06 07:34:58,735 INFO L420 AbstractCegarLoop]: === Iteration 3013 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:58,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:58,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1710112799, now seen corresponding path program 1 times [2022-12-06 07:34:58,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:58,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251704923] [2022-12-06 07:34:58,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:58,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:58,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:58,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-06 07:34:58,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:58,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251704923] [2022-12-06 07:34:58,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251704923] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:58,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:58,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:58,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147021724] [2022-12-06 07:34:58,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:58,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:58,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:58,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:58,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:58,805 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:58,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:58,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:58,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:58,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:58,859 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:58,859 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:58,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:58,860 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:58,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:58,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:58,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:58,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:58,860 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:58,860 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:58,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:58,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:58,861 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:58,861 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:58,861 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:58,861 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:58,861 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:58,861 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:58,861 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:58,861 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:58,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:58,864 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:58,864 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:58,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:58,864 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:58,864 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:58,939 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:58,940 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:58,940 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:58,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:58,941 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:58,941 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:58,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3012 [2022-12-06 07:34:58,941 INFO L420 AbstractCegarLoop]: === Iteration 3014 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:58,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:58,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1740588992, now seen corresponding path program 1 times [2022-12-06 07:34:58,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:58,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594625124] [2022-12-06 07:34:58,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:58,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34: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-06 07:34:59,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:59,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594625124] [2022-12-06 07:34:59,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594625124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:59,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:59,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:59,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758123761] [2022-12-06 07:34:59,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:59,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:59,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:59,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:59,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:59,035 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:59,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:59,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:59,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:59,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:59,072 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:59,072 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:59,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:59,073 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:59,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:59,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:59,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:59,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:59,073 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:59,073 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:59,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:59,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:59,074 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:59,074 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:59,074 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:59,074 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:59,074 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:59,074 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:59,074 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:59,074 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:59,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:59,077 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:59,077 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:59,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:59,077 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:59,077 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:59,151 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:59,153 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:34:59,153 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:59,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:59,153 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:59,153 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:59,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3013 [2022-12-06 07:34:59,153 INFO L420 AbstractCegarLoop]: === Iteration 3015 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:59,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:59,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1767371101, now seen corresponding path program 1 times [2022-12-06 07:34:59,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:59,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929155231] [2022-12-06 07:34:59,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:59,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:59,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-06 07:34:59,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:59,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929155231] [2022-12-06 07:34:59,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929155231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:59,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:59,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:59,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080305607] [2022-12-06 07:34:59,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:59,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:59,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:59,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:59,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:59,224 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:59,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:59,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:59,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:59,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:59,265 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:59,265 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:59,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:59,265 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:59,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:59,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:59,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:59,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:59,266 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:59,266 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:59,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:59,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:59,267 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:59,267 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:59,267 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:59,267 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:59,267 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:59,267 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:59,267 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:59,267 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:59,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:59,269 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:59,269 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:59,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:59,270 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:59,270 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:59,352 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:59,354 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 07:34:59,354 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:59,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:59,354 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:59,354 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:59,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3014 [2022-12-06 07:34:59,354 INFO L420 AbstractCegarLoop]: === Iteration 3016 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:59,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:59,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1797847294, now seen corresponding path program 1 times [2022-12-06 07:34:59,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:59,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849627147] [2022-12-06 07:34:59,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:59,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:59,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:59,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-06 07:34:59,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:59,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849627147] [2022-12-06 07:34:59,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849627147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:59,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:59,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:59,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727527453] [2022-12-06 07:34:59,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:59,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:59,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:59,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:59,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:59,423 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:59,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:59,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:59,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:59,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:59,465 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:59,465 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:59,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:59,466 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:59,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:59,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:59,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:59,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:59,466 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:59,466 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:59,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:59,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:59,467 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:59,467 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:59,467 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:59,467 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:59,467 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:59,468 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:59,468 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:59,468 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:59,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:59,470 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:59,470 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:59,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:59,470 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:59,470 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:59,545 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:59,547 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:34:59,547 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:59,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:59,547 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:59,547 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:59,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3015 [2022-12-06 07:34:59,547 INFO L420 AbstractCegarLoop]: === Iteration 3017 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:59,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:59,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1824629403, now seen corresponding path program 1 times [2022-12-06 07:34:59,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:59,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648592296] [2022-12-06 07:34:59,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:59,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:59,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-06 07:34:59,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:59,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648592296] [2022-12-06 07:34:59,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648592296] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:59,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:59,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:59,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826531489] [2022-12-06 07:34:59,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:59,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:59,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:59,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:59,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:59,619 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:59,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:59,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:59,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:59,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:59,658 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:34:59,658 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:34:59,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 371 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:34:59,659 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:34:59,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:59,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:59,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:59,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:59,659 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:59,659 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:59,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:59,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:59,660 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:59,660 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:59,660 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:59,660 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:59,660 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:59,660 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:59,660 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:59,660 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:59,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:59,662 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:34:59,663 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:34:59,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:34:59,663 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:59,663 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:34:59,736 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:59,737 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:34:59,737 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:34:59,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:59,737 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:59,737 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:59,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3016 [2022-12-06 07:34:59,737 INFO L420 AbstractCegarLoop]: === Iteration 3018 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:59,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:59,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1855105596, now seen corresponding path program 1 times [2022-12-06 07:34:59,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:59,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673912121] [2022-12-06 07:34:59,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:59,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:59,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-06 07:34:59,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:59,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673912121] [2022-12-06 07:34:59,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673912121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:59,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:59,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:59,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902004094] [2022-12-06 07:34:59,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:59,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:59,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:59,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:59,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:59,805 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:59,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:59,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:59,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:59,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:59,843 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:34:59,843 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:34:59,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 350 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:34:59,843 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:34:59,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:59,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:59,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:59,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:34:59,844 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:34:59,844 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:34:59,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:34:59,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:59,845 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:59,845 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:34:59,845 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:34:59,845 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:59,845 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:59,845 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:59,845 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:59,845 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:59,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:59,847 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:34:59,847 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:34:59,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:34:59,848 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:34:59,848 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:34:59,923 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:59,925 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:34:59,925 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:34:59,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:59,925 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:59,925 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:59,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3017 [2022-12-06 07:34:59,925 INFO L420 AbstractCegarLoop]: === Iteration 3019 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:34:59,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:59,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1881887705, now seen corresponding path program 1 times [2022-12-06 07:34:59,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:59,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855195389] [2022-12-06 07:34:59,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:59,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:59,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:59,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-06 07:34:59,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:59,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855195389] [2022-12-06 07:34:59,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855195389] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:59,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:59,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:34:59,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995690787] [2022-12-06 07:34:59,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:59,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:59,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:59,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:59,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:59,996 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:34:59,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:59,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:59,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:34:59,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:00,039 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:00,039 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:00,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:00,040 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:00,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:00,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:00,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:00,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:00,040 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:00,040 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:00,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:00,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:00,041 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:00,041 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:00,041 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:00,041 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:00,041 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:00,041 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:00,041 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:00,041 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:00,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:00,044 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:00,044 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:00,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:00,044 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:00,044 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:00,119 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:00,120 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:00,120 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:00,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:00,120 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:00,120 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:00,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3018 [2022-12-06 07:35:00,121 INFO L420 AbstractCegarLoop]: === Iteration 3020 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:00,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:00,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1912363898, now seen corresponding path program 1 times [2022-12-06 07:35:00,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:00,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609046133] [2022-12-06 07:35:00,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:00,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:00,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-06 07:35:00,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:00,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609046133] [2022-12-06 07:35:00,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609046133] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:00,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:00,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:00,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041463414] [2022-12-06 07:35:00,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:00,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:00,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:00,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:00,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:00,205 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:00,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:00,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:00,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:00,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:00,248 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:00,248 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:00,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 349 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:00,248 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:00,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:00,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:00,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:00,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:00,249 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:00,249 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:00,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:00,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:00,250 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:00,250 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:00,250 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:00,250 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:00,250 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:00,250 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:00,250 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:00,250 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:00,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:00,252 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:00,253 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:00,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:00,253 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:00,253 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:00,329 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:00,330 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:35:00,330 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:00,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:00,330 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:00,330 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:00,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3019 [2022-12-06 07:35:00,330 INFO L420 AbstractCegarLoop]: === Iteration 3021 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:00,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:00,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1939146007, now seen corresponding path program 1 times [2022-12-06 07:35:00,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:00,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385335502] [2022-12-06 07:35:00,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:00,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:00,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-06 07:35:00,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:00,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385335502] [2022-12-06 07:35:00,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385335502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:00,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:00,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:00,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016546875] [2022-12-06 07:35:00,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:00,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:00,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:00,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:00,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:00,401 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:00,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:00,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:00,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:00,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:00,436 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:00,437 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:00,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:00,437 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:00,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:00,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:00,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:00,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:00,438 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:00,438 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:00,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:00,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:00,438 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:00,439 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:00,439 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:00,439 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:00,439 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:00,439 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:00,439 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:00,439 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:00,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:00,441 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:00,441 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:00,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:00,442 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:00,442 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:00,516 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:00,517 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:00,517 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:00,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:00,518 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:00,518 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:00,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3020 [2022-12-06 07:35:00,518 INFO L420 AbstractCegarLoop]: === Iteration 3022 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:00,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:00,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1969622200, now seen corresponding path program 1 times [2022-12-06 07:35:00,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:00,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398453411] [2022-12-06 07:35:00,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:00,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:00,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-06 07:35:00,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:00,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398453411] [2022-12-06 07:35:00,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398453411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:00,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:00,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:00,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952205155] [2022-12-06 07:35:00,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:00,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:00,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:00,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:00,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:00,586 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:00,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:00,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:00,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:00,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:00,627 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:00,627 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:00,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:00,628 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:00,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:00,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:00,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:00,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:00,628 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:00,628 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:00,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:00,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:00,629 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:00,629 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:00,629 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:00,629 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:00,629 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:00,630 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:00,630 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:00,630 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:00,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:00,632 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:00,632 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:00,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:00,632 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:00,632 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:00,708 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:00,709 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:35:00,710 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:00,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:00,710 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:00,710 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:00,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3021 [2022-12-06 07:35:00,710 INFO L420 AbstractCegarLoop]: === Iteration 3023 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:00,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:00,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1996404309, now seen corresponding path program 1 times [2022-12-06 07:35:00,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:00,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219847207] [2022-12-06 07:35:00,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:00,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:00,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-06 07:35:00,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:00,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219847207] [2022-12-06 07:35:00,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219847207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:00,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:00,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:00,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572264896] [2022-12-06 07:35:00,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:00,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:00,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:00,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:00,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:00,781 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:00,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:00,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:00,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:00,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:00,822 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:00,822 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:00,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:00,822 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:00,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:00,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:00,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:00,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:00,823 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:00,823 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:00,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:00,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:00,823 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:00,824 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:00,824 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:00,824 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:00,824 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:00,824 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:00,824 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:00,824 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:00,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:00,826 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:00,826 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:00,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:00,827 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:00,827 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:00,902 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:00,903 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:00,903 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:00,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:00,903 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:00,903 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:00,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3022 [2022-12-06 07:35:00,903 INFO L420 AbstractCegarLoop]: === Iteration 3024 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:00,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:00,904 INFO L85 PathProgramCache]: Analyzing trace with hash 2026880502, now seen corresponding path program 1 times [2022-12-06 07:35:00,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:00,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690678184] [2022-12-06 07:35:00,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:00,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:00,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-06 07:35:00,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:00,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690678184] [2022-12-06 07:35:00,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690678184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:00,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:00,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:00,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322325206] [2022-12-06 07:35:00,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:00,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:00,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:00,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:00,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:00,971 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:00,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:00,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:00,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:00,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:01,008 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:01,008 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:01,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:01,008 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:01,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:01,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:01,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:01,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:01,009 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:01,009 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:01,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:01,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:01,009 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:01,010 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:01,010 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:01,010 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:01,010 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:01,010 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:01,010 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:01,010 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:01,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:01,012 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:01,012 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:01,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:01,013 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:01,013 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:01,086 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:01,087 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:01,088 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:01,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:01,088 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:01,088 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:01,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3023 [2022-12-06 07:35:01,088 INFO L420 AbstractCegarLoop]: === Iteration 3025 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:01,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:01,088 INFO L85 PathProgramCache]: Analyzing trace with hash 2053662611, now seen corresponding path program 1 times [2022-12-06 07:35:01,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:01,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46098174] [2022-12-06 07:35:01,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:01,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:01,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-06 07:35:01,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:01,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46098174] [2022-12-06 07:35:01,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46098174] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:01,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:01,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:01,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408982503] [2022-12-06 07:35:01,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:01,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:01,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:01,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:01,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:01,159 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:01,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:01,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:01,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:01,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:01,195 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:01,195 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:01,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:01,196 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:01,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:01,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:01,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:01,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:01,196 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:01,197 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:01,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:01,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:01,197 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:01,197 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:01,197 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:01,197 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:01,198 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:01,198 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:01,198 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:01,198 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:01,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:01,200 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:01,200 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:01,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:01,200 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:01,200 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:01,275 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:01,276 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:01,276 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:01,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:01,277 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:01,277 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:01,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3024 [2022-12-06 07:35:01,277 INFO L420 AbstractCegarLoop]: === Iteration 3026 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:01,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:01,277 INFO L85 PathProgramCache]: Analyzing trace with hash 2084138804, now seen corresponding path program 1 times [2022-12-06 07:35:01,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:01,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216922448] [2022-12-06 07:35:01,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:01,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:01,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-06 07:35:01,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:01,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216922448] [2022-12-06 07:35:01,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216922448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:01,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:01,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:01,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602974678] [2022-12-06 07:35:01,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:01,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:01,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:01,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:01,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:01,346 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:01,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:01,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:01,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:01,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:01,395 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:01,396 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:01,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:01,396 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:01,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:01,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:01,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:01,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:01,397 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:01,397 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:01,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:01,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:01,397 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:01,397 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:01,397 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:01,398 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:01,398 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:01,398 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:01,398 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:01,398 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:01,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:01,400 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:01,400 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:01,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:01,400 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:01,400 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:01,474 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:01,475 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:01,475 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:01,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:01,476 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:01,476 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:01,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3025 [2022-12-06 07:35:01,476 INFO L420 AbstractCegarLoop]: === Iteration 3027 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:01,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:01,476 INFO L85 PathProgramCache]: Analyzing trace with hash 2110920913, now seen corresponding path program 1 times [2022-12-06 07:35:01,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:01,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115860195] [2022-12-06 07:35:01,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:01,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:01,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-06 07:35:01,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:01,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115860195] [2022-12-06 07:35:01,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115860195] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:01,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:01,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:01,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131229279] [2022-12-06 07:35:01,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:01,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:01,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:01,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:01,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:01,546 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:01,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:01,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:01,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:01,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:01,587 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:01,588 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:01,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:01,588 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:01,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:01,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:01,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:01,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:01,589 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:01,589 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:01,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:01,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:01,590 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:01,590 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:01,590 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:01,590 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:01,590 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:01,590 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:01,590 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:01,590 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:01,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:01,592 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:01,592 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:01,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:01,593 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:01,593 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:01,671 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:01,672 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:35:01,672 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:01,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:01,672 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:01,672 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:01,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3026 [2022-12-06 07:35:01,673 INFO L420 AbstractCegarLoop]: === Iteration 3028 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:01,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:01,673 INFO L85 PathProgramCache]: Analyzing trace with hash 2141397106, now seen corresponding path program 1 times [2022-12-06 07:35:01,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:01,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075259085] [2022-12-06 07:35:01,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:01,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:01,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-06 07:35:01,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:01,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075259085] [2022-12-06 07:35:01,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075259085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:01,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:01,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:01,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582095945] [2022-12-06 07:35:01,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:01,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:01,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:01,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:01,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:01,743 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:01,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:01,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:01,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:01,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:01,778 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:01,779 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:01,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:01,779 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:01,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:01,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:01,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:01,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:01,780 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:01,780 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:01,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:01,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:01,780 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:01,780 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:01,780 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:01,781 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:01,781 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:01,781 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:01,781 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:01,781 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:01,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:01,783 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:01,783 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:01,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:01,783 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:01,783 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:01,856 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:01,858 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:01,858 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:01,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:01,858 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:01,858 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:01,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3027 [2022-12-06 07:35:01,858 INFO L420 AbstractCegarLoop]: === Iteration 3029 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:01,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:01,858 INFO L85 PathProgramCache]: Analyzing trace with hash -2126788081, now seen corresponding path program 1 times [2022-12-06 07:35:01,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:01,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967182969] [2022-12-06 07:35:01,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:01,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:01,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-06 07:35:01,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:01,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967182969] [2022-12-06 07:35:01,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967182969] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:01,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:01,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:01,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85121123] [2022-12-06 07:35:01,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:01,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:01,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:01,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:01,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:01,926 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:01,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:01,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:01,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:01,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:01,967 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:01,967 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:01,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:01,967 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:01,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:01,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:01,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:01,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:01,968 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:01,968 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:01,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:01,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:01,968 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:01,969 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:01,969 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:01,969 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:01,969 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:01,969 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:01,969 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:01,969 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:01,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:01,971 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:01,971 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:01,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:01,972 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:01,972 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:02,046 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:02,047 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:02,047 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:02,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:02,047 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:02,047 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:02,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3028 [2022-12-06 07:35:02,047 INFO L420 AbstractCegarLoop]: === Iteration 3030 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:02,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:02,048 INFO L85 PathProgramCache]: Analyzing trace with hash -2096311888, now seen corresponding path program 1 times [2022-12-06 07:35:02,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:02,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891533905] [2022-12-06 07:35:02,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:02,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35: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-06 07:35:02,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:02,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891533905] [2022-12-06 07:35:02,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891533905] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:02,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:02,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:02,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448696103] [2022-12-06 07:35:02,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:02,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:02,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:02,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:02,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:02,113 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:02,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:02,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:02,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:02,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:02,149 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:02,149 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:02,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:02,149 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:02,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:02,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:02,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:02,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:02,150 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:02,150 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:02,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:02,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:02,150 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:02,150 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:02,150 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:02,150 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:02,151 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:02,151 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:02,151 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:02,151 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:02,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:02,153 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:02,153 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:02,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:02,153 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:02,153 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:02,227 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:02,228 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:02,228 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:02,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:02,229 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:02,229 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:02,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3029 [2022-12-06 07:35:02,229 INFO L420 AbstractCegarLoop]: === Iteration 3031 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:02,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:02,229 INFO L85 PathProgramCache]: Analyzing trace with hash -2069529779, now seen corresponding path program 1 times [2022-12-06 07:35:02,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:02,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714085942] [2022-12-06 07:35:02,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:02,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:02,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-06 07:35:02,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:02,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714085942] [2022-12-06 07:35:02,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714085942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:02,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:02,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:02,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542161723] [2022-12-06 07:35:02,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:02,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:02,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:02,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:02,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:02,298 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:02,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:02,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:02,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:02,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:02,334 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:02,334 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:02,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:02,334 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:02,335 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:02,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:02,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:02,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:02,335 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:02,335 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:02,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:02,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:02,336 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:02,336 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:02,336 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:02,336 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:02,336 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:02,336 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:02,336 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:02,336 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:02,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:02,338 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:02,339 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:02,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:02,339 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:02,339 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:02,413 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:02,414 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:02,415 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:02,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:02,415 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:02,415 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:02,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3030 [2022-12-06 07:35:02,415 INFO L420 AbstractCegarLoop]: === Iteration 3032 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:02,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:02,415 INFO L85 PathProgramCache]: Analyzing trace with hash -2039053586, now seen corresponding path program 1 times [2022-12-06 07:35:02,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:02,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804104566] [2022-12-06 07:35:02,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:02,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:02,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-06 07:35:02,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:02,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804104566] [2022-12-06 07:35:02,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804104566] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:02,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:02,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:02,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331830839] [2022-12-06 07:35:02,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:02,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:02,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:02,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:02,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:02,482 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:02,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:02,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:02,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:02,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:02,524 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:02,525 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:02,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:02,525 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:02,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:02,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:02,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:02,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:02,526 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:02,526 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:02,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:02,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:02,526 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:02,526 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:02,527 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:02,527 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:02,527 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:02,527 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:02,527 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:02,527 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:02,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:02,529 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:02,529 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:02,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:02,529 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:02,530 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:02,603 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:02,604 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:02,604 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:02,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:02,605 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:02,605 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:02,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3031 [2022-12-06 07:35:02,605 INFO L420 AbstractCegarLoop]: === Iteration 3033 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:02,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:02,605 INFO L85 PathProgramCache]: Analyzing trace with hash -2012271477, now seen corresponding path program 1 times [2022-12-06 07:35:02,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:02,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984686492] [2022-12-06 07:35:02,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:02,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:02,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:02,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-06 07:35:02,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:02,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984686492] [2022-12-06 07:35:02,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984686492] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:02,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:02,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:02,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159490439] [2022-12-06 07:35:02,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:02,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:02,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:02,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:02,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:02,692 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:02,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:02,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:02,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:02,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:02,726 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:02,726 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:02,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:02,726 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:02,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:02,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:02,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:02,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:02,727 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:02,727 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:02,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:02,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:02,728 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:02,728 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:02,728 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:02,728 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:02,728 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:02,728 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:02,728 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:02,728 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:02,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:02,730 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:02,730 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:02,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:02,731 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:02,731 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:02,804 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:02,806 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:02,806 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:02,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:02,806 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:02,806 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:02,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3032 [2022-12-06 07:35:02,806 INFO L420 AbstractCegarLoop]: === Iteration 3034 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:02,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:02,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1981795284, now seen corresponding path program 1 times [2022-12-06 07:35:02,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:02,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477923392] [2022-12-06 07:35:02,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:02,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:02,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-06 07:35:02,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:02,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477923392] [2022-12-06 07:35:02,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477923392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:02,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:02,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:02,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061238105] [2022-12-06 07:35:02,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:02,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:02,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:02,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:02,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:02,871 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:02,871 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:02,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:02,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:02,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:02,912 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:02,912 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:02,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:02,912 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:02,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:02,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:02,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:02,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:02,913 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:02,913 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:02,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:02,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:02,914 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:02,914 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:02,914 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:02,914 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:02,914 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:02,914 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:02,914 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:02,914 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:02,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:02,916 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:02,916 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:02,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:02,917 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:02,917 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:02,990 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:02,991 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:02,991 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:02,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:02,991 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:02,991 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:02,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3033 [2022-12-06 07:35:02,991 INFO L420 AbstractCegarLoop]: === Iteration 3035 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:02,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:02,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1955013175, now seen corresponding path program 1 times [2022-12-06 07:35:02,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:02,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095601843] [2022-12-06 07:35:02,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:02,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:03,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-06 07:35:03,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:03,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095601843] [2022-12-06 07:35:03,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095601843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:03,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:03,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:03,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365334144] [2022-12-06 07:35:03,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:03,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:03,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:03,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:03,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:03,060 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:03,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:03,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:03,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:03,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:03,101 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:03,101 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:03,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:03,101 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:03,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:03,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:03,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:03,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:03,102 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:03,102 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:03,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:03,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:03,103 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:03,103 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:03,103 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:03,103 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:03,103 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:03,103 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:03,103 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:03,103 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:03,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:03,105 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:03,105 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:03,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:03,106 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:03,106 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:03,179 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:03,180 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:03,181 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:03,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:03,181 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:03,181 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:03,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3034 [2022-12-06 07:35:03,181 INFO L420 AbstractCegarLoop]: === Iteration 3036 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:03,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:03,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1924536982, now seen corresponding path program 1 times [2022-12-06 07:35:03,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:03,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401988800] [2022-12-06 07:35:03,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:03,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:03,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-06 07:35:03,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:03,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401988800] [2022-12-06 07:35:03,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401988800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:03,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:03,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:03,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129728480] [2022-12-06 07:35:03,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:03,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:03,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:03,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:03,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:03,248 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:03,248 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:03,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:03,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:03,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:03,290 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:03,290 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:03,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:03,291 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:03,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:03,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:03,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:03,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:03,291 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:03,291 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:03,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:03,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:03,292 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:03,292 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:03,292 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:03,292 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:03,292 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:03,292 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:03,292 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:03,292 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:03,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:03,294 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:03,294 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:03,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:03,295 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:03,295 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:03,369 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:03,370 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:03,370 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:03,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:03,370 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:03,370 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:03,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3035 [2022-12-06 07:35:03,370 INFO L420 AbstractCegarLoop]: === Iteration 3037 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:03,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:03,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1897754873, now seen corresponding path program 1 times [2022-12-06 07:35:03,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:03,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850521579] [2022-12-06 07:35:03,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:03,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:03,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-06 07:35:03,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:03,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850521579] [2022-12-06 07:35:03,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850521579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:03,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:03,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:03,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335717605] [2022-12-06 07:35:03,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:03,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:03,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:03,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:03,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:03,439 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:03,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:03,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:03,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:03,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:03,474 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:03,474 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:03,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 372 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:03,474 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:03,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:03,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:03,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:03,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:03,475 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:03,475 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:03,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:03,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:03,476 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:03,476 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:03,476 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:03,476 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:03,476 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:03,476 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:03,476 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:03,476 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:03,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:03,478 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:03,478 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:03,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:03,479 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:03,479 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:03,555 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:03,556 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:35:03,556 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:03,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:03,556 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:03,557 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:03,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3036 [2022-12-06 07:35:03,557 INFO L420 AbstractCegarLoop]: === Iteration 3038 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:03,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:03,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1867278680, now seen corresponding path program 1 times [2022-12-06 07:35:03,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:03,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976580511] [2022-12-06 07:35:03,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:03,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:03,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:03,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-06 07:35:03,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:03,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976580511] [2022-12-06 07:35:03,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976580511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:03,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:03,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:03,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602380461] [2022-12-06 07:35:03,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:03,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:03,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:03,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:03,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:03,626 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:03,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:03,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:03,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:03,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:03,669 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:03,669 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:03,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:03,669 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:03,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:03,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:03,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:03,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:03,670 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:03,670 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:03,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:03,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:03,670 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:03,671 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:03,671 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:03,671 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:03,671 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:03,671 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:03,671 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:03,671 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:03,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:03,673 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:03,673 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:03,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:03,674 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:03,674 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:03,749 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:03,750 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:03,750 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:03,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:03,750 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:03,750 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:03,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3037 [2022-12-06 07:35:03,751 INFO L420 AbstractCegarLoop]: === Iteration 3039 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:03,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:03,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1840496571, now seen corresponding path program 1 times [2022-12-06 07:35:03,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:03,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272507535] [2022-12-06 07:35:03,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:03,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:03,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-06 07:35:03,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:03,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272507535] [2022-12-06 07:35:03,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272507535] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:03,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:03,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:03,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938358311] [2022-12-06 07:35:03,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:03,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:03,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:03,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:03,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:03,822 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:03,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:03,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:03,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:03,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:03,875 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:03,875 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:03,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:03,876 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:03,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:03,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:03,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:03,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:03,876 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:03,876 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:03,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:03,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:03,877 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:03,877 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:03,877 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:03,877 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:03,877 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:03,877 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:03,877 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:03,877 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:03,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:03,880 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:03,880 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:03,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:03,880 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:03,880 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:03,955 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:03,957 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:35:03,957 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:03,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:03,957 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:03,957 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:03,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3038 [2022-12-06 07:35:03,957 INFO L420 AbstractCegarLoop]: === Iteration 3040 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:03,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:03,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1810020378, now seen corresponding path program 1 times [2022-12-06 07:35:03,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:03,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133229365] [2022-12-06 07:35:03,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:03,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:04,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-06 07:35:04,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:04,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133229365] [2022-12-06 07:35:04,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133229365] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:04,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:04,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:04,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533274983] [2022-12-06 07:35:04,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:04,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:04,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:04,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:04,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:04,024 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:04,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:04,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:04,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:04,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:04,060 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:04,060 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:04,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:04,060 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:04,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:04,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:04,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:04,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:04,061 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:04,061 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:04,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:04,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:04,062 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:04,062 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:04,062 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:04,062 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:04,062 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:04,062 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:04,062 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:04,062 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:04,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:04,064 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:04,064 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:04,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:04,065 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:04,065 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:04,179 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:04,181 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-06 07:35:04,181 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:04,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:04,181 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:04,181 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:04,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3039 [2022-12-06 07:35:04,181 INFO L420 AbstractCegarLoop]: === Iteration 3041 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:04,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:04,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1783238269, now seen corresponding path program 1 times [2022-12-06 07:35:04,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:04,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988717294] [2022-12-06 07:35:04,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:04,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:04,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:04,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-06 07:35:04,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:04,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988717294] [2022-12-06 07:35:04,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988717294] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:04,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:04,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:04,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470738762] [2022-12-06 07:35:04,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:04,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:04,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:04,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:04,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:04,255 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:04,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:04,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:04,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:04,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:04,297 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:04,297 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:04,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:04,297 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:04,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:04,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:04,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:04,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:04,298 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:04,298 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:04,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:04,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:04,299 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:04,299 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:04,299 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:04,299 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:04,299 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:04,299 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:04,299 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:04,299 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:04,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:04,301 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:04,301 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:04,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:04,302 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:04,302 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:04,376 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:04,377 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:04,377 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:04,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:04,377 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:04,378 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:04,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3040 [2022-12-06 07:35:04,378 INFO L420 AbstractCegarLoop]: === Iteration 3042 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:04,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:04,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1752762076, now seen corresponding path program 1 times [2022-12-06 07:35:04,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:04,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638785102] [2022-12-06 07:35:04,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:04,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:04,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-06 07:35:04,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:04,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638785102] [2022-12-06 07:35:04,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638785102] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:04,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:04,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:04,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355501980] [2022-12-06 07:35:04,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:04,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:04,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:04,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:04,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:04,447 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:04,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:04,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:04,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:04,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:04,483 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:04,483 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:04,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:04,483 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:04,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:04,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:04,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:04,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:04,484 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:04,484 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:04,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:04,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:04,484 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:04,485 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:04,485 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:04,485 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:04,485 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:04,485 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:04,485 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:04,485 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:04,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:04,487 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:04,487 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:04,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:04,487 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:04,488 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:04,562 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:04,563 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:04,563 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:04,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:04,563 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:04,563 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:04,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3041 [2022-12-06 07:35:04,563 INFO L420 AbstractCegarLoop]: === Iteration 3043 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:04,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:04,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1725979967, now seen corresponding path program 1 times [2022-12-06 07:35:04,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:04,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564198459] [2022-12-06 07:35:04,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:04,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:04,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-06 07:35:04,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:04,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564198459] [2022-12-06 07:35:04,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564198459] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:04,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:04,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:04,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244222979] [2022-12-06 07:35:04,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:04,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:04,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:04,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:04,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:04,634 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:04,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:04,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:04,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:04,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:04,675 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:04,675 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:04,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:04,676 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:04,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:04,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:04,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:04,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:04,676 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:04,676 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:04,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:04,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:04,677 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:04,677 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:04,677 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:04,677 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:04,677 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:04,677 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:04,677 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:04,678 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:04,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:04,680 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:04,680 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:04,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:04,680 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:04,680 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:04,754 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:04,756 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:04,756 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:04,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:04,756 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:04,756 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:04,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3042 [2022-12-06 07:35:04,756 INFO L420 AbstractCegarLoop]: === Iteration 3044 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:04,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:04,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1695503774, now seen corresponding path program 1 times [2022-12-06 07:35:04,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:04,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590829431] [2022-12-06 07:35:04,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:04,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:04,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:04,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:04,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590829431] [2022-12-06 07:35:04,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590829431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:04,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:04,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:04,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069872664] [2022-12-06 07:35:04,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:04,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:04,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:04,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:04,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:04,827 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:04,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:04,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:04,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:04,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:04,863 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:04,863 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:04,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:04,863 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:04,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:04,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:04,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:04,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:04,864 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:04,864 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:04,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:04,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:04,865 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:04,865 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:04,865 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:04,865 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:04,865 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:04,865 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:04,865 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:04,865 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:04,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:04,867 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:04,867 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:04,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:04,868 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:04,868 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:04,943 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:04,944 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:04,944 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:04,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:04,944 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:04,945 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:04,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3043 [2022-12-06 07:35:04,945 INFO L420 AbstractCegarLoop]: === Iteration 3045 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:04,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:04,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1668721665, now seen corresponding path program 1 times [2022-12-06 07:35:04,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:04,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797070096] [2022-12-06 07:35:04,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:04,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:05,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-06 07:35:05,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:05,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797070096] [2022-12-06 07:35:05,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797070096] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:05,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:05,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:05,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618921122] [2022-12-06 07:35:05,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:05,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:05,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:05,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:05,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:05,015 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:05,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:05,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:05,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:05,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:05,051 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:05,051 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:05,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:05,052 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:05,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:05,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:05,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:05,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:05,052 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:05,052 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:05,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:05,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:05,053 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:05,053 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:05,053 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:05,053 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:05,053 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:05,053 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:05,053 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:05,053 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:05,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:05,056 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:05,056 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:05,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:05,056 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:05,056 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:05,129 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:05,130 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:05,130 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:05,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:05,130 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:05,130 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:05,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3044 [2022-12-06 07:35:05,131 INFO L420 AbstractCegarLoop]: === Iteration 3046 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:05,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:05,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1638245472, now seen corresponding path program 1 times [2022-12-06 07:35:05,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:05,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222295087] [2022-12-06 07:35:05,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:05,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:05,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-06 07:35:05,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:05,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222295087] [2022-12-06 07:35:05,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222295087] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:05,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:05,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:05,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472531986] [2022-12-06 07:35:05,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:05,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:05,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:05,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:05,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:05,211 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:05,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:05,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:05,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:05,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:05,248 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:05,248 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:05,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:05,248 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:05,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:05,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:05,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:05,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:05,249 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:05,249 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:05,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:05,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:05,250 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:05,250 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:05,250 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:05,250 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:05,250 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:05,250 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:05,250 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:05,250 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:05,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:05,252 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:05,252 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:05,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:05,253 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:05,253 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:05,326 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:05,327 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:05,327 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:05,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:05,327 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:05,327 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:05,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3045 [2022-12-06 07:35:05,327 INFO L420 AbstractCegarLoop]: === Iteration 3047 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:05,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:05,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1611463363, now seen corresponding path program 1 times [2022-12-06 07:35:05,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:05,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963247982] [2022-12-06 07:35:05,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:05,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:05,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-06 07:35:05,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:05,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963247982] [2022-12-06 07:35:05,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963247982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:05,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:05,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:05,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643046490] [2022-12-06 07:35:05,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:05,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:05,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:05,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:05,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:05,400 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:05,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:05,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:05,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:05,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:05,436 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:05,436 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:05,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:05,437 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:05,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:05,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:05,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:05,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:05,437 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:05,437 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:05,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:05,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:05,438 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:05,438 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:05,438 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:05,438 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:05,438 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:05,439 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:05,439 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:05,439 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:05,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:05,441 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:05,441 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:05,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:05,441 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:05,441 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:05,515 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:05,517 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:05,517 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:05,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:05,517 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:05,517 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:05,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3046 [2022-12-06 07:35:05,517 INFO L420 AbstractCegarLoop]: === Iteration 3048 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:05,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:05,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1580987170, now seen corresponding path program 1 times [2022-12-06 07:35:05,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:05,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912812564] [2022-12-06 07:35:05,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:05,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:05,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-06 07:35:05,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:05,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912812564] [2022-12-06 07:35:05,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912812564] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:05,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:05,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:05,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305002138] [2022-12-06 07:35:05,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:05,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:05,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:05,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:05,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:05,583 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:05,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:05,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:05,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:05,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:05,619 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:05,619 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:05,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:05,620 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:05,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:05,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:05,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:05,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:05,620 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:05,621 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:05,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:05,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:05,621 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:05,621 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:05,621 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:05,621 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:05,622 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:05,622 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:05,622 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:05,622 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:05,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:05,624 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:05,624 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:05,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:05,624 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:05,624 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:05,699 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:05,700 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:05,700 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:05,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:05,700 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:05,700 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:05,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3047 [2022-12-06 07:35:05,701 INFO L420 AbstractCegarLoop]: === Iteration 3049 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:05,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:05,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1554205061, now seen corresponding path program 1 times [2022-12-06 07:35:05,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:05,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691740754] [2022-12-06 07:35:05,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:05,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35: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-06 07:35:05,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:05,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691740754] [2022-12-06 07:35:05,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691740754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:05,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:05,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:05,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333356821] [2022-12-06 07:35:05,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:05,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:05,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:05,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:05,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:05,769 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:05,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:05,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:05,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:05,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:05,805 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:05,805 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:05,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:05,805 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:05,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:05,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:05,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:05,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:05,806 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:05,806 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:05,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:05,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:05,807 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:05,807 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:05,807 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:05,807 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:05,807 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:05,807 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:05,807 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:05,807 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:05,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:05,809 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:05,809 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:05,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:05,810 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:05,810 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:05,885 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:05,886 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:05,887 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:05,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:05,887 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:05,887 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:05,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3048 [2022-12-06 07:35:05,887 INFO L420 AbstractCegarLoop]: === Iteration 3050 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:05,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:05,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1523728868, now seen corresponding path program 1 times [2022-12-06 07:35:05,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:05,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860035307] [2022-12-06 07:35:05,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:05,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:05,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:05,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-06 07:35:05,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:05,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860035307] [2022-12-06 07:35:05,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860035307] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:05,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:05,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:05,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297859210] [2022-12-06 07:35:05,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:05,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:05,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:05,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:05,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:05,972 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:05,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:05,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:05,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:05,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:06,015 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:06,015 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:06,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:06,016 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:06,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:06,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:06,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:06,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:06,016 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:06,016 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:06,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:06,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:06,017 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:06,017 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:06,017 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:06,017 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:06,017 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:06,017 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:06,017 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:06,018 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:06,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:06,020 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:06,020 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:06,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:06,020 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:06,020 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:06,096 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:06,097 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:35:06,098 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:06,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:06,098 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:06,098 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:06,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3049 [2022-12-06 07:35:06,098 INFO L420 AbstractCegarLoop]: === Iteration 3051 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:06,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:06,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1496946759, now seen corresponding path program 1 times [2022-12-06 07:35:06,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:06,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063077392] [2022-12-06 07:35:06,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:06,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:06,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:06,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-06 07:35:06,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:06,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063077392] [2022-12-06 07:35:06,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063077392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:06,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:06,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:06,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028594754] [2022-12-06 07:35:06,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:06,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:06,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:06,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:06,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:06,168 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:06,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:06,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:06,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:06,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:06,209 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:06,209 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:06,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:06,209 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:06,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:06,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:06,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:06,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:06,210 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:06,210 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:06,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:06,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:06,211 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:06,211 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:06,211 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:06,211 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:06,211 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:06,211 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:06,211 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:06,211 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:06,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:06,213 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:06,213 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:06,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:06,214 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:06,214 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:06,287 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:06,288 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:06,288 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:06,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:06,288 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:06,288 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:06,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3050 [2022-12-06 07:35:06,288 INFO L420 AbstractCegarLoop]: === Iteration 3052 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:06,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:06,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1466470566, now seen corresponding path program 1 times [2022-12-06 07:35:06,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:06,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888248656] [2022-12-06 07:35:06,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:06,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:06,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:06,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-06 07:35:06,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:06,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888248656] [2022-12-06 07:35:06,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888248656] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:06,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:06,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:06,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632612397] [2022-12-06 07:35:06,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:06,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:06,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:06,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:06,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:06,374 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:06,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:06,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:06,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:06,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:06,410 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:06,410 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:06,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:06,411 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:06,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:06,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:06,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:06,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:06,411 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:06,411 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:06,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:06,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:06,412 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:06,412 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:06,412 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:06,412 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:06,412 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:06,412 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:06,412 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:06,412 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:06,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:06,415 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:06,415 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:06,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:06,415 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:06,415 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:06,490 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:06,492 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:35:06,492 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:06,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:06,492 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:06,492 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:06,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3051 [2022-12-06 07:35:06,492 INFO L420 AbstractCegarLoop]: === Iteration 3053 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:06,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:06,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1439688457, now seen corresponding path program 1 times [2022-12-06 07:35:06,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:06,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608076860] [2022-12-06 07:35:06,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:06,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:06,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-06 07:35:06,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:06,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608076860] [2022-12-06 07:35:06,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608076860] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:06,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:06,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:06,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450743544] [2022-12-06 07:35:06,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:06,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:06,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:06,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:06,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:06,562 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:06,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:06,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:06,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:06,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:06,605 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:06,605 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:06,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:06,605 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:06,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:06,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:06,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:06,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:06,606 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:06,606 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:06,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:06,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:06,607 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:06,607 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:06,607 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:06,607 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:06,607 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:06,607 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:06,607 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:06,607 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:06,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:06,609 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:06,609 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:06,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:06,610 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:06,610 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:06,685 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:06,686 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:06,686 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:06,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:06,686 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:06,686 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:06,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3052 [2022-12-06 07:35:06,686 INFO L420 AbstractCegarLoop]: === Iteration 3054 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:06,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:06,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1409212264, now seen corresponding path program 1 times [2022-12-06 07:35:06,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:06,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631675545] [2022-12-06 07:35:06,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:06,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:06,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-06 07:35:06,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:06,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631675545] [2022-12-06 07:35:06,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631675545] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:06,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:06,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:06,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306541478] [2022-12-06 07:35:06,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:06,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:06,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:06,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:06,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:06,755 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:06,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:06,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:06,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:06,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:06,791 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:06,791 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:06,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:06,792 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:06,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:06,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:06,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:06,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:06,792 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:06,792 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:06,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:06,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:06,793 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:06,793 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:06,793 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:06,793 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:06,793 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:06,794 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:06,794 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:06,794 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:06,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:06,796 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:06,796 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:06,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:06,796 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:06,796 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:06,870 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:06,871 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:06,871 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:06,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:06,872 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:06,872 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:06,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3053 [2022-12-06 07:35:06,872 INFO L420 AbstractCegarLoop]: === Iteration 3055 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:06,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:06,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1382430155, now seen corresponding path program 1 times [2022-12-06 07:35:06,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:06,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699778713] [2022-12-06 07:35:06,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:06,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:06,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:06,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-06 07:35:06,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:06,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699778713] [2022-12-06 07:35:06,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699778713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:06,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:06,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:06,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523313853] [2022-12-06 07:35:06,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:06,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:06,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:06,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:06,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:06,942 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:06,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:06,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:06,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:06,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:06,978 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:06,978 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:06,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:06,979 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:06,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:06,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:06,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:06,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:06,979 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:06,979 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:06,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:06,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:06,980 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:06,980 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:06,980 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:06,980 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:06,980 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:06,980 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:06,980 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:06,981 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:06,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:06,983 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:06,983 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:06,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:06,983 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:06,983 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:07,058 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:07,060 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:35:07,060 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:07,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:07,060 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:07,060 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:07,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3054 [2022-12-06 07:35:07,060 INFO L420 AbstractCegarLoop]: === Iteration 3056 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:07,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:07,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1351953962, now seen corresponding path program 1 times [2022-12-06 07:35:07,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:07,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939176696] [2022-12-06 07:35:07,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:07,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:07,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:07,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-06 07:35:07,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:07,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939176696] [2022-12-06 07:35:07,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939176696] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:07,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:07,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:07,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802468374] [2022-12-06 07:35:07,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:07,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:07,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:07,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:07,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:07,129 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:07,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:07,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:07,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:07,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:07,171 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:07,171 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:07,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:07,172 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:07,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:07,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:07,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:07,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:07,172 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:07,172 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:07,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:07,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:07,173 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:07,173 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:07,173 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:07,173 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:07,173 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:07,174 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:07,174 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:07,174 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:07,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:07,176 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:07,176 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:07,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:07,176 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:07,176 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:07,252 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:07,253 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:35:07,253 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:07,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:07,253 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:07,253 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:07,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3055 [2022-12-06 07:35:07,253 INFO L420 AbstractCegarLoop]: === Iteration 3057 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:07,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:07,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1325171853, now seen corresponding path program 1 times [2022-12-06 07:35:07,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:07,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695793197] [2022-12-06 07:35:07,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:07,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:07,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:07,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-06 07:35:07,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:07,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695793197] [2022-12-06 07:35:07,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695793197] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:07,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:07,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:07,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114306694] [2022-12-06 07:35:07,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:07,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:07,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:07,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:07,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:07,323 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:07,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:07,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:07,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:07,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:07,365 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:07,365 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:07,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:07,366 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:07,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:07,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:07,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:07,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:07,366 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:07,366 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:07,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:07,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:07,367 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:07,367 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:07,367 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:07,367 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:07,367 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:07,367 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:07,367 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:07,367 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:07,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:07,370 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:07,370 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:07,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:07,370 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:07,370 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:07,444 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:07,446 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:07,446 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:07,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:07,446 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:07,446 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:07,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3056 [2022-12-06 07:35:07,446 INFO L420 AbstractCegarLoop]: === Iteration 3058 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:07,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:07,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1294695660, now seen corresponding path program 1 times [2022-12-06 07:35:07,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:07,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21376442] [2022-12-06 07:35:07,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:07,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:07,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-06 07:35:07,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:07,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21376442] [2022-12-06 07:35:07,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21376442] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:07,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:07,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:07,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351088873] [2022-12-06 07:35:07,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:07,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:07,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:07,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:07,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:07,513 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:07,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:07,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:07,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:07,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:07,550 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:07,550 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:07,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:07,551 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:07,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:07,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:07,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:07,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:07,551 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:07,551 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:07,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:07,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:07,552 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:07,552 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:07,552 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:07,552 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:07,552 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:07,552 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:07,552 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:07,553 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:07,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:07,555 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:07,555 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:07,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:07,555 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:07,555 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:07,629 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:07,630 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:07,630 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:07,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:07,631 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:07,631 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:07,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3057 [2022-12-06 07:35:07,631 INFO L420 AbstractCegarLoop]: === Iteration 3059 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:07,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:07,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1267913551, now seen corresponding path program 1 times [2022-12-06 07:35:07,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:07,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865688541] [2022-12-06 07:35:07,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:07,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:07,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-06 07:35:07,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:07,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865688541] [2022-12-06 07:35:07,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865688541] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:07,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:07,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:07,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226821595] [2022-12-06 07:35:07,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:07,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:07,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:07,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:07,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:07,710 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:07,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:07,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:07,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:07,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:07,749 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:07,750 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:07,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:07,750 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:07,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:07,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:07,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:07,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:07,751 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:07,751 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:07,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:07,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:07,751 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:07,752 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:07,752 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:07,752 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:07,752 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:07,752 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:07,752 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:07,752 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:07,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:07,754 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:07,754 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:07,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:07,755 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:07,755 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:07,830 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:07,831 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:07,832 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:07,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:07,832 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:07,832 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:07,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3058 [2022-12-06 07:35:07,832 INFO L420 AbstractCegarLoop]: === Iteration 3060 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:07,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:07,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1237437358, now seen corresponding path program 1 times [2022-12-06 07:35:07,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:07,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666889979] [2022-12-06 07:35:07,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:07,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:07,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-06 07:35:07,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:07,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666889979] [2022-12-06 07:35:07,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666889979] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:07,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:07,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:07,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238931467] [2022-12-06 07:35:07,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:07,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:07,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:07,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:07,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:07,897 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:07,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:07,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:07,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:07,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:07,934 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:07,934 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:07,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:07,935 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:07,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:07,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:07,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:07,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:07,935 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:07,935 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:07,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:07,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:07,936 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:07,936 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:07,936 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:07,936 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:07,936 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:07,937 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:07,937 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:07,937 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:07,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:07,939 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:07,939 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:07,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:07,939 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:07,939 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:08,013 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:08,014 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:08,014 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:08,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:08,014 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:08,014 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:08,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3059 [2022-12-06 07:35:08,014 INFO L420 AbstractCegarLoop]: === Iteration 3061 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:08,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:08,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1210655249, now seen corresponding path program 1 times [2022-12-06 07:35:08,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:08,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410900257] [2022-12-06 07:35:08,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:08,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:08,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-06 07:35:08,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:08,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410900257] [2022-12-06 07:35:08,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410900257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:08,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:08,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:08,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665033522] [2022-12-06 07:35:08,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:08,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:08,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:08,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:08,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:08,086 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:08,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:08,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:08,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:08,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:08,121 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:08,121 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:08,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:08,122 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:08,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:08,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:08,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:08,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:08,122 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:08,122 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:08,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:08,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:08,123 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:08,123 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:08,123 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:08,123 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:08,123 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:08,123 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:08,123 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:08,124 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:08,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:08,126 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:08,126 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:08,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:08,126 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:08,126 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:08,199 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:08,200 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:08,201 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:08,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:08,201 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:08,201 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:08,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3060 [2022-12-06 07:35:08,201 INFO L420 AbstractCegarLoop]: === Iteration 3062 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:08,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:08,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1180179056, now seen corresponding path program 1 times [2022-12-06 07:35:08,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:08,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308173712] [2022-12-06 07:35:08,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:08,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:08,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-06 07:35:08,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:08,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308173712] [2022-12-06 07:35:08,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308173712] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:08,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:08,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:08,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927496945] [2022-12-06 07:35:08,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:08,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:08,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:08,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:08,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:08,269 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:08,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:08,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:08,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:08,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:08,304 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:08,305 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:08,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:08,305 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:08,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:08,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:08,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:08,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:08,305 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:08,306 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:08,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:08,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:08,306 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:08,306 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:08,306 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:08,306 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:08,306 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:08,307 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:08,307 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:08,307 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:08,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:08,309 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:08,309 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:08,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:08,309 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:08,309 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:08,382 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:08,383 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:08,383 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:08,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:08,383 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:08,383 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:08,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3061 [2022-12-06 07:35:08,383 INFO L420 AbstractCegarLoop]: === Iteration 3063 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:08,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:08,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1153396947, now seen corresponding path program 1 times [2022-12-06 07:35:08,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:08,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143258517] [2022-12-06 07:35:08,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:08,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:08,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-06 07:35:08,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:08,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143258517] [2022-12-06 07:35:08,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143258517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:08,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:08,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:08,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593123617] [2022-12-06 07:35:08,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:08,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:08,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:08,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:08,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:08,451 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:08,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:08,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:08,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:08,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:08,487 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:08,487 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:08,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:08,487 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:08,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:08,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:08,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:08,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:08,488 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:08,488 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:08,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:08,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:08,488 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:08,488 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:08,489 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:08,489 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:08,489 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:08,489 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:08,489 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:08,489 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:08,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:08,491 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:08,491 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:08,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:08,491 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:08,491 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:08,565 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:08,566 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:08,566 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:08,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:08,567 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:08,567 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:08,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3062 [2022-12-06 07:35:08,567 INFO L420 AbstractCegarLoop]: === Iteration 3064 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:08,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:08,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1122920754, now seen corresponding path program 1 times [2022-12-06 07:35:08,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:08,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028379206] [2022-12-06 07:35:08,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:08,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:08,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-06 07:35:08,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:08,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028379206] [2022-12-06 07:35:08,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028379206] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:08,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:08,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:08,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079080949] [2022-12-06 07:35:08,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:08,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:08,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:08,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:08,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:08,634 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:08,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:08,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:08,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:08,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:08,675 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:08,675 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:08,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:08,676 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:08,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:08,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:08,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:08,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:08,676 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:08,676 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:08,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:08,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:08,677 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:08,677 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:08,677 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:08,677 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:08,677 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:08,677 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:08,677 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:08,678 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:08,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:08,680 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:08,680 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:08,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 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 116. Up to 16 conditions per place. [2022-12-06 07:35:08,680 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:08,680 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:08,752 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:08,754 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:35:08,754 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:08,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:08,754 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:08,754 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:08,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3063 [2022-12-06 07:35:08,754 INFO L420 AbstractCegarLoop]: === Iteration 3065 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:08,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:08,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1096138645, now seen corresponding path program 1 times [2022-12-06 07:35:08,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:08,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900684945] [2022-12-06 07:35:08,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:08,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:08,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-06 07:35:08,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:08,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900684945] [2022-12-06 07:35:08,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900684945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:08,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:08,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:08,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787761532] [2022-12-06 07:35:08,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:08,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:08,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:08,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:08,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:08,840 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:08,840 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:08,840 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:08,840 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:08,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:08,882 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:08,882 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:08,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:08,882 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:08,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:08,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:08,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:08,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:08,883 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:08,883 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:08,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:08,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:08,884 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:08,884 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:08,884 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:08,884 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:08,884 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:08,884 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:08,884 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:08,884 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:08,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:08,886 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:08,886 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:08,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:08,887 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:08,887 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:08,960 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:08,961 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:08,961 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:08,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:08,962 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:08,962 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:08,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3064 [2022-12-06 07:35:08,962 INFO L420 AbstractCegarLoop]: === Iteration 3066 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:08,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:08,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1065662452, now seen corresponding path program 1 times [2022-12-06 07:35:08,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:08,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952195585] [2022-12-06 07:35:08,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:08,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:09,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:09,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:09,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952195585] [2022-12-06 07:35:09,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952195585] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:09,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:09,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:09,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006318190] [2022-12-06 07:35:09,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:09,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:09,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:09,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:09,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:09,029 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:09,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:09,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:09,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:09,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:09,065 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:09,065 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:09,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:09,065 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:09,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:09,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:09,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:09,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:09,066 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:09,066 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:09,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:09,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:09,066 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:09,066 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:09,066 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:09,067 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:09,067 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:09,067 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:09,067 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:09,067 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:09,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:09,069 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:09,069 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:09,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:09,069 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:09,069 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:09,144 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:09,145 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:09,145 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:09,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:09,145 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:09,145 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:09,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3065 [2022-12-06 07:35:09,145 INFO L420 AbstractCegarLoop]: === Iteration 3067 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:09,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:09,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1038880343, now seen corresponding path program 1 times [2022-12-06 07:35:09,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:09,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138761484] [2022-12-06 07:35:09,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:09,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:09,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:09,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-06 07:35:09,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:09,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138761484] [2022-12-06 07:35:09,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138761484] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:09,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:09,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:09,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030537487] [2022-12-06 07:35:09,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:09,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:09,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:09,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:09,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:09,214 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:09,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:09,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:09,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:09,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:09,259 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:09,259 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:09,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:09,259 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:09,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:09,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:09,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:09,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:09,260 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:09,260 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:09,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:09,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:09,261 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:09,261 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:09,261 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:09,261 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:09,261 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:09,261 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:09,261 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:09,261 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:09,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:09,263 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:09,263 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:09,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:09,264 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:09,264 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:09,337 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:09,338 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:09,338 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:09,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:09,338 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:09,338 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:09,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3066 [2022-12-06 07:35:09,338 INFO L420 AbstractCegarLoop]: === Iteration 3068 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:09,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:09,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1008404150, now seen corresponding path program 1 times [2022-12-06 07:35:09,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:09,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107822659] [2022-12-06 07:35:09,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:09,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:09,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-06 07:35:09,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:09,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107822659] [2022-12-06 07:35:09,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107822659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:09,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:09,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:09,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654991410] [2022-12-06 07:35:09,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:09,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:09,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:09,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:09,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:09,404 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:09,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:09,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:09,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:09,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:09,445 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:09,446 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:09,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:09,446 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:09,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:09,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:09,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:09,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:09,447 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:09,447 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:09,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:09,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:09,447 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:09,447 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:09,447 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:09,447 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:09,448 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:09,448 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:09,448 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:09,448 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:09,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:09,450 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:09,450 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:09,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:09,450 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:09,450 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:09,524 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:09,525 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:09,525 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:09,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:09,525 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:09,525 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:09,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3067 [2022-12-06 07:35:09,525 INFO L420 AbstractCegarLoop]: === Iteration 3069 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:09,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:09,526 INFO L85 PathProgramCache]: Analyzing trace with hash -981622041, now seen corresponding path program 1 times [2022-12-06 07:35:09,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:09,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636291468] [2022-12-06 07:35:09,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:09,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:09,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-06 07:35:09,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:09,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636291468] [2022-12-06 07:35:09,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636291468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:09,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:09,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:09,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949457847] [2022-12-06 07:35:09,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:09,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:09,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:09,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:09,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:09,596 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:09,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:09,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:09,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:09,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:09,632 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:09,632 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:09,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:09,632 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:09,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:09,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:09,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:09,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:09,633 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:09,633 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:09,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:09,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:09,634 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:09,634 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:09,634 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:09,634 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:09,634 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:09,634 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:09,634 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:09,634 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:09,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:09,636 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:09,636 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:09,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:09,637 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:09,637 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:09,711 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:09,712 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:09,712 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:09,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:09,712 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:09,712 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:09,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3068 [2022-12-06 07:35:09,712 INFO L420 AbstractCegarLoop]: === Iteration 3070 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:09,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:09,712 INFO L85 PathProgramCache]: Analyzing trace with hash -951145848, now seen corresponding path program 1 times [2022-12-06 07:35:09,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:09,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968020999] [2022-12-06 07:35:09,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:09,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:09,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:09,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-06 07:35:09,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:09,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968020999] [2022-12-06 07:35:09,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968020999] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:09,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:09,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:09,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388800661] [2022-12-06 07:35:09,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:09,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:09,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:09,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:09,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:09,778 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:09,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:09,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:09,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:09,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:09,821 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:09,821 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:09,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 336 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:09,822 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:09,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:09,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:09,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:09,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:09,822 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:09,822 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:09,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:09,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:09,823 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:09,823 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:09,823 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:09,823 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:09,823 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:09,823 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:09,823 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:09,823 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:09,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:09,826 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:09,826 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:09,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:09,826 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:09,826 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:09,900 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:09,901 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:09,901 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:09,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:09,901 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:09,901 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:09,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3069 [2022-12-06 07:35:09,901 INFO L420 AbstractCegarLoop]: === Iteration 3071 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:09,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:09,902 INFO L85 PathProgramCache]: Analyzing trace with hash -924363739, now seen corresponding path program 1 times [2022-12-06 07:35:09,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:09,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947199509] [2022-12-06 07:35:09,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:09,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35: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-06 07:35:09,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:09,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947199509] [2022-12-06 07:35:09,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947199509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:09,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:09,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:09,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79763126] [2022-12-06 07:35:09,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:09,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:09,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:09,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:09,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:09,970 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:09,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:09,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:09,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:09,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:10,011 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:10,011 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:10,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:10,012 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:10,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:10,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:10,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:10,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:10,012 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:10,012 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:10,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:10,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:10,013 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:10,013 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:10,013 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:10,013 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:10,013 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:10,013 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:10,013 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:10,014 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:10,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:10,016 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:10,016 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:10,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:10,016 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:10,016 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:10,092 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:10,093 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:35:10,093 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:10,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:10,093 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:10,093 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:10,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3070 [2022-12-06 07:35:10,093 INFO L420 AbstractCegarLoop]: === Iteration 3072 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:10,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:10,093 INFO L85 PathProgramCache]: Analyzing trace with hash -893887546, now seen corresponding path program 1 times [2022-12-06 07:35:10,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:10,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490789545] [2022-12-06 07:35:10,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:10,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:10,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-06 07:35:10,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:10,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490789545] [2022-12-06 07:35:10,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490789545] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:10,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:10,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:10,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379625025] [2022-12-06 07:35:10,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:10,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:10,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:10,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:10,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:10,170 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:10,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:10,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:10,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:10,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:10,211 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:10,212 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:10,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:10,212 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:10,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:10,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:10,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:10,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:10,212 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:10,213 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:10,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:10,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:10,213 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:10,213 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:10,213 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:10,213 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:10,213 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:10,214 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:10,214 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:10,214 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:10,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:10,216 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:10,216 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:10,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:10,216 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:10,216 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:10,291 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:10,292 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:10,292 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:10,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:10,292 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:10,292 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:10,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3071 [2022-12-06 07:35:10,293 INFO L420 AbstractCegarLoop]: === Iteration 3073 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:10,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:10,293 INFO L85 PathProgramCache]: Analyzing trace with hash -867105437, now seen corresponding path program 1 times [2022-12-06 07:35:10,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:10,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813817508] [2022-12-06 07:35:10,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:10,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35: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-06 07:35:10,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:10,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813817508] [2022-12-06 07:35:10,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813817508] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:10,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:10,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:10,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466821064] [2022-12-06 07:35:10,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:10,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:10,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:10,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:10,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:10,362 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:10,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:10,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:10,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:10,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:10,397 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:10,398 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:10,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:10,398 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:10,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:10,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:10,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:10,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:10,398 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:10,399 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:10,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:10,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:10,399 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:10,399 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:10,399 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:10,399 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:10,399 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:10,400 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:10,400 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:10,400 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:10,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:10,402 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:10,402 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:10,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:10,402 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:10,402 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:10,477 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:10,478 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:10,478 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:10,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:10,478 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:10,478 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:10,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3072 [2022-12-06 07:35:10,478 INFO L420 AbstractCegarLoop]: === Iteration 3074 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:10,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:10,479 INFO L85 PathProgramCache]: Analyzing trace with hash -836629244, now seen corresponding path program 1 times [2022-12-06 07:35:10,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:10,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702666848] [2022-12-06 07:35:10,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:10,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:10,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:10,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:10,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702666848] [2022-12-06 07:35:10,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702666848] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:10,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:10,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:10,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612888726] [2022-12-06 07:35:10,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:10,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:10,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:10,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:10,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:10,547 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:10,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:10,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:10,547 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:10,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:10,584 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:10,584 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:10,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:10,584 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:10,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:10,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:10,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:10,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:10,585 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:10,585 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:10,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:10,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:10,586 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:10,586 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:10,586 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:10,586 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:10,586 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:10,586 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:10,586 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:10,586 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:10,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:10,588 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:10,588 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:10,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:10,588 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:10,589 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:10,663 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:10,664 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:10,665 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:10,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:10,665 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:10,665 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:10,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3073 [2022-12-06 07:35:10,665 INFO L420 AbstractCegarLoop]: === Iteration 3075 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:10,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:10,665 INFO L85 PathProgramCache]: Analyzing trace with hash -809847135, now seen corresponding path program 1 times [2022-12-06 07:35:10,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:10,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246017665] [2022-12-06 07:35:10,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:10,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:10,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:10,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-06 07:35:10,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:10,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246017665] [2022-12-06 07:35:10,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246017665] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:10,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:10,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:10,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150726049] [2022-12-06 07:35:10,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:10,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:10,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:10,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:10,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:10,735 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:10,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:10,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:10,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:10,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:10,773 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:10,773 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:10,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 371 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:10,774 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:10,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:10,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:10,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:10,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:10,774 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:10,774 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:10,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:10,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:10,775 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:10,775 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:10,775 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:10,775 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:10,775 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:10,775 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:10,775 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:10,775 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:10,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:10,777 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:10,777 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:10,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:10,778 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:10,778 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:10,852 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:10,853 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:10,853 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:10,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:10,853 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:10,853 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:10,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3074 [2022-12-06 07:35:10,853 INFO L420 AbstractCegarLoop]: === Iteration 3076 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:10,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:10,854 INFO L85 PathProgramCache]: Analyzing trace with hash -779370942, now seen corresponding path program 1 times [2022-12-06 07:35:10,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:10,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820876468] [2022-12-06 07:35:10,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:10,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:10,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-06 07:35:10,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:10,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820876468] [2022-12-06 07:35:10,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820876468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:10,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:10,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:10,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765302762] [2022-12-06 07:35:10,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:10,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:10,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:10,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:10,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:10,926 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:10,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:10,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:10,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:10,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:10,966 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:10,966 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:10,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:10,967 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:10,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:10,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:10,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:10,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:10,967 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:10,967 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:10,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:10,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:10,968 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:10,968 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:10,968 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:10,968 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:10,968 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:10,968 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:10,969 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:10,969 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:10,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:10,971 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:10,971 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:10,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:10,971 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:10,971 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:11,045 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:11,046 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:11,046 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:11,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:11,046 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:11,046 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:11,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3075 [2022-12-06 07:35:11,046 INFO L420 AbstractCegarLoop]: === Iteration 3077 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:11,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:11,046 INFO L85 PathProgramCache]: Analyzing trace with hash -752588833, now seen corresponding path program 1 times [2022-12-06 07:35:11,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:11,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450064037] [2022-12-06 07:35:11,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:11,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:11,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-06 07:35:11,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:11,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450064037] [2022-12-06 07:35:11,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450064037] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:11,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:11,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:11,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431488639] [2022-12-06 07:35:11,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:11,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:11,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:11,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:11,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:11,123 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:11,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:11,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:11,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:11,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:11,160 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:11,160 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:11,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:11,160 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:11,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:11,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:11,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:11,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:11,161 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:11,161 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:11,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:11,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:11,162 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:11,162 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:11,162 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:11,162 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:11,162 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:11,162 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:11,162 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:11,162 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:11,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:11,164 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:11,164 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:11,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:11,165 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:11,165 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:11,238 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:11,240 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:11,240 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:11,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:11,240 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:11,240 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:11,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3076 [2022-12-06 07:35:11,240 INFO L420 AbstractCegarLoop]: === Iteration 3078 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:11,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:11,240 INFO L85 PathProgramCache]: Analyzing trace with hash -722112640, now seen corresponding path program 1 times [2022-12-06 07:35:11,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:11,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759627576] [2022-12-06 07:35:11,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:11,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:11,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:11,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-06 07:35:11,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:11,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759627576] [2022-12-06 07:35:11,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759627576] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:11,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:11,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:11,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335336619] [2022-12-06 07:35:11,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:11,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:11,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:11,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:11,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:11,323 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:11,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:11,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:11,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:11,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:11,365 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:11,365 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:11,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:11,365 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:11,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:11,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:11,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:11,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:11,366 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:11,366 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:11,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:11,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:11,366 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:11,366 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:11,366 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:11,367 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:11,367 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:11,367 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:11,367 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:11,367 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:11,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:11,369 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:11,369 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:11,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:11,369 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:11,369 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:11,442 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:11,443 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:35:11,443 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:11,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:11,444 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:11,444 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:11,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3077 [2022-12-06 07:35:11,444 INFO L420 AbstractCegarLoop]: === Iteration 3079 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:11,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:11,444 INFO L85 PathProgramCache]: Analyzing trace with hash -695330531, now seen corresponding path program 1 times [2022-12-06 07:35:11,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:11,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113775246] [2022-12-06 07:35:11,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:11,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:11,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-06 07:35:11,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:11,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113775246] [2022-12-06 07:35:11,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113775246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:11,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:11,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:11,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741287546] [2022-12-06 07:35:11,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:11,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:11,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:11,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:11,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:11,514 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:11,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:11,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:11,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:11,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:11,552 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:11,552 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:11,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 374 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:11,552 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:11,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:11,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:11,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:11,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:11,553 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:11,553 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:11,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:11,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:11,553 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:11,553 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:11,554 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:11,554 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:11,554 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:11,554 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:11,554 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:11,554 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:11,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:11,556 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:11,556 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:11,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:11,556 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:11,556 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:11,630 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:11,631 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:11,632 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:11,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:11,632 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:11,632 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:11,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3078 [2022-12-06 07:35:11,632 INFO L420 AbstractCegarLoop]: === Iteration 3080 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:11,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:11,632 INFO L85 PathProgramCache]: Analyzing trace with hash -664854338, now seen corresponding path program 1 times [2022-12-06 07:35:11,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:11,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582241757] [2022-12-06 07:35:11,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:11,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:11,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-06 07:35:11,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:11,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582241757] [2022-12-06 07:35:11,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582241757] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:11,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:11,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:11,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187117018] [2022-12-06 07:35:11,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:11,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:11,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:11,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:11,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:11,697 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:11,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:11,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:11,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:11,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:11,733 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:11,733 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:11,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:11,733 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:11,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:11,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:11,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:11,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:11,734 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:11,734 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:11,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:11,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:11,734 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:11,734 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:11,735 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:11,735 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:11,735 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:11,735 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:11,735 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:11,735 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:11,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:11,737 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:11,737 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:11,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:11,737 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:11,737 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:11,811 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:11,813 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:11,813 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:11,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:11,813 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:11,813 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:11,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3079 [2022-12-06 07:35:11,813 INFO L420 AbstractCegarLoop]: === Iteration 3081 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:11,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:11,813 INFO L85 PathProgramCache]: Analyzing trace with hash -638072229, now seen corresponding path program 1 times [2022-12-06 07:35:11,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:11,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559478543] [2022-12-06 07:35:11,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:11,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:11,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-06 07:35:11,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:11,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559478543] [2022-12-06 07:35:11,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559478543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:11,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:11,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:11,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695224765] [2022-12-06 07:35:11,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:11,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:11,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:11,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:11,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:11,884 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:11,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:11,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:11,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:11,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:11,925 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:11,925 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:11,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:11,925 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:11,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:11,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:11,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:11,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:11,926 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:11,926 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:11,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:11,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:11,926 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:11,926 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:11,927 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:11,927 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:11,927 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:11,927 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:11,927 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:11,927 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:11,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:11,929 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:11,929 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:11,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:11,929 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:11,929 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:12,005 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:12,006 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:12,006 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:12,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:12,006 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:12,006 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:12,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3080 [2022-12-06 07:35:12,006 INFO L420 AbstractCegarLoop]: === Iteration 3082 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:12,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:12,007 INFO L85 PathProgramCache]: Analyzing trace with hash -607596036, now seen corresponding path program 1 times [2022-12-06 07:35:12,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:12,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120404359] [2022-12-06 07:35:12,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:12,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:12,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-06 07:35:12,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:12,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120404359] [2022-12-06 07:35:12,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120404359] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:12,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:12,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:12,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228999202] [2022-12-06 07:35:12,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:12,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:12,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:12,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:12,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:12,073 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:12,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:12,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:12,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:12,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:12,114 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:12,114 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:12,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:12,114 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:12,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:12,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:12,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:12,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:12,115 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:12,115 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:12,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:12,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:12,116 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:12,116 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:12,116 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:12,116 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:12,116 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:12,116 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:12,116 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:12,116 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:12,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:12,118 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:12,118 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:12,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:12,119 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:12,119 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:12,193 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:12,195 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:12,195 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:12,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:12,195 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:12,195 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:12,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3081 [2022-12-06 07:35:12,195 INFO L420 AbstractCegarLoop]: === Iteration 3083 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:12,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:12,195 INFO L85 PathProgramCache]: Analyzing trace with hash -580813927, now seen corresponding path program 1 times [2022-12-06 07:35:12,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:12,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825392301] [2022-12-06 07:35:12,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:12,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:12,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:12,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:12,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825392301] [2022-12-06 07:35:12,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825392301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:12,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:12,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:12,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083046407] [2022-12-06 07:35:12,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:12,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:12,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:12,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:12,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:12,265 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:12,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:12,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:12,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:12,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:12,306 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:12,307 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:12,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:12,307 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:12,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:12,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:12,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:12,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:12,308 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:12,308 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:12,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:12,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:12,308 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:12,308 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:12,309 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:12,309 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:12,309 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:12,309 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:12,309 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:12,309 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:12,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:12,311 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:12,311 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:12,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:12,311 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:12,311 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:12,387 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:12,388 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:12,388 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:12,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:12,388 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:12,388 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:12,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3082 [2022-12-06 07:35:12,388 INFO L420 AbstractCegarLoop]: === Iteration 3084 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:12,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:12,388 INFO L85 PathProgramCache]: Analyzing trace with hash -550337734, now seen corresponding path program 1 times [2022-12-06 07:35:12,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:12,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325884388] [2022-12-06 07:35:12,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:12,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35: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-06 07:35:12,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:12,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325884388] [2022-12-06 07:35:12,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325884388] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:12,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:12,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:12,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922579439] [2022-12-06 07:35:12,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:12,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:12,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:12,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:12,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:12,460 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:12,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:12,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:12,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:12,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:12,495 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:12,495 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:12,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:12,495 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:12,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:12,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:12,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:12,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:12,496 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:12,496 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:12,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:12,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:12,497 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:12,497 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:12,497 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:12,497 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:12,497 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:12,497 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:12,497 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:12,497 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:12,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:12,499 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:12,499 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:12,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:12,500 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:12,500 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:12,586 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:12,587 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-06 07:35:12,587 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:12,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:12,587 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:12,587 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:12,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3083 [2022-12-06 07:35:12,588 INFO L420 AbstractCegarLoop]: === Iteration 3085 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:12,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:12,588 INFO L85 PathProgramCache]: Analyzing trace with hash -523555625, now seen corresponding path program 1 times [2022-12-06 07:35:12,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:12,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92677685] [2022-12-06 07:35:12,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:12,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:12,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-06 07:35:12,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:12,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92677685] [2022-12-06 07:35:12,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92677685] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:12,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:12,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:12,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130301200] [2022-12-06 07:35:12,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:12,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:12,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:12,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:12,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:12,657 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:12,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:12,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:12,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:12,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:12,693 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:12,693 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:12,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:12,694 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:12,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:12,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:12,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:12,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:12,694 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:12,694 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:12,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:12,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:12,695 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:12,695 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:12,695 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:12,695 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:12,695 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:12,696 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:12,696 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:12,696 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:12,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:12,698 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:12,698 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:12,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:12,698 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:12,698 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:12,771 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:12,772 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:12,772 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:12,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:12,772 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:12,772 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:12,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3084 [2022-12-06 07:35:12,773 INFO L420 AbstractCegarLoop]: === Iteration 3086 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:12,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:12,773 INFO L85 PathProgramCache]: Analyzing trace with hash -493079432, now seen corresponding path program 1 times [2022-12-06 07:35:12,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:12,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810892227] [2022-12-06 07:35:12,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:12,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:12,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-06 07:35:12,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:12,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810892227] [2022-12-06 07:35:12,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810892227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:12,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:12,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:12,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826391154] [2022-12-06 07:35:12,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:12,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:12,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:12,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:12,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:12,839 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:12,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:12,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:12,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:12,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:12,876 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:12,876 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:12,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:12,876 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:12,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:12,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:12,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:12,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:12,877 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:12,877 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:12,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:12,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:12,877 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:12,877 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:12,877 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:12,878 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:12,878 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:12,878 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:12,878 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:12,878 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:12,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:12,880 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:12,880 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:12,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:12,880 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:12,880 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:12,954 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:12,955 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:12,955 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:12,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:12,956 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:12,956 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:12,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3085 [2022-12-06 07:35:12,956 INFO L420 AbstractCegarLoop]: === Iteration 3087 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:12,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:12,956 INFO L85 PathProgramCache]: Analyzing trace with hash -466297323, now seen corresponding path program 1 times [2022-12-06 07:35:12,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:12,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323286530] [2022-12-06 07:35:12,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:12,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:12,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:13,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-06 07:35:13,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:13,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323286530] [2022-12-06 07:35:13,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323286530] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:13,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:13,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:13,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498777113] [2022-12-06 07:35:13,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:13,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:13,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:13,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:13,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:13,024 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:13,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:13,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:13,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:13,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:13,064 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:13,064 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:13,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:13,065 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:13,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:13,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:13,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:13,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:13,065 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:13,065 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:13,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:13,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:13,066 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:13,066 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:13,066 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:13,066 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:13,066 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:13,066 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:13,066 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:13,067 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:13,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:13,069 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:13,069 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:13,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:13,069 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:13,069 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:13,142 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:13,143 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:13,143 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:13,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:13,143 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:13,143 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:13,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3086 [2022-12-06 07:35:13,144 INFO L420 AbstractCegarLoop]: === Iteration 3088 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:13,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:13,144 INFO L85 PathProgramCache]: Analyzing trace with hash -435821130, now seen corresponding path program 1 times [2022-12-06 07:35:13,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:13,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866165499] [2022-12-06 07:35:13,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:13,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:13,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:13,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:13,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866165499] [2022-12-06 07:35:13,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866165499] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:13,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:13,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:13,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097692860] [2022-12-06 07:35:13,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:13,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:13,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:13,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:13,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:13,211 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:13,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:13,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:13,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:13,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:13,247 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:13,247 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:13,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:13,247 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:13,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:13,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:13,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:13,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:13,248 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:13,248 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:13,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:13,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:13,249 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:13,249 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:13,249 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:13,249 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:13,249 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:13,249 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:13,249 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:13,249 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:13,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:13,251 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:13,251 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:13,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:13,252 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:13,252 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:13,325 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:13,326 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:13,326 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:13,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:13,326 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:13,326 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:13,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3087 [2022-12-06 07:35:13,326 INFO L420 AbstractCegarLoop]: === Iteration 3089 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:13,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:13,326 INFO L85 PathProgramCache]: Analyzing trace with hash -409039021, now seen corresponding path program 1 times [2022-12-06 07:35:13,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:13,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558917793] [2022-12-06 07:35:13,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:13,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:13,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-06 07:35:13,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:13,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558917793] [2022-12-06 07:35:13,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558917793] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:13,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:13,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:13,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270043462] [2022-12-06 07:35:13,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:13,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:13,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:13,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:13,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:13,395 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:13,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:13,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:13,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:13,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:13,436 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:13,436 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:13,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:13,437 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:13,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:13,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:13,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:13,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:13,437 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:13,437 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:13,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:13,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:13,438 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:13,438 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:13,438 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:13,438 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:13,438 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:13,438 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:13,438 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:13,438 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:13,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:13,441 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:13,441 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:13,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:13,441 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:13,441 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:13,515 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:13,516 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:13,516 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:13,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:13,516 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:13,516 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:13,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3088 [2022-12-06 07:35:13,516 INFO L420 AbstractCegarLoop]: === Iteration 3090 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:13,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:13,516 INFO L85 PathProgramCache]: Analyzing trace with hash -378562828, now seen corresponding path program 1 times [2022-12-06 07:35:13,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:13,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011599663] [2022-12-06 07:35:13,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:13,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:13,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-06 07:35:13,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:13,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011599663] [2022-12-06 07:35:13,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011599663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:13,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:13,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:13,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844812605] [2022-12-06 07:35:13,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:13,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:13,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:13,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:13,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:13,584 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:13,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:13,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:13,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:13,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:13,626 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:13,626 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:13,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:13,627 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:13,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:13,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:13,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:13,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:13,627 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:13,627 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:13,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:13,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:13,628 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:13,628 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:13,628 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:13,628 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:13,628 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:13,628 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:13,628 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:13,628 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:13,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:13,631 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:13,631 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:13,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 118 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:13,631 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:13,631 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:13,706 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:13,708 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:35:13,708 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:13,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:13,708 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:13,708 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:13,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3089 [2022-12-06 07:35:13,708 INFO L420 AbstractCegarLoop]: === Iteration 3091 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:13,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:13,708 INFO L85 PathProgramCache]: Analyzing trace with hash -351780719, now seen corresponding path program 1 times [2022-12-06 07:35:13,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:13,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647258584] [2022-12-06 07:35:13,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:13,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:13,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-06 07:35:13,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:13,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647258584] [2022-12-06 07:35:13,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647258584] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:13,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:13,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:13,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851546172] [2022-12-06 07:35:13,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:13,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:13,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:13,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:13,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:13,795 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:13,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:13,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:13,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:13,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:13,837 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:13,837 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:13,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 355 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:13,838 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:13,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:13,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:13,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:13,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:13,838 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:13,838 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:13,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:13,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:13,839 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:13,839 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:13,839 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:13,839 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:13,839 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:13,839 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:13,839 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:13,840 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:13,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:13,842 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:13,842 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:13,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:13,842 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:13,842 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:13,918 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:13,919 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:35:13,919 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:13,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:13,919 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:13,919 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:13,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3090 [2022-12-06 07:35:13,920 INFO L420 AbstractCegarLoop]: === Iteration 3092 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:13,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:13,920 INFO L85 PathProgramCache]: Analyzing trace with hash -321304526, now seen corresponding path program 1 times [2022-12-06 07:35:13,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:13,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009326060] [2022-12-06 07:35:13,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:13,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:13,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-06 07:35:13,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:13,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009326060] [2022-12-06 07:35:13,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009326060] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:13,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:13,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:13,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927496135] [2022-12-06 07:35:13,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:13,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:13,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:13,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:13,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:13,990 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:13,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:13,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:13,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:13,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:14,026 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:14,027 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:14,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:14,027 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:14,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:14,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:14,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:14,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:14,028 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:14,028 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:14,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:14,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:14,028 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:14,028 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:14,029 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:14,029 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:14,029 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:14,029 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:14,029 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:14,029 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:14,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:14,031 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:14,031 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:14,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:14,031 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:14,031 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:14,108 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:14,109 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:35:14,109 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:14,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:14,109 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:14,109 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:14,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3091 [2022-12-06 07:35:14,109 INFO L420 AbstractCegarLoop]: === Iteration 3093 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:14,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:14,110 INFO L85 PathProgramCache]: Analyzing trace with hash -294522417, now seen corresponding path program 1 times [2022-12-06 07:35:14,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:14,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641366494] [2022-12-06 07:35:14,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:14,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:14,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-06 07:35:14,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:14,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641366494] [2022-12-06 07:35:14,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641366494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:14,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:14,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:14,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501511323] [2022-12-06 07:35:14,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:14,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:14,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:14,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:14,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:14,182 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:14,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:14,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:14,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:14,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:14,223 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:14,223 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:14,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:14,224 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:14,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:14,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:14,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:14,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:14,224 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:14,224 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:14,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:14,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:14,225 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:14,225 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:14,225 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:14,225 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:14,225 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:14,225 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:14,225 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:14,225 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:14,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:14,228 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:14,228 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:14,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:14,228 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:14,228 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:14,302 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:14,303 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:14,303 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:14,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:14,304 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:14,304 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:14,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3092 [2022-12-06 07:35:14,304 INFO L420 AbstractCegarLoop]: === Iteration 3094 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:14,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:14,304 INFO L85 PathProgramCache]: Analyzing trace with hash -264046224, now seen corresponding path program 1 times [2022-12-06 07:35:14,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:14,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164142966] [2022-12-06 07:35:14,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:14,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:14,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-06 07:35:14,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:14,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164142966] [2022-12-06 07:35:14,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164142966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:14,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:14,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:14,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664307503] [2022-12-06 07:35:14,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:14,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:14,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:14,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:14,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:14,372 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:14,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:14,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:14,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:14,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:14,409 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:14,409 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:14,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:14,410 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:14,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:14,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:14,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:14,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:14,410 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:14,410 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:14,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:14,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:14,411 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:14,411 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:14,411 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:14,411 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:14,411 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:14,411 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:14,411 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:14,411 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:14,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:14,414 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:14,414 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:14,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:14,414 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:14,414 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:14,489 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:14,491 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:35:14,491 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:14,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:14,491 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:14,491 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:14,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3093 [2022-12-06 07:35:14,491 INFO L420 AbstractCegarLoop]: === Iteration 3095 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:14,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:14,491 INFO L85 PathProgramCache]: Analyzing trace with hash -237264115, now seen corresponding path program 1 times [2022-12-06 07:35:14,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:14,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6052845] [2022-12-06 07:35:14,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:14,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:14,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-06 07:35:14,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:14,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6052845] [2022-12-06 07:35:14,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6052845] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:14,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:14,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:14,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384425741] [2022-12-06 07:35:14,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:14,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:14,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:14,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:14,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:14,561 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:14,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:14,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:14,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:14,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:14,600 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:14,601 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:14,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:14,601 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:14,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:14,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:14,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:14,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:14,602 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:14,602 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:14,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:14,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:14,602 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:14,602 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:14,603 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:14,603 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:14,603 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:14,603 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:14,603 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:14,603 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:14,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:14,605 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:14,605 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:14,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:14,605 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:14,605 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:14,680 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:14,681 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:14,681 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:14,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:14,681 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:14,681 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:14,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3094 [2022-12-06 07:35:14,681 INFO L420 AbstractCegarLoop]: === Iteration 3096 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:14,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:14,682 INFO L85 PathProgramCache]: Analyzing trace with hash -206787922, now seen corresponding path program 1 times [2022-12-06 07:35:14,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:14,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453536632] [2022-12-06 07:35:14,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:14,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:14,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-06 07:35:14,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:14,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453536632] [2022-12-06 07:35:14,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453536632] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:14,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:14,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:14,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899835086] [2022-12-06 07:35:14,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:14,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:14,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:14,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:14,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:14,750 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:14,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:14,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:14,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:14,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:14,786 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:14,786 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:14,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:14,787 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:14,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:14,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:14,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:14,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:14,787 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:14,787 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:14,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:14,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:14,788 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:14,788 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:14,788 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:14,788 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:14,788 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:14,788 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:14,788 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:14,789 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:14,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:14,791 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:14,791 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:14,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:14,791 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:14,791 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:14,865 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:14,866 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:14,866 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:14,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:14,866 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:14,866 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:14,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3095 [2022-12-06 07:35:14,866 INFO L420 AbstractCegarLoop]: === Iteration 3097 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:14,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:14,867 INFO L85 PathProgramCache]: Analyzing trace with hash -180005813, now seen corresponding path program 1 times [2022-12-06 07:35:14,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:14,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488480634] [2022-12-06 07:35:14,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:14,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:14,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-06 07:35:14,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:14,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488480634] [2022-12-06 07:35:14,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488480634] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:14,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:14,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:14,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338575841] [2022-12-06 07:35:14,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:14,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:14,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:14,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:14,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:14,936 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:14,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:14,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:14,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:14,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:14,978 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:14,978 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:14,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:14,978 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:14,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:14,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:14,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:14,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:14,979 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:14,979 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:14,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:14,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:14,980 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:14,980 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:14,980 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:14,980 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:14,980 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:14,980 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:14,980 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:14,980 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:14,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:14,982 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:14,982 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:14,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:14,983 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:14,983 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:15,069 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:15,070 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-06 07:35:15,070 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:15,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:15,071 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:15,071 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:15,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3096 [2022-12-06 07:35:15,071 INFO L420 AbstractCegarLoop]: === Iteration 3098 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:15,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:15,071 INFO L85 PathProgramCache]: Analyzing trace with hash -149529620, now seen corresponding path program 1 times [2022-12-06 07:35:15,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:15,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347558202] [2022-12-06 07:35:15,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:15,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:15,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-06 07:35:15,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:15,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347558202] [2022-12-06 07:35:15,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347558202] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:15,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:15,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:15,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621184800] [2022-12-06 07:35:15,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:15,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:15,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:15,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:15,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:15,137 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:15,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:15,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:15,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:15,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:15,178 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:15,179 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:15,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:15,179 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:15,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:15,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:15,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:15,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:15,180 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:15,180 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:15,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:15,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:15,180 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:15,180 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:15,180 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:15,181 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:15,181 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:15,181 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:15,181 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:15,181 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:15,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:15,183 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:15,183 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:15,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:15,183 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:15,183 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:15,257 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:15,259 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:15,259 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:15,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:15,259 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:15,259 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:15,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3097 [2022-12-06 07:35:15,259 INFO L420 AbstractCegarLoop]: === Iteration 3099 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:15,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:15,259 INFO L85 PathProgramCache]: Analyzing trace with hash -122747511, now seen corresponding path program 1 times [2022-12-06 07:35:15,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:15,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784972618] [2022-12-06 07:35:15,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:15,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:15,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-06 07:35:15,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:15,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784972618] [2022-12-06 07:35:15,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784972618] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:15,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:15,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:15,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023422626] [2022-12-06 07:35:15,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:15,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:15,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:15,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:15,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:15,329 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:15,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:15,329 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:15,329 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:15,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:15,370 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:15,370 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:15,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:15,371 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:15,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:15,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:15,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:15,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:15,371 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:15,371 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:15,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:15,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:15,372 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:15,372 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:15,372 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:15,372 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:15,372 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:15,372 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:15,372 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:15,372 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:15,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:15,375 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:15,375 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:15,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:15,375 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:15,375 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:15,449 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:15,450 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:15,450 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:15,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:15,450 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:15,450 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:15,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3098 [2022-12-06 07:35:15,450 INFO L420 AbstractCegarLoop]: === Iteration 3100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:15,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:15,451 INFO L85 PathProgramCache]: Analyzing trace with hash -92271318, now seen corresponding path program 1 times [2022-12-06 07:35:15,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:15,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266776868] [2022-12-06 07:35:15,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:15,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:15,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-06 07:35:15,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:15,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266776868] [2022-12-06 07:35:15,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266776868] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:15,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:15,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:15,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468674869] [2022-12-06 07:35:15,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:15,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:15,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:15,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:15,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:15,517 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:15,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:15,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:15,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:15,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:15,553 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:15,554 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:15,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:15,554 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:15,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:15,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:15,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:15,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:15,555 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:15,555 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:15,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:15,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:15,555 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:15,556 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:15,556 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:15,556 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:15,556 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:15,556 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:15,556 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:15,556 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:15,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:15,558 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:15,558 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:15,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:15,559 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:15,559 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:15,632 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:15,633 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:15,633 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:15,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:15,633 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:15,633 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:15,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3099 [2022-12-06 07:35:15,633 INFO L420 AbstractCegarLoop]: === Iteration 3101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:15,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:15,634 INFO L85 PathProgramCache]: Analyzing trace with hash -65489209, now seen corresponding path program 1 times [2022-12-06 07:35:15,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:15,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329427947] [2022-12-06 07:35:15,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:15,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:15,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-06 07:35:15,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:15,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329427947] [2022-12-06 07:35:15,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329427947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:15,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:15,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:15,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411465518] [2022-12-06 07:35:15,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:15,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:15,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:15,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:15,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:15,702 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:15,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:15,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:15,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:15,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:15,737 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:15,738 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:15,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:15,738 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:15,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:15,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:15,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:15,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:15,738 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:15,738 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:15,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:15,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:15,739 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:15,739 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:15,739 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:15,739 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:15,739 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:15,740 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:15,740 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:15,740 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:15,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:15,742 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:15,742 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:15,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:15,742 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:15,742 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:15,815 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:15,816 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:15,816 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:15,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:15,816 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:15,816 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:15,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3100 [2022-12-06 07:35:15,816 INFO L420 AbstractCegarLoop]: === Iteration 3102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:15,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:15,817 INFO L85 PathProgramCache]: Analyzing trace with hash -35013016, now seen corresponding path program 1 times [2022-12-06 07:35:15,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:15,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587280507] [2022-12-06 07:35:15,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:15,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:15,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-06 07:35:15,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:15,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587280507] [2022-12-06 07:35:15,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587280507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:15,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:15,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:15,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922723790] [2022-12-06 07:35:15,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:15,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:15,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:15,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:15,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:15,881 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:15,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:15,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:15,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:15,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:15,923 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:15,923 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:15,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:15,923 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:15,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:15,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:15,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:15,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:15,924 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:15,924 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:15,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:15,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:15,924 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:15,924 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:15,925 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:15,925 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:15,925 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:15,925 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:15,925 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:15,925 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:15,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:15,927 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:15,927 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:15,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:15,927 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:15,927 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:16,001 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:16,002 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:16,002 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:16,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:16,003 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:16,003 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:16,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3101 [2022-12-06 07:35:16,003 INFO L420 AbstractCegarLoop]: === Iteration 3103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:16,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:16,003 INFO L85 PathProgramCache]: Analyzing trace with hash -8230907, now seen corresponding path program 1 times [2022-12-06 07:35:16,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:16,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535103669] [2022-12-06 07:35:16,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:16,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:16,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:16,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-06 07:35:16,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:16,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535103669] [2022-12-06 07:35:16,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535103669] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:16,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:16,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:16,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574310132] [2022-12-06 07:35:16,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:16,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:16,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:16,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:16,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:16,072 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:16,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:16,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:16,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:16,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:16,111 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:16,111 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:16,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:16,111 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:16,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:16,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:16,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:16,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:16,112 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:16,112 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:16,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:16,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:16,112 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:16,112 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:16,113 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:16,113 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:16,113 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:16,113 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:16,113 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:16,113 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:16,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:16,115 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:16,115 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:16,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:16,115 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:16,115 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:16,189 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:16,190 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:16,190 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:16,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:16,190 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:16,190 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:16,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3102 [2022-12-06 07:35:16,191 INFO L420 AbstractCegarLoop]: === Iteration 3104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:16,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:16,191 INFO L85 PathProgramCache]: Analyzing trace with hash 22245286, now seen corresponding path program 1 times [2022-12-06 07:35:16,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:16,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791934643] [2022-12-06 07:35:16,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:16,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:16,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-06 07:35:16,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:16,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791934643] [2022-12-06 07:35:16,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791934643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:16,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:16,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:16,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416596857] [2022-12-06 07:35:16,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:16,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:16,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:16,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:16,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:16,273 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:16,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:16,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:16,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:16,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:16,314 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:16,314 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:16,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:16,315 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:16,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:16,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:16,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:16,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:16,315 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:16,315 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:16,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:16,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:16,316 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:16,316 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:16,316 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:16,316 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:16,316 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:16,316 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:16,317 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:16,317 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:16,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:16,319 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:16,319 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:16,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:16,319 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:16,319 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:16,392 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:16,393 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:16,393 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:16,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:16,393 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:16,393 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:16,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3103 [2022-12-06 07:35:16,393 INFO L420 AbstractCegarLoop]: === Iteration 3105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:16,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:16,394 INFO L85 PathProgramCache]: Analyzing trace with hash 49027395, now seen corresponding path program 1 times [2022-12-06 07:35:16,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:16,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653997464] [2022-12-06 07:35:16,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:16,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:16,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-06 07:35:16,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:16,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653997464] [2022-12-06 07:35:16,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653997464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:16,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:16,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:16,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443894973] [2022-12-06 07:35:16,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:16,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:16,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:16,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:16,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:16,464 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:16,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:16,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:16,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:16,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:16,499 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:16,499 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:16,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:16,500 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:16,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:16,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:16,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:16,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:16,500 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:16,500 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:16,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:16,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:16,501 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:16,501 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:16,501 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:16,501 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:16,501 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:16,501 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:16,501 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:16,501 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:16,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:16,503 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:16,503 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:16,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:16,504 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:16,504 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:16,576 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:16,577 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:35:16,577 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:16,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:16,577 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:16,577 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:16,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3104 [2022-12-06 07:35:16,577 INFO L420 AbstractCegarLoop]: === Iteration 3106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:16,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:16,577 INFO L85 PathProgramCache]: Analyzing trace with hash 79503588, now seen corresponding path program 1 times [2022-12-06 07:35:16,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:16,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152684556] [2022-12-06 07:35:16,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:16,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:16,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-06 07:35:16,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:16,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152684556] [2022-12-06 07:35:16,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152684556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:16,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:16,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:16,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451666315] [2022-12-06 07:35:16,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:16,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:16,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:16,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:16,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:16,643 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:16,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:16,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:16,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:16,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:16,678 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:16,679 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:16,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:16,679 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:16,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:16,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:16,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:16,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:16,680 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:16,680 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:16,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:16,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:16,680 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:16,680 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:16,680 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:16,680 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:16,680 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:16,681 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:16,681 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:16,681 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:16,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:16,683 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:16,683 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:16,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 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 116. Up to 16 conditions per place. [2022-12-06 07:35:16,683 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:16,683 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:16,758 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:16,759 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:16,759 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:16,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:16,759 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:16,759 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:16,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3105 [2022-12-06 07:35:16,759 INFO L420 AbstractCegarLoop]: === Iteration 3107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:16,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:16,759 INFO L85 PathProgramCache]: Analyzing trace with hash 106285697, now seen corresponding path program 1 times [2022-12-06 07:35:16,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:16,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119402269] [2022-12-06 07:35:16,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:16,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:16,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-06 07:35:16,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:16,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119402269] [2022-12-06 07:35:16,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119402269] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:16,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:16,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:16,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995018035] [2022-12-06 07:35:16,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:16,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:16,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:16,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:16,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:16,828 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:16,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:16,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:16,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:16,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:16,869 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:16,869 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:16,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:16,870 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:16,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:16,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:16,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:16,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:16,870 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:16,870 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:16,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:16,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:16,871 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:16,871 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:16,871 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:16,871 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:16,871 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:16,871 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:16,871 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:16,871 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:16,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:16,873 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:16,874 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:16,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:16,874 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:16,874 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:16,947 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:16,948 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:16,948 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:16,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:16,948 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:16,948 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:16,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3106 [2022-12-06 07:35:16,949 INFO L420 AbstractCegarLoop]: === Iteration 3108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:16,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:16,949 INFO L85 PathProgramCache]: Analyzing trace with hash 136761890, now seen corresponding path program 1 times [2022-12-06 07:35:16,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:16,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832270738] [2022-12-06 07:35:16,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:16,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:17,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-06 07:35:17,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:17,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832270738] [2022-12-06 07:35:17,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832270738] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:17,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:17,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:17,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594765552] [2022-12-06 07:35:17,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:17,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:17,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:17,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:17,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:17,016 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:17,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:17,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:17,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:17,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:17,057 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:17,057 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:17,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:17,058 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:17,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:17,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:17,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:17,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:17,058 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:17,058 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:17,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:17,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:17,059 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:17,059 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:17,059 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:17,059 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:17,059 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:17,059 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:17,059 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:17,059 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:17,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:17,062 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:17,062 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:17,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:17,062 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:17,062 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:17,135 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:17,136 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:17,136 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:17,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:17,136 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:17,136 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:17,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3107 [2022-12-06 07:35:17,136 INFO L420 AbstractCegarLoop]: === Iteration 3109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:17,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:17,136 INFO L85 PathProgramCache]: Analyzing trace with hash 163543999, now seen corresponding path program 1 times [2022-12-06 07:35:17,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:17,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997547707] [2022-12-06 07:35:17,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:17,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:17,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-06 07:35:17,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:17,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997547707] [2022-12-06 07:35:17,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997547707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:17,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:17,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:17,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474814077] [2022-12-06 07:35:17,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:17,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:17,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:17,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:17,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:17,206 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:17,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:17,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:17,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:17,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:17,242 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:17,242 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:17,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:17,242 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:17,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:17,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:17,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:17,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:17,243 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:17,243 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:17,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:17,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:17,244 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:17,244 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:17,244 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:17,244 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:17,244 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:17,244 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:17,244 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:17,244 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:17,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:17,246 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:17,246 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:17,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:17,246 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:17,246 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:17,318 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:17,319 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:35:17,320 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:17,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:17,320 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:17,320 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:17,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3108 [2022-12-06 07:35:17,320 INFO L420 AbstractCegarLoop]: === Iteration 3110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:17,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:17,320 INFO L85 PathProgramCache]: Analyzing trace with hash 194020192, now seen corresponding path program 1 times [2022-12-06 07:35:17,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:17,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224891301] [2022-12-06 07:35:17,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:17,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:17,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-06 07:35:17,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:17,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224891301] [2022-12-06 07:35:17,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224891301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:17,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:17,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:17,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887467051] [2022-12-06 07:35:17,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:17,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:17,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:17,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:17,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:17,387 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:17,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:17,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:17,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:17,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:17,428 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:17,428 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:17,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:17,429 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:17,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:17,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:17,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:17,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:17,429 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:17,429 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:17,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:17,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:17,430 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:17,430 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:17,430 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:17,430 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:17,430 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:17,430 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:17,430 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:17,430 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:17,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:17,443 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:17,444 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:17,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:17,444 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:17,444 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:17,520 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:17,521 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-06 07:35:17,521 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:17,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:17,521 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:17,521 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:17,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3109 [2022-12-06 07:35:17,521 INFO L420 AbstractCegarLoop]: === Iteration 3111 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:17,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:17,521 INFO L85 PathProgramCache]: Analyzing trace with hash 220802301, now seen corresponding path program 1 times [2022-12-06 07:35:17,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:17,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568663977] [2022-12-06 07:35:17,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:17,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:17,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-06 07:35:17,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:17,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568663977] [2022-12-06 07:35:17,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568663977] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:17,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:17,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:17,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963620675] [2022-12-06 07:35:17,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:17,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:17,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:17,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:17,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:17,591 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:17,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:17,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:17,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:17,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:17,633 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:17,633 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:17,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 370 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:17,633 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:17,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:17,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:17,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:17,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:17,634 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:17,634 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:17,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:17,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:17,635 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:17,635 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:17,635 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:17,635 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:17,635 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:17,635 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:17,635 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:17,635 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:17,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:17,637 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:17,637 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:17,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:17,638 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:17,638 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:17,709 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:17,710 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:35:17,710 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:17,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:17,711 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:17,711 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:17,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3110 [2022-12-06 07:35:17,711 INFO L420 AbstractCegarLoop]: === Iteration 3112 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:17,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:17,711 INFO L85 PathProgramCache]: Analyzing trace with hash 251278494, now seen corresponding path program 1 times [2022-12-06 07:35:17,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:17,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547268876] [2022-12-06 07:35:17,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:17,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:17,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-06 07:35:17,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:17,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547268876] [2022-12-06 07:35:17,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547268876] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:17,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:17,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:17,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917179402] [2022-12-06 07:35:17,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:17,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:17,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:17,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:17,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:17,777 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:17,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:17,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:17,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:17,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:17,813 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:17,813 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:17,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:17,814 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:17,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:17,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:17,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:17,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:17,814 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:17,814 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:17,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:17,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:17,815 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:17,815 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:17,815 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:17,815 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:17,815 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:17,815 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:17,815 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:17,815 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:17,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:17,818 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:17,818 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:17,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:17,818 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:17,818 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:17,895 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:17,896 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:35:17,896 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:17,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:17,896 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:17,896 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:17,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3111 [2022-12-06 07:35:17,897 INFO L420 AbstractCegarLoop]: === Iteration 3113 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:17,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:17,897 INFO L85 PathProgramCache]: Analyzing trace with hash 278060603, now seen corresponding path program 1 times [2022-12-06 07:35:17,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:17,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849117331] [2022-12-06 07:35:17,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:17,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:17,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-06 07:35:17,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:17,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849117331] [2022-12-06 07:35:17,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849117331] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:17,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:17,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:17,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136048258] [2022-12-06 07:35:17,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:17,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:17,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:17,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:17,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:17,966 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:17,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:17,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:17,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:17,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:18,007 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:18,007 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:18,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:18,008 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:18,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:18,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:18,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:18,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:18,008 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:18,008 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:18,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:18,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:18,009 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:18,009 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:18,009 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:18,009 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:18,009 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:18,009 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:18,009 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:18,010 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:18,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:18,012 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:18,012 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:18,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:18,012 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:18,012 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:18,085 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:18,087 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:18,087 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:18,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:18,087 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:18,087 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:18,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3112 [2022-12-06 07:35:18,087 INFO L420 AbstractCegarLoop]: === Iteration 3114 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:18,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:18,087 INFO L85 PathProgramCache]: Analyzing trace with hash 308536796, now seen corresponding path program 1 times [2022-12-06 07:35:18,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:18,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036727631] [2022-12-06 07:35:18,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:18,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:18,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-06 07:35:18,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:18,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036727631] [2022-12-06 07:35:18,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036727631] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:18,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:18,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:18,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593469336] [2022-12-06 07:35:18,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:18,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:18,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:18,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:18,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:18,156 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:18,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:18,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:18,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:18,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:18,191 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:18,192 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:18,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:18,192 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:18,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:18,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:18,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:18,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:18,192 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:18,193 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:18,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:18,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:18,193 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:18,193 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:18,193 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:18,193 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:18,193 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:18,194 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:18,194 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:18,194 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:18,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:18,196 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:18,196 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:18,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:18,196 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:18,196 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:18,270 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:18,271 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:18,271 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:18,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:18,272 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:18,272 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:18,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3113 [2022-12-06 07:35:18,272 INFO L420 AbstractCegarLoop]: === Iteration 3115 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:18,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:18,272 INFO L85 PathProgramCache]: Analyzing trace with hash 335318905, now seen corresponding path program 1 times [2022-12-06 07:35:18,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:18,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496763675] [2022-12-06 07:35:18,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:18,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:18,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-06 07:35:18,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:18,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496763675] [2022-12-06 07:35:18,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496763675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:18,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:18,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:18,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251050897] [2022-12-06 07:35:18,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:18,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:18,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:18,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:18,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:18,342 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:18,342 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:18,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:18,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:18,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:18,383 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:18,384 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:18,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:18,384 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:18,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:18,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:18,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:18,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:18,384 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:18,385 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:18,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:18,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:18,385 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:18,385 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:18,385 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:18,385 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:18,385 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:18,386 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:18,386 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:18,386 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:18,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:18,388 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:18,388 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:18,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:18,388 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:18,388 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:18,462 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:18,463 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:18,463 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:18,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:18,463 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:18,463 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:18,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3114 [2022-12-06 07:35:18,463 INFO L420 AbstractCegarLoop]: === Iteration 3116 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:18,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:18,464 INFO L85 PathProgramCache]: Analyzing trace with hash 365795098, now seen corresponding path program 1 times [2022-12-06 07:35:18,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:18,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433512307] [2022-12-06 07:35:18,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:18,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:18,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-06 07:35:18,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:18,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433512307] [2022-12-06 07:35:18,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433512307] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:18,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:18,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:18,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882617837] [2022-12-06 07:35:18,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:18,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:18,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:18,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:18,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:18,531 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:18,531 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:18,531 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:18,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:18,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:18,571 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:18,571 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:18,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 349 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:18,572 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:18,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:18,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:18,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:18,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:18,572 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:18,572 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:18,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:18,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:18,573 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:18,573 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:18,573 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:18,573 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:18,573 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:18,574 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:18,574 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:18,574 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:18,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:18,576 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:18,576 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:18,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:18,576 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:18,576 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:18,649 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:18,650 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:18,650 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:18,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:18,650 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:18,650 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:18,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3115 [2022-12-06 07:35:18,650 INFO L420 AbstractCegarLoop]: === Iteration 3117 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:18,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:18,651 INFO L85 PathProgramCache]: Analyzing trace with hash 392577207, now seen corresponding path program 1 times [2022-12-06 07:35:18,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:18,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457631145] [2022-12-06 07:35:18,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:18,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:18,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-06 07:35:18,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:18,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457631145] [2022-12-06 07:35:18,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457631145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:18,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:18,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:18,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190904259] [2022-12-06 07:35:18,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:18,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:18,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:18,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:18,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:18,736 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:18,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:18,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:18,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:18,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:18,771 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:18,771 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:18,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:18,771 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:18,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:18,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:18,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:18,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:18,772 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:18,772 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:18,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:18,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:18,772 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:18,772 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:18,773 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:18,773 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:18,773 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:18,773 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:18,773 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:18,773 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:18,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:18,775 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:18,775 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:18,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:18,775 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:18,775 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:18,848 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:18,849 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:35:18,850 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:18,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:18,850 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:18,850 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:18,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3116 [2022-12-06 07:35:18,850 INFO L420 AbstractCegarLoop]: === Iteration 3118 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:18,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:18,850 INFO L85 PathProgramCache]: Analyzing trace with hash 423053400, now seen corresponding path program 1 times [2022-12-06 07:35:18,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:18,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086735707] [2022-12-06 07:35:18,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:18,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:18,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-06 07:35:18,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:18,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086735707] [2022-12-06 07:35:18,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086735707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:18,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:18,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:18,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760392016] [2022-12-06 07:35:18,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:18,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:18,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:18,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:18,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:18,916 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:18,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:18,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:18,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:18,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:18,958 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:18,958 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:18,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:18,958 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:18,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:18,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:18,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:18,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:18,959 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:18,959 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:18,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:18,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:18,959 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:18,959 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:18,960 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:18,960 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:18,960 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:18,960 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:18,960 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:18,960 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:18,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:18,962 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:18,962 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:18,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:18,962 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:18,962 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:19,036 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:19,037 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:19,037 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:19,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:19,038 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:19,038 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:19,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3117 [2022-12-06 07:35:19,038 INFO L420 AbstractCegarLoop]: === Iteration 3119 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:19,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:19,038 INFO L85 PathProgramCache]: Analyzing trace with hash 449835509, now seen corresponding path program 1 times [2022-12-06 07:35:19,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:19,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954181991] [2022-12-06 07:35:19,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:19,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:19,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-06 07:35:19,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:19,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954181991] [2022-12-06 07:35:19,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954181991] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:19,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:19,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:19,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259429554] [2022-12-06 07:35:19,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:19,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:19,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:19,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:19,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:19,107 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:19,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:19,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:19,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:19,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:19,141 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:19,141 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:19,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:19,142 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:19,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:19,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:19,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:19,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:19,142 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:19,142 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:19,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:19,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:19,143 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:19,143 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:19,143 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:19,143 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:19,143 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:19,143 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:19,143 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:19,143 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:19,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:19,145 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:19,146 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:19,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:19,146 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:19,146 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:19,220 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:19,221 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:19,221 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:19,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:19,221 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:19,221 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:19,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3118 [2022-12-06 07:35:19,221 INFO L420 AbstractCegarLoop]: === Iteration 3120 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:19,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:19,221 INFO L85 PathProgramCache]: Analyzing trace with hash 480311702, now seen corresponding path program 1 times [2022-12-06 07:35:19,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:19,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246396615] [2022-12-06 07:35:19,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:19,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:19,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:19,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:19,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246396615] [2022-12-06 07:35:19,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246396615] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:19,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:19,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:19,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971762028] [2022-12-06 07:35:19,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:19,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:19,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:19,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:19,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:19,287 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:19,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:19,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:19,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:19,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:19,322 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:19,322 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:19,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:19,323 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:19,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:19,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:19,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:19,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:19,323 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:19,323 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:19,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:19,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:19,324 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:19,324 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:19,324 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:19,324 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:19,324 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:19,324 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:19,324 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:19,324 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:19,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:19,326 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:19,326 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:19,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:19,327 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:19,327 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:19,401 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:19,402 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:19,402 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:19,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:19,402 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:19,403 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:19,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3119 [2022-12-06 07:35:19,403 INFO L420 AbstractCegarLoop]: === Iteration 3121 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:19,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:19,403 INFO L85 PathProgramCache]: Analyzing trace with hash 507093811, now seen corresponding path program 1 times [2022-12-06 07:35:19,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:19,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164295498] [2022-12-06 07:35:19,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:19,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:19,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-06 07:35:19,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:19,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164295498] [2022-12-06 07:35:19,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164295498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:19,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:19,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:19,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493371121] [2022-12-06 07:35:19,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:19,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:19,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:19,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:19,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:19,471 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:19,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:19,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:19,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:19,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:19,508 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:19,508 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:19,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:19,508 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:19,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:19,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:19,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:19,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:19,509 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:19,509 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:19,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:19,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:19,510 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:19,510 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:19,510 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:19,510 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:19,510 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:19,510 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:19,510 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:19,510 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:19,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:19,512 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:19,512 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:19,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:19,513 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:19,513 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:19,586 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:19,587 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:19,587 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:19,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:19,587 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:19,587 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:19,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3120 [2022-12-06 07:35:19,587 INFO L420 AbstractCegarLoop]: === Iteration 3122 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:19,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:19,587 INFO L85 PathProgramCache]: Analyzing trace with hash 537570004, now seen corresponding path program 1 times [2022-12-06 07:35:19,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:19,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742833595] [2022-12-06 07:35:19,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:19,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:19,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-06 07:35:19,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:19,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742833595] [2022-12-06 07:35:19,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742833595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:19,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:19,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:19,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018395142] [2022-12-06 07:35:19,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:19,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:19,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:19,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:19,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:19,656 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:19,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:19,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:19,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:19,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:19,692 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:19,692 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:19,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:19,693 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:19,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:19,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:19,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:19,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:19,693 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:19,693 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:19,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:19,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:19,694 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:19,694 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:19,694 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:19,694 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:19,694 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:19,694 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:19,694 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:19,694 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:19,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:19,696 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:19,697 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:19,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:19,697 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:19,697 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:19,771 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:19,772 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:19,772 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:19,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:19,772 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:19,772 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:19,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3121 [2022-12-06 07:35:19,772 INFO L420 AbstractCegarLoop]: === Iteration 3123 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:19,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:19,772 INFO L85 PathProgramCache]: Analyzing trace with hash 564352113, now seen corresponding path program 1 times [2022-12-06 07:35:19,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:19,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409454574] [2022-12-06 07:35:19,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:19,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35: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-06 07:35:19,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:19,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409454574] [2022-12-06 07:35:19,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409454574] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:19,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:19,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:19,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019497631] [2022-12-06 07:35:19,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:19,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:19,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:19,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:19,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:19,841 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:19,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:19,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:19,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:19,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:19,893 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:19,894 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:19,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:19,894 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:19,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:19,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:19,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:19,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:19,895 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:19,895 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:19,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:19,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:19,895 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:19,895 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:19,895 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:19,895 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:19,896 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:19,896 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:19,896 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:19,896 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:19,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:19,898 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:19,898 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:19,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:19,898 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:19,898 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:19,973 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:19,974 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:19,974 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:19,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:19,974 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:19,974 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:19,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3122 [2022-12-06 07:35:19,974 INFO L420 AbstractCegarLoop]: === Iteration 3124 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:19,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:19,974 INFO L85 PathProgramCache]: Analyzing trace with hash 594828306, now seen corresponding path program 1 times [2022-12-06 07:35:19,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:19,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664679014] [2022-12-06 07:35:19,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:19,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:20,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:20,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:20,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664679014] [2022-12-06 07:35:20,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664679014] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:20,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:20,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:20,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643862689] [2022-12-06 07:35:20,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:20,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:20,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:20,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:20,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:20,043 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:20,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:20,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:20,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:20,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:20,079 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:20,079 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:20,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:20,080 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:20,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:20,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:20,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:20,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:20,080 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:20,080 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:20,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:20,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:20,081 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:20,081 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:20,081 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:20,081 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:20,081 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:20,081 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:20,081 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:20,081 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:20,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:20,084 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:20,084 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:20,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:20,084 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:20,084 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:20,159 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:20,160 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:20,160 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:20,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:20,160 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:20,160 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:20,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3123 [2022-12-06 07:35:20,161 INFO L420 AbstractCegarLoop]: === Iteration 3125 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:20,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:20,161 INFO L85 PathProgramCache]: Analyzing trace with hash 621610415, now seen corresponding path program 1 times [2022-12-06 07:35:20,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:20,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619510692] [2022-12-06 07:35:20,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:20,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:20,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-06 07:35:20,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:20,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619510692] [2022-12-06 07:35:20,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619510692] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:20,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:20,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:20,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143504042] [2022-12-06 07:35:20,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:20,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:20,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:20,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:20,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:20,230 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:20,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:20,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:20,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:20,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:20,271 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:20,271 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:20,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:20,271 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:20,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:20,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:20,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:20,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:20,272 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:20,272 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:20,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:20,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:20,273 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:20,273 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:20,273 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:20,273 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:20,273 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:20,273 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:20,273 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:20,273 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:20,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:20,275 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:20,275 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:20,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:20,276 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:20,276 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:20,350 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:20,351 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:20,351 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:20,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:20,351 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:20,351 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:20,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3124 [2022-12-06 07:35:20,351 INFO L420 AbstractCegarLoop]: === Iteration 3126 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:20,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:20,351 INFO L85 PathProgramCache]: Analyzing trace with hash 652086608, now seen corresponding path program 1 times [2022-12-06 07:35:20,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:20,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836593985] [2022-12-06 07:35:20,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:20,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:20,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-06 07:35:20,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:20,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836593985] [2022-12-06 07:35:20,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836593985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:20,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:20,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:20,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815824041] [2022-12-06 07:35:20,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:20,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:20,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:20,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:20,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:20,418 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:20,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:20,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:20,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:20,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:20,461 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:20,461 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:20,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:20,461 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:20,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:20,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:20,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:20,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:20,462 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:20,462 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:20,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:20,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:20,462 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:20,462 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:20,463 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:20,463 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:20,463 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:20,463 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:20,463 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:20,463 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:20,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:20,465 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:20,465 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:20,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:20,465 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:20,465 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:20,540 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:20,541 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:20,541 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:20,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:20,541 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:20,541 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:20,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3125 [2022-12-06 07:35:20,541 INFO L420 AbstractCegarLoop]: === Iteration 3127 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:20,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:20,541 INFO L85 PathProgramCache]: Analyzing trace with hash 678868717, now seen corresponding path program 1 times [2022-12-06 07:35:20,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:20,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106306247] [2022-12-06 07:35:20,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:20,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:20,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-06 07:35:20,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:20,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106306247] [2022-12-06 07:35:20,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106306247] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:20,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:20,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:20,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923246688] [2022-12-06 07:35:20,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:20,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:20,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:20,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:20,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:20,612 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:20,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:20,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:20,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:20,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:20,646 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:20,646 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:20,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:20,646 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:20,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:20,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:20,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:20,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:20,647 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:20,647 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:20,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:20,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:20,648 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:20,648 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:20,648 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:20,648 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:20,648 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:20,648 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:20,648 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:20,648 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:20,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:20,650 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:20,650 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:20,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:20,650 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:20,650 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:20,724 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:20,725 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:20,725 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:20,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:20,725 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:20,725 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:20,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3126 [2022-12-06 07:35:20,725 INFO L420 AbstractCegarLoop]: === Iteration 3128 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:20,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:20,725 INFO L85 PathProgramCache]: Analyzing trace with hash 709344910, now seen corresponding path program 1 times [2022-12-06 07:35:20,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:20,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698209673] [2022-12-06 07:35:20,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:20,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:20,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-06 07:35:20,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:20,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698209673] [2022-12-06 07:35:20,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698209673] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:20,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:20,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:20,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371968268] [2022-12-06 07:35:20,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:20,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:20,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:20,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:20,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:20,793 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:20,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:20,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:20,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:20,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:20,829 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:20,829 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:20,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:20,830 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:20,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:20,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:20,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:20,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:20,830 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:20,830 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:20,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:20,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:20,831 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:20,831 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:20,831 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:20,831 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:20,831 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:20,831 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:20,831 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:20,831 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:20,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:20,833 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:20,833 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:20,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:20,834 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:20,834 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:20,908 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:20,909 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:20,909 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:20,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:20,909 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:20,909 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:20,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3127 [2022-12-06 07:35:20,910 INFO L420 AbstractCegarLoop]: === Iteration 3129 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:20,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:20,910 INFO L85 PathProgramCache]: Analyzing trace with hash 736127019, now seen corresponding path program 1 times [2022-12-06 07:35:20,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:20,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389793293] [2022-12-06 07:35:20,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:20,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:20,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-06 07:35:20,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:20,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389793293] [2022-12-06 07:35:20,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389793293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:20,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:20,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:20,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633530721] [2022-12-06 07:35:20,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:20,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:20,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:20,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:20,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:20,980 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:20,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:20,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:20,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:20,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:21,021 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:21,021 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:21,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 356 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:21,021 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:21,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:21,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:21,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:21,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:21,022 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:21,022 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:21,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:21,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:21,022 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:21,022 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:21,022 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:21,023 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:21,023 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:21,023 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:21,023 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:21,023 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:21,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:21,025 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:21,025 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:21,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:21,025 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:21,025 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:21,100 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:21,102 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:21,102 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:21,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:21,102 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:21,102 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:21,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3128 [2022-12-06 07:35:21,102 INFO L420 AbstractCegarLoop]: === Iteration 3130 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:21,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:21,102 INFO L85 PathProgramCache]: Analyzing trace with hash 766603212, now seen corresponding path program 1 times [2022-12-06 07:35:21,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:21,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373457955] [2022-12-06 07:35:21,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:21,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:21,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:21,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:21,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373457955] [2022-12-06 07:35:21,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373457955] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:21,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:21,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:21,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530129052] [2022-12-06 07:35:21,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:21,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:21,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:21,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:21,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:21,181 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:21,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:21,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:21,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:21,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:21,223 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:21,223 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:21,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:21,224 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:21,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:21,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:21,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:21,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:21,224 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:21,224 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:21,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:21,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:21,225 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:21,225 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:21,225 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:21,225 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:21,225 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:21,225 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:21,225 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:21,225 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:21,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:21,228 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:21,228 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:21,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:21,228 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:21,228 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:21,308 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:21,309 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:35:21,309 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:21,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:21,309 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:21,309 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:21,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3129 [2022-12-06 07:35:21,309 INFO L420 AbstractCegarLoop]: === Iteration 3131 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:21,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:21,309 INFO L85 PathProgramCache]: Analyzing trace with hash 793385321, now seen corresponding path program 1 times [2022-12-06 07:35:21,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:21,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400058536] [2022-12-06 07:35:21,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:21,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:21,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:21,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:21,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400058536] [2022-12-06 07:35:21,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400058536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:21,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:21,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:21,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043773877] [2022-12-06 07:35:21,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:21,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:21,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:21,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:21,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:21,379 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:21,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:21,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:21,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:21,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:21,418 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:21,418 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:21,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:21,418 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:21,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:21,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:21,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:21,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:21,419 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:21,419 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:21,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:21,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:21,420 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:21,420 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:21,420 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:21,420 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:21,420 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:21,420 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:21,420 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:21,420 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:21,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:21,422 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:21,422 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:21,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:21,423 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:21,423 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:21,497 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:21,498 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:21,498 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:21,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:21,498 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:21,498 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:21,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3130 [2022-12-06 07:35:21,498 INFO L420 AbstractCegarLoop]: === Iteration 3132 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:21,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:21,499 INFO L85 PathProgramCache]: Analyzing trace with hash 823861514, now seen corresponding path program 1 times [2022-12-06 07:35:21,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:21,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893297437] [2022-12-06 07:35:21,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:21,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:21,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-06 07:35:21,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:21,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893297437] [2022-12-06 07:35:21,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893297437] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:21,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:21,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:21,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634978992] [2022-12-06 07:35:21,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:21,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:21,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:21,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:21,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:21,569 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:21,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:21,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:21,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:21,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:21,605 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:21,605 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:21,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:21,605 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:21,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:21,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:21,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:21,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:21,606 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:21,606 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:21,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:21,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:21,607 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:21,607 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:21,607 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:21,607 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:21,607 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:21,607 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:21,607 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:21,607 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:21,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:21,609 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:21,609 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:21,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:21,610 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:21,610 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:21,684 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:21,686 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:21,686 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:21,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:21,686 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:21,686 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:21,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3131 [2022-12-06 07:35:21,686 INFO L420 AbstractCegarLoop]: === Iteration 3133 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:21,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:21,686 INFO L85 PathProgramCache]: Analyzing trace with hash 850643623, now seen corresponding path program 1 times [2022-12-06 07:35:21,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:21,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871863182] [2022-12-06 07:35:21,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:21,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35: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-06 07:35:21,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:21,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871863182] [2022-12-06 07:35:21,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871863182] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:21,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:21,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:21,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536833778] [2022-12-06 07:35:21,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:21,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:21,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:21,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:21,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:21,758 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:21,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:21,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:21,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:21,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:21,793 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:21,793 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:21,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:21,793 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:21,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:21,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:21,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:21,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:21,794 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:21,794 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:21,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:21,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:21,795 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:21,795 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:21,795 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:21,795 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:21,795 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:21,795 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:21,795 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:21,795 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:21,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:21,797 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:21,797 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:21,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:21,798 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:21,798 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:21,872 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:21,873 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:21,873 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:21,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:21,873 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:21,873 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:21,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3132 [2022-12-06 07:35:21,873 INFO L420 AbstractCegarLoop]: === Iteration 3134 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:21,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:21,874 INFO L85 PathProgramCache]: Analyzing trace with hash 881119816, now seen corresponding path program 1 times [2022-12-06 07:35:21,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:21,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082565737] [2022-12-06 07:35:21,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:21,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:21,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-06 07:35:21,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:21,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082565737] [2022-12-06 07:35:21,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082565737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:21,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:21,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:21,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721737835] [2022-12-06 07:35:21,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:21,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:21,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:21,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:21,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:21,941 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:21,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:21,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:21,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:21,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:21,978 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:21,978 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:21,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:21,979 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:21,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:21,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:21,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:21,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:21,979 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:21,979 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:21,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:21,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:21,980 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:21,980 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:21,980 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:21,980 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:21,980 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:21,980 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:21,981 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:21,981 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:21,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:21,983 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:21,983 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:21,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:21,983 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:21,983 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:22,058 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:22,059 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:22,059 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:22,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:22,059 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:22,059 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:22,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3133 [2022-12-06 07:35:22,059 INFO L420 AbstractCegarLoop]: === Iteration 3135 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:22,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:22,059 INFO L85 PathProgramCache]: Analyzing trace with hash 907901925, now seen corresponding path program 1 times [2022-12-06 07:35:22,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:22,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858901526] [2022-12-06 07:35:22,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:22,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35: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-06 07:35:22,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:22,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858901526] [2022-12-06 07:35:22,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858901526] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:22,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:22,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:22,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882713113] [2022-12-06 07:35:22,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:22,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:22,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:22,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:22,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:22,131 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:22,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:22,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:22,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:22,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:22,170 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:22,170 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:22,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:22,171 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:22,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:22,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:22,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:22,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:22,171 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:22,171 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:22,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:22,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:22,172 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:22,172 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:22,172 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:22,172 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:22,172 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:22,173 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:22,173 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:22,173 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:22,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:22,175 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:22,175 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:22,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:22,175 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:22,175 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:22,250 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:22,251 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:22,251 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:22,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:22,251 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:22,251 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:22,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3134 [2022-12-06 07:35:22,252 INFO L420 AbstractCegarLoop]: === Iteration 3136 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:22,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:22,252 INFO L85 PathProgramCache]: Analyzing trace with hash 938378118, now seen corresponding path program 1 times [2022-12-06 07:35:22,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:22,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337524049] [2022-12-06 07:35:22,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:22,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:22,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-06 07:35:22,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:22,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337524049] [2022-12-06 07:35:22,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337524049] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:22,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:22,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:22,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280492654] [2022-12-06 07:35:22,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:22,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:22,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:22,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:22,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:22,336 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:22,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:22,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:22,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:22,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:22,372 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:22,372 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:22,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:22,372 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:22,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:22,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:22,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:22,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:22,373 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:22,373 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:22,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:22,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:22,373 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:22,374 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:22,374 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:22,374 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:22,374 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:22,374 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:22,374 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:22,374 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:22,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:22,376 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:22,376 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:22,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:22,376 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:22,377 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:22,451 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:22,452 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:22,452 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:22,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:22,452 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:22,452 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:22,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3135 [2022-12-06 07:35:22,452 INFO L420 AbstractCegarLoop]: === Iteration 3137 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:22,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:22,453 INFO L85 PathProgramCache]: Analyzing trace with hash 965160227, now seen corresponding path program 1 times [2022-12-06 07:35:22,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:22,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213654947] [2022-12-06 07:35:22,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:22,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:22,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-06 07:35:22,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:22,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213654947] [2022-12-06 07:35:22,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213654947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:22,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:22,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:22,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541227754] [2022-12-06 07:35:22,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:22,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:22,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:22,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:22,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:22,522 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:22,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:22,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:22,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:22,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:22,563 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:22,563 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:22,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:22,564 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:22,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:22,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:22,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:22,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:22,564 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:22,564 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:22,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:22,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:22,565 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:22,565 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:22,565 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:22,565 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:22,565 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:22,565 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:22,565 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:22,565 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:22,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:22,568 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:22,568 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:22,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:22,568 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:22,568 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:22,641 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:22,643 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:22,643 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:22,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:22,643 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:22,643 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:22,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3136 [2022-12-06 07:35:22,643 INFO L420 AbstractCegarLoop]: === Iteration 3138 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:22,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:22,643 INFO L85 PathProgramCache]: Analyzing trace with hash 995636420, now seen corresponding path program 1 times [2022-12-06 07:35:22,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:22,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696587062] [2022-12-06 07:35:22,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:22,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:22,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-06 07:35:22,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:22,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696587062] [2022-12-06 07:35:22,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696587062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:22,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:22,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:22,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214154686] [2022-12-06 07:35:22,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:22,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:22,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:22,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:22,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:22,710 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:22,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:22,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:22,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:22,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:22,752 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:22,752 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:22,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:22,753 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:22,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:22,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:22,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:22,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:22,753 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:22,753 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:22,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:22,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:22,754 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:22,754 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:22,754 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:22,754 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:22,754 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:22,754 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:22,754 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:22,755 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:22,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:22,757 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:22,757 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:22,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:22,757 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:22,757 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:22,831 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:22,832 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:22,832 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:22,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:22,832 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:22,832 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:22,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3137 [2022-12-06 07:35:22,832 INFO L420 AbstractCegarLoop]: === Iteration 3139 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:22,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:22,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1022418529, now seen corresponding path program 1 times [2022-12-06 07:35:22,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:22,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141768768] [2022-12-06 07:35:22,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:22,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:22,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:22,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:22,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141768768] [2022-12-06 07:35:22,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141768768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:22,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:22,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:22,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155488011] [2022-12-06 07:35:22,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:22,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:22,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:22,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:22,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:22,901 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:22,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:22,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:22,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:22,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:22,935 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:22,935 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:22,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:22,936 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:22,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:22,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:22,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:22,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:22,936 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:22,936 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:22,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:22,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:22,937 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:22,937 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:22,937 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:22,937 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:22,937 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:22,937 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:22,937 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:22,937 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:22,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:22,939 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:22,940 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:22,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:22,940 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:22,940 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:23,014 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:23,015 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:23,015 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:23,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:23,015 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:23,015 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:23,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3138 [2022-12-06 07:35:23,015 INFO L420 AbstractCegarLoop]: === Iteration 3140 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:23,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:23,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1052894722, now seen corresponding path program 1 times [2022-12-06 07:35:23,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:23,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138897773] [2022-12-06 07:35:23,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:23,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:23,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:23,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-06 07:35:23,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:23,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138897773] [2022-12-06 07:35:23,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138897773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:23,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:23,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:23,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069504498] [2022-12-06 07:35:23,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:23,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:23,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:23,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:23,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:23,082 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:23,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:23,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:23,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:23,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:23,124 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:23,124 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:23,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 349 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:23,125 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:23,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:23,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:23,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:23,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:23,125 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:23,125 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:23,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:23,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:23,126 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:23,126 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:23,126 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:23,126 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:23,126 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:23,126 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:23,126 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:23,126 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:23,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:23,129 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:23,129 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:23,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:23,129 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:23,129 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:23,202 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:23,203 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:23,203 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:23,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:23,203 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:23,203 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:23,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3139 [2022-12-06 07:35:23,203 INFO L420 AbstractCegarLoop]: === Iteration 3141 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:23,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:23,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1079676831, now seen corresponding path program 1 times [2022-12-06 07:35:23,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:23,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219813677] [2022-12-06 07:35:23,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:23,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:23,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-06 07:35:23,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:23,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219813677] [2022-12-06 07:35:23,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219813677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:23,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:23,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:23,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115219593] [2022-12-06 07:35:23,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:23,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:23,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:23,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:23,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:23,275 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:23,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:23,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:23,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:23,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:23,311 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:23,311 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:23,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:23,311 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:23,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:23,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:23,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:23,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:23,312 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:23,312 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:23,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:23,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:23,313 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:23,313 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:23,313 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:23,313 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:23,313 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:23,313 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:23,313 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:23,313 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:23,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:23,315 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:23,316 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:23,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:23,316 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:23,316 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:23,393 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:23,394 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:35:23,394 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:23,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:23,394 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:23,394 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:23,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3140 [2022-12-06 07:35:23,394 INFO L420 AbstractCegarLoop]: === Iteration 3142 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:23,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:23,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1110153024, now seen corresponding path program 1 times [2022-12-06 07:35:23,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:23,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4449704] [2022-12-06 07:35:23,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:23,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:23,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-06 07:35:23,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:23,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4449704] [2022-12-06 07:35:23,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4449704] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:23,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:23,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:23,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459148592] [2022-12-06 07:35:23,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:23,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:23,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:23,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:23,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:23,462 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:23,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:23,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:23,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:23,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:23,503 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:23,504 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:23,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:23,504 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:23,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:23,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:23,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:23,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:23,504 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:23,505 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:23,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:23,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:23,505 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:23,505 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:23,505 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:23,505 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:23,505 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:23,506 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:23,506 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:23,506 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:23,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:23,508 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:23,508 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:23,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:23,508 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:23,508 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:23,582 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:23,583 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:23,584 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:23,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:23,584 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:23,584 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:23,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3141 [2022-12-06 07:35:23,584 INFO L420 AbstractCegarLoop]: === Iteration 3143 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:23,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:23,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1136935133, now seen corresponding path program 1 times [2022-12-06 07:35:23,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:23,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327597794] [2022-12-06 07:35:23,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:23,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:23,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-06 07:35:23,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:23,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327597794] [2022-12-06 07:35:23,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327597794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:23,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:23,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:23,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387131626] [2022-12-06 07:35:23,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:23,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:23,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:23,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:23,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:23,663 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:23,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:23,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:23,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:23,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:23,697 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:23,697 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:23,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:23,697 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:23,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:23,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:23,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:23,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:23,698 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:23,698 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:23,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:23,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:23,699 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:23,699 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:23,699 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:23,699 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:23,699 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:23,699 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:23,699 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:23,699 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:23,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:23,701 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:23,701 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:23,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:23,701 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:23,702 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:23,775 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:23,776 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:23,776 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:23,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:23,776 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:23,776 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:23,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3142 [2022-12-06 07:35:23,776 INFO L420 AbstractCegarLoop]: === Iteration 3144 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:23,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:23,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1167411326, now seen corresponding path program 1 times [2022-12-06 07:35:23,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:23,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610793258] [2022-12-06 07:35:23,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:23,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:23,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:23,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-06 07:35:23,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:23,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610793258] [2022-12-06 07:35:23,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610793258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:23,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:23,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:23,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545912399] [2022-12-06 07:35:23,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:23,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:23,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:23,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:23,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:23,847 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:23,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:23,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:23,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:23,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:23,890 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:23,890 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:23,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:23,890 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:23,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:23,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:23,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:23,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:23,891 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:23,891 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:23,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:23,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:23,892 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:23,892 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:23,892 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:23,892 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:23,892 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:23,892 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:23,892 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:23,892 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:23,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:23,894 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:23,894 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:23,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:23,895 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:23,895 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:23,969 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:23,971 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:23,971 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:23,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:23,971 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:23,971 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:23,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3143 [2022-12-06 07:35:23,971 INFO L420 AbstractCegarLoop]: === Iteration 3145 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:23,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:23,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1194193435, now seen corresponding path program 1 times [2022-12-06 07:35:23,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:23,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036649657] [2022-12-06 07:35:23,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:23,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:24,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-06 07:35:24,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:24,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036649657] [2022-12-06 07:35:24,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036649657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:24,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:24,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:24,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502335501] [2022-12-06 07:35:24,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:24,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:24,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:24,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:24,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:24,039 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:24,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:24,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:24,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:24,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:24,080 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:24,080 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:24,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:24,081 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:24,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:24,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:24,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:24,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:24,081 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:24,081 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:24,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:24,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:24,082 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:24,082 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:24,082 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:24,082 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:24,082 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:24,082 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:24,082 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:24,082 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:24,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:24,084 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:24,084 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:24,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:24,085 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:24,085 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:24,156 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:24,158 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:35:24,158 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:24,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:24,158 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:24,158 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:24,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3144 [2022-12-06 07:35:24,158 INFO L420 AbstractCegarLoop]: === Iteration 3146 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:24,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:24,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1224669628, now seen corresponding path program 1 times [2022-12-06 07:35:24,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:24,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629581065] [2022-12-06 07:35:24,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:24,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:24,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-06 07:35:24,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:24,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629581065] [2022-12-06 07:35:24,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629581065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:24,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:24,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:24,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267727905] [2022-12-06 07:35:24,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:24,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:24,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:24,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:24,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:24,225 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:24,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:24,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:24,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:24,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:24,261 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:24,261 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:24,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:24,262 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:24,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:24,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:24,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:24,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:24,262 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:24,262 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:24,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:24,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:24,263 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:24,263 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:24,263 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:24,263 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:24,263 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:24,263 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:24,263 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:24,263 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:24,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:24,266 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:24,266 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:24,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:24,266 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:24,266 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:24,340 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:24,342 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:24,342 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:24,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:24,342 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:24,342 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:24,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3145 [2022-12-06 07:35:24,342 INFO L420 AbstractCegarLoop]: === Iteration 3147 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:24,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:24,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1251451737, now seen corresponding path program 1 times [2022-12-06 07:35:24,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:24,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37841655] [2022-12-06 07:35:24,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:24,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:24,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-06 07:35:24,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:24,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37841655] [2022-12-06 07:35:24,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37841655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:24,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:24,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:24,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653143789] [2022-12-06 07:35:24,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:24,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:24,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:24,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:24,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:24,411 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:24,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:24,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:24,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:24,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:24,446 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:24,446 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:24,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:24,447 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:24,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:24,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:24,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:24,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:24,447 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:24,447 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:24,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:24,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:24,448 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:24,448 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:24,448 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:24,448 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:24,448 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:24,449 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:24,449 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:24,449 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:24,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:24,451 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:24,451 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:24,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:24,451 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:24,451 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:24,524 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:24,525 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:24,525 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:24,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:24,525 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:24,526 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:24,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3146 [2022-12-06 07:35:24,526 INFO L420 AbstractCegarLoop]: === Iteration 3148 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:24,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:24,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1281927930, now seen corresponding path program 1 times [2022-12-06 07:35:24,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:24,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310573812] [2022-12-06 07:35:24,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:24,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:24,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-06 07:35:24,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:24,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310573812] [2022-12-06 07:35:24,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310573812] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:24,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:24,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:24,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578893802] [2022-12-06 07:35:24,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:24,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:24,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:24,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:24,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:24,608 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:24,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:24,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:24,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:24,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:24,645 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:24,645 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:24,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:24,645 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:24,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:24,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:24,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:24,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:24,646 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:24,646 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:24,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:24,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:24,646 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:24,646 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:24,647 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:24,647 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:24,647 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:24,647 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:24,647 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:24,647 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:24,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:24,649 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:24,649 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:24,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:24,649 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:24,649 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:24,725 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:24,726 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:24,726 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:24,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:24,727 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:24,727 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:24,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3147 [2022-12-06 07:35:24,727 INFO L420 AbstractCegarLoop]: === Iteration 3149 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:24,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:24,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1308710039, now seen corresponding path program 1 times [2022-12-06 07:35:24,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:24,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71319758] [2022-12-06 07:35:24,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:24,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:24,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-06 07:35:24,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:24,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71319758] [2022-12-06 07:35:24,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71319758] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:24,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:24,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:24,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487630778] [2022-12-06 07:35:24,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:24,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:24,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:24,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:24,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:24,813 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:24,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:24,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:24,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:24,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:24,847 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:24,848 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:24,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:24,848 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:24,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:24,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:24,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:24,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:24,848 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:24,849 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:24,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:24,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:24,849 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:24,849 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:24,849 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:24,849 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:24,849 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:24,850 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:24,850 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:24,850 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:24,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:24,852 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:24,852 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:24,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:24,852 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:24,852 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:24,925 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:24,926 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:24,926 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:24,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:24,926 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:24,926 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:24,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3148 [2022-12-06 07:35:24,927 INFO L420 AbstractCegarLoop]: === Iteration 3150 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:24,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:24,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1339186232, now seen corresponding path program 1 times [2022-12-06 07:35:24,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:24,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494221067] [2022-12-06 07:35:24,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:24,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:24,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-06 07:35:24,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:24,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494221067] [2022-12-06 07:35:24,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494221067] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:24,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:24,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:24,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480204382] [2022-12-06 07:35:24,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:24,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:24,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:24,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:24,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:24,996 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:24,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:24,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:24,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:24,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:25,033 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:25,033 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:25,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:25,033 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:25,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:25,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:25,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:25,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:25,034 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:25,034 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:25,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:25,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:25,034 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:25,034 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:25,035 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:25,035 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:25,035 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:25,035 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:25,035 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:25,035 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:25,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:25,037 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:25,037 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:25,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:25,037 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:25,037 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:25,110 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:25,112 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:25,112 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:25,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:25,112 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:25,112 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:25,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3149 [2022-12-06 07:35:25,112 INFO L420 AbstractCegarLoop]: === Iteration 3151 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:25,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:25,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1365968341, now seen corresponding path program 1 times [2022-12-06 07:35:25,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:25,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080580815] [2022-12-06 07:35:25,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:25,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35: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-06 07:35:25,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:25,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080580815] [2022-12-06 07:35:25,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080580815] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:25,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:25,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:25,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731204997] [2022-12-06 07:35:25,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:25,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:25,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:25,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:25,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:25,182 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:25,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:25,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:25,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:25,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:25,218 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:25,218 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:25,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:25,218 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:25,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:25,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:25,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:25,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:25,219 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:25,219 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:25,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:25,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:25,219 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:25,220 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:25,220 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:25,220 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:25,220 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:25,220 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:25,220 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:25,220 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:25,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:25,222 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:25,222 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:25,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:25,222 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:25,223 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:25,297 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:25,298 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:25,298 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:25,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:25,298 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:25,298 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:25,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3150 [2022-12-06 07:35:25,299 INFO L420 AbstractCegarLoop]: === Iteration 3152 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:25,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:25,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1396444534, now seen corresponding path program 1 times [2022-12-06 07:35:25,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:25,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239410674] [2022-12-06 07:35:25,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:25,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35: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-06 07:35:25,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:25,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239410674] [2022-12-06 07:35:25,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239410674] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:25,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:25,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:25,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201735438] [2022-12-06 07:35:25,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:25,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:25,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:25,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:25,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:25,366 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:25,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:25,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:25,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:25,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:25,402 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:25,402 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:25,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:25,403 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:25,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:25,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:25,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:25,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:25,403 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:25,403 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:25,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:25,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:25,404 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:25,404 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:25,404 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:25,404 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:25,404 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:25,404 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:25,404 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:25,404 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:25,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:25,407 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:25,407 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:25,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:25,407 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:25,407 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:25,481 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:25,482 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:25,482 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:25,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:25,482 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:25,482 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:25,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3151 [2022-12-06 07:35:25,482 INFO L420 AbstractCegarLoop]: === Iteration 3153 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:25,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:25,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1423226643, now seen corresponding path program 1 times [2022-12-06 07:35:25,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:25,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523322436] [2022-12-06 07:35:25,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:25,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:25,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-06 07:35:25,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:25,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523322436] [2022-12-06 07:35:25,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523322436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:25,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:25,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:25,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101434475] [2022-12-06 07:35:25,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:25,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:25,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:25,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:25,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:25,554 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:25,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:25,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:25,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:25,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:25,590 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:25,590 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:25,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:25,591 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:25,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:25,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:25,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:25,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:25,591 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:25,591 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:25,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:25,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:25,592 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:25,592 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:25,592 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:25,592 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:25,592 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:25,592 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:25,592 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:25,592 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:25,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:25,594 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:25,595 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:25,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:25,595 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:25,595 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:25,670 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:25,671 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:25,671 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:25,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:25,671 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:25,671 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:25,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3152 [2022-12-06 07:35:25,671 INFO L420 AbstractCegarLoop]: === Iteration 3154 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:25,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:25,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1453702836, now seen corresponding path program 1 times [2022-12-06 07:35:25,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:25,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411405394] [2022-12-06 07:35:25,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:25,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:25,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:25,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-06 07:35:25,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:25,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411405394] [2022-12-06 07:35:25,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411405394] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:25,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:25,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:25,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754629718] [2022-12-06 07:35:25,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:25,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:25,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:25,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:25,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:25,739 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:25,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:25,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:25,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:25,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:25,776 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:25,776 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:25,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:25,776 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:25,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:25,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:25,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:25,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:25,777 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:25,777 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:25,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:25,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:25,777 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:25,778 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:25,778 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:25,778 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:25,778 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:25,778 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:25,778 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:25,778 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:25,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:25,780 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:25,780 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:25,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:25,781 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:25,781 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:25,855 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:25,856 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:25,856 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:25,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:25,856 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:25,856 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:25,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3153 [2022-12-06 07:35:25,856 INFO L420 AbstractCegarLoop]: === Iteration 3155 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:25,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:25,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1480484945, now seen corresponding path program 1 times [2022-12-06 07:35:25,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:25,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906943763] [2022-12-06 07:35:25,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:25,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:25,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-06 07:35:25,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:25,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906943763] [2022-12-06 07:35:25,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906943763] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:25,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:25,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:25,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879534516] [2022-12-06 07:35:25,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:25,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:25,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:25,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:25,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:25,936 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:25,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:25,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:25,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:25,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:25,977 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:25,977 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:25,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:25,978 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:25,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:25,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:25,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:25,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:25,978 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:25,978 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:25,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:25,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:25,979 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:25,979 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:25,979 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:25,979 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:25,979 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:25,979 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:25,979 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:25,980 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:25,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:25,982 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:25,982 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:25,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 144 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:25,982 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:25,982 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:26,070 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:26,071 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-06 07:35:26,071 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:26,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:26,071 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:26,071 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:26,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3154 [2022-12-06 07:35:26,071 INFO L420 AbstractCegarLoop]: === Iteration 3156 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:26,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:26,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1510961138, now seen corresponding path program 1 times [2022-12-06 07:35:26,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:26,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61143304] [2022-12-06 07:35:26,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:26,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:26,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-06 07:35:26,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:26,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61143304] [2022-12-06 07:35:26,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61143304] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:26,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:26,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:26,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057199639] [2022-12-06 07:35:26,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:26,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:26,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:26,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:26,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:26,139 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:26,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:26,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:26,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:26,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:26,180 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:26,180 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:26,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:26,181 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:26,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:26,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:26,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:26,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:26,181 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:26,181 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:26,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:26,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:26,182 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:26,182 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:26,182 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:26,182 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:26,182 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:26,182 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:26,182 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:26,182 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:26,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:26,184 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:26,185 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:26,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 118 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:26,185 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:26,185 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:26,259 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:26,260 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:26,261 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:26,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:26,261 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:26,261 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:26,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3155 [2022-12-06 07:35:26,261 INFO L420 AbstractCegarLoop]: === Iteration 3157 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:26,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:26,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1537743247, now seen corresponding path program 1 times [2022-12-06 07:35:26,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:26,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361127927] [2022-12-06 07:35:26,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:26,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:26,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-06 07:35:26,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:26,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361127927] [2022-12-06 07:35:26,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361127927] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:26,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:26,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:26,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620002806] [2022-12-06 07:35:26,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:26,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:26,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:26,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:26,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:26,330 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:26,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:26,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:26,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:26,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:26,366 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:26,366 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:26,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:26,367 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:26,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:26,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:26,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:26,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:26,367 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:26,367 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:26,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:26,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:26,368 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:26,368 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:26,368 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:26,368 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:26,368 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:26,369 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:26,369 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:26,369 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:26,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:26,371 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:26,371 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:26,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:26,371 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:26,371 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:26,446 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:26,447 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:26,447 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:26,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:26,447 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:26,447 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:26,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3156 [2022-12-06 07:35:26,447 INFO L420 AbstractCegarLoop]: === Iteration 3158 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:26,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:26,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1568219440, now seen corresponding path program 1 times [2022-12-06 07:35:26,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:26,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115509805] [2022-12-06 07:35:26,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:26,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:26,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-06 07:35:26,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:26,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115509805] [2022-12-06 07:35:26,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115509805] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:26,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:26,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:26,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408402173] [2022-12-06 07:35:26,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:26,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:26,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:26,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:26,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:26,516 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:26,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:26,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:26,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:26,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:26,557 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:26,557 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:26,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:26,557 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:26,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:26,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:26,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:26,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:26,558 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:26,558 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:26,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:26,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:26,558 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:26,558 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:26,558 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:26,559 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:26,559 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:26,559 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:26,559 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:26,559 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:26,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:26,561 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:26,561 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:26,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 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 116. Up to 16 conditions per place. [2022-12-06 07:35:26,561 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:26,561 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:26,636 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:26,637 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:26,637 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:26,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:26,638 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:26,638 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:26,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3157 [2022-12-06 07:35:26,638 INFO L420 AbstractCegarLoop]: === Iteration 3159 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:26,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:26,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1595001549, now seen corresponding path program 1 times [2022-12-06 07:35:26,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:26,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716001509] [2022-12-06 07:35:26,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:26,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:26,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-06 07:35:26,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:26,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716001509] [2022-12-06 07:35:26,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716001509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:26,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:26,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:26,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285813314] [2022-12-06 07:35:26,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:26,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:26,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:26,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:26,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:26,706 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:26,706 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:26,706 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:26,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:26,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:26,742 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:26,742 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:26,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:26,742 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:26,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:26,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:26,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:26,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:26,743 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:26,743 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:26,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:26,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:26,744 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:26,744 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:26,744 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:26,744 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:26,744 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:26,744 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:26,744 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:26,744 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:26,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:26,746 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:26,747 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:26,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:26,747 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:26,747 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:26,820 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:26,822 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:26,822 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:26,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:26,822 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:26,822 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:26,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3158 [2022-12-06 07:35:26,822 INFO L420 AbstractCegarLoop]: === Iteration 3160 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:26,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:26,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1625477742, now seen corresponding path program 1 times [2022-12-06 07:35:26,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:26,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008930929] [2022-12-06 07:35:26,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:26,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:26,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-06 07:35:26,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:26,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008930929] [2022-12-06 07:35:26,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008930929] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:26,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:26,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:26,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024263851] [2022-12-06 07:35:26,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:26,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:26,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:26,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:26,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:26,894 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:26,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:26,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:26,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:26,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:26,930 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:26,930 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:26,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:26,930 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:26,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:26,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:26,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:26,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:26,931 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:26,931 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:26,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:26,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:26,932 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:26,932 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:26,932 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:26,932 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:26,932 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:26,932 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:26,932 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:26,932 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:26,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:26,934 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:26,934 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:26,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:26,935 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:26,935 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:27,010 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:27,011 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:27,011 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:27,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:27,011 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:27,011 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:27,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3159 [2022-12-06 07:35:27,011 INFO L420 AbstractCegarLoop]: === Iteration 3161 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:27,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:27,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1652259851, now seen corresponding path program 1 times [2022-12-06 07:35:27,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:27,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606219594] [2022-12-06 07:35:27,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:27,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:27,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-06 07:35:27,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:27,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606219594] [2022-12-06 07:35:27,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606219594] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:27,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:27,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:27,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736894760] [2022-12-06 07:35:27,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:27,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:27,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:27,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:27,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:27,081 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:27,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:27,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:27,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:27,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:27,115 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:27,115 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:27,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:27,115 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:27,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:27,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:27,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:27,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:27,116 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:27,116 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:27,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:27,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:27,116 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:27,117 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:27,117 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:27,117 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:27,117 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:27,117 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:27,117 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:27,117 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:27,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:27,119 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:27,119 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:27,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:27,120 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:27,120 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:27,192 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:27,193 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:35:27,193 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:27,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:27,193 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:27,193 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:27,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3160 [2022-12-06 07:35:27,193 INFO L420 AbstractCegarLoop]: === Iteration 3162 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:27,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:27,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1682736044, now seen corresponding path program 1 times [2022-12-06 07:35:27,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:27,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583765007] [2022-12-06 07:35:27,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:27,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:27,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:27,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:27,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583765007] [2022-12-06 07:35:27,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583765007] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:27,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:27,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:27,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479712548] [2022-12-06 07:35:27,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:27,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:27,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:27,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:27,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:27,283 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:27,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:27,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:27,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:27,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:27,318 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:27,318 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:27,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:27,319 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:27,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:27,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:27,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:27,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:27,319 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:27,319 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:27,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:27,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:27,320 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:27,320 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:27,320 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:27,320 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:27,320 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:27,320 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:27,320 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:27,320 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:27,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:27,323 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:27,323 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:27,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:27,323 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:27,323 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:27,397 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:27,398 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:27,398 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:27,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:27,398 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:27,398 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:27,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3161 [2022-12-06 07:35:27,398 INFO L420 AbstractCegarLoop]: === Iteration 3163 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:27,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:27,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1709518153, now seen corresponding path program 1 times [2022-12-06 07:35:27,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:27,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946917947] [2022-12-06 07:35:27,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:27,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:27,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-06 07:35:27,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:27,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946917947] [2022-12-06 07:35:27,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946917947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:27,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:27,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:27,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479054067] [2022-12-06 07:35:27,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:27,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:27,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:27,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:27,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:27,470 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:27,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:27,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:27,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:27,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:27,510 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:27,511 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:27,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:27,511 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:27,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:27,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:27,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:27,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:27,512 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:27,512 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:27,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:27,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:27,512 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:27,512 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:27,512 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:27,513 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:27,513 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:27,513 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:27,513 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:27,513 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:27,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:27,515 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:27,515 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:27,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:27,515 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:27,515 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:27,589 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:27,590 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:27,590 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:27,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:27,590 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:27,590 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:27,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3162 [2022-12-06 07:35:27,590 INFO L420 AbstractCegarLoop]: === Iteration 3164 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:27,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:27,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1739994346, now seen corresponding path program 1 times [2022-12-06 07:35:27,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:27,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928155476] [2022-12-06 07:35:27,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:27,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:27,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-06 07:35:27,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:27,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928155476] [2022-12-06 07:35:27,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928155476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:27,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:27,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:27,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322174989] [2022-12-06 07:35:27,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:27,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:27,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:27,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:27,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:27,664 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:27,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:27,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:27,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:27,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:27,706 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:27,706 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:27,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:27,707 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:27,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:27,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:27,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:27,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:27,707 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:27,707 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:27,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:27,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:27,708 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:27,708 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:27,708 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:27,708 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:27,708 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:27,708 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:27,708 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:27,708 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:27,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:27,711 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:27,711 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:27,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:27,711 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:27,711 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:27,785 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:27,786 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:27,786 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:27,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:27,786 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:27,786 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:27,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3163 [2022-12-06 07:35:27,787 INFO L420 AbstractCegarLoop]: === Iteration 3165 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:27,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:27,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1766776455, now seen corresponding path program 1 times [2022-12-06 07:35:27,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:27,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14216810] [2022-12-06 07:35:27,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:27,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:27,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:27,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-06 07:35:27,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:27,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14216810] [2022-12-06 07:35:27,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14216810] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:27,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:27,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:27,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466468581] [2022-12-06 07:35:27,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:27,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:27,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:27,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:27,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:27,856 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:27,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:27,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:27,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:27,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:27,897 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:27,897 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:27,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:27,897 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:27,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:27,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:27,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:27,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:27,898 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:27,898 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:27,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:27,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:27,898 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:27,898 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:27,899 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:27,899 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:27,899 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:27,899 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:27,899 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:27,899 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:27,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:27,901 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:27,901 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:27,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:27,902 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:27,902 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:27,976 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:27,977 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:27,977 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:27,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:27,977 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:27,977 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:27,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3164 [2022-12-06 07:35:27,978 INFO L420 AbstractCegarLoop]: === Iteration 3166 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:27,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:27,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1797252648, now seen corresponding path program 1 times [2022-12-06 07:35:27,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:27,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139120421] [2022-12-06 07:35:27,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:27,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:28,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-06 07:35:28,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:28,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139120421] [2022-12-06 07:35:28,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139120421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:28,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:28,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:28,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746167086] [2022-12-06 07:35:28,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:28,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:28,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:28,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:28,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:28,045 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:28,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:28,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:28,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:28,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:28,081 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:28,081 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:28,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:28,081 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:28,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:28,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:28,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:28,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:28,082 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:28,082 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:28,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:28,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:28,083 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:28,083 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:28,083 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:28,083 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:28,083 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:28,083 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:28,083 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:28,083 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:28,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:28,085 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:28,085 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:28,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:28,086 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:28,086 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:28,159 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:28,161 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:28,161 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:28,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:28,161 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:28,161 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:28,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3165 [2022-12-06 07:35:28,161 INFO L420 AbstractCegarLoop]: === Iteration 3167 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:28,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:28,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1824034757, now seen corresponding path program 1 times [2022-12-06 07:35:28,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:28,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612819473] [2022-12-06 07:35:28,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:28,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:28,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-06 07:35:28,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:28,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612819473] [2022-12-06 07:35:28,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612819473] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:28,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:28,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:28,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791689067] [2022-12-06 07:35:28,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:28,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:28,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:28,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:28,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:28,232 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:28,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:28,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:28,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:28,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:28,268 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:28,268 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:28,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:28,268 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:28,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:28,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:28,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:28,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:28,269 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:28,269 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:28,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:28,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:28,269 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:28,270 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:28,270 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:28,270 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:28,270 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:28,270 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:28,270 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:28,270 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:28,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:28,272 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:28,272 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:28,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:28,272 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:28,272 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:28,347 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:28,348 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:28,348 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:28,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:28,348 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:28,348 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:28,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3166 [2022-12-06 07:35:28,348 INFO L420 AbstractCegarLoop]: === Iteration 3168 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:28,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:28,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1854510950, now seen corresponding path program 1 times [2022-12-06 07:35:28,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:28,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351044383] [2022-12-06 07:35:28,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:28,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:28,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-06 07:35:28,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:28,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351044383] [2022-12-06 07:35:28,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351044383] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:28,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:28,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:28,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433294709] [2022-12-06 07:35:28,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:28,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:28,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:28,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:28,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:28,417 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:28,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:28,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:28,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:28,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:28,473 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:28,473 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:28,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:28,473 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:28,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:28,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:28,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:28,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:28,474 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:28,474 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:28,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:28,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:28,474 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:28,474 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:28,475 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:28,475 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:28,475 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:28,475 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:28,475 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:28,475 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:28,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:28,477 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:28,477 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:28,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:28,477 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:28,477 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:28,564 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:28,565 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-06 07:35:28,565 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:28,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:28,565 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:28,565 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:28,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3167 [2022-12-06 07:35:28,565 INFO L420 AbstractCegarLoop]: === Iteration 3169 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:28,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:28,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1881293059, now seen corresponding path program 1 times [2022-12-06 07:35:28,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:28,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844732662] [2022-12-06 07:35:28,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:28,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:28,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-06 07:35:28,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:28,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844732662] [2022-12-06 07:35:28,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844732662] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:28,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:28,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:28,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887380828] [2022-12-06 07:35:28,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:28,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:28,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:28,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:28,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:28,640 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:28,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:28,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:28,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:28,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:28,676 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:28,676 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:28,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 375 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:28,676 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:28,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:28,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:28,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:28,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:28,677 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:28,677 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:28,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:28,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:28,678 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:28,678 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:28,678 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:28,678 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:28,678 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:28,678 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:28,678 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:28,678 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:28,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:28,680 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:28,680 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:28,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:28,681 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:28,681 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:28,755 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:28,757 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:28,757 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:28,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:28,757 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:28,757 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:28,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3168 [2022-12-06 07:35:28,757 INFO L420 AbstractCegarLoop]: === Iteration 3170 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:28,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:28,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1911769252, now seen corresponding path program 1 times [2022-12-06 07:35:28,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:28,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989421829] [2022-12-06 07:35:28,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:28,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:28,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-06 07:35:28,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:28,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989421829] [2022-12-06 07:35:28,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989421829] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:28,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:28,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:28,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484409603] [2022-12-06 07:35:28,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:28,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:28,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:28,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:28,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:28,836 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:28,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:28,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:28,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:28,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:28,886 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:28,886 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:28,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:28,887 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:28,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:28,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:28,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:28,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:28,887 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:28,887 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:28,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:28,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:28,888 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:28,888 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:28,889 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:28,889 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:28,889 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:28,889 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:28,889 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:28,889 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:28,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:28,892 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:28,892 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:28,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:28,892 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:28,892 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:28,981 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:28,983 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 07:35:28,983 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:28,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:28,983 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:28,983 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:28,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3169 [2022-12-06 07:35:28,983 INFO L420 AbstractCegarLoop]: === Iteration 3171 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:28,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:28,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1938551361, now seen corresponding path program 1 times [2022-12-06 07:35:28,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:28,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606425375] [2022-12-06 07:35:28,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:28,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:29,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-06 07:35:29,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:29,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606425375] [2022-12-06 07:35:29,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606425375] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:29,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:29,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:29,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018205134] [2022-12-06 07:35:29,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:29,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:29,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:29,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:29,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:29,074 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:29,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:29,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:29,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:29,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:29,121 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:29,122 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:29,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:29,122 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:29,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:29,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:29,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:29,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:29,123 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:29,123 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:29,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:29,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:29,124 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:29,124 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:29,124 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:29,124 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:29,124 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:29,124 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:29,124 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:29,124 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:29,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:29,127 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:29,127 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:29,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:29,128 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:29,128 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:29,217 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:29,219 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 07:35:29,219 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:29,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:29,219 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:29,219 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:29,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3170 [2022-12-06 07:35:29,220 INFO L420 AbstractCegarLoop]: === Iteration 3172 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:29,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:29,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1969027554, now seen corresponding path program 1 times [2022-12-06 07:35:29,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:29,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21767391] [2022-12-06 07:35:29,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:29,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:29,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-06 07:35:29,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:29,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21767391] [2022-12-06 07:35:29,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21767391] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:29,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:29,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:29,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656998211] [2022-12-06 07:35:29,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:29,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:29,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:29,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:29,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:29,308 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:29,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:29,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:29,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:29,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:29,361 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:29,361 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:29,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:29,362 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:29,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:29,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:29,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:29,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:29,363 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:29,363 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:29,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:29,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:29,364 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:29,364 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:29,364 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:29,364 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:29,364 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:29,364 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:29,364 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:29,364 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:29,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:29,367 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:29,367 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:29,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:29,368 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:29,368 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:29,453 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:29,455 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-06 07:35:29,455 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:29,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:29,455 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:29,455 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:29,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3171 [2022-12-06 07:35:29,455 INFO L420 AbstractCegarLoop]: === Iteration 3173 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:29,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:29,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1995809663, now seen corresponding path program 1 times [2022-12-06 07:35:29,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:29,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904313626] [2022-12-06 07:35:29,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:29,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:29,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-06 07:35:29,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:29,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904313626] [2022-12-06 07:35:29,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904313626] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:29,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:29,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:29,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110676699] [2022-12-06 07:35:29,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:29,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:29,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:29,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:29,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:29,526 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:29,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:29,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:29,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:29,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:29,565 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:29,565 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:29,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 371 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:29,566 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:29,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:29,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:29,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:29,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:29,566 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:29,566 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:29,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:29,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:29,567 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:29,567 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:29,567 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:29,567 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:29,567 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:29,567 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:29,567 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:29,567 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:29,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:29,570 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:29,570 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:29,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:29,570 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:29,570 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:29,643 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:29,645 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:29,645 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:29,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:29,645 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:29,645 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:29,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3172 [2022-12-06 07:35:29,645 INFO L420 AbstractCegarLoop]: === Iteration 3174 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:29,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:29,645 INFO L85 PathProgramCache]: Analyzing trace with hash 2026285856, now seen corresponding path program 1 times [2022-12-06 07:35:29,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:29,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382398247] [2022-12-06 07:35:29,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:29,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:29,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:29,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-06 07:35:29,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:29,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382398247] [2022-12-06 07:35:29,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382398247] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:29,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:29,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:29,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739231099] [2022-12-06 07:35:29,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:29,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:29,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:29,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:29,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:29,713 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:29,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:29,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:29,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:29,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:29,756 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:29,756 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:29,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:29,757 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:29,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:29,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:29,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:29,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:29,757 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:29,757 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:29,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:29,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:29,758 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:29,758 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:29,758 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:29,758 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:29,758 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:29,759 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:29,759 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:29,759 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:29,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:29,761 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:29,761 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:29,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:29,761 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:29,761 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:29,834 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:29,836 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:29,836 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:29,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:29,836 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:29,836 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:29,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3173 [2022-12-06 07:35:29,836 INFO L420 AbstractCegarLoop]: === Iteration 3175 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:29,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:29,836 INFO L85 PathProgramCache]: Analyzing trace with hash 2053067965, now seen corresponding path program 1 times [2022-12-06 07:35:29,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:29,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159373628] [2022-12-06 07:35:29,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:29,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:29,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-06 07:35:29,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:29,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159373628] [2022-12-06 07:35:29,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159373628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:29,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:29,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:29,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269342273] [2022-12-06 07:35:29,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:29,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:29,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:29,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:29,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:29,920 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:29,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:29,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:29,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:29,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:29,959 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:29,959 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:29,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 372 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:29,959 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:29,959 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:29,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:29,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:29,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:29,960 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:29,960 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:29,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:29,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:29,961 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:29,961 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:29,961 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:29,961 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:29,961 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:29,961 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:29,961 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:29,961 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:29,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:29,963 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:29,963 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:29,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:29,964 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:29,964 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:30,038 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:30,040 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:30,040 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:30,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:30,040 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:30,040 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:30,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3174 [2022-12-06 07:35:30,040 INFO L420 AbstractCegarLoop]: === Iteration 3176 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:30,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:30,040 INFO L85 PathProgramCache]: Analyzing trace with hash 2083544158, now seen corresponding path program 1 times [2022-12-06 07:35:30,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:30,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407631000] [2022-12-06 07:35:30,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:30,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:30,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-06 07:35:30,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:30,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407631000] [2022-12-06 07:35:30,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407631000] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:30,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:30,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:30,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572757280] [2022-12-06 07:35:30,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:30,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:30,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:30,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:30,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:30,116 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:30,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:30,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:30,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:30,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:30,158 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:30,158 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:30,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:30,158 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:30,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:30,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:30,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:30,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:30,159 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:30,159 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:30,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:30,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:30,159 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:30,159 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:30,160 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:30,160 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:30,160 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:30,160 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:30,160 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:30,160 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:30,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:30,162 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:30,162 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:30,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:30,162 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:30,162 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:30,239 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:30,240 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:35:30,240 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:30,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:30,240 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:30,240 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:30,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3175 [2022-12-06 07:35:30,240 INFO L420 AbstractCegarLoop]: === Iteration 3177 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:30,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:30,241 INFO L85 PathProgramCache]: Analyzing trace with hash 2110326267, now seen corresponding path program 1 times [2022-12-06 07:35:30,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:30,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915407713] [2022-12-06 07:35:30,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:30,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:30,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:30,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-06 07:35:30,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:30,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915407713] [2022-12-06 07:35:30,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915407713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:30,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:30,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:30,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850055306] [2022-12-06 07:35:30,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:30,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:30,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:30,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:30,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:30,310 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:30,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:30,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:30,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:30,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:30,347 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:30,347 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:30,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 354 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:30,347 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:30,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:30,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:30,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:30,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:30,348 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:30,348 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:30,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:30,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:30,349 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:30,349 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:30,349 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:30,349 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:30,349 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:30,349 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:30,349 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:30,349 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:30,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:30,351 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:30,351 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:30,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:30,352 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:30,352 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:30,428 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:30,429 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:35:30,429 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:30,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:30,429 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:30,429 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:30,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3176 [2022-12-06 07:35:30,429 INFO L420 AbstractCegarLoop]: === Iteration 3178 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:30,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:30,429 INFO L85 PathProgramCache]: Analyzing trace with hash 2140802460, now seen corresponding path program 1 times [2022-12-06 07:35:30,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:30,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529325636] [2022-12-06 07:35:30,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:30,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:30,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-06 07:35:30,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:30,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529325636] [2022-12-06 07:35:30,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529325636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:30,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:30,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:30,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529689880] [2022-12-06 07:35:30,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:30,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:30,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:30,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:30,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:30,496 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:30,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:30,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:30,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:30,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:30,537 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:30,537 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:30,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:30,537 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:30,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:30,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:30,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:30,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:30,538 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:30,538 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:30,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:30,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:30,539 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:30,539 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:30,539 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:30,539 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:30,539 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:30,539 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:30,539 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:30,539 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:30,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:30,541 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:30,541 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:30,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:30,542 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:30,542 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:30,616 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:30,618 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:30,618 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:30,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:30,618 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:30,618 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:30,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3177 [2022-12-06 07:35:30,618 INFO L420 AbstractCegarLoop]: === Iteration 3179 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:30,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:30,618 INFO L85 PathProgramCache]: Analyzing trace with hash -2127382727, now seen corresponding path program 1 times [2022-12-06 07:35:30,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:30,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437603807] [2022-12-06 07:35:30,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:30,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:30,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-06 07:35:30,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:30,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437603807] [2022-12-06 07:35:30,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437603807] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:30,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:30,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:30,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247310114] [2022-12-06 07:35:30,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:30,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:30,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:30,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:30,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:30,688 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:30,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:30,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:30,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:30,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:30,723 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:30,723 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:30,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:30,724 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:30,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:30,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:30,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:30,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:30,724 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:30,724 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:30,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:30,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:30,725 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:30,725 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:30,725 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:30,725 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:30,725 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:30,725 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:30,725 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:30,725 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:30,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:30,728 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:30,728 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:30,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:30,728 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:30,728 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:30,802 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:30,803 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:30,803 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:30,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:30,803 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:30,803 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:30,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3178 [2022-12-06 07:35:30,804 INFO L420 AbstractCegarLoop]: === Iteration 3180 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:30,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:30,804 INFO L85 PathProgramCache]: Analyzing trace with hash -2096906534, now seen corresponding path program 1 times [2022-12-06 07:35:30,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:30,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338860679] [2022-12-06 07:35:30,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:30,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:30,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-06 07:35:30,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:30,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338860679] [2022-12-06 07:35:30,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338860679] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:30,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:30,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:30,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369930094] [2022-12-06 07:35:30,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:30,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:30,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:30,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:30,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:30,871 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:30,871 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:30,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:30,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:30,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:30,912 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:30,913 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:30,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:30,913 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:30,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:30,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:30,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:30,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:30,914 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:30,914 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:30,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:30,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:30,914 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:30,914 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:30,914 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:30,915 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:30,915 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:30,915 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:30,915 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:30,915 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:30,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:30,917 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:30,917 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:30,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:30,917 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:30,917 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:30,991 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:30,992 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:30,993 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:30,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:30,993 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:30,993 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:30,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3179 [2022-12-06 07:35:30,993 INFO L420 AbstractCegarLoop]: === Iteration 3181 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:30,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:30,993 INFO L85 PathProgramCache]: Analyzing trace with hash -2070124425, now seen corresponding path program 1 times [2022-12-06 07:35:30,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:30,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246157189] [2022-12-06 07:35:30,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:30,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:31,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:31,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-06 07:35:31,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:31,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246157189] [2022-12-06 07:35:31,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246157189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:31,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:31,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:31,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056626543] [2022-12-06 07:35:31,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:31,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:31,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:31,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:31,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:31,079 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:31,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:31,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:31,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:31,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:31,114 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:31,114 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:31,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:31,115 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:31,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:31,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:31,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:31,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:31,115 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:31,115 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:31,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:31,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:31,116 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:31,116 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:31,116 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:31,116 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:31,116 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:31,116 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:31,116 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:31,116 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:31,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:31,118 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:31,118 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:31,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:31,119 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:31,119 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:31,193 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:31,194 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:31,194 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:31,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:31,194 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:31,194 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:31,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3180 [2022-12-06 07:35:31,194 INFO L420 AbstractCegarLoop]: === Iteration 3182 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:31,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:31,195 INFO L85 PathProgramCache]: Analyzing trace with hash -2039648232, now seen corresponding path program 1 times [2022-12-06 07:35:31,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:31,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468729449] [2022-12-06 07:35:31,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:31,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:31,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-06 07:35:31,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:31,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468729449] [2022-12-06 07:35:31,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468729449] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:31,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:31,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:31,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262643367] [2022-12-06 07:35:31,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:31,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:31,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:31,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:31,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:31,263 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:31,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:31,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:31,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:31,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:31,300 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:31,300 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:31,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:31,300 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:31,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:31,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:31,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:31,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:31,301 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:31,301 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:31,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:31,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:31,302 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:31,302 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:31,302 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:31,302 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:31,302 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:31,302 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:31,302 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:31,302 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:31,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:31,304 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:31,304 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:31,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:31,305 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:31,305 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:31,378 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:31,380 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:31,380 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:31,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:31,380 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:31,380 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:31,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3181 [2022-12-06 07:35:31,380 INFO L420 AbstractCegarLoop]: === Iteration 3183 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:31,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:31,380 INFO L85 PathProgramCache]: Analyzing trace with hash -2012866123, now seen corresponding path program 1 times [2022-12-06 07:35:31,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:31,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923827378] [2022-12-06 07:35:31,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:31,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:31,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-06 07:35:31,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:31,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923827378] [2022-12-06 07:35:31,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923827378] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:31,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:31,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:31,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898305691] [2022-12-06 07:35:31,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:31,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:31,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:31,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:31,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:31,451 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:31,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:31,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:31,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:31,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:31,493 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:31,493 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:31,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:31,494 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:31,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:31,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:31,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:31,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:31,494 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:31,494 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:31,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:31,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:31,495 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:31,495 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:31,495 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:31,495 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:31,495 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:31,495 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:31,495 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:31,495 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:31,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:31,497 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:31,498 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:31,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:31,498 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:31,498 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:31,571 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:31,572 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:31,572 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:31,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:31,572 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:31,572 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:31,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3182 [2022-12-06 07:35:31,573 INFO L420 AbstractCegarLoop]: === Iteration 3184 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:31,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:31,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1982389930, now seen corresponding path program 1 times [2022-12-06 07:35:31,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:31,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351758800] [2022-12-06 07:35:31,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:31,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:31,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-06 07:35:31,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:31,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351758800] [2022-12-06 07:35:31,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351758800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:31,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:31,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:31,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535151104] [2022-12-06 07:35:31,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:31,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:31,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:31,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:31,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:31,640 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:31,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:31,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:31,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:31,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:31,692 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:31,692 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:31,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:31,693 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:31,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:31,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:31,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:31,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:31,693 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:31,693 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:31,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:31,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:31,694 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:31,694 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:31,694 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:31,694 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:31,694 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:31,694 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:31,694 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:31,695 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:31,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:31,697 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:31,697 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:31,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:31,697 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:31,697 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:31,772 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:31,773 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:31,773 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:31,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:31,774 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:31,774 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:31,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3183 [2022-12-06 07:35:31,774 INFO L420 AbstractCegarLoop]: === Iteration 3185 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:31,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:31,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1955607821, now seen corresponding path program 1 times [2022-12-06 07:35:31,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:31,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545920198] [2022-12-06 07:35:31,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:31,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:31,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-06 07:35:31,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:31,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545920198] [2022-12-06 07:35:31,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545920198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:31,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:31,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:31,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304556734] [2022-12-06 07:35:31,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:31,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:31,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:31,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:31,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:31,845 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:31,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:31,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:31,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:31,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:31,882 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:31,882 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:31,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:31,882 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:31,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:31,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:31,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:31,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:31,883 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:31,883 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:31,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:31,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:31,884 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:31,884 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:31,884 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:31,884 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:31,884 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:31,884 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:31,884 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:31,884 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:31,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:31,886 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:31,886 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:31,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:31,887 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:31,887 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:31,960 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:31,962 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:31,962 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:31,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:31,962 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:31,962 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:31,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3184 [2022-12-06 07:35:31,962 INFO L420 AbstractCegarLoop]: === Iteration 3186 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:31,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:31,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1925131628, now seen corresponding path program 1 times [2022-12-06 07:35:31,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:31,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283927883] [2022-12-06 07:35:31,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:31,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:32,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-06 07:35:32,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:32,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283927883] [2022-12-06 07:35:32,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283927883] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:32,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:32,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:32,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475316808] [2022-12-06 07:35:32,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:32,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:32,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:32,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:32,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:32,030 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:32,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:32,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:32,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:32,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:32,073 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:32,073 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:32,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:32,073 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:32,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:32,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:32,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:32,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:32,074 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:32,074 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:32,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:32,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:32,074 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:32,074 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:32,075 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:32,075 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:32,075 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:32,075 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:32,075 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:32,075 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:32,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:32,077 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:32,077 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:32,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:32,077 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:32,077 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:32,151 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:32,152 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:32,152 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:32,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:32,153 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:32,153 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:32,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3185 [2022-12-06 07:35:32,153 INFO L420 AbstractCegarLoop]: === Iteration 3187 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:32,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:32,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1898349519, now seen corresponding path program 1 times [2022-12-06 07:35:32,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:32,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558568280] [2022-12-06 07:35:32,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:32,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:32,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:32,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-06 07:35:32,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:32,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558568280] [2022-12-06 07:35:32,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558568280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:32,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:32,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:32,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598597179] [2022-12-06 07:35:32,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:32,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:32,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:32,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:32,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:32,222 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:32,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:32,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:32,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:32,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:32,263 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:32,263 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:32,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:32,263 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:32,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:32,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:32,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:32,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:32,264 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:32,264 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:32,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:32,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:32,265 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:32,265 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:32,265 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:32,265 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:32,265 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:32,265 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:32,265 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:32,265 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:32,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:32,267 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:32,267 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:32,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:32,268 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:32,268 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:32,353 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:32,354 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 07:35:32,354 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:32,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:32,354 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:32,354 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:32,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3186 [2022-12-06 07:35:32,354 INFO L420 AbstractCegarLoop]: === Iteration 3188 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:32,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:32,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1867873326, now seen corresponding path program 1 times [2022-12-06 07:35:32,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:32,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195852218] [2022-12-06 07:35:32,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:32,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:32,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-06 07:35:32,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:32,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195852218] [2022-12-06 07:35:32,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195852218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:32,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:32,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:32,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318628851] [2022-12-06 07:35:32,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:32,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:32,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:32,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:32,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:32,421 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:32,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:32,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:32,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:32,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:32,461 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:32,462 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:32,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:32,462 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:32,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:32,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:32,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:32,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:32,463 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:32,463 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:32,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:32,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:32,463 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:32,463 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:32,463 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:32,464 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:32,464 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:32,464 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:32,464 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:32,464 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:32,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:32,466 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:32,466 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:32,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:32,466 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:32,466 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:32,540 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:32,541 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:32,541 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:32,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:32,541 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:32,541 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:32,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3187 [2022-12-06 07:35:32,541 INFO L420 AbstractCegarLoop]: === Iteration 3189 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:32,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:32,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1841091217, now seen corresponding path program 1 times [2022-12-06 07:35:32,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:32,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121181026] [2022-12-06 07:35:32,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:32,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:32,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-06 07:35:32,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:32,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121181026] [2022-12-06 07:35:32,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121181026] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:32,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:32,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:32,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904935403] [2022-12-06 07:35:32,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:32,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:32,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:32,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:32,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:32,611 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:32,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:32,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:32,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:32,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:32,647 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:32,647 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:32,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:32,647 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:32,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:32,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:32,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:32,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:32,648 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:32,648 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:32,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:32,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:32,649 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:32,649 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:32,649 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:32,649 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:32,649 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:32,649 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:32,649 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:32,649 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:32,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:32,651 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:32,651 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:32,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:32,652 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:32,652 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:32,726 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:32,727 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:32,727 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:32,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:32,727 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:32,727 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:32,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3188 [2022-12-06 07:35:32,727 INFO L420 AbstractCegarLoop]: === Iteration 3190 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:32,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:32,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1810615024, now seen corresponding path program 1 times [2022-12-06 07:35:32,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:32,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477483514] [2022-12-06 07:35:32,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:32,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:32,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:32,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-06 07:35:32,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:32,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477483514] [2022-12-06 07:35:32,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477483514] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:32,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:32,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:32,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930874075] [2022-12-06 07:35:32,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:32,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:32,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:32,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:32,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:32,795 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:32,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:32,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:32,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:32,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:32,837 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:32,837 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:32,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:32,838 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:32,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:32,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:32,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:32,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:32,838 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:32,838 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:32,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:32,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:32,839 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:32,839 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:32,839 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:32,839 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:32,839 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:32,839 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:32,839 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:32,839 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:32,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:32,842 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:32,842 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:32,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:32,842 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:32,842 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:32,916 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:32,918 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:32,918 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:32,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:32,918 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:32,918 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:32,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3189 [2022-12-06 07:35:32,918 INFO L420 AbstractCegarLoop]: === Iteration 3191 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:32,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:32,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1783832915, now seen corresponding path program 1 times [2022-12-06 07:35:32,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:32,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649499259] [2022-12-06 07:35:32,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:32,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:32,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:32,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:32,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649499259] [2022-12-06 07:35:32,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649499259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:32,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:32,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:32,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135399585] [2022-12-06 07:35:32,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:32,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:32,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:32,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:32,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:32,988 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:32,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:32,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:32,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:32,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:33,029 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:33,029 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:33,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:33,030 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:33,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:33,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:33,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:33,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:33,030 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:33,030 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:33,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:33,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:33,031 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:33,031 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:33,031 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:33,031 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:33,031 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:33,031 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:33,031 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:33,031 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:33,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:33,034 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:33,034 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:33,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:33,034 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:33,034 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:33,106 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:33,107 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:35:33,107 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:33,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:33,107 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:33,107 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:33,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3190 [2022-12-06 07:35:33,107 INFO L420 AbstractCegarLoop]: === Iteration 3192 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:33,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:33,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1753356722, now seen corresponding path program 1 times [2022-12-06 07:35:33,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:33,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872899654] [2022-12-06 07:35:33,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:33,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35: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-06 07:35:33,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:33,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872899654] [2022-12-06 07:35:33,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872899654] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:33,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:33,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:33,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727049005] [2022-12-06 07:35:33,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:33,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:33,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:33,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:33,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:33,181 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:33,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:33,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:33,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:33,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:33,225 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:33,225 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:33,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 349 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:33,226 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:33,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:33,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:33,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:33,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:33,226 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:33,226 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:33,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:33,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:33,227 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:33,227 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:33,227 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:33,227 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:33,227 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:33,227 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:33,227 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:33,227 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:33,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:33,229 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:33,229 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:33,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:33,230 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:33,230 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:33,304 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:33,305 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:33,305 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:33,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:33,305 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:33,305 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:33,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3191 [2022-12-06 07:35:33,305 INFO L420 AbstractCegarLoop]: === Iteration 3193 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:33,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:33,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1726574613, now seen corresponding path program 1 times [2022-12-06 07:35:33,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:33,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674334310] [2022-12-06 07:35:33,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:33,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35: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-06 07:35:33,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:33,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674334310] [2022-12-06 07:35:33,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674334310] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:33,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:33,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:33,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67825105] [2022-12-06 07:35:33,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:33,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:33,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:33,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:33,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:33,376 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:33,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:33,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:33,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:33,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:33,417 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:33,417 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:33,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:33,418 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:33,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:33,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:33,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:33,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:33,418 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:33,418 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:33,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:33,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:33,419 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:33,419 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:33,419 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:33,419 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:33,419 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:33,419 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:33,419 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:33,420 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:33,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:33,422 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:33,422 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:33,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:33,422 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:33,422 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:33,495 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:33,496 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:33,497 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:33,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:33,497 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:33,497 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:33,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3192 [2022-12-06 07:35:33,497 INFO L420 AbstractCegarLoop]: === Iteration 3194 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:33,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:33,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1696098420, now seen corresponding path program 1 times [2022-12-06 07:35:33,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:33,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744870216] [2022-12-06 07:35:33,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:33,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:33,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-06 07:35:33,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:33,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744870216] [2022-12-06 07:35:33,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744870216] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:33,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:33,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:33,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561349391] [2022-12-06 07:35:33,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:33,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:33,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:33,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:33,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:33,582 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:33,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:33,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:33,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:33,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:33,624 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:33,625 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:33,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:33,625 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:33,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:33,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:33,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:33,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:33,626 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:33,626 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:33,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:33,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:33,626 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:33,626 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:33,626 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:33,627 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:33,627 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:33,627 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:33,627 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:33,627 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:33,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:33,629 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:33,629 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:33,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:33,629 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:33,629 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:33,702 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:33,704 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:33,704 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:33,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:33,704 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:33,704 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:33,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3193 [2022-12-06 07:35:33,704 INFO L420 AbstractCegarLoop]: === Iteration 3195 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:33,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:33,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1669316311, now seen corresponding path program 1 times [2022-12-06 07:35:33,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:33,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668875196] [2022-12-06 07:35:33,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:33,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:33,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-06 07:35:33,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:33,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668875196] [2022-12-06 07:35:33,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668875196] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:33,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:33,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:33,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245759849] [2022-12-06 07:35:33,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:33,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:33,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:33,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:33,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:33,777 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:33,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:33,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:33,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:33,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:33,813 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:33,814 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:33,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:33,814 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:33,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:33,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:33,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:33,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:33,815 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:33,815 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:33,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:33,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:33,815 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:33,815 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:33,815 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:33,816 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:33,816 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:33,816 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:33,816 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:33,816 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:33,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:33,818 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:33,818 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:33,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:33,818 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:33,818 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:33,892 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:33,893 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:33,893 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:33,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:33,893 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:33,893 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:33,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3194 [2022-12-06 07:35:33,894 INFO L420 AbstractCegarLoop]: === Iteration 3196 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:33,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:33,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1638840118, now seen corresponding path program 1 times [2022-12-06 07:35:33,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:33,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627389567] [2022-12-06 07:35:33,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:33,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:33,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-06 07:35:33,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:33,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627389567] [2022-12-06 07:35:33,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627389567] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:33,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:33,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:33,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289638144] [2022-12-06 07:35:33,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:33,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:33,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:33,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:33,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:33,960 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:33,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:33,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:33,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:33,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:33,996 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:33,996 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:33,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:33,997 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:33,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:33,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:33,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:33,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:33,997 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:33,997 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:33,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:33,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:33,998 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:33,998 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:33,998 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:33,998 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:33,998 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:33,998 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:33,998 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:33,998 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:33,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:34,000 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:34,000 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:34,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:34,001 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:34,001 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:34,076 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:34,078 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:35:34,078 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:34,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:34,078 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:34,078 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:34,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3195 [2022-12-06 07:35:34,078 INFO L420 AbstractCegarLoop]: === Iteration 3197 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:34,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:34,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1612058009, now seen corresponding path program 1 times [2022-12-06 07:35:34,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:34,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902462283] [2022-12-06 07:35:34,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:34,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:34,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-06 07:35:34,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:34,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902462283] [2022-12-06 07:35:34,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902462283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:34,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:34,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:34,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601810244] [2022-12-06 07:35:34,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:34,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:34,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:34,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:34,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:34,147 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:34,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:34,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:34,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:34,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:34,183 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:34,183 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:34,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:34,184 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:34,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:34,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:34,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:34,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:34,184 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:34,184 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:34,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:34,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:34,185 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:34,185 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:34,185 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:34,185 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:34,185 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:34,185 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:34,185 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:34,185 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:34,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:34,188 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:34,188 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:34,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:34,188 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:34,188 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:34,262 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:34,263 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:34,263 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:34,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:34,263 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:34,263 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:34,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3196 [2022-12-06 07:35:34,263 INFO L420 AbstractCegarLoop]: === Iteration 3198 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:34,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:34,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1581581816, now seen corresponding path program 1 times [2022-12-06 07:35:34,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:34,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765145458] [2022-12-06 07:35:34,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:34,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:34,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-06 07:35:34,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:34,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765145458] [2022-12-06 07:35:34,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765145458] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:34,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:34,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:34,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733439907] [2022-12-06 07:35:34,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:34,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:34,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:34,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:34,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:34,331 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:34,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:34,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:34,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:34,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:34,373 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:34,373 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:34,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:34,373 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:34,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:34,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:34,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:34,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:34,374 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:34,374 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:34,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:34,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:34,375 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:34,375 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:34,375 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:34,375 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:34,375 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:34,375 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:34,375 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:34,375 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:34,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:34,377 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:34,377 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:34,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:34,378 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:34,378 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:34,452 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:34,453 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:34,453 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:34,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:34,453 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:34,453 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:34,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3197 [2022-12-06 07:35:34,454 INFO L420 AbstractCegarLoop]: === Iteration 3199 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:34,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:34,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1554799707, now seen corresponding path program 1 times [2022-12-06 07:35:34,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:34,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609377445] [2022-12-06 07:35:34,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:34,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:34,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-06 07:35:34,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:34,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609377445] [2022-12-06 07:35:34,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609377445] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:34,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:34,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:34,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269933746] [2022-12-06 07:35:34,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:34,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:34,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:34,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:34,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:34,525 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:34,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:34,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:34,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:34,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:34,566 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:34,566 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:34,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:34,567 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:34,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:34,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:34,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:34,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:34,567 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:34,567 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:34,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:34,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:34,568 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:34,568 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:34,568 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:34,568 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:34,568 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:34,568 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:34,568 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:34,568 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:34,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:34,570 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:34,570 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:34,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:34,571 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:34,571 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:34,645 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:34,646 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:34,646 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:34,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:34,647 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:34,647 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:34,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3198 [2022-12-06 07:35:34,647 INFO L420 AbstractCegarLoop]: === Iteration 3200 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:34,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:34,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1524323514, now seen corresponding path program 1 times [2022-12-06 07:35:34,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:34,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466076809] [2022-12-06 07:35:34,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:34,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:34,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-06 07:35:34,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:34,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466076809] [2022-12-06 07:35:34,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466076809] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:34,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:34,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:34,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23287769] [2022-12-06 07:35:34,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:34,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:34,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:34,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:34,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:34,714 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:34,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:34,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:34,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:34,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:34,768 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:34,768 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:34,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:34,768 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:34,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:34,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:34,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:34,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:34,779 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:34,779 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:34,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:34,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:34,780 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:34,780 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:34,780 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:34,780 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:34,780 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:34,780 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:34,780 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:34,780 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:34,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:34,784 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:34,784 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:34,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:34,784 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:34,784 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:34,862 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:34,863 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 07:35:34,863 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:34,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:34,864 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:34,864 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:34,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3199 [2022-12-06 07:35:34,864 INFO L420 AbstractCegarLoop]: === Iteration 3201 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:34,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:34,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1497541405, now seen corresponding path program 1 times [2022-12-06 07:35:34,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:34,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938597247] [2022-12-06 07:35:34,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:34,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:34,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-06 07:35:34,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:34,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938597247] [2022-12-06 07:35:34,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938597247] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:34,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:34,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:34,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569911806] [2022-12-06 07:35:34,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:34,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:34,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:34,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:34,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:34,933 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:34,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:34,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:34,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:34,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:34,968 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:34,968 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:34,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:34,968 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:34,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:34,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:34,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:34,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:34,969 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:34,969 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:34,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:34,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:34,969 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:34,969 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:34,970 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:34,970 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:34,970 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:34,970 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:34,970 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:34,970 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:34,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:34,972 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:34,972 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:34,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:34,973 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:34,973 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:35,046 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:35,048 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:35,048 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:35,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:35,048 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:35,048 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:35,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3200 [2022-12-06 07:35:35,048 INFO L420 AbstractCegarLoop]: === Iteration 3202 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:35,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:35,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1467065212, now seen corresponding path program 1 times [2022-12-06 07:35:35,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:35,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103924789] [2022-12-06 07:35:35,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:35,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:35,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:35,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:35,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103924789] [2022-12-06 07:35:35,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103924789] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:35,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:35,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:35,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392783434] [2022-12-06 07:35:35,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:35,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:35,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:35,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:35,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:35,118 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:35,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:35,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:35,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:35,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:35,153 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:35,153 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:35,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:35,153 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:35,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:35,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:35,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:35,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:35,154 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:35,154 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:35,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:35,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:35,154 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:35,154 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:35,155 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:35,155 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:35,155 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:35,155 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:35,155 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:35,155 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:35,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:35,157 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:35,157 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:35,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 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 116. Up to 16 conditions per place. [2022-12-06 07:35:35,157 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:35,158 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:35,232 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:35,233 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:35,233 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:35,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:35,233 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:35,233 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:35,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3201 [2022-12-06 07:35:35,233 INFO L420 AbstractCegarLoop]: === Iteration 3203 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:35,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:35,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1440283103, now seen corresponding path program 1 times [2022-12-06 07:35:35,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:35,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232434541] [2022-12-06 07:35:35,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:35,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:35,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-06 07:35:35,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:35,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232434541] [2022-12-06 07:35:35,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232434541] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:35,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:35,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:35,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592850774] [2022-12-06 07:35:35,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:35,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:35,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:35,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:35,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:35,303 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:35,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:35,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:35,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:35,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:35,343 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:35,344 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:35,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:35,344 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:35,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:35,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:35,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:35,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:35,345 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:35,345 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:35,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:35,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:35,345 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:35,345 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:35,345 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:35,345 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:35,346 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:35,346 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:35,346 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:35,346 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:35,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:35,348 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:35,348 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:35,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:35,348 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:35,348 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:35,422 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:35,423 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:35,423 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:35,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:35,424 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:35,424 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:35,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3202 [2022-12-06 07:35:35,424 INFO L420 AbstractCegarLoop]: === Iteration 3204 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:35,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:35,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1409806910, now seen corresponding path program 1 times [2022-12-06 07:35:35,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:35,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356845787] [2022-12-06 07:35:35,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:35,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:35,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-06 07:35:35,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:35,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356845787] [2022-12-06 07:35:35,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356845787] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:35,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:35,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:35,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094115474] [2022-12-06 07:35:35,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:35,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:35,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:35,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:35,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:35,490 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:35,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:35,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:35,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:35,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:35,531 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:35,531 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:35,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:35,532 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:35,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:35,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:35,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:35,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:35,532 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:35,532 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:35,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:35,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:35,533 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:35,533 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:35,533 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:35,533 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:35,533 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:35,534 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:35,534 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:35,534 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:35,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:35,536 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:35,536 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:35,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:35,536 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:35,536 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:35,610 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:35,612 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:35,612 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:35,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:35,612 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:35,612 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:35,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3203 [2022-12-06 07:35:35,612 INFO L420 AbstractCegarLoop]: === Iteration 3205 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:35,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:35,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1383024801, now seen corresponding path program 1 times [2022-12-06 07:35:35,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:35,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117457844] [2022-12-06 07:35:35,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:35,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:35,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-06 07:35:35,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:35,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117457844] [2022-12-06 07:35:35,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117457844] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:35,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:35,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:35,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406826517] [2022-12-06 07:35:35,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:35,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:35,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:35,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:35,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:35,681 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:35,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:35,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:35,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:35,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:35,721 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:35,722 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:35,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:35,722 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:35,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:35,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:35,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:35,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:35,722 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:35,723 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:35,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:35,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:35,723 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:35,723 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:35,723 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:35,723 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:35,723 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:35,724 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:35,724 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:35,724 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:35,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:35,726 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:35,726 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:35,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:35,726 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:35,726 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:35,801 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:35,802 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:35,802 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:35,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:35,802 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:35,802 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:35,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3204 [2022-12-06 07:35:35,802 INFO L420 AbstractCegarLoop]: === Iteration 3206 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:35,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:35,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1352548608, now seen corresponding path program 1 times [2022-12-06 07:35:35,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:35,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676664799] [2022-12-06 07:35:35,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:35,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:35,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:35,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-06 07:35:35,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:35,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676664799] [2022-12-06 07:35:35,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676664799] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:35,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:35,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:35,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669544032] [2022-12-06 07:35:35,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:35,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:35,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:35,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:35,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:35,873 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:35,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:35,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:35,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:35,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:35,916 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:35,916 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:35,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:35,916 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:35,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:35,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:35,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:35,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:35,917 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:35,917 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:35,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:35,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:35,918 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:35,918 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:35,918 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:35,918 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:35,918 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:35,918 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:35,918 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:35,918 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:35,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:35,920 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:35,920 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:35,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:35,921 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:35,921 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:35,996 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:35,997 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:35,997 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:35,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:35,997 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:35,997 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:35,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3205 [2022-12-06 07:35:35,998 INFO L420 AbstractCegarLoop]: === Iteration 3207 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:35,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:35,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1325766499, now seen corresponding path program 1 times [2022-12-06 07:35:35,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:35,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578172179] [2022-12-06 07:35:35,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:35,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:36,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-06 07:35:36,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:36,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578172179] [2022-12-06 07:35:36,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578172179] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:36,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:36,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:36,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056394906] [2022-12-06 07:35:36,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:36,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:36,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:36,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:36,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:36,100 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:36,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:36,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:36,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:36,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:36,141 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:36,142 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:36,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:36,142 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:36,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:36,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:36,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:36,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:36,143 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:36,143 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:36,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:36,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:36,143 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:36,143 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:36,143 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:36,143 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:36,144 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:36,144 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:36,144 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:36,144 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:36,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:36,146 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:36,146 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:36,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:36,146 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:36,146 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:36,220 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:36,221 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:36,222 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:36,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:36,222 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:36,222 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:36,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3206 [2022-12-06 07:35:36,222 INFO L420 AbstractCegarLoop]: === Iteration 3208 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:36,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:36,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1295290306, now seen corresponding path program 1 times [2022-12-06 07:35:36,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:36,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484083607] [2022-12-06 07:35:36,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:36,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:36,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-06 07:35:36,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:36,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484083607] [2022-12-06 07:35:36,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484083607] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:36,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:36,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:36,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104861416] [2022-12-06 07:35:36,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:36,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:36,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:36,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:36,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:36,292 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:36,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:36,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:36,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:36,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:36,333 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:36,333 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:36,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:36,334 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:36,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:36,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:36,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:36,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:36,334 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:36,334 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:36,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:36,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:36,335 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:36,335 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:36,335 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:36,335 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:36,335 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:36,335 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:36,335 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:36,335 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:36,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:36,337 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:36,338 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:36,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:36,338 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:36,338 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:36,413 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:36,414 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:36,414 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:36,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:36,414 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:36,414 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:36,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3207 [2022-12-06 07:35:36,414 INFO L420 AbstractCegarLoop]: === Iteration 3209 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:36,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:36,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1268508197, now seen corresponding path program 1 times [2022-12-06 07:35:36,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:36,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831812141] [2022-12-06 07:35:36,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:36,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:36,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-06 07:35:36,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:36,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831812141] [2022-12-06 07:35:36,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831812141] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:36,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:36,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:36,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378776208] [2022-12-06 07:35:36,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:36,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:36,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:36,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:36,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:36,484 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:36,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:36,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:36,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:36,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:36,525 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:36,526 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:36,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:36,526 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:36,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:36,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:36,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:36,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:36,527 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:36,527 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:36,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:36,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:36,527 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:36,527 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:36,527 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:36,528 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:36,528 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:36,528 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:36,528 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:36,528 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:36,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:36,530 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:36,530 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:36,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:36,530 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:36,530 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:36,604 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:36,605 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:36,606 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:36,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:36,606 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:36,606 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:36,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3208 [2022-12-06 07:35:36,606 INFO L420 AbstractCegarLoop]: === Iteration 3210 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:36,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:36,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1238032004, now seen corresponding path program 1 times [2022-12-06 07:35:36,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:36,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758148779] [2022-12-06 07:35:36,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:36,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:36,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:36,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-06 07:35:36,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:36,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758148779] [2022-12-06 07:35:36,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758148779] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:36,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:36,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:36,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143386713] [2022-12-06 07:35:36,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:36,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:36,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:36,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:36,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:36,674 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:36,674 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:36,674 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:36,674 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:36,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:36,710 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:36,710 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:36,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:36,711 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:36,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:36,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:36,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:36,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:36,711 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:36,711 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:36,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:36,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:36,712 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:36,712 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:36,712 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:36,712 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:36,712 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:36,712 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:36,712 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:36,712 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:36,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:36,714 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:36,714 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:36,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:36,715 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:36,715 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:36,790 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:36,791 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:36,791 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:36,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:36,791 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:36,791 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:36,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3209 [2022-12-06 07:35:36,791 INFO L420 AbstractCegarLoop]: === Iteration 3211 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:36,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:36,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1211249895, now seen corresponding path program 1 times [2022-12-06 07:35:36,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:36,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53475040] [2022-12-06 07:35:36,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:36,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:36,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:36,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:36,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53475040] [2022-12-06 07:35:36,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53475040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:36,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:36,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:36,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679866755] [2022-12-06 07:35:36,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:36,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:36,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:36,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:36,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:36,862 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:36,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:36,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:36,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:36,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:36,898 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:36,898 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:36,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:36,898 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:36,898 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:36,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:36,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:36,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:36,899 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:36,899 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:36,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:36,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:36,900 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:36,900 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:36,900 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:36,900 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:36,900 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:36,900 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:36,900 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:36,900 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:36,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:36,902 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:36,902 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:36,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:36,903 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:36,903 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:36,978 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:36,979 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:36,979 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:36,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:36,979 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:36,979 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:36,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3210 [2022-12-06 07:35:36,980 INFO L420 AbstractCegarLoop]: === Iteration 3212 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:36,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:36,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1180773702, now seen corresponding path program 1 times [2022-12-06 07:35:36,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:36,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876943996] [2022-12-06 07:35:36,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:36,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:37,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-06 07:35:37,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:37,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876943996] [2022-12-06 07:35:37,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876943996] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:37,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:37,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:37,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969860111] [2022-12-06 07:35:37,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:37,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:37,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:37,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:37,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:37,048 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:37,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:37,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:37,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:37,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:37,090 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:37,090 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:37,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:37,090 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:37,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:37,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:37,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:37,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:37,091 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:37,091 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:37,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:37,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:37,091 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:37,092 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:37,092 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:37,092 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:37,092 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:37,092 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:37,092 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:37,092 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:37,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:37,094 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:37,094 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:37,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:37,094 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:37,095 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:37,170 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:37,171 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:37,171 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:37,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:37,171 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:37,171 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:37,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3211 [2022-12-06 07:35:37,172 INFO L420 AbstractCegarLoop]: === Iteration 3213 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:37,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:37,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1153991593, now seen corresponding path program 1 times [2022-12-06 07:35:37,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:37,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405645424] [2022-12-06 07:35:37,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:37,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35: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-06 07:35:37,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:37,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405645424] [2022-12-06 07:35:37,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405645424] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:37,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:37,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:37,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826194678] [2022-12-06 07:35:37,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:37,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:37,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:37,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:37,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:37,262 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:37,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:37,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:37,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:37,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:37,298 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:37,298 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:37,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:37,299 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:37,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:37,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:37,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:37,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:37,299 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:37,299 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:37,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:37,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:37,300 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:37,300 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:37,300 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:37,300 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:37,300 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:37,300 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:37,300 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:37,300 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:37,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:37,302 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:37,303 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:37,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:37,303 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:37,303 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:37,376 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:37,377 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:37,377 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:37,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:37,377 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:37,377 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:37,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3212 [2022-12-06 07:35:37,377 INFO L420 AbstractCegarLoop]: === Iteration 3214 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:37,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:37,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1123515400, now seen corresponding path program 1 times [2022-12-06 07:35:37,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:37,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4544651] [2022-12-06 07:35:37,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:37,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:37,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-06 07:35:37,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:37,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4544651] [2022-12-06 07:35:37,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4544651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:37,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:37,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:37,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030975797] [2022-12-06 07:35:37,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:37,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:37,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:37,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:37,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:37,446 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:37,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:37,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:37,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:37,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:37,483 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:37,483 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:37,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:37,483 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:37,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:37,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:37,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:37,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:37,484 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:37,484 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:37,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:37,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:37,485 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:37,485 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:37,485 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:37,485 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:37,485 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:37,485 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:37,485 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:37,485 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:37,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:37,487 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:37,488 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:37,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:37,488 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:37,488 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:37,563 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:37,565 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:35:37,565 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:37,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:37,565 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:37,565 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:37,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3213 [2022-12-06 07:35:37,565 INFO L420 AbstractCegarLoop]: === Iteration 3215 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:37,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:37,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1096733291, now seen corresponding path program 1 times [2022-12-06 07:35:37,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:37,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210819027] [2022-12-06 07:35:37,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:37,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:37,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-06 07:35:37,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:37,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210819027] [2022-12-06 07:35:37,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210819027] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:37,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:37,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:37,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931539098] [2022-12-06 07:35:37,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:37,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:37,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:37,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:37,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:37,637 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:37,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:37,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:37,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:37,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:37,671 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:37,671 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:37,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:37,671 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:37,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:37,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:37,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:37,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:37,672 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:37,672 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:37,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:37,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:37,672 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:37,672 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:37,673 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:37,673 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:37,673 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:37,673 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:37,673 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:37,673 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:37,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:37,675 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:37,675 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:37,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:37,675 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:37,675 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:37,749 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:37,751 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:37,751 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:37,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:37,751 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:37,751 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:37,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3214 [2022-12-06 07:35:37,751 INFO L420 AbstractCegarLoop]: === Iteration 3216 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:37,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:37,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1066257098, now seen corresponding path program 1 times [2022-12-06 07:35:37,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:37,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228615279] [2022-12-06 07:35:37,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:37,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:37,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-06 07:35:37,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:37,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228615279] [2022-12-06 07:35:37,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228615279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:37,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:37,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:37,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034082321] [2022-12-06 07:35:37,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:37,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:37,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:37,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:37,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:37,819 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:37,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:37,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:37,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:37,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:37,861 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:37,861 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:37,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:37,862 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:37,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:37,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:37,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:37,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:37,862 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:37,862 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:37,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:37,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:37,863 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:37,863 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:37,863 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:37,863 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:37,863 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:37,863 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:37,863 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:37,864 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:37,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:37,866 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:37,866 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:37,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:37,866 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:37,866 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:37,940 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:37,941 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:37,941 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:37,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:37,941 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:37,941 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:37,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3215 [2022-12-06 07:35:37,941 INFO L420 AbstractCegarLoop]: === Iteration 3217 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:37,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:37,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1039474989, now seen corresponding path program 1 times [2022-12-06 07:35:37,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:37,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064968320] [2022-12-06 07:35:37,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:37,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:38,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-06 07:35:38,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:38,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064968320] [2022-12-06 07:35:38,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064968320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:38,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:38,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:38,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354029964] [2022-12-06 07:35:38,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:38,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:38,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:38,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:38,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:38,013 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:38,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:38,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:38,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:38,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:38,049 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:38,049 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:38,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:38,049 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:38,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:38,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:38,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:38,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:38,050 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:38,050 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:38,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:38,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:38,051 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:38,051 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:38,051 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:38,051 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:38,051 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:38,051 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:38,051 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:38,051 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:38,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:38,053 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:38,053 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:38,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:38,054 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:38,054 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:38,129 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:38,130 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:38,130 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:38,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:38,130 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:38,130 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:38,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3216 [2022-12-06 07:35:38,130 INFO L420 AbstractCegarLoop]: === Iteration 3218 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:38,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:38,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1008998796, now seen corresponding path program 1 times [2022-12-06 07:35:38,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:38,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163135958] [2022-12-06 07:35:38,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:38,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:38,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-06 07:35:38,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:38,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163135958] [2022-12-06 07:35:38,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163135958] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:38,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:38,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:38,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92046785] [2022-12-06 07:35:38,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:38,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:38,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:38,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:38,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:38,198 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:38,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:38,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:38,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:38,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:38,235 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:38,235 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:38,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:38,235 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:38,236 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:38,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:38,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:38,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:38,236 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:38,236 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:38,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:38,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:38,237 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:38,237 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:38,237 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:38,237 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:38,237 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:38,237 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:38,237 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:38,237 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:38,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:38,239 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:38,239 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:38,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:38,240 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:38,240 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:38,314 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:38,315 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:38,315 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:38,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:38,315 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:38,315 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:38,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3217 [2022-12-06 07:35:38,315 INFO L420 AbstractCegarLoop]: === Iteration 3219 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:38,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:38,315 INFO L85 PathProgramCache]: Analyzing trace with hash -982216687, now seen corresponding path program 1 times [2022-12-06 07:35:38,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:38,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905016060] [2022-12-06 07:35:38,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:38,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:38,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-06 07:35:38,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:38,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905016060] [2022-12-06 07:35:38,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905016060] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:38,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:38,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:38,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188904386] [2022-12-06 07:35:38,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:38,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:38,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:38,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:38,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:38,385 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:38,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:38,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:38,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:38,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:38,424 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:38,425 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:38,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:38,425 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:38,425 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:38,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:38,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:38,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:38,425 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:38,426 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:38,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:38,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:38,426 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:38,426 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:38,426 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:38,426 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:38,427 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:38,427 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:38,427 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:38,427 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:38,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:38,429 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:38,429 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:38,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:38,429 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:38,429 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:38,504 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:38,505 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:38,505 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:38,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:38,505 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:38,505 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:38,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3218 [2022-12-06 07:35:38,505 INFO L420 AbstractCegarLoop]: === Iteration 3220 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:38,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:38,505 INFO L85 PathProgramCache]: Analyzing trace with hash -951740494, now seen corresponding path program 1 times [2022-12-06 07:35:38,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:38,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237014689] [2022-12-06 07:35:38,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:38,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:38,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:38,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-06 07:35:38,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:38,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237014689] [2022-12-06 07:35:38,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237014689] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:38,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:38,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:38,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324789951] [2022-12-06 07:35:38,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:38,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:38,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:38,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:38,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:38,582 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:38,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:38,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:38,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:38,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:38,624 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:38,624 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:38,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:38,624 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:38,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:38,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:38,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:38,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:38,625 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:38,625 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:38,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:38,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:38,625 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:38,625 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:38,626 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:38,626 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:38,626 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:38,626 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:38,626 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:38,626 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:38,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:38,628 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:38,628 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:38,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:38,628 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:38,629 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:38,703 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:38,704 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:38,704 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:38,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:38,704 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:38,705 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:38,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3219 [2022-12-06 07:35:38,705 INFO L420 AbstractCegarLoop]: === Iteration 3221 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:38,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:38,705 INFO L85 PathProgramCache]: Analyzing trace with hash -924958385, now seen corresponding path program 1 times [2022-12-06 07:35:38,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:38,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631808160] [2022-12-06 07:35:38,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:38,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:38,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-06 07:35:38,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:38,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631808160] [2022-12-06 07:35:38,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631808160] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:38,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:38,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:38,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324441600] [2022-12-06 07:35:38,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:38,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:38,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:38,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:38,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:38,777 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:38,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:38,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:38,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:38,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:38,818 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:38,818 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:38,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:38,818 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:38,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:38,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:38,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:38,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:38,819 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:38,819 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:38,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:38,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:38,820 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:38,820 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:38,820 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:38,820 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:38,820 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:38,820 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:38,820 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:38,820 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:38,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:38,822 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:38,822 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:38,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:38,823 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:38,823 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:38,898 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:38,899 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:38,899 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:38,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:38,899 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:38,899 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:38,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3220 [2022-12-06 07:35:38,899 INFO L420 AbstractCegarLoop]: === Iteration 3222 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:38,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:38,899 INFO L85 PathProgramCache]: Analyzing trace with hash -894482192, now seen corresponding path program 1 times [2022-12-06 07:35:38,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:38,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556349879] [2022-12-06 07:35:38,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:38,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:38,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-06 07:35:38,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:38,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556349879] [2022-12-06 07:35:38,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556349879] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:38,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:38,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:38,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840897649] [2022-12-06 07:35:38,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:38,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:38,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:38,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:38,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:38,968 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:38,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:38,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:38,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:38,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:39,004 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:39,004 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:39,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:39,005 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:39,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:39,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:39,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:39,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:39,005 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:39,005 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:39,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:39,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:39,006 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:39,006 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:39,006 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:39,006 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:39,006 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:39,006 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:39,006 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:39,006 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:39,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:39,009 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:39,009 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:39,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:39,009 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:39,009 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:39,083 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:39,084 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:39,084 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:39,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:39,084 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:39,085 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:39,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3221 [2022-12-06 07:35:39,085 INFO L420 AbstractCegarLoop]: === Iteration 3223 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:39,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:39,085 INFO L85 PathProgramCache]: Analyzing trace with hash -867700083, now seen corresponding path program 1 times [2022-12-06 07:35:39,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:39,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250848325] [2022-12-06 07:35:39,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:39,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:39,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-06 07:35:39,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:39,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250848325] [2022-12-06 07:35:39,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250848325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:39,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:39,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:39,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575938140] [2022-12-06 07:35:39,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:39,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:39,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:39,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:39,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:39,155 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:39,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:39,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:39,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:39,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:39,196 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:39,196 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:39,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:39,197 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:39,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:39,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:39,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:39,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:39,197 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:39,197 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:39,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:39,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:39,198 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:39,198 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:39,198 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:39,198 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:39,198 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:39,198 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:39,198 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:39,198 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:39,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:39,201 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:39,201 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:39,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:39,201 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:39,201 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:39,275 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:39,277 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:39,277 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:39,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:39,277 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:39,277 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:39,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3222 [2022-12-06 07:35:39,277 INFO L420 AbstractCegarLoop]: === Iteration 3224 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:39,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:39,277 INFO L85 PathProgramCache]: Analyzing trace with hash -837223890, now seen corresponding path program 1 times [2022-12-06 07:35:39,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:39,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883340185] [2022-12-06 07:35:39,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:39,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:39,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:39,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:39,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883340185] [2022-12-06 07:35:39,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883340185] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:39,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:39,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:39,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132356087] [2022-12-06 07:35:39,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:39,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:39,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:39,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:39,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:39,348 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:39,348 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:39,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:39,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:39,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:39,389 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:39,389 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:39,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:39,390 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:39,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:39,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:39,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:39,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:39,390 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:39,390 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:39,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:39,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:39,391 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:39,391 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:39,391 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:39,391 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:39,391 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:39,391 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:39,391 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:39,391 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:39,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:39,394 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:39,394 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:39,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 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 116. Up to 16 conditions per place. [2022-12-06 07:35:39,394 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:39,394 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:39,467 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:39,469 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:39,469 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:39,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:39,469 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:39,469 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:39,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3223 [2022-12-06 07:35:39,469 INFO L420 AbstractCegarLoop]: === Iteration 3225 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:39,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:39,469 INFO L85 PathProgramCache]: Analyzing trace with hash -810441781, now seen corresponding path program 1 times [2022-12-06 07:35:39,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:39,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265675172] [2022-12-06 07:35:39,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:39,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:39,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-06 07:35:39,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:39,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265675172] [2022-12-06 07:35:39,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265675172] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:39,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:39,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:39,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851042874] [2022-12-06 07:35:39,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:39,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:39,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:39,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:39,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:39,539 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:39,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:39,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:39,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:39,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:39,575 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:39,575 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:39,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:39,575 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:39,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:39,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:39,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:39,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:39,576 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:39,576 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:39,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:39,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:39,577 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:39,577 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:39,577 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:39,577 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:39,577 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:39,577 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:39,577 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:39,577 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:39,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:39,579 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:39,579 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:39,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:39,580 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:39,580 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:39,653 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:39,654 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:39,654 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:39,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:39,654 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:39,654 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:39,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3224 [2022-12-06 07:35:39,654 INFO L420 AbstractCegarLoop]: === Iteration 3226 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:39,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:39,654 INFO L85 PathProgramCache]: Analyzing trace with hash -779965588, now seen corresponding path program 1 times [2022-12-06 07:35:39,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:39,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296191006] [2022-12-06 07:35:39,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:39,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:39,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-06 07:35:39,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:39,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296191006] [2022-12-06 07:35:39,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296191006] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:39,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:39,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:39,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402137758] [2022-12-06 07:35:39,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:39,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:39,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:39,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:39,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:39,738 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:39,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:39,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:39,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:39,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:39,780 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:39,780 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:39,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:39,781 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:39,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:39,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:39,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:39,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:39,781 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:39,781 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:39,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:39,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:39,782 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:39,782 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:39,782 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:39,782 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:39,782 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:39,782 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:39,783 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:39,783 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:39,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:39,785 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:39,785 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:39,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:39,785 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:39,785 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:39,860 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:39,861 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:39,861 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:39,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:39,861 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:39,861 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:39,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3225 [2022-12-06 07:35:39,862 INFO L420 AbstractCegarLoop]: === Iteration 3227 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:39,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:39,862 INFO L85 PathProgramCache]: Analyzing trace with hash -753183479, now seen corresponding path program 1 times [2022-12-06 07:35:39,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:39,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200215718] [2022-12-06 07:35:39,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:39,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:39,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-06 07:35:39,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:39,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200215718] [2022-12-06 07:35:39,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200215718] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:39,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:39,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:39,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925314283] [2022-12-06 07:35:39,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:39,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:39,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:39,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:39,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:39,933 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:39,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:39,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:39,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:39,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:39,976 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:39,976 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:39,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:39,977 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:39,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:39,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:39,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:39,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:39,977 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:39,977 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:39,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:39,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:39,978 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:39,978 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:39,978 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:39,978 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:39,978 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:39,978 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:39,978 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:39,978 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:39,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:39,980 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:39,981 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:39,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:39,981 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:39,981 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:40,055 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:40,056 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:40,056 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:40,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:40,056 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:40,056 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:40,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3226 [2022-12-06 07:35:40,056 INFO L420 AbstractCegarLoop]: === Iteration 3228 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:40,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:40,056 INFO L85 PathProgramCache]: Analyzing trace with hash -722707286, now seen corresponding path program 1 times [2022-12-06 07:35:40,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:40,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794164747] [2022-12-06 07:35:40,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:40,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:40,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-06 07:35:40,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:40,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794164747] [2022-12-06 07:35:40,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794164747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:40,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:40,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:40,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514418497] [2022-12-06 07:35:40,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:40,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:40,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:40,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:40,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:40,127 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:40,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:40,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:40,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:40,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:40,162 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:40,162 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:40,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:40,162 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:40,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:40,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:40,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:40,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:40,163 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:40,163 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:40,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:40,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:40,164 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:40,164 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:40,164 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:40,164 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:40,164 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:40,164 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:40,164 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:40,164 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:40,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:40,166 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:40,166 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:40,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:40,167 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:40,167 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:40,242 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:40,243 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:40,244 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:40,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:40,244 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:40,244 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:40,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3227 [2022-12-06 07:35:40,244 INFO L420 AbstractCegarLoop]: === Iteration 3229 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:40,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:40,244 INFO L85 PathProgramCache]: Analyzing trace with hash -695925177, now seen corresponding path program 1 times [2022-12-06 07:35:40,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:40,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580459743] [2022-12-06 07:35:40,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:40,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:40,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-06 07:35:40,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:40,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580459743] [2022-12-06 07:35:40,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580459743] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:40,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:40,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:40,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479801485] [2022-12-06 07:35:40,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:40,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:40,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:40,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:40,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:40,318 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:40,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:40,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:40,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:40,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:40,353 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:40,353 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:40,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 373 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:40,354 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:40,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:40,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:40,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:40,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:40,354 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:40,354 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:40,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:40,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:40,355 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:40,355 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:40,355 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:40,355 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:40,355 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:40,356 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:40,356 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:40,356 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:40,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:40,358 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:40,358 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:40,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:40,358 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:40,358 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:40,432 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:40,433 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:40,434 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:40,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:40,434 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:40,434 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:40,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3228 [2022-12-06 07:35:40,434 INFO L420 AbstractCegarLoop]: === Iteration 3230 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:40,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:40,434 INFO L85 PathProgramCache]: Analyzing trace with hash -665448984, now seen corresponding path program 1 times [2022-12-06 07:35:40,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:40,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511416465] [2022-12-06 07:35:40,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:40,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:40,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-06 07:35:40,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:40,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511416465] [2022-12-06 07:35:40,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511416465] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:40,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:40,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:40,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293621174] [2022-12-06 07:35:40,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:40,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:40,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:40,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:40,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:40,502 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:40,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:40,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:40,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:40,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:40,538 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:40,538 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:40,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:40,539 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:40,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:40,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:40,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:40,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:40,539 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:40,539 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:40,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:40,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:40,540 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:40,540 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:40,540 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:40,540 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:40,540 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:40,540 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:40,540 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:40,541 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:40,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:40,543 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:40,543 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:40,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:40,543 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:40,543 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:40,615 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:40,616 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:35:40,616 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:40,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:40,617 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:40,617 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:40,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3229 [2022-12-06 07:35:40,617 INFO L420 AbstractCegarLoop]: === Iteration 3231 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:40,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:40,617 INFO L85 PathProgramCache]: Analyzing trace with hash -638666875, now seen corresponding path program 1 times [2022-12-06 07:35:40,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:40,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822338551] [2022-12-06 07:35:40,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:40,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:40,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:40,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-06 07:35:40,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:40,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822338551] [2022-12-06 07:35:40,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822338551] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:40,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:40,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:40,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964577192] [2022-12-06 07:35:40,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:40,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:40,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:40,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:40,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:40,688 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:40,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:40,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:40,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:40,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:40,723 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:40,723 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:40,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:40,724 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:40,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:40,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:40,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:40,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:40,724 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:40,725 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:40,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:40,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:40,725 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:40,725 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:40,725 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:40,725 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:40,725 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:40,726 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:40,726 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:40,726 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:40,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:40,728 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:40,728 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:40,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:40,728 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:40,728 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:40,802 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:40,803 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:40,803 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:40,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:40,803 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:40,803 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:40,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3230 [2022-12-06 07:35:40,804 INFO L420 AbstractCegarLoop]: === Iteration 3232 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:40,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:40,804 INFO L85 PathProgramCache]: Analyzing trace with hash -608190682, now seen corresponding path program 1 times [2022-12-06 07:35:40,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:40,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975075282] [2022-12-06 07:35:40,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:40,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:40,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-06 07:35:40,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:40,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975075282] [2022-12-06 07:35:40,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975075282] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:40,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:40,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:40,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614184468] [2022-12-06 07:35:40,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:40,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:40,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:40,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:40,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:40,871 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:40,871 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:40,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:40,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:40,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:40,927 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:40,927 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:40,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:40,928 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:40,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:40,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:40,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:40,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:40,928 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:40,928 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:40,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:40,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:40,929 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:40,929 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:40,929 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:40,929 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:40,929 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:40,929 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:40,929 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:40,929 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:40,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:40,932 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:40,932 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:40,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:40,932 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:40,932 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:41,008 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:41,009 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:35:41,009 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:41,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:41,009 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:41,009 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:41,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3231 [2022-12-06 07:35:41,010 INFO L420 AbstractCegarLoop]: === Iteration 3233 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:41,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:41,010 INFO L85 PathProgramCache]: Analyzing trace with hash -581408573, now seen corresponding path program 1 times [2022-12-06 07:35:41,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:41,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854893213] [2022-12-06 07:35:41,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:41,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:41,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-06 07:35:41,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:41,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854893213] [2022-12-06 07:35:41,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854893213] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:41,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:41,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:41,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889179426] [2022-12-06 07:35:41,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:41,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:41,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:41,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:41,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:41,082 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:41,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:41,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:41,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:41,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:41,118 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:41,118 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:41,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:41,119 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:41,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:41,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:41,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:41,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:41,119 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:41,119 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:41,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:41,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:41,120 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:41,120 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:41,120 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:41,120 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:41,120 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:41,120 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:41,120 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:41,120 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:41,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:41,123 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:41,123 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:41,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:41,123 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:41,123 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:41,197 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:41,199 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:41,199 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:41,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:41,199 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:41,199 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:41,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3232 [2022-12-06 07:35:41,199 INFO L420 AbstractCegarLoop]: === Iteration 3234 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:41,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:41,199 INFO L85 PathProgramCache]: Analyzing trace with hash -550932380, now seen corresponding path program 1 times [2022-12-06 07:35:41,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:41,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063359648] [2022-12-06 07:35:41,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:41,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:41,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-06 07:35:41,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:41,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063359648] [2022-12-06 07:35:41,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063359648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:41,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:41,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:41,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126805596] [2022-12-06 07:35:41,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:41,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:41,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:41,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:41,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:41,269 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:41,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:41,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:41,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:41,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:41,312 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:41,312 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:41,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:41,312 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:41,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:41,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:41,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:41,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:41,313 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:41,313 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:41,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:41,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:41,314 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:41,314 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:41,314 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:41,314 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:41,314 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:41,314 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:41,314 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:41,314 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:41,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:41,316 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:41,316 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:41,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:41,317 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:41,317 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:41,392 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:41,393 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:41,394 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:41,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:41,394 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:41,394 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:41,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3233 [2022-12-06 07:35:41,394 INFO L420 AbstractCegarLoop]: === Iteration 3235 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:41,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:41,394 INFO L85 PathProgramCache]: Analyzing trace with hash -524150271, now seen corresponding path program 1 times [2022-12-06 07:35:41,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:41,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312544393] [2022-12-06 07:35:41,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:41,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:41,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-06 07:35:41,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:41,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312544393] [2022-12-06 07:35:41,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312544393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:41,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:41,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:41,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988965490] [2022-12-06 07:35:41,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:41,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:41,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:41,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:41,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:41,466 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:41,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:41,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:41,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:41,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:41,502 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:41,502 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:41,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:41,502 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:41,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:41,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:41,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:41,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:41,503 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:41,503 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:41,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:41,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:41,504 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:41,504 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:41,504 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:41,504 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:41,504 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:41,504 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:41,504 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:41,504 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:41,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:41,506 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:41,506 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:41,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 146 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:41,507 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:41,507 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:41,579 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:41,581 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:41,581 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:41,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:41,581 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:41,581 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:41,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3234 [2022-12-06 07:35:41,581 INFO L420 AbstractCegarLoop]: === Iteration 3236 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:41,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:41,581 INFO L85 PathProgramCache]: Analyzing trace with hash -493674078, now seen corresponding path program 1 times [2022-12-06 07:35:41,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:41,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289598521] [2022-12-06 07:35:41,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:41,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:41,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:41,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:41,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289598521] [2022-12-06 07:35:41,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289598521] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:41,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:41,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:41,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371761611] [2022-12-06 07:35:41,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:41,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:41,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:41,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:41,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:41,651 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:41,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:41,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:41,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:41,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:41,687 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:41,687 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:41,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:41,688 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:41,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:41,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:41,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:41,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:41,688 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:41,688 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:41,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:41,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:41,689 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:41,689 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:41,689 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:41,689 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:41,689 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:41,689 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:41,689 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:41,689 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:41,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:41,691 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:41,692 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:41,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:41,692 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:41,692 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:41,768 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:41,769 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:35:41,769 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:41,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:41,769 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:41,769 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:41,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3235 [2022-12-06 07:35:41,770 INFO L420 AbstractCegarLoop]: === Iteration 3237 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:41,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:41,770 INFO L85 PathProgramCache]: Analyzing trace with hash -466891969, now seen corresponding path program 1 times [2022-12-06 07:35:41,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:41,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224619609] [2022-12-06 07:35:41,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:41,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:41,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-06 07:35:41,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:41,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224619609] [2022-12-06 07:35:41,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224619609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:41,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:41,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:41,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276029] [2022-12-06 07:35:41,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:41,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:41,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:41,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:41,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:41,839 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:41,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:41,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:41,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:41,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:41,880 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:41,881 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:41,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:41,881 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:41,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:41,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:41,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:41,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:41,882 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:41,882 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:41,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:41,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:41,882 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:41,882 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:41,882 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:41,883 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:41,883 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:41,883 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:41,883 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:41,883 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:41,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:41,885 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:41,885 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:41,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:41,885 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:41,885 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:41,968 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:41,970 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 07:35:41,970 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:41,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:41,970 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:41,970 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:41,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3236 [2022-12-06 07:35:41,970 INFO L420 AbstractCegarLoop]: === Iteration 3238 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:41,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:41,970 INFO L85 PathProgramCache]: Analyzing trace with hash -436415776, now seen corresponding path program 1 times [2022-12-06 07:35:41,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:41,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139205193] [2022-12-06 07:35:41,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:41,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:42,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-06 07:35:42,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:42,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139205193] [2022-12-06 07:35:42,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139205193] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:42,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:42,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:42,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108902475] [2022-12-06 07:35:42,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:42,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:42,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:42,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:42,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:42,040 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:42,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:42,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:42,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:42,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:42,081 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:42,081 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:42,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:42,082 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:42,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:42,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:42,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:42,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:42,082 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:42,082 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:42,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:42,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:42,083 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:42,083 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:42,083 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:42,083 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:42,083 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:42,083 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:42,083 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:42,084 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:42,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:42,086 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:42,086 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:42,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:42,086 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:42,086 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:42,162 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:42,164 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:35:42,164 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:42,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:42,164 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:42,164 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:42,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3237 [2022-12-06 07:35:42,164 INFO L420 AbstractCegarLoop]: === Iteration 3239 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:42,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:42,164 INFO L85 PathProgramCache]: Analyzing trace with hash -409633667, now seen corresponding path program 1 times [2022-12-06 07:35:42,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:42,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465616822] [2022-12-06 07:35:42,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:42,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:42,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-06 07:35:42,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:42,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465616822] [2022-12-06 07:35:42,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465616822] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:42,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:42,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:42,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489055068] [2022-12-06 07:35:42,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:42,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:42,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:42,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:42,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:42,245 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:42,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:42,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:42,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:42,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:42,281 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:42,281 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:42,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:42,282 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:42,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:42,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:42,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:42,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:42,282 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:42,282 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:42,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:42,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:42,283 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:42,283 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:42,283 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:42,283 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:42,283 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:42,283 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:42,284 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:42,284 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:42,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:42,286 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:42,286 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:42,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:42,286 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:42,286 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:42,361 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:42,362 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:42,362 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:42,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:42,363 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:42,363 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:42,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3238 [2022-12-06 07:35:42,363 INFO L420 AbstractCegarLoop]: === Iteration 3240 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:42,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:42,363 INFO L85 PathProgramCache]: Analyzing trace with hash -379157474, now seen corresponding path program 1 times [2022-12-06 07:35:42,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:42,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167629078] [2022-12-06 07:35:42,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:42,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:42,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-06 07:35:42,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:42,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167629078] [2022-12-06 07:35:42,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167629078] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:42,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:42,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:42,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390867304] [2022-12-06 07:35:42,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:42,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:42,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:42,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:42,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:42,430 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:42,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:42,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:42,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:42,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:42,472 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:42,472 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:42,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:42,473 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:42,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:42,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:42,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:42,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:42,473 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:42,473 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:42,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:42,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:42,474 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:42,474 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:42,474 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:42,474 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:42,474 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:42,474 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:42,475 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:42,475 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:42,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:42,477 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:42,477 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:42,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:42,477 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:42,477 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:42,552 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:42,553 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:42,553 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:42,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:42,553 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:42,553 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:42,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3239 [2022-12-06 07:35:42,553 INFO L420 AbstractCegarLoop]: === Iteration 3241 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:42,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:42,554 INFO L85 PathProgramCache]: Analyzing trace with hash -352375365, now seen corresponding path program 1 times [2022-12-06 07:35:42,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:42,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708311231] [2022-12-06 07:35:42,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:42,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:42,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-06 07:35:42,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:42,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708311231] [2022-12-06 07:35:42,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708311231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:42,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:42,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:42,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737032326] [2022-12-06 07:35:42,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:42,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:42,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:42,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:42,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:42,624 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:42,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:42,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:42,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:42,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:42,663 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:42,663 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:42,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:42,664 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:42,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:42,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:42,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:42,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:42,664 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:42,664 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:42,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:42,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:42,665 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:42,665 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:42,665 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:42,665 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:42,665 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:42,665 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:42,665 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:42,665 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:42,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:42,668 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:42,668 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:42,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:42,668 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:42,668 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:42,741 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:42,743 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:42,743 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:42,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:42,743 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:42,743 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:42,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3240 [2022-12-06 07:35:42,743 INFO L420 AbstractCegarLoop]: === Iteration 3242 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:42,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:42,743 INFO L85 PathProgramCache]: Analyzing trace with hash -321899172, now seen corresponding path program 1 times [2022-12-06 07:35:42,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:42,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847589477] [2022-12-06 07:35:42,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:42,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:42,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-06 07:35:42,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:42,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847589477] [2022-12-06 07:35:42,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847589477] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:42,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:42,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:42,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488106807] [2022-12-06 07:35:42,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:42,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:42,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:42,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:42,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:42,812 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:42,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:42,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:42,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:42,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:42,854 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:42,854 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:42,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:42,855 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:42,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:42,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:42,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:42,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:42,855 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:42,855 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:42,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:42,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:42,856 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:42,856 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:42,856 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:42,856 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:42,856 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:42,856 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:42,856 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:42,857 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:42,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:42,859 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:42,859 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:42,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 122 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:42,859 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:42,859 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:42,934 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:42,935 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:42,935 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:42,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:42,935 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:42,935 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:42,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3241 [2022-12-06 07:35:42,936 INFO L420 AbstractCegarLoop]: === Iteration 3243 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:42,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:42,936 INFO L85 PathProgramCache]: Analyzing trace with hash -295117063, now seen corresponding path program 1 times [2022-12-06 07:35:42,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:42,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902296776] [2022-12-06 07:35:42,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:42,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:43,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-06 07:35:43,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:43,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902296776] [2022-12-06 07:35:43,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902296776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:43,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:43,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:43,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375444829] [2022-12-06 07:35:43,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:43,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:43,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:43,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:43,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:43,007 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:43,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:43,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:43,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:43,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:43,071 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:43,071 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:43,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:43,072 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:43,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:43,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:43,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:43,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:43,073 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:43,073 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:43,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:43,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:43,074 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:43,074 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:43,074 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:43,074 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:43,074 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:43,074 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:43,074 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:43,074 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:43,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:43,077 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:43,077 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:43,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:43,077 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:43,078 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:43,167 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:43,168 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 07:35:43,168 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:43,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:43,169 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:43,169 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:43,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3242 [2022-12-06 07:35:43,169 INFO L420 AbstractCegarLoop]: === Iteration 3244 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:43,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:43,169 INFO L85 PathProgramCache]: Analyzing trace with hash -264640870, now seen corresponding path program 1 times [2022-12-06 07:35:43,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:43,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711224036] [2022-12-06 07:35:43,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:43,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:43,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-06 07:35:43,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:43,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711224036] [2022-12-06 07:35:43,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711224036] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:43,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:43,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:43,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096679971] [2022-12-06 07:35:43,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:43,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:43,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:43,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:43,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:43,258 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:43,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:43,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:43,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:43,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:43,298 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:43,298 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:43,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:43,299 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:43,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:43,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:43,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:43,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:43,299 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:43,299 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:43,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:43,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:43,300 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:43,300 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:43,300 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:43,300 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:43,301 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:43,301 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:43,301 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:43,301 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:43,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:43,304 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:43,304 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:43,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:43,304 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:43,304 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:43,394 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:43,395 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 07:35:43,395 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:43,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:43,395 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:43,396 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:43,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3243 [2022-12-06 07:35:43,396 INFO L420 AbstractCegarLoop]: === Iteration 3245 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:43,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:43,396 INFO L85 PathProgramCache]: Analyzing trace with hash -237858761, now seen corresponding path program 1 times [2022-12-06 07:35:43,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:43,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259952706] [2022-12-06 07:35:43,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:43,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:43,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:43,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-06 07:35:43,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:43,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259952706] [2022-12-06 07:35:43,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259952706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:43,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:43,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:43,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913899315] [2022-12-06 07:35:43,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:43,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:43,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:43,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:43,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:43,512 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:43,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:43,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:43,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:43,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:43,548 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:43,548 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:43,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 356 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:43,548 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:43,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:43,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:43,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:43,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:43,549 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:43,549 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:43,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:43,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:43,550 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:43,550 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:43,550 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:43,550 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:43,550 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:43,550 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:43,550 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:43,550 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:43,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:43,552 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:43,552 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:43,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:43,553 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:43,553 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:43,628 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:43,629 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:43,629 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:43,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:43,629 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:43,629 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:43,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3244 [2022-12-06 07:35:43,629 INFO L420 AbstractCegarLoop]: === Iteration 3246 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:43,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:43,629 INFO L85 PathProgramCache]: Analyzing trace with hash -207382568, now seen corresponding path program 1 times [2022-12-06 07:35:43,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:43,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234077186] [2022-12-06 07:35:43,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:43,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:43,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-06 07:35:43,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:43,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234077186] [2022-12-06 07:35:43,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234077186] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:43,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:43,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:43,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493263261] [2022-12-06 07:35:43,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:43,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:43,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:43,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:43,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:43,696 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:43,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:43,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:43,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:43,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:43,733 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:43,733 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:43,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:43,734 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:43,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:43,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:43,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:43,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:43,734 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:43,734 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:43,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:43,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:43,735 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:43,735 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:43,735 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:43,735 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:43,735 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:43,735 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:43,735 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:43,735 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:43,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:43,737 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:43,737 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:43,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:43,738 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:43,738 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:43,813 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:43,814 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:43,814 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:43,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:43,814 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:43,815 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:43,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3245 [2022-12-06 07:35:43,815 INFO L420 AbstractCegarLoop]: === Iteration 3247 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:43,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:43,815 INFO L85 PathProgramCache]: Analyzing trace with hash -180600459, now seen corresponding path program 1 times [2022-12-06 07:35:43,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:43,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004407655] [2022-12-06 07:35:43,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:43,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:43,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:43,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:43,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004407655] [2022-12-06 07:35:43,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004407655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:43,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:43,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:43,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189525295] [2022-12-06 07:35:43,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:43,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:43,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:43,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:43,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:43,885 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:43,885 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:43,885 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:43,885 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:43,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:43,924 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:43,924 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:43,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:43,924 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:43,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:43,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:43,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:43,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:43,925 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:43,925 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:43,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:43,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:43,925 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:43,926 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:43,926 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:43,926 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:43,926 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:43,926 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:43,926 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:43,926 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:43,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:43,928 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:43,928 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:43,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:43,928 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:43,929 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:44,002 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:44,003 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:44,003 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:44,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:44,004 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:44,004 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:44,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3246 [2022-12-06 07:35:44,004 INFO L420 AbstractCegarLoop]: === Iteration 3248 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:44,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:44,004 INFO L85 PathProgramCache]: Analyzing trace with hash -150124266, now seen corresponding path program 1 times [2022-12-06 07:35:44,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:44,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64687669] [2022-12-06 07:35:44,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:44,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:44,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-06 07:35:44,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:44,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64687669] [2022-12-06 07:35:44,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64687669] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:44,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:44,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:44,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328645063] [2022-12-06 07:35:44,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:44,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:44,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:44,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:44,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:44,072 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:44,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:44,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:44,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:44,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:44,114 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:44,114 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:44,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:44,115 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:44,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:44,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:44,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:44,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:44,115 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:44,115 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:44,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:44,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:44,116 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:44,116 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:44,116 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:44,116 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:44,116 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:44,116 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:44,116 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:44,116 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:44,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:44,118 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:44,118 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:44,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:44,119 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:44,119 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:44,194 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:44,195 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:44,195 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:44,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:44,195 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:44,195 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:44,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3247 [2022-12-06 07:35:44,196 INFO L420 AbstractCegarLoop]: === Iteration 3249 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:44,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:44,196 INFO L85 PathProgramCache]: Analyzing trace with hash -123342157, now seen corresponding path program 1 times [2022-12-06 07:35:44,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:44,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764071721] [2022-12-06 07:35:44,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:44,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35: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-06 07:35:44,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:44,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764071721] [2022-12-06 07:35:44,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764071721] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:44,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:44,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:44,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244419620] [2022-12-06 07:35:44,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:44,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:44,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:44,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:44,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:44,266 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:44,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:44,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:44,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:44,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:44,301 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:44,301 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:44,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:44,302 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:44,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:44,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:44,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:44,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:44,302 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:44,302 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:44,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:44,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:44,303 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:44,303 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:44,303 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:44,303 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:44,303 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:44,303 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:44,303 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:44,303 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:44,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:44,305 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:44,306 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:44,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:44,306 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:44,306 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:44,379 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:44,380 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:44,380 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:44,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:44,380 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:44,380 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:44,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3248 [2022-12-06 07:35:44,380 INFO L420 AbstractCegarLoop]: === Iteration 3250 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:44,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:44,381 INFO L85 PathProgramCache]: Analyzing trace with hash -92865964, now seen corresponding path program 1 times [2022-12-06 07:35:44,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:44,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225086306] [2022-12-06 07:35:44,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:44,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:44,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-06 07:35:44,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:44,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225086306] [2022-12-06 07:35:44,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225086306] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:44,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:44,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:44,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808795519] [2022-12-06 07:35:44,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:44,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:44,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:44,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:44,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:44,447 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:44,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:44,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:44,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:44,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:44,483 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:44,483 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:44,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:44,484 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:44,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:44,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:44,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:44,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:44,484 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:44,484 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:44,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:44,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:44,485 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:44,485 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:44,485 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:44,485 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:44,485 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:44,485 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:44,485 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:44,485 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:44,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:44,487 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:44,488 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:44,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 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 116. Up to 16 conditions per place. [2022-12-06 07:35:44,488 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:44,488 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:44,561 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:44,562 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:44,562 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:44,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:44,562 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:44,562 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:44,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3249 [2022-12-06 07:35:44,562 INFO L420 AbstractCegarLoop]: === Iteration 3251 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:44,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:44,563 INFO L85 PathProgramCache]: Analyzing trace with hash -66083855, now seen corresponding path program 1 times [2022-12-06 07:35:44,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:44,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918798857] [2022-12-06 07:35:44,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:44,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:44,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:44,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:44,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:44,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918798857] [2022-12-06 07:35:44,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918798857] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:44,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:44,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:44,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159812916] [2022-12-06 07:35:44,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:44,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:44,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:44,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:44,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:44,634 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:44,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:44,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:44,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:44,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:44,675 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:44,675 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:44,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:44,676 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:44,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:44,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:44,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:44,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:44,676 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:44,676 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:44,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:44,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:44,677 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:44,677 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:44,677 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:44,677 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:44,677 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:44,678 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:44,678 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:44,678 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:44,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:44,680 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:44,680 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:44,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:44,680 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:44,680 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:44,766 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:44,767 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-06 07:35:44,768 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:44,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:44,768 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:44,768 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:44,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3250 [2022-12-06 07:35:44,768 INFO L420 AbstractCegarLoop]: === Iteration 3252 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:44,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:44,768 INFO L85 PathProgramCache]: Analyzing trace with hash -35607662, now seen corresponding path program 1 times [2022-12-06 07:35:44,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:44,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419645779] [2022-12-06 07:35:44,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:44,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:44,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:44,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-06 07:35:44,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:44,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419645779] [2022-12-06 07:35:44,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419645779] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:44,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:44,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:44,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671127196] [2022-12-06 07:35:44,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:44,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:44,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:44,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:44,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:44,834 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:44,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:44,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:44,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:44,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:44,870 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:44,871 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:44,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:44,871 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:44,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:44,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:44,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:44,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:44,872 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:44,872 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:44,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:44,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:44,872 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:44,872 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:44,872 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:44,873 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:44,873 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:44,873 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:44,873 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:44,873 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:44,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:44,875 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:44,875 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:44,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:44,875 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:44,875 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:44,948 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:44,950 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:44,950 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:44,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:44,950 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:44,950 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:44,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3251 [2022-12-06 07:35:44,950 INFO L420 AbstractCegarLoop]: === Iteration 3253 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:44,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:44,950 INFO L85 PathProgramCache]: Analyzing trace with hash -8825553, now seen corresponding path program 1 times [2022-12-06 07:35:44,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:44,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295704051] [2022-12-06 07:35:44,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:44,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:45,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-06 07:35:45,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:45,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295704051] [2022-12-06 07:35:45,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295704051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:45,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:45,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:45,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571473558] [2022-12-06 07:35:45,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:45,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:45,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:45,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:45,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:45,021 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:45,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:45,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:45,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:45,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:45,062 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:45,062 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:45,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:45,062 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:45,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:45,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:45,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:45,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:45,063 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:45,063 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:45,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:45,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:45,063 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:45,064 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:45,064 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:45,064 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:45,064 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:45,064 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:45,064 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:45,064 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:45,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:45,066 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:45,066 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:45,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:45,066 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:45,066 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:45,144 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:45,146 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:35:45,146 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:45,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:45,146 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:45,146 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:45,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3252 [2022-12-06 07:35:45,146 INFO L420 AbstractCegarLoop]: === Iteration 3254 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:45,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:45,146 INFO L85 PathProgramCache]: Analyzing trace with hash 21650640, now seen corresponding path program 1 times [2022-12-06 07:35:45,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:45,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535140194] [2022-12-06 07:35:45,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:45,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:45,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:45,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:45,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535140194] [2022-12-06 07:35:45,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535140194] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:45,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:45,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:45,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892296166] [2022-12-06 07:35:45,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:45,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:45,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:45,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:45,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:45,214 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:45,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:45,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:45,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:45,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:45,255 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:45,255 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:45,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:45,256 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:45,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:45,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:45,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:45,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:45,256 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:45,256 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:45,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:45,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:45,257 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:45,257 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:45,257 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:45,257 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:45,257 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:45,257 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:45,257 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:45,257 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:45,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:45,260 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:45,260 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:45,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:45,260 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:45,260 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:45,335 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:45,336 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:45,336 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:45,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:45,336 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:45,336 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:45,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3253 [2022-12-06 07:35:45,336 INFO L420 AbstractCegarLoop]: === Iteration 3255 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:45,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:45,337 INFO L85 PathProgramCache]: Analyzing trace with hash 48432749, now seen corresponding path program 1 times [2022-12-06 07:35:45,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:45,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747433198] [2022-12-06 07:35:45,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:45,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:45,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-06 07:35:45,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:45,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747433198] [2022-12-06 07:35:45,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747433198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:45,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:45,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:45,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440275306] [2022-12-06 07:35:45,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:45,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:45,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:45,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:45,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:45,406 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:45,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:45,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:45,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:45,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:45,447 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:45,447 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:45,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:45,448 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:45,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:45,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:45,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:45,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:45,448 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:45,448 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:45,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:45,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:45,449 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:45,449 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:45,449 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:45,449 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:45,449 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:45,449 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:45,449 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:45,449 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:45,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:45,452 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:45,452 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:45,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:45,452 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:45,452 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:45,525 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:45,527 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:45,527 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:45,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:45,527 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:45,527 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:45,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3254 [2022-12-06 07:35:45,527 INFO L420 AbstractCegarLoop]: === Iteration 3256 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:45,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:45,527 INFO L85 PathProgramCache]: Analyzing trace with hash 78908942, now seen corresponding path program 1 times [2022-12-06 07:35:45,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:45,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744078651] [2022-12-06 07:35:45,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:45,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:45,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-06 07:35:45,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:45,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744078651] [2022-12-06 07:35:45,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744078651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:45,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:45,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:45,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443040212] [2022-12-06 07:35:45,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:45,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:45,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:45,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:45,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:45,594 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:45,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:45,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:45,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:45,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:45,635 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:45,635 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:45,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:45,636 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:45,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:45,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:45,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:45,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:45,636 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:45,636 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:45,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:45,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:45,637 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:45,637 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:45,637 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:45,637 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:45,637 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:45,637 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:45,638 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:45,638 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:45,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:45,640 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:45,640 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:45,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 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 116. Up to 16 conditions per place. [2022-12-06 07:35:45,640 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:45,640 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:45,714 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:45,715 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:45,715 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:45,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:45,715 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:45,716 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:45,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3255 [2022-12-06 07:35:45,716 INFO L420 AbstractCegarLoop]: === Iteration 3257 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:45,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:45,716 INFO L85 PathProgramCache]: Analyzing trace with hash 105691051, now seen corresponding path program 1 times [2022-12-06 07:35:45,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:45,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000962109] [2022-12-06 07:35:45,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:45,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:45,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-06 07:35:45,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:45,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000962109] [2022-12-06 07:35:45,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000962109] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:45,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:45,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:45,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293552787] [2022-12-06 07:35:45,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:45,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:45,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:45,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:45,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:45,787 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:45,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:45,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:45,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:45,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:45,828 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:45,828 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:45,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:45,828 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:45,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:45,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:45,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:45,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:45,829 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:45,829 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:45,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:45,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:45,829 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:45,829 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:45,830 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:45,830 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:45,830 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:45,830 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:45,830 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:45,830 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:45,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:45,832 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:45,832 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:45,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:45,832 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:45,832 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:45,906 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:45,907 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:45,907 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:45,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:45,907 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:45,907 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:45,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3256 [2022-12-06 07:35:45,908 INFO L420 AbstractCegarLoop]: === Iteration 3258 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:45,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:45,908 INFO L85 PathProgramCache]: Analyzing trace with hash 136167244, now seen corresponding path program 1 times [2022-12-06 07:35:45,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:45,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778294735] [2022-12-06 07:35:45,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:45,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35: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-06 07:35:45,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:45,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778294735] [2022-12-06 07:35:45,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778294735] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:45,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:45,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:45,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867448464] [2022-12-06 07:35:45,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:45,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:45,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:45,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:45,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:45,992 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:45,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:45,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:45,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:45,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:46,034 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:46,034 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:46,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:46,035 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:46,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:46,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:46,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:46,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:46,035 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:46,035 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:46,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:46,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:46,036 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:46,036 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:46,036 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:46,036 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:46,036 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:46,037 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:46,037 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:46,037 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:46,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:46,039 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:46,039 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:46,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:46,039 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:46,039 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:46,112 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:46,113 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:46,113 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:46,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:46,113 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:46,113 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:46,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3257 [2022-12-06 07:35:46,114 INFO L420 AbstractCegarLoop]: === Iteration 3259 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:46,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:46,114 INFO L85 PathProgramCache]: Analyzing trace with hash 162949353, now seen corresponding path program 1 times [2022-12-06 07:35:46,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:46,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110425870] [2022-12-06 07:35:46,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:46,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:46,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-06 07:35:46,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:46,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110425870] [2022-12-06 07:35:46,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110425870] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:46,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:46,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:46,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925033645] [2022-12-06 07:35:46,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:46,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:46,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:46,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:46,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:46,184 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:46,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:46,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:46,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:46,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:46,222 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:46,223 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:46,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:46,223 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:46,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:46,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:46,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:46,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:46,224 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:46,224 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:46,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:46,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:46,224 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:46,224 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:46,224 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:46,224 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:46,225 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:46,225 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:46,225 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:46,225 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:46,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:46,227 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:46,227 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:46,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:46,227 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:46,227 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:46,301 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:46,302 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:46,302 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:46,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:46,302 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:46,302 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:46,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3258 [2022-12-06 07:35:46,302 INFO L420 AbstractCegarLoop]: === Iteration 3260 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:46,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:46,303 INFO L85 PathProgramCache]: Analyzing trace with hash 193425546, now seen corresponding path program 1 times [2022-12-06 07:35:46,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:46,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722103055] [2022-12-06 07:35:46,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:46,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:46,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-06 07:35:46,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:46,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722103055] [2022-12-06 07:35:46,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722103055] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:46,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:46,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:46,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786613049] [2022-12-06 07:35:46,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:46,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:46,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:46,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:46,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:46,368 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:46,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:46,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:46,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:46,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:46,409 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:46,409 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:46,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:46,409 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:46,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:46,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:46,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:46,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:46,410 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:46,410 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:46,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:46,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:46,410 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:46,410 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:46,411 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:46,411 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:46,411 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:46,411 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:46,411 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:46,411 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:46,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:46,413 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:46,413 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:46,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:46,413 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:46,413 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:46,487 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:46,488 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:46,488 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:46,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:46,488 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:46,488 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:46,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3259 [2022-12-06 07:35:46,488 INFO L420 AbstractCegarLoop]: === Iteration 3261 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:46,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:46,488 INFO L85 PathProgramCache]: Analyzing trace with hash 220207655, now seen corresponding path program 1 times [2022-12-06 07:35:46,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:46,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003656699] [2022-12-06 07:35:46,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:46,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:46,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:46,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:46,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003656699] [2022-12-06 07:35:46,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003656699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:46,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:46,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:46,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356586417] [2022-12-06 07:35:46,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:46,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:46,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:46,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:46,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:46,559 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:46,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:46,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:46,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:46,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:46,594 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:46,594 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:46,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:46,595 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:46,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:46,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:46,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:46,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:46,595 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:46,595 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:46,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:46,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:46,596 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:46,596 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:46,596 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:46,596 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:46,596 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:46,596 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:46,596 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:46,596 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:46,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:46,599 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:46,599 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:46,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:46,599 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:46,599 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:46,674 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:46,675 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:46,675 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:46,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:46,675 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:46,675 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:46,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3260 [2022-12-06 07:35:46,676 INFO L420 AbstractCegarLoop]: === Iteration 3262 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:46,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:46,676 INFO L85 PathProgramCache]: Analyzing trace with hash 250683848, now seen corresponding path program 1 times [2022-12-06 07:35:46,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:46,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039141044] [2022-12-06 07:35:46,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:46,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:46,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-06 07:35:46,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:46,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039141044] [2022-12-06 07:35:46,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039141044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:46,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:46,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:46,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117584158] [2022-12-06 07:35:46,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:46,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:46,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:46,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:46,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:46,745 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:46,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:46,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:46,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:46,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:46,781 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:46,782 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:46,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:46,782 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:46,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:46,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:46,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:46,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:46,783 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:46,783 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:46,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:46,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:46,784 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:46,784 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:46,784 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:46,784 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:46,784 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:46,784 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:46,785 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:46,785 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:46,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:46,787 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:46,787 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:46,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:46,787 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:46,787 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:46,861 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:46,862 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:46,862 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:46,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:46,862 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:46,862 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:46,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3261 [2022-12-06 07:35:46,862 INFO L420 AbstractCegarLoop]: === Iteration 3263 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:46,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:46,863 INFO L85 PathProgramCache]: Analyzing trace with hash 277465957, now seen corresponding path program 1 times [2022-12-06 07:35:46,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:46,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941196334] [2022-12-06 07:35:46,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:46,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:46,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-06 07:35:46,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:46,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941196334] [2022-12-06 07:35:46,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941196334] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:46,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:46,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:46,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445871639] [2022-12-06 07:35:46,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:46,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:46,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:46,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:46,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:46,936 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:46,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:46,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:46,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:46,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:46,977 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:46,977 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:46,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:46,978 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:46,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:46,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:46,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:46,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:46,978 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:46,978 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:46,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:46,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:46,979 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:46,979 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:46,979 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:46,979 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:46,979 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:46,979 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:46,979 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:46,980 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:46,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:46,982 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:46,982 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:46,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:46,982 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:46,982 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:47,057 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:47,059 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:35:47,059 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:47,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:47,059 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:47,059 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:47,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3262 [2022-12-06 07:35:47,059 INFO L420 AbstractCegarLoop]: === Iteration 3264 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:47,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:47,060 INFO L85 PathProgramCache]: Analyzing trace with hash 307942150, now seen corresponding path program 1 times [2022-12-06 07:35:47,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:47,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889841238] [2022-12-06 07:35:47,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:47,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35: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-06 07:35:47,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:47,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889841238] [2022-12-06 07:35:47,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889841238] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:47,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:47,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:47,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858094389] [2022-12-06 07:35:47,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:47,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:47,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:47,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:47,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:47,148 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:47,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:47,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:47,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:47,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:47,186 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:47,186 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:47,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:47,187 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:47,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:47,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:47,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:47,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:47,187 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:47,187 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:47,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:47,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:47,188 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:47,188 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:47,188 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:47,188 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:47,189 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:47,189 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:47,189 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:47,189 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:47,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:47,191 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:47,191 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:47,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:47,191 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:47,191 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:47,265 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:47,266 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:47,266 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:47,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:47,266 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:47,266 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:47,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3263 [2022-12-06 07:35:47,267 INFO L420 AbstractCegarLoop]: === Iteration 3265 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:47,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:47,267 INFO L85 PathProgramCache]: Analyzing trace with hash 334724259, now seen corresponding path program 1 times [2022-12-06 07:35:47,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:47,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582798571] [2022-12-06 07:35:47,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:47,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:47,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-06 07:35:47,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:47,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582798571] [2022-12-06 07:35:47,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582798571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:47,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:47,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:47,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904002932] [2022-12-06 07:35:47,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:47,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:47,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:47,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:47,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:47,335 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:47,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:47,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:47,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:47,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:47,370 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:47,371 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:47,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:47,371 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:47,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:47,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:47,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:47,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:47,371 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:47,372 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:47,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:47,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:47,372 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:47,372 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:47,372 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:47,372 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:47,372 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:47,373 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:47,373 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:47,373 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:47,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:47,375 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:47,375 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:47,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:47,375 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:47,375 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:47,449 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:47,450 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:47,450 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:47,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:47,450 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:47,450 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:47,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3264 [2022-12-06 07:35:47,450 INFO L420 AbstractCegarLoop]: === Iteration 3266 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:47,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:47,450 INFO L85 PathProgramCache]: Analyzing trace with hash 365200452, now seen corresponding path program 1 times [2022-12-06 07:35:47,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:47,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181969525] [2022-12-06 07:35:47,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:47,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:47,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-06 07:35:47,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:47,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181969525] [2022-12-06 07:35:47,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181969525] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:47,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:47,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:47,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014423285] [2022-12-06 07:35:47,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:47,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:47,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:47,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:47,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:47,516 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:47,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:47,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:47,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:47,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:47,558 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:47,558 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:47,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:47,558 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:47,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:47,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:47,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:47,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:47,559 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:47,559 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:47,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:47,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:47,560 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:47,560 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:47,560 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:47,560 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:47,560 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:47,560 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:47,560 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:47,560 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:47,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:47,562 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:47,562 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:47,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:47,562 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:47,563 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:47,636 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:47,637 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:47,637 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:47,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:47,637 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:47,637 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:47,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3265 [2022-12-06 07:35:47,638 INFO L420 AbstractCegarLoop]: === Iteration 3267 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:47,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:47,638 INFO L85 PathProgramCache]: Analyzing trace with hash 391982561, now seen corresponding path program 1 times [2022-12-06 07:35:47,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:47,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829517149] [2022-12-06 07:35:47,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:47,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:47,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-06 07:35:47,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:47,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829517149] [2022-12-06 07:35:47,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829517149] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:47,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:47,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:47,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229858980] [2022-12-06 07:35:47,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:47,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:47,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:47,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:47,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:47,706 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:47,706 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:47,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:47,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:47,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:47,744 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:47,744 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:47,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:47,745 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:47,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:47,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:47,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:47,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:47,745 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:47,745 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:47,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:47,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:47,746 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:47,746 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:47,746 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:47,746 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:47,746 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:47,747 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:47,747 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:47,747 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:47,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:47,749 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:47,749 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:47,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:47,749 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:47,749 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:47,822 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:47,824 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:47,824 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:47,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:47,824 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:47,824 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:47,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3266 [2022-12-06 07:35:47,824 INFO L420 AbstractCegarLoop]: === Iteration 3268 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:47,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:47,824 INFO L85 PathProgramCache]: Analyzing trace with hash 422458754, now seen corresponding path program 1 times [2022-12-06 07:35:47,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:47,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448591491] [2022-12-06 07:35:47,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:47,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:47,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-06 07:35:47,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:47,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448591491] [2022-12-06 07:35:47,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448591491] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:47,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:47,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:47,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571071255] [2022-12-06 07:35:47,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:47,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:47,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:47,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:47,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:47,891 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:47,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:47,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:47,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:47,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:47,932 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:47,932 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:47,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:47,933 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:47,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:47,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:47,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:47,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:47,933 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:47,933 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:47,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:47,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:47,934 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:47,934 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:47,934 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:47,934 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:47,934 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:47,935 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:47,935 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:47,935 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:47,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:47,937 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:47,937 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:47,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:47,937 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:47,937 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:48,011 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:48,012 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:48,012 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:48,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:48,012 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:48,013 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:48,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3267 [2022-12-06 07:35:48,013 INFO L420 AbstractCegarLoop]: === Iteration 3269 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:48,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:48,013 INFO L85 PathProgramCache]: Analyzing trace with hash 449240863, now seen corresponding path program 1 times [2022-12-06 07:35:48,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:48,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584151640] [2022-12-06 07:35:48,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:48,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:48,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-06 07:35:48,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:48,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584151640] [2022-12-06 07:35:48,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584151640] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:48,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:48,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:48,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933076038] [2022-12-06 07:35:48,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:48,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:48,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:48,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:48,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:48,083 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:48,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:48,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:48,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:48,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:48,124 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:48,124 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:48,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:48,124 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:48,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:48,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:48,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:48,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:48,125 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:48,125 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:48,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:48,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:48,125 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:48,126 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:48,126 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:48,126 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:48,126 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:48,126 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:48,126 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:48,126 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:48,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:48,128 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:48,128 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:48,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:48,129 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:48,129 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:48,202 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:48,203 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:48,203 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:48,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:48,204 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:48,204 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:48,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3268 [2022-12-06 07:35:48,204 INFO L420 AbstractCegarLoop]: === Iteration 3270 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:48,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:48,204 INFO L85 PathProgramCache]: Analyzing trace with hash 479717056, now seen corresponding path program 1 times [2022-12-06 07:35:48,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:48,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726397065] [2022-12-06 07:35:48,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:48,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:48,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-06 07:35:48,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:48,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726397065] [2022-12-06 07:35:48,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726397065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:48,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:48,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:48,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135925048] [2022-12-06 07:35:48,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:48,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:48,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:48,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:48,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:48,271 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:48,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:48,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:48,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:48,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:48,314 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:48,314 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:48,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:48,314 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:48,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:48,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:48,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:48,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:48,315 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:48,315 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:48,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:48,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:48,316 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:48,316 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:48,316 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:48,316 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:48,316 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:48,316 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:48,316 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:48,316 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:48,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:48,318 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:48,318 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:48,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:48,319 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:48,319 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:48,394 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:48,395 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:48,396 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:48,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:48,396 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:48,396 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:48,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3269 [2022-12-06 07:35:48,396 INFO L420 AbstractCegarLoop]: === Iteration 3271 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:48,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:48,396 INFO L85 PathProgramCache]: Analyzing trace with hash 506499165, now seen corresponding path program 1 times [2022-12-06 07:35:48,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:48,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460311058] [2022-12-06 07:35:48,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:48,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:48,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:48,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:48,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460311058] [2022-12-06 07:35:48,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460311058] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:48,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:48,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:48,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545585459] [2022-12-06 07:35:48,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:48,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:48,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:48,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:48,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:48,478 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:48,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:48,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:48,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:48,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:48,519 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:48,519 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:48,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:48,519 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:48,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:48,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:48,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:48,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:48,520 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:48,520 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:48,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:48,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:48,520 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:48,520 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:48,521 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:48,521 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:48,521 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:48,521 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:48,521 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:48,521 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:48,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:48,523 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:48,523 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:48,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:48,523 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:48,523 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:48,598 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:48,600 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:48,600 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:48,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:48,600 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:48,600 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:48,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3270 [2022-12-06 07:35:48,600 INFO L420 AbstractCegarLoop]: === Iteration 3272 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:48,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:48,600 INFO L85 PathProgramCache]: Analyzing trace with hash 536975358, now seen corresponding path program 1 times [2022-12-06 07:35:48,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:48,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597399182] [2022-12-06 07:35:48,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:48,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:48,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-06 07:35:48,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:48,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597399182] [2022-12-06 07:35:48,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597399182] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:48,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:48,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:48,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48492925] [2022-12-06 07:35:48,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:48,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:48,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:48,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:48,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:48,668 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:48,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:48,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:48,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:48,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:48,705 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:48,705 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:48,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:48,706 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:48,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:48,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:48,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:48,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:48,706 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:48,706 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:48,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:48,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:48,707 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:48,707 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:48,707 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:48,707 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:48,707 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:48,707 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:48,707 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:48,708 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:48,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:48,710 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:48,710 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:48,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:48,710 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:48,710 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:48,785 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:48,786 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:48,786 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:48,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:48,786 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:48,786 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:48,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3271 [2022-12-06 07:35:48,786 INFO L420 AbstractCegarLoop]: === Iteration 3273 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:48,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:48,787 INFO L85 PathProgramCache]: Analyzing trace with hash 563757467, now seen corresponding path program 1 times [2022-12-06 07:35:48,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:48,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556915689] [2022-12-06 07:35:48,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:48,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:48,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:48,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:48,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556915689] [2022-12-06 07:35:48,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556915689] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:48,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:48,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:48,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964834772] [2022-12-06 07:35:48,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:48,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:48,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:48,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:48,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:48,857 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:48,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:48,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:48,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:48,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:48,891 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:48,891 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:48,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:48,891 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:48,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:48,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:48,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:48,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:48,892 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:48,892 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:48,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:48,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:48,893 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:48,893 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:48,893 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:48,893 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:48,893 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:48,893 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:48,893 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:48,893 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:48,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:48,895 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:48,895 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:48,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:48,896 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:48,896 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:48,970 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:48,971 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:48,971 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:48,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:48,971 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:48,972 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:48,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3272 [2022-12-06 07:35:48,972 INFO L420 AbstractCegarLoop]: === Iteration 3274 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:48,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:48,972 INFO L85 PathProgramCache]: Analyzing trace with hash 594233660, now seen corresponding path program 1 times [2022-12-06 07:35:48,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:48,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594652586] [2022-12-06 07:35:48,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:48,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:49,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-06 07:35:49,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:49,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594652586] [2022-12-06 07:35:49,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594652586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:49,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:49,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:49,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612123656] [2022-12-06 07:35:49,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:49,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:49,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:49,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:49,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:49,039 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:49,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:49,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:49,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:49,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:49,080 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:49,081 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:49,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:49,081 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:49,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:49,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:49,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:49,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:49,081 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:49,082 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:49,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:49,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:49,082 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:49,082 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:49,082 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:49,082 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:49,082 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:49,083 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:49,083 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:49,083 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:49,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:49,085 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:49,085 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:49,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:49,085 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:49,085 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:49,179 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:49,181 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 07:35:49,181 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:49,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:49,181 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:49,181 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:49,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3273 [2022-12-06 07:35:49,181 INFO L420 AbstractCegarLoop]: === Iteration 3275 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:49,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:49,182 INFO L85 PathProgramCache]: Analyzing trace with hash 621015769, now seen corresponding path program 1 times [2022-12-06 07:35:49,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:49,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604007200] [2022-12-06 07:35:49,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:49,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:49,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-06 07:35:49,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:49,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604007200] [2022-12-06 07:35:49,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604007200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:49,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:49,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:49,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586677895] [2022-12-06 07:35:49,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:49,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:49,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:49,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:49,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:49,276 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:49,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:49,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:49,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:49,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:49,330 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:49,331 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:49,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:49,331 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:49,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:49,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:49,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:49,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:49,332 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:49,332 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:49,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:49,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:49,333 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:49,333 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:49,333 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:49,334 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:49,334 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:49,334 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:49,334 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:49,334 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:49,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:49,337 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:49,337 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:49,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:49,337 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:49,337 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:49,411 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:49,412 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:49,412 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:49,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:49,412 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:49,412 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:49,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3274 [2022-12-06 07:35:49,413 INFO L420 AbstractCegarLoop]: === Iteration 3276 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:49,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:49,413 INFO L85 PathProgramCache]: Analyzing trace with hash 651491962, now seen corresponding path program 1 times [2022-12-06 07:35:49,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:49,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202428409] [2022-12-06 07:35:49,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:49,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:49,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-06 07:35:49,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:49,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202428409] [2022-12-06 07:35:49,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202428409] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:49,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:49,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:49,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992879867] [2022-12-06 07:35:49,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:49,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:49,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:49,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:49,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:49,479 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:49,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:49,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:49,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:49,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:49,516 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:49,516 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:49,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:49,516 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:49,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:49,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:49,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:49,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:49,517 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:49,517 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:49,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:49,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:49,518 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:49,518 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:49,518 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:49,518 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:49,518 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:49,518 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:49,518 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:49,518 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:49,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:49,520 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:49,520 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:49,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:49,521 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:49,521 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:49,595 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:49,596 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:49,596 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:49,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:49,596 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:49,596 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:49,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3275 [2022-12-06 07:35:49,597 INFO L420 AbstractCegarLoop]: === Iteration 3277 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:49,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:49,597 INFO L85 PathProgramCache]: Analyzing trace with hash 678274071, now seen corresponding path program 1 times [2022-12-06 07:35:49,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:49,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326464602] [2022-12-06 07:35:49,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:49,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:49,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-06 07:35:49,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:49,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326464602] [2022-12-06 07:35:49,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326464602] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:49,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:49,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:49,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000460907] [2022-12-06 07:35:49,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:49,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:49,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:49,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:49,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:49,683 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:49,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:49,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:49,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:49,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:49,721 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:49,721 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:49,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:49,722 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:49,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:49,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:49,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:49,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:49,722 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:49,722 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:49,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:49,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:49,723 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:49,723 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:49,723 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:49,723 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:49,723 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:49,723 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:49,723 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:49,724 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:49,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:49,726 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:49,726 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:49,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:49,726 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:49,726 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:49,801 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:49,802 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:49,802 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:49,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:49,802 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:49,802 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:49,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3276 [2022-12-06 07:35:49,802 INFO L420 AbstractCegarLoop]: === Iteration 3278 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:49,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:49,803 INFO L85 PathProgramCache]: Analyzing trace with hash 708750264, now seen corresponding path program 1 times [2022-12-06 07:35:49,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:49,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185216206] [2022-12-06 07:35:49,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:49,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:49,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-06 07:35:49,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:49,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185216206] [2022-12-06 07:35:49,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185216206] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:49,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:49,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:49,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829886448] [2022-12-06 07:35:49,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:49,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:49,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:49,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:49,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:49,872 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:49,872 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:49,872 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:49,872 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:49,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:49,914 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:49,915 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:49,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:49,915 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:49,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:49,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:49,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:49,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:49,916 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:49,916 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:49,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:49,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:49,916 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:49,916 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:49,916 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:49,917 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:49,917 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:49,917 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:49,917 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:49,917 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:49,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:49,919 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:49,919 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:49,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:49,919 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:49,919 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:49,995 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:49,996 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:49,996 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:49,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:49,996 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:49,996 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:49,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3277 [2022-12-06 07:35:49,996 INFO L420 AbstractCegarLoop]: === Iteration 3279 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:49,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:49,996 INFO L85 PathProgramCache]: Analyzing trace with hash 735532373, now seen corresponding path program 1 times [2022-12-06 07:35:49,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:49,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269992206] [2022-12-06 07:35:49,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:49,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35: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-06 07:35:50,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:50,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269992206] [2022-12-06 07:35:50,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269992206] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:50,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:50,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:50,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010362335] [2022-12-06 07:35:50,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:50,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:50,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:50,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:50,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:50,068 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:50,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:50,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:50,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:50,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:50,107 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:50,107 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:50,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:50,107 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:50,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:50,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:50,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:50,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:50,108 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:50,108 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:50,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:50,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:50,109 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:50,109 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:50,109 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:50,109 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:50,109 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:50,109 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:50,109 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:50,109 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:50,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:50,111 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:50,111 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:50,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:50,112 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:50,112 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:50,186 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:50,187 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:50,187 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:50,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:50,187 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:50,187 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:50,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3278 [2022-12-06 07:35:50,188 INFO L420 AbstractCegarLoop]: === Iteration 3280 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:50,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:50,188 INFO L85 PathProgramCache]: Analyzing trace with hash 766008566, now seen corresponding path program 1 times [2022-12-06 07:35:50,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:50,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257305739] [2022-12-06 07:35:50,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:50,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:50,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-06 07:35:50,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:50,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257305739] [2022-12-06 07:35:50,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257305739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:50,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:50,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:50,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463423318] [2022-12-06 07:35:50,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:50,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:50,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:50,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:50,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:50,257 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:50,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:50,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:50,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:50,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:50,299 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:50,299 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:50,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:50,299 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:50,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:50,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:50,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:50,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:50,300 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:50,300 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:50,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:50,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:50,300 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:50,300 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:50,301 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:50,301 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:50,301 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:50,301 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:50,301 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:50,301 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:50,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:50,303 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:50,303 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:50,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:50,303 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:50,303 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:50,376 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:50,378 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:50,378 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:50,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:50,378 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:50,378 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:50,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3279 [2022-12-06 07:35:50,378 INFO L420 AbstractCegarLoop]: === Iteration 3281 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:50,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:50,378 INFO L85 PathProgramCache]: Analyzing trace with hash 792790675, now seen corresponding path program 1 times [2022-12-06 07:35:50,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:50,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534271497] [2022-12-06 07:35:50,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:50,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:50,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-06 07:35:50,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:50,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534271497] [2022-12-06 07:35:50,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534271497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:50,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:50,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:50,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056495747] [2022-12-06 07:35:50,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:50,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:50,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:50,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:50,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:50,451 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:50,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:50,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:50,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:50,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:50,485 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:50,485 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:50,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:50,485 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:50,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:50,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:50,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:50,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:50,486 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:50,486 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:50,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:50,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:50,487 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:50,487 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:50,487 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:50,487 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:50,487 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:50,487 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:50,487 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:50,487 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:50,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:50,489 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:50,489 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:50,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:50,490 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:50,490 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:50,562 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:50,563 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:35:50,563 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:50,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:50,563 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:50,563 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:50,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3280 [2022-12-06 07:35:50,564 INFO L420 AbstractCegarLoop]: === Iteration 3282 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:50,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:50,564 INFO L85 PathProgramCache]: Analyzing trace with hash 823266868, now seen corresponding path program 1 times [2022-12-06 07:35:50,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:50,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074882882] [2022-12-06 07:35:50,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:50,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:50,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-06 07:35:50,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:50,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074882882] [2022-12-06 07:35:50,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074882882] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:50,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:50,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:50,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068303420] [2022-12-06 07:35:50,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:50,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:50,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:50,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:50,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:50,632 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:50,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:50,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:50,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:50,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:50,669 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:50,669 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:50,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:50,670 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:50,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:50,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:50,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:50,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:50,670 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:50,670 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:50,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:50,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:50,671 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:50,671 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:50,671 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:50,671 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:50,671 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:50,671 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:50,671 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:50,672 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:50,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:50,674 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:50,674 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:50,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:50,674 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:50,674 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:50,748 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:50,750 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:50,750 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:50,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:50,750 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:50,750 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:50,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3281 [2022-12-06 07:35:50,750 INFO L420 AbstractCegarLoop]: === Iteration 3283 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:50,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:50,750 INFO L85 PathProgramCache]: Analyzing trace with hash 850048977, now seen corresponding path program 1 times [2022-12-06 07:35:50,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:50,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266426425] [2022-12-06 07:35:50,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:50,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:50,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-06 07:35:50,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:50,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266426425] [2022-12-06 07:35:50,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266426425] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:50,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:50,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:50,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373390836] [2022-12-06 07:35:50,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:50,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:50,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:50,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:50,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:50,827 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:50,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:50,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:50,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:50,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:50,868 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:50,868 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:50,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:50,868 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:50,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:50,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:50,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:50,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:50,869 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:50,869 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:50,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:50,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:50,869 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:50,869 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:50,870 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:50,870 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:50,870 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:50,870 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:50,870 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:50,870 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:50,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:50,884 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:50,884 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:50,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:50,884 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:50,884 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:50,958 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:50,960 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-06 07:35:50,960 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:50,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:50,960 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:50,960 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:50,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3282 [2022-12-06 07:35:50,961 INFO L420 AbstractCegarLoop]: === Iteration 3284 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:50,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:50,961 INFO L85 PathProgramCache]: Analyzing trace with hash 880525170, now seen corresponding path program 1 times [2022-12-06 07:35:50,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:50,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846945031] [2022-12-06 07:35:50,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:50,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:51,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:51,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:51,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846945031] [2022-12-06 07:35:51,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846945031] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:51,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:51,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:51,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629376369] [2022-12-06 07:35:51,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:51,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:51,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:51,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:51,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:51,029 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:51,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:51,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:51,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:51,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:51,070 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:51,070 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:51,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:51,070 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:51,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:51,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:51,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:51,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:51,071 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:51,071 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:51,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:51,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:51,072 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:51,072 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:51,072 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:51,072 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:51,072 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:51,072 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:51,072 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:51,072 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:51,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:51,074 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:51,074 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:51,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:51,075 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:51,075 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:51,151 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:51,152 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:35:51,152 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:51,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:51,152 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:51,152 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:51,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3283 [2022-12-06 07:35:51,152 INFO L420 AbstractCegarLoop]: === Iteration 3285 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:51,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:51,152 INFO L85 PathProgramCache]: Analyzing trace with hash 907307279, now seen corresponding path program 1 times [2022-12-06 07:35:51,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:51,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959753441] [2022-12-06 07:35:51,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:51,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:51,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-06 07:35:51,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:51,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959753441] [2022-12-06 07:35:51,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959753441] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:51,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:51,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:51,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507496799] [2022-12-06 07:35:51,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:51,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:51,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:51,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:51,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:51,226 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:51,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:51,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:51,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:51,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:51,267 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:51,267 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:51,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:51,267 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:51,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:51,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:51,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:51,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:51,268 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:51,268 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:51,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:51,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:51,269 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:51,269 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:51,269 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:51,269 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:51,269 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:51,269 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:51,269 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:51,269 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:51,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:51,271 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:51,271 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:51,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:51,272 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:51,272 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:51,347 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:51,349 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:35:51,349 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:51,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:51,349 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:51,349 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:51,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3284 [2022-12-06 07:35:51,349 INFO L420 AbstractCegarLoop]: === Iteration 3286 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:51,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:51,349 INFO L85 PathProgramCache]: Analyzing trace with hash 937783472, now seen corresponding path program 1 times [2022-12-06 07:35:51,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:51,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373520444] [2022-12-06 07:35:51,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:51,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:51,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35: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-06 07:35:51,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:51,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373520444] [2022-12-06 07:35:51,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373520444] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:51,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:51,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:51,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195704415] [2022-12-06 07:35:51,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:51,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:51,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:51,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:51,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:51,419 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:51,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:51,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:51,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:51,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:51,461 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:51,461 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:51,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 349 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:51,461 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:51,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:51,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:51,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:51,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:51,462 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:51,462 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:51,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:51,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:51,463 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:51,463 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:51,463 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:51,463 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:51,463 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:51,463 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:51,463 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:51,463 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:51,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:51,465 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:51,465 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:51,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:51,466 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:51,466 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:51,540 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:51,542 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:51,542 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:51,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:51,542 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:51,542 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:51,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3285 [2022-12-06 07:35:51,542 INFO L420 AbstractCegarLoop]: === Iteration 3287 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:51,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:51,542 INFO L85 PathProgramCache]: Analyzing trace with hash 964565581, now seen corresponding path program 1 times [2022-12-06 07:35:51,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:51,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626472947] [2022-12-06 07:35:51,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:51,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:51,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-06 07:35:51,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:51,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626472947] [2022-12-06 07:35:51,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626472947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:51,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:51,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:51,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861043117] [2022-12-06 07:35:51,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:51,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:51,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:51,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:51,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:51,616 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:51,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:51,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:51,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:51,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:51,652 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:51,652 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:51,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:51,652 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:51,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:51,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:51,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:51,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:51,653 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:51,653 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:51,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:51,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:51,653 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:51,653 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:51,654 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:51,654 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:51,654 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:51,654 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:51,654 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:51,654 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:51,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:51,656 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:51,656 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:51,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:51,656 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:51,656 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:51,732 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:51,733 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:51,733 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:51,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:51,733 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:51,733 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:51,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3286 [2022-12-06 07:35:51,734 INFO L420 AbstractCegarLoop]: === Iteration 3288 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:51,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:51,734 INFO L85 PathProgramCache]: Analyzing trace with hash 995041774, now seen corresponding path program 1 times [2022-12-06 07:35:51,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:51,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757351298] [2022-12-06 07:35:51,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:51,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:51,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-06 07:35:51,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:51,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757351298] [2022-12-06 07:35:51,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757351298] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:51,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:51,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:51,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796851159] [2022-12-06 07:35:51,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:51,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:51,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:51,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:51,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:51,801 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:51,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:51,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:51,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:51,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:51,837 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:51,837 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:51,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:51,838 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:51,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:51,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:51,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:51,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:51,838 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:51,838 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:51,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:51,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:51,839 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:51,839 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:51,839 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:51,839 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:51,839 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:51,840 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:51,840 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:51,840 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:51,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:51,842 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:51,842 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:51,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:51,842 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:51,842 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:51,917 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:51,918 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:51,918 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:51,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:51,918 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:51,918 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:51,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3287 [2022-12-06 07:35:51,919 INFO L420 AbstractCegarLoop]: === Iteration 3289 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:51,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:51,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1021823883, now seen corresponding path program 1 times [2022-12-06 07:35:51,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:51,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019545097] [2022-12-06 07:35:51,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:51,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:51,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-06 07:35:51,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:51,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019545097] [2022-12-06 07:35:51,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019545097] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:51,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:51,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:51,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224541030] [2022-12-06 07:35:51,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:51,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:51,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:51,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:51,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:51,990 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:51,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:51,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:51,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:51,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:52,029 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:52,029 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:52,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 370 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:52,029 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:52,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:52,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:52,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:52,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:52,030 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:52,030 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:52,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:52,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:52,030 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:52,030 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:52,031 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:52,031 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:52,031 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:52,031 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:52,031 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:52,031 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:52,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:52,033 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:52,033 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:52,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:52,033 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:52,033 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:52,108 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:52,109 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:52,109 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:52,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:52,109 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:52,110 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:52,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3288 [2022-12-06 07:35:52,110 INFO L420 AbstractCegarLoop]: === Iteration 3290 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:52,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:52,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1052300076, now seen corresponding path program 1 times [2022-12-06 07:35:52,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:52,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313725089] [2022-12-06 07:35:52,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:52,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:52,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:52,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-06 07:35:52,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:52,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313725089] [2022-12-06 07:35:52,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313725089] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:52,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:52,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:52,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491900269] [2022-12-06 07:35:52,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:52,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:52,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:52,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:52,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:52,192 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:52,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:52,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:52,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:52,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:52,233 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:52,233 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:52,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:52,234 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:52,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:52,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:52,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:52,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:52,234 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:52,234 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:52,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:52,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:52,235 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:52,235 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:52,235 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:52,235 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:52,235 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:52,236 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:52,236 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:52,236 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:52,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:52,238 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:52,238 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:52,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:52,238 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:52,238 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:52,314 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:52,315 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:35:52,315 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:52,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:52,315 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:52,315 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:52,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3289 [2022-12-06 07:35:52,315 INFO L420 AbstractCegarLoop]: === Iteration 3291 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:52,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:52,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1079082185, now seen corresponding path program 1 times [2022-12-06 07:35:52,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:52,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575643172] [2022-12-06 07:35:52,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:52,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:52,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:52,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-06 07:35:52,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:52,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575643172] [2022-12-06 07:35:52,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575643172] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:52,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:52,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:52,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215499675] [2022-12-06 07:35:52,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:52,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:52,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:52,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:52,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:52,386 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:52,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:52,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:52,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:52,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:52,422 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:52,422 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:52,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:52,423 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:52,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:52,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:52,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:52,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:52,423 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:52,423 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:52,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:52,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:52,424 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:52,424 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:52,424 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:52,424 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:52,424 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:52,424 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:52,425 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:52,425 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:52,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:52,427 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:52,427 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:52,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:52,427 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:52,427 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:52,502 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:52,504 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:35:52,504 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:52,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:52,504 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:52,504 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:52,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3290 [2022-12-06 07:35:52,504 INFO L420 AbstractCegarLoop]: === Iteration 3292 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:52,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:52,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1109558378, now seen corresponding path program 1 times [2022-12-06 07:35:52,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:52,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759574970] [2022-12-06 07:35:52,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:52,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:52,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:52,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-06 07:35:52,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:52,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759574970] [2022-12-06 07:35:52,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759574970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:52,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:52,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:52,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321404465] [2022-12-06 07:35:52,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:52,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:52,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:52,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:52,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:52,573 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:52,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:52,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:52,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:52,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:52,615 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:52,615 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:52,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:52,616 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:52,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:52,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:52,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:52,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:52,616 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:52,616 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:52,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:52,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:52,617 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:52,617 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:52,617 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:52,617 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:52,617 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:52,617 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:52,617 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:52,617 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:52,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:52,620 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:52,620 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:52,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:52,620 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:52,620 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:52,694 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:52,695 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:52,696 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:52,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:52,696 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:52,696 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:52,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3291 [2022-12-06 07:35:52,696 INFO L420 AbstractCegarLoop]: === Iteration 3293 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:52,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:52,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1136340487, now seen corresponding path program 1 times [2022-12-06 07:35:52,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:52,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139626540] [2022-12-06 07:35:52,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:52,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:52,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:52,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:52,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:52,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139626540] [2022-12-06 07:35:52,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139626540] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:52,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:52,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:52,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10723270] [2022-12-06 07:35:52,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:52,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:52,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:52,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:52,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:52,765 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:52,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:52,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:52,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:52,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:52,799 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:52,800 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:52,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:52,800 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:52,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:52,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:52,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:52,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:52,801 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:52,801 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:52,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:52,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:52,801 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:52,801 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:52,801 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:52,801 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:52,802 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:52,802 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:52,802 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:52,802 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:52,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:52,804 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:52,804 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:52,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:52,804 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:52,804 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:52,877 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:52,879 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:52,879 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:52,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:52,879 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:52,879 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:52,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3292 [2022-12-06 07:35:52,879 INFO L420 AbstractCegarLoop]: === Iteration 3294 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:52,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:52,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1166816680, now seen corresponding path program 1 times [2022-12-06 07:35:52,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:52,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396612330] [2022-12-06 07:35:52,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:52,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:52,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-06 07:35:52,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:52,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396612330] [2022-12-06 07:35:52,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396612330] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:52,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:52,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:52,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194978097] [2022-12-06 07:35:52,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:52,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:52,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:52,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:52,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:52,948 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:52,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:52,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:52,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:52,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:52,984 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:52,984 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:52,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:52,984 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:52,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:52,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:52,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:52,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:52,985 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:52,985 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:52,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:52,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:52,985 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:52,985 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:52,986 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:52,986 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:52,986 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:52,986 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:52,986 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:52,986 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:52,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:52,988 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:52,988 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:52,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:52,988 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:52,989 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:53,063 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:53,064 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:53,064 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:53,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:53,064 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:53,065 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:53,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3293 [2022-12-06 07:35:53,065 INFO L420 AbstractCegarLoop]: === Iteration 3295 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:53,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:53,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1193598789, now seen corresponding path program 1 times [2022-12-06 07:35:53,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:53,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162863657] [2022-12-06 07:35:53,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:53,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:53,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-06 07:35:53,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:53,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162863657] [2022-12-06 07:35:53,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162863657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:53,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:53,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:53,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57413628] [2022-12-06 07:35:53,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:53,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:53,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:53,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:53,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:53,135 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:53,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:53,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:53,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:53,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:53,176 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:53,176 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:53,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:53,177 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:53,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:53,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:53,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:53,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:53,177 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:53,177 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:53,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:53,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:53,178 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:53,178 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:53,178 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:53,178 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:53,178 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:53,178 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:53,178 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:53,178 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:53,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:53,180 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:53,181 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:53,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:53,181 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:53,181 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:53,253 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:53,255 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:53,255 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:53,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:53,255 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:53,255 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:53,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3294 [2022-12-06 07:35:53,255 INFO L420 AbstractCegarLoop]: === Iteration 3296 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:53,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:53,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1224074982, now seen corresponding path program 1 times [2022-12-06 07:35:53,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:53,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622494942] [2022-12-06 07:35:53,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:53,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:53,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-06 07:35:53,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:53,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622494942] [2022-12-06 07:35:53,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622494942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:53,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:53,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:53,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502319627] [2022-12-06 07:35:53,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:53,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:53,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:53,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:53,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:53,338 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:53,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:53,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:53,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:53,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:53,378 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:53,379 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:53,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:53,379 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:53,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:53,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:53,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:53,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:53,380 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:53,380 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:53,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:53,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:53,380 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:53,380 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:53,381 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:53,381 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:53,381 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:53,381 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:53,381 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:53,381 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:53,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:53,383 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:53,383 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:53,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:53,383 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:53,383 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:53,457 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:53,458 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:53,458 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:53,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:53,458 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:53,458 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:53,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3295 [2022-12-06 07:35:53,458 INFO L420 AbstractCegarLoop]: === Iteration 3297 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:53,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:53,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1250857091, now seen corresponding path program 1 times [2022-12-06 07:35:53,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:53,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793029158] [2022-12-06 07:35:53,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:53,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:53,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-06 07:35:53,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:53,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793029158] [2022-12-06 07:35:53,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793029158] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:53,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:53,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:53,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180085302] [2022-12-06 07:35:53,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:53,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:53,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:53,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:53,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:53,530 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:53,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:53,530 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:53,530 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:53,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:53,570 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:53,570 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:53,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:53,571 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:53,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:53,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:53,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:53,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:53,571 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:53,571 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:53,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:53,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:53,572 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:53,572 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:53,572 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:53,572 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:53,572 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:53,573 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:53,573 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:53,573 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:53,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:53,575 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:53,575 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:53,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:53,575 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:53,575 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:53,648 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:53,650 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:53,650 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:53,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:53,650 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:53,650 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:53,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3296 [2022-12-06 07:35:53,650 INFO L420 AbstractCegarLoop]: === Iteration 3298 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:53,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:53,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1281333284, now seen corresponding path program 1 times [2022-12-06 07:35:53,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:53,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577808684] [2022-12-06 07:35:53,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:53,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:53,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:53,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-06 07:35:53,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:53,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577808684] [2022-12-06 07:35:53,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577808684] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:53,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:53,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:53,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140000084] [2022-12-06 07:35:53,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:53,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:53,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:53,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:53,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:53,725 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:53,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:53,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:53,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:53,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:53,763 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:53,763 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:53,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:53,763 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:53,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:53,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:53,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:53,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:53,764 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:53,764 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:53,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:53,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:53,765 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:53,765 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:53,765 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:53,765 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:53,765 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:53,765 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:53,765 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:53,765 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:53,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:53,767 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:53,767 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:53,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:53,768 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:53,768 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:53,842 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:53,843 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:53,843 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:53,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:53,843 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:53,843 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:53,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3297 [2022-12-06 07:35:53,843 INFO L420 AbstractCegarLoop]: === Iteration 3299 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:53,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:53,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1308115393, now seen corresponding path program 1 times [2022-12-06 07:35:53,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:53,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712938980] [2022-12-06 07:35:53,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:53,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:53,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-06 07:35:53,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:53,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712938980] [2022-12-06 07:35:53,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712938980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:53,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:53,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:53,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778146167] [2022-12-06 07:35:53,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:53,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:53,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:53,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:53,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:53,913 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:53,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:53,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:53,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:53,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:53,948 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:53,948 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:53,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:53,948 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:53,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:53,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:53,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:53,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:53,949 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:53,949 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:53,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:53,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:53,950 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:53,950 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:53,950 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:53,950 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:53,950 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:53,950 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:53,950 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:53,950 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:53,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:53,952 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:53,952 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:53,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:53,953 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:53,953 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:54,027 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:54,029 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:54,029 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:54,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:54,029 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:54,029 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:54,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3298 [2022-12-06 07:35:54,029 INFO L420 AbstractCegarLoop]: === Iteration 3300 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:54,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:54,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1338591586, now seen corresponding path program 1 times [2022-12-06 07:35:54,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:54,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77213043] [2022-12-06 07:35:54,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:54,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:54,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-06 07:35:54,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:54,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77213043] [2022-12-06 07:35:54,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77213043] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:54,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:54,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:54,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018222171] [2022-12-06 07:35:54,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:54,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:54,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:54,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:54,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:54,099 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:54,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:54,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:54,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:54,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:54,135 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:54,136 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:54,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:54,136 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:54,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:54,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:54,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:54,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:54,136 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:54,137 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:54,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:54,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:54,137 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:54,137 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:54,137 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:54,137 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:54,137 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:54,138 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:54,138 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:54,138 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:54,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:54,140 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:54,140 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:54,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:54,140 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:54,140 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:54,214 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:54,216 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:54,216 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:54,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:54,216 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:54,216 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:54,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3299 [2022-12-06 07:35:54,216 INFO L420 AbstractCegarLoop]: === Iteration 3301 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:54,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:54,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1365373695, now seen corresponding path program 1 times [2022-12-06 07:35:54,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:54,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165639028] [2022-12-06 07:35:54,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:54,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:54,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-06 07:35:54,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:54,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165639028] [2022-12-06 07:35:54,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165639028] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:54,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:54,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:54,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104211635] [2022-12-06 07:35:54,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:54,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:54,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:54,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:54,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:54,283 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:54,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:54,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:54,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:54,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:54,320 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:54,321 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:54,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:54,321 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:54,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:54,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:54,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:54,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:54,322 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:54,322 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:54,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:54,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:54,322 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:54,322 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:54,323 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:54,323 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:54,323 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:54,323 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:54,323 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:54,323 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:54,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:54,325 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:54,325 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:54,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:54,325 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:54,326 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:54,399 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:54,401 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:54,401 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:54,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:54,401 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:54,401 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:54,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3300 [2022-12-06 07:35:54,401 INFO L420 AbstractCegarLoop]: === Iteration 3302 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:54,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:54,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1395849888, now seen corresponding path program 1 times [2022-12-06 07:35:54,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:54,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054183430] [2022-12-06 07:35:54,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:54,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:54,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-06 07:35:54,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:54,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054183430] [2022-12-06 07:35:54,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054183430] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:54,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:54,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:54,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565217491] [2022-12-06 07:35:54,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:54,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:54,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:54,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:54,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:54,468 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:54,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:54,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:54,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:54,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:54,504 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:54,504 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:54,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:54,504 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:54,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:54,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:54,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:54,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:54,505 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:54,505 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:54,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:54,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:54,506 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:54,506 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:54,506 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:54,506 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:54,506 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:54,506 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:54,506 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:54,506 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:54,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:54,508 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:54,508 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:54,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:54,509 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:54,509 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:54,584 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:54,585 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:54,585 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:54,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:54,585 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:54,585 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:54,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3301 [2022-12-06 07:35:54,585 INFO L420 AbstractCegarLoop]: === Iteration 3303 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:54,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:54,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1422631997, now seen corresponding path program 1 times [2022-12-06 07:35:54,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:54,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226199101] [2022-12-06 07:35:54,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:54,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:54,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-06 07:35:54,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:54,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226199101] [2022-12-06 07:35:54,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226199101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:54,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:54,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:54,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129562254] [2022-12-06 07:35:54,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:54,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:54,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:54,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:54,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:54,663 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:54,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:54,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:54,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:54,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:54,703 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:54,704 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:54,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:54,704 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:54,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:54,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:54,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:54,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:54,704 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:54,705 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:54,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:54,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:54,705 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:54,705 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:54,705 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:54,705 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:54,706 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:54,706 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:54,706 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:54,706 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:54,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:54,708 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:54,708 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:54,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:54,708 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:54,708 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:54,781 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:54,783 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:54,783 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:54,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:54,783 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:54,783 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:54,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3302 [2022-12-06 07:35:54,783 INFO L420 AbstractCegarLoop]: === Iteration 3304 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:54,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:54,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1453108190, now seen corresponding path program 1 times [2022-12-06 07:35:54,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:54,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110082485] [2022-12-06 07:35:54,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:54,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:54,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-06 07:35:54,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:54,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110082485] [2022-12-06 07:35:54,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110082485] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:54,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:54,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:54,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314218530] [2022-12-06 07:35:54,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:54,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:54,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:54,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:54,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:54,850 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:54,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:54,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:54,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:54,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:54,893 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:54,893 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:54,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:54,893 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:54,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:54,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:54,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:54,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:54,894 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:54,894 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:54,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:54,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:54,894 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:54,895 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:54,895 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:54,895 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:54,895 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:54,895 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:54,895 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:54,895 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:54,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:54,897 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:54,897 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:54,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:54,898 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:54,898 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:54,973 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:54,974 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:54,974 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:54,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:54,974 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:54,974 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:54,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3303 [2022-12-06 07:35:54,974 INFO L420 AbstractCegarLoop]: === Iteration 3305 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:54,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:54,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1479890299, now seen corresponding path program 1 times [2022-12-06 07:35:54,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:54,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851074503] [2022-12-06 07:35:54,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:54,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:55,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-06 07:35:55,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:55,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851074503] [2022-12-06 07:35:55,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851074503] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:55,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:55,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:55,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104996545] [2022-12-06 07:35:55,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:55,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:55,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:55,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:55,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:55,045 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:55,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:55,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:55,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:55,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:55,081 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:55,081 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:55,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:55,081 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:55,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:55,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:55,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:55,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:55,082 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:55,082 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:55,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:55,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:55,083 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:55,083 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:55,083 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:55,083 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:55,083 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:55,083 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:55,083 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:55,083 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:55,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:55,085 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:55,086 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:55,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:55,086 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:55,086 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:55,161 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:55,162 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:55,162 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:55,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:55,162 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:55,162 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:55,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3304 [2022-12-06 07:35:55,162 INFO L420 AbstractCegarLoop]: === Iteration 3306 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:55,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:55,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1510366492, now seen corresponding path program 1 times [2022-12-06 07:35:55,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:55,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869763806] [2022-12-06 07:35:55,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:55,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:55,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-06 07:35:55,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:55,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869763806] [2022-12-06 07:35:55,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869763806] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:55,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:55,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:55,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580957270] [2022-12-06 07:35:55,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:55,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:55,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:55,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:55,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:55,231 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:55,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:55,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:55,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:55,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:55,272 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:55,272 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:55,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:55,273 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:55,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:55,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:55,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:55,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:55,273 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:55,273 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:55,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:55,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:55,274 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:55,274 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:55,274 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:55,274 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:55,274 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:55,274 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:55,274 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:55,274 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:55,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:55,277 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:55,277 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:55,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:55,277 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:55,277 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:55,352 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:55,354 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:35:55,354 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:55,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:55,354 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:55,354 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:55,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3305 [2022-12-06 07:35:55,354 INFO L420 AbstractCegarLoop]: === Iteration 3307 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:55,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:55,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1537148601, now seen corresponding path program 1 times [2022-12-06 07:35:55,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:55,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110061376] [2022-12-06 07:35:55,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:55,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:55,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-06 07:35:55,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:55,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110061376] [2022-12-06 07:35:55,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110061376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:55,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:55,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:55,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618298643] [2022-12-06 07:35:55,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:55,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:55,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:55,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:55,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:55,429 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:55,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:55,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:55,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:55,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:55,464 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:55,465 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:55,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:55,465 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:55,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:55,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:55,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:55,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:55,465 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:55,466 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:55,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:55,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:55,466 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:55,466 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:55,466 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:55,466 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:55,466 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:55,467 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:55,467 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:55,467 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:55,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:55,469 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:55,469 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:55,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:55,469 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:55,469 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:55,556 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:55,557 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-06 07:35:55,557 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:55,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:55,557 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:55,557 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:55,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3306 [2022-12-06 07:35:55,558 INFO L420 AbstractCegarLoop]: === Iteration 3308 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:55,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:55,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1567624794, now seen corresponding path program 1 times [2022-12-06 07:35:55,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:55,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496159722] [2022-12-06 07:35:55,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:55,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:55,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-06 07:35:55,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:55,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496159722] [2022-12-06 07:35:55,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496159722] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:55,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:55,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:55,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903812734] [2022-12-06 07:35:55,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:55,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:55,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:55,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:55,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:55,628 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:55,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:55,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:55,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:55,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:55,670 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:55,671 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:55,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:55,671 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:55,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:55,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:55,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:55,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:55,672 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:55,672 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:55,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:55,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:55,672 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:55,672 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:55,673 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:55,673 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:55,673 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:55,673 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:55,673 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:55,673 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:55,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:55,675 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:55,675 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:55,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:55,675 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:55,675 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:55,750 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:55,751 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:55,751 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:55,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:55,751 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:55,751 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:55,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3307 [2022-12-06 07:35:55,751 INFO L420 AbstractCegarLoop]: === Iteration 3309 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:55,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:55,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1594406903, now seen corresponding path program 1 times [2022-12-06 07:35:55,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:55,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553629640] [2022-12-06 07:35:55,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:55,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:55,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-06 07:35:55,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:55,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553629640] [2022-12-06 07:35:55,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553629640] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:55,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:55,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:55,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910847782] [2022-12-06 07:35:55,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:55,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:55,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:55,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:55,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:55,842 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:55,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:55,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:55,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:55,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:55,877 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:55,877 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:55,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:55,878 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:55,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:55,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:55,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:55,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:55,878 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:55,878 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:55,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:55,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:55,879 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:55,879 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:55,879 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:55,879 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:55,879 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:55,879 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:55,879 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:55,879 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:55,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:55,882 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:55,882 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:55,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:55,882 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:55,882 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:55,959 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:55,960 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:35:55,960 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:55,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:55,960 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:55,960 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:55,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3308 [2022-12-06 07:35:55,960 INFO L420 AbstractCegarLoop]: === Iteration 3310 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:55,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:55,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1624883096, now seen corresponding path program 1 times [2022-12-06 07:35:55,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:55,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217327644] [2022-12-06 07:35:55,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:55,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:56,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-06 07:35:56,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:56,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217327644] [2022-12-06 07:35:56,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217327644] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:56,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:56,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:56,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149144008] [2022-12-06 07:35:56,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:56,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:56,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:56,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:56,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:56,028 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:56,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:56,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:56,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:56,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:56,072 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:56,072 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:56,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:56,072 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:56,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:56,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:56,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:56,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:56,073 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:56,073 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:56,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:56,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:56,074 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:56,074 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:56,074 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:56,074 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:56,074 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:56,074 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:56,074 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:56,074 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:56,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:56,076 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:56,076 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:56,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:56,077 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:56,077 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:56,152 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:56,154 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:35:56,154 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:56,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:56,154 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:56,154 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:56,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3309 [2022-12-06 07:35:56,154 INFO L420 AbstractCegarLoop]: === Iteration 3311 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:56,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:56,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1651665205, now seen corresponding path program 1 times [2022-12-06 07:35:56,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:56,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383101659] [2022-12-06 07:35:56,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:56,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:56,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-06 07:35:56,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:56,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383101659] [2022-12-06 07:35:56,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383101659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:56,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:56,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:56,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460068893] [2022-12-06 07:35:56,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:56,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:56,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:56,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:56,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:56,226 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:56,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:56,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:56,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:56,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:56,267 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:56,267 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:56,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 372 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:56,268 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:56,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:56,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:56,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:56,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:56,268 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:56,268 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:56,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:56,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:56,269 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:56,269 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:56,269 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:56,269 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:56,269 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:56,269 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:56,269 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:56,269 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:56,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:56,272 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:56,272 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:56,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:56,272 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:56,272 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:56,345 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:56,346 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:56,347 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:56,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:56,347 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:56,347 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:56,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3310 [2022-12-06 07:35:56,347 INFO L420 AbstractCegarLoop]: === Iteration 3312 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:56,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:56,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1682141398, now seen corresponding path program 1 times [2022-12-06 07:35:56,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:56,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876799396] [2022-12-06 07:35:56,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:56,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:56,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-06 07:35:56,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:56,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876799396] [2022-12-06 07:35:56,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876799396] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:56,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:56,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:56,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774783291] [2022-12-06 07:35:56,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:56,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:56,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:56,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:56,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:56,415 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:56,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:56,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:56,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:56,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:56,452 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:56,452 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:56,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:56,453 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:56,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:56,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:56,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:56,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:56,453 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:56,453 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:56,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:56,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:56,454 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:56,454 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:56,454 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:56,454 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:56,454 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:56,455 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:56,455 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:56,455 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:56,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:56,457 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:56,457 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:56,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:56,457 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:56,457 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:56,530 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:56,532 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:56,532 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:56,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:56,532 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:56,532 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:56,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3311 [2022-12-06 07:35:56,532 INFO L420 AbstractCegarLoop]: === Iteration 3313 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:56,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:56,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1708923507, now seen corresponding path program 1 times [2022-12-06 07:35:56,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:56,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615061948] [2022-12-06 07:35:56,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:56,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:56,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:56,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-06 07:35:56,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:56,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615061948] [2022-12-06 07:35:56,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615061948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:56,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:56,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:56,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629225556] [2022-12-06 07:35:56,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:56,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:56,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:56,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:56,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:56,603 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:56,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:56,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:56,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:56,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:56,642 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:56,642 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:56,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:56,642 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:56,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:56,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:56,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:56,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:56,643 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:56,643 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:56,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:56,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:56,644 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:56,644 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:56,644 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:56,644 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:56,644 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:56,644 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:56,644 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:56,644 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:56,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:56,646 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:56,646 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:56,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:56,647 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:56,647 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:56,718 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:56,719 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:35:56,719 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:56,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:56,719 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:56,719 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:56,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3312 [2022-12-06 07:35:56,719 INFO L420 AbstractCegarLoop]: === Iteration 3314 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:56,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:56,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1739399700, now seen corresponding path program 1 times [2022-12-06 07:35:56,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:56,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357549176] [2022-12-06 07:35:56,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:56,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:56,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:56,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:56,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357549176] [2022-12-06 07:35:56,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357549176] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:56,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:56,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:56,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983805965] [2022-12-06 07:35:56,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:56,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:56,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:56,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:56,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:56,786 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:56,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:56,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:56,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:56,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:56,821 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:56,821 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:56,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:56,822 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:56,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:56,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:56,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:56,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:56,822 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:56,822 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:56,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:56,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:56,823 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:56,823 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:56,823 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:56,823 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:56,823 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:56,823 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:56,823 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:56,823 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:56,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:56,826 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:56,826 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:56,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:56,826 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:56,826 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:56,901 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:56,902 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:56,902 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:56,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:56,902 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:56,902 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:56,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3313 [2022-12-06 07:35:56,902 INFO L420 AbstractCegarLoop]: === Iteration 3315 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:56,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:56,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1766181809, now seen corresponding path program 1 times [2022-12-06 07:35:56,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:56,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5379169] [2022-12-06 07:35:56,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:56,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:56,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-06 07:35:56,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:56,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5379169] [2022-12-06 07:35:56,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5379169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:56,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:56,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:56,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332577440] [2022-12-06 07:35:56,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:56,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:56,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:56,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:56,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:56,989 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:56,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:56,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:56,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:56,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:57,029 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:57,030 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:57,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 356 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:57,030 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:57,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:57,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:57,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:57,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:57,030 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:57,031 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:57,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:57,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:57,031 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:57,031 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:57,031 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:57,031 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:57,032 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:57,032 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:57,032 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:57,032 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:57,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:57,034 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:57,034 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:57,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:57,034 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:57,034 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:57,108 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:57,110 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:57,110 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:57,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:57,110 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:57,110 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:57,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3314 [2022-12-06 07:35:57,110 INFO L420 AbstractCegarLoop]: === Iteration 3316 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:57,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:57,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1796658002, now seen corresponding path program 1 times [2022-12-06 07:35:57,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:57,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175744790] [2022-12-06 07:35:57,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:57,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:57,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:57,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-06 07:35:57,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:57,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175744790] [2022-12-06 07:35:57,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175744790] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:57,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:57,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:57,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40350307] [2022-12-06 07:35:57,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:57,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:57,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:57,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:57,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:57,177 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:57,178 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:57,178 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:57,178 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:57,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:57,214 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:57,214 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:35:57,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:57,214 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:57,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:57,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:57,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:57,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:57,215 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:57,215 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:57,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:57,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:57,215 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:57,216 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:57,216 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:57,216 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:57,216 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:57,216 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:57,216 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:57,216 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:57,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:57,218 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:57,218 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:57,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:57,218 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:57,218 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:57,295 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:57,296 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:35:57,296 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:57,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:57,296 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:57,296 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:57,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3315 [2022-12-06 07:35:57,297 INFO L420 AbstractCegarLoop]: === Iteration 3317 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:57,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:57,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1823440111, now seen corresponding path program 1 times [2022-12-06 07:35:57,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:57,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897770299] [2022-12-06 07:35:57,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:57,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:57,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-06 07:35:57,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:57,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897770299] [2022-12-06 07:35:57,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897770299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:57,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:57,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:57,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181369535] [2022-12-06 07:35:57,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:57,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:57,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:57,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:57,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:57,366 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:57,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:57,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:57,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:57,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:57,402 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:57,402 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:57,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:57,403 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:57,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:57,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:57,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:57,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:57,403 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:57,403 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:57,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:57,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:57,404 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:57,404 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:57,404 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:57,404 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:57,404 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:57,404 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:57,404 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:57,405 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:57,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:57,407 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:57,407 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:57,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:57,407 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:57,407 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:57,480 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:57,482 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:57,482 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:57,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:57,482 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:57,482 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:57,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3316 [2022-12-06 07:35:57,482 INFO L420 AbstractCegarLoop]: === Iteration 3318 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:57,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:57,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1853916304, now seen corresponding path program 1 times [2022-12-06 07:35:57,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:57,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075486070] [2022-12-06 07:35:57,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:57,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:57,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-06 07:35:57,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:57,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075486070] [2022-12-06 07:35:57,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075486070] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:57,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:57,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:57,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343106556] [2022-12-06 07:35:57,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:57,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:57,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:57,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:57,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:57,551 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:57,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:57,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:57,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:57,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:57,593 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:57,593 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:57,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:57,594 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:57,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:57,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:57,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:57,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:57,595 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:57,595 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:57,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:57,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:57,595 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:57,595 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:57,595 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:57,596 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:57,596 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:57,596 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:57,596 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:57,596 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:57,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:57,598 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:57,598 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:57,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:57,598 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:57,598 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:57,673 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:57,674 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:57,675 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:57,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:57,675 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:57,675 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:57,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3317 [2022-12-06 07:35:57,675 INFO L420 AbstractCegarLoop]: === Iteration 3319 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:57,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:57,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1880698413, now seen corresponding path program 1 times [2022-12-06 07:35:57,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:57,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757996204] [2022-12-06 07:35:57,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:57,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:57,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-06 07:35:57,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:57,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757996204] [2022-12-06 07:35:57,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757996204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:57,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:57,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:57,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914620139] [2022-12-06 07:35:57,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:57,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:57,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:57,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:57,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:57,745 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:57,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:57,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:57,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:57,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:57,781 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:57,781 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:57,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:57,781 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:57,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:57,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:57,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:57,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:57,782 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:57,782 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:57,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:57,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:57,783 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:57,783 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:57,783 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:57,783 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:57,783 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:57,783 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:57,783 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:57,783 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:57,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:57,785 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:57,785 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:57,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:57,786 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:57,786 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:57,860 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:57,861 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:57,861 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:57,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:57,861 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:57,861 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:57,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3318 [2022-12-06 07:35:57,861 INFO L420 AbstractCegarLoop]: === Iteration 3320 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:57,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:57,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1911174606, now seen corresponding path program 1 times [2022-12-06 07:35:57,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:57,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049900648] [2022-12-06 07:35:57,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:57,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:57,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-06 07:35:57,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:57,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049900648] [2022-12-06 07:35:57,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049900648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:57,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:57,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:57,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766466775] [2022-12-06 07:35:57,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:57,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:57,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:57,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:57,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:57,929 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:57,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:57,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:57,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:57,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:57,966 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:57,966 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:57,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:57,967 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:57,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:57,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:57,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:57,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:57,967 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:57,967 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:57,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:57,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:57,968 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:57,968 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:57,968 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:57,968 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:57,968 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:57,969 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:57,969 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:57,969 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:57,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:57,971 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:57,971 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:57,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:57,971 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:57,971 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:58,045 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:58,047 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:58,047 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:58,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:58,047 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:58,047 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:58,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3319 [2022-12-06 07:35:58,047 INFO L420 AbstractCegarLoop]: === Iteration 3321 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:58,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:58,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1937956715, now seen corresponding path program 1 times [2022-12-06 07:35:58,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:58,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056989634] [2022-12-06 07:35:58,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:58,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:58,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-06 07:35:58,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:58,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056989634] [2022-12-06 07:35:58,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056989634] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:58,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:58,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:58,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330939211] [2022-12-06 07:35:58,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:58,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:58,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:58,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:58,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:58,118 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:58,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:58,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:58,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:58,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:58,153 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:58,153 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:58,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:58,154 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:58,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:58,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:58,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:58,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:58,154 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:58,154 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:58,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:58,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:58,155 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:58,155 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:58,155 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:58,155 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:58,155 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:58,155 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:58,156 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:58,156 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:58,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:58,158 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:58,158 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:58,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:58,158 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:58,158 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:58,233 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:58,234 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:58,234 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:58,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:58,234 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:58,234 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:58,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3320 [2022-12-06 07:35:58,234 INFO L420 AbstractCegarLoop]: === Iteration 3322 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:58,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:58,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1968432908, now seen corresponding path program 1 times [2022-12-06 07:35:58,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:58,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749914245] [2022-12-06 07:35:58,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:58,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:58,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-06 07:35:58,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:58,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749914245] [2022-12-06 07:35:58,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749914245] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:58,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:58,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:58,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367613667] [2022-12-06 07:35:58,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:58,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:58,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:58,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:58,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:58,315 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:58,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:58,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:58,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:58,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:58,352 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:58,352 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:58,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:58,353 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:58,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:58,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:58,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:58,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:58,353 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:58,353 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:58,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:58,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:58,354 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:58,354 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:58,354 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:58,354 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:58,354 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:58,354 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:58,354 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:58,354 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:58,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:58,357 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:58,357 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:58,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:58,357 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:58,357 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:58,431 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:58,432 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:35:58,432 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:58,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:58,432 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:58,432 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:58,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3321 [2022-12-06 07:35:58,432 INFO L420 AbstractCegarLoop]: === Iteration 3323 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:58,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:58,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1995215017, now seen corresponding path program 1 times [2022-12-06 07:35:58,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:58,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980529980] [2022-12-06 07:35:58,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:58,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:58,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-06 07:35:58,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:58,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980529980] [2022-12-06 07:35:58,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980529980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:58,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:58,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:58,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853738959] [2022-12-06 07:35:58,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:58,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:58,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:58,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:58,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:58,502 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:58,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:58,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:58,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:58,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:58,543 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:58,543 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:58,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:58,544 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:58,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:58,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:58,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:58,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:58,544 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:58,544 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:58,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:58,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:58,545 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:58,545 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:58,545 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:58,545 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:58,545 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:58,545 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:58,545 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:58,545 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:58,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:58,548 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:58,548 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:58,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:58,548 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:58,548 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:58,623 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:58,625 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:35:58,625 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:58,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:58,625 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:58,625 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:58,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3322 [2022-12-06 07:35:58,625 INFO L420 AbstractCegarLoop]: === Iteration 3324 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:58,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:58,625 INFO L85 PathProgramCache]: Analyzing trace with hash 2025691210, now seen corresponding path program 1 times [2022-12-06 07:35:58,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:58,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443924857] [2022-12-06 07:35:58,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:58,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:58,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:58,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:58,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443924857] [2022-12-06 07:35:58,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443924857] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:58,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:58,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:58,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489614104] [2022-12-06 07:35:58,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:58,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:58,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:58,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:58,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:58,692 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:58,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:58,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:58,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:58,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:58,734 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:58,734 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:58,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:58,734 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:58,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:58,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:58,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:58,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:58,735 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:58,735 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:58,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:58,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:58,735 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:58,735 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:58,736 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:58,736 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:58,736 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:58,736 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:58,736 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:58,736 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:58,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:58,738 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:58,738 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:58,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:58,738 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:58,738 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:58,812 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:58,813 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:58,813 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:58,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:58,813 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:58,813 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:58,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3323 [2022-12-06 07:35:58,814 INFO L420 AbstractCegarLoop]: === Iteration 3325 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:58,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:58,814 INFO L85 PathProgramCache]: Analyzing trace with hash 2052473319, now seen corresponding path program 1 times [2022-12-06 07:35:58,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:58,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490894182] [2022-12-06 07:35:58,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:58,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:58,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-06 07:35:58,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:58,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490894182] [2022-12-06 07:35:58,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490894182] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:58,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:58,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:58,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814557702] [2022-12-06 07:35:58,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:58,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:58,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:58,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:58,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:58,880 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:58,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:58,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:58,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:58,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:58,917 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:58,917 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:58,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:58,917 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:58,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:58,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:58,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:58,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:58,918 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:58,918 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:58,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:58,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:58,919 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:58,919 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:58,919 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:58,919 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:58,919 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:58,919 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:58,919 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:58,920 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:58,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:58,922 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:58,922 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:58,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:58,922 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:58,922 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:58,997 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:58,998 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:58,998 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:58,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:58,998 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:58,998 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:58,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3324 [2022-12-06 07:35:58,999 INFO L420 AbstractCegarLoop]: === Iteration 3326 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:58,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:58,999 INFO L85 PathProgramCache]: Analyzing trace with hash 2082949512, now seen corresponding path program 1 times [2022-12-06 07:35:58,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:58,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375443696] [2022-12-06 07:35:58,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:58,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:59,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:59,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-06 07:35:59,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:59,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375443696] [2022-12-06 07:35:59,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375443696] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:59,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:59,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:59,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086683048] [2022-12-06 07:35:59,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:59,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:59,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:59,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:59,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:59,071 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:59,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:59,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:59,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:59,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:59,114 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:59,114 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:59,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:59,114 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:59,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:59,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:59,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:59,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:59,115 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:59,115 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:59,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:59,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:59,116 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:59,116 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:59,116 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:59,116 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:59,116 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:59,116 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:59,116 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:59,116 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:59,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:59,118 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:59,118 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:59,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:59,119 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:59,119 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:59,192 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:59,193 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:35:59,193 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:59,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:59,194 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:59,194 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:59,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3325 [2022-12-06 07:35:59,194 INFO L420 AbstractCegarLoop]: === Iteration 3327 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:59,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:59,194 INFO L85 PathProgramCache]: Analyzing trace with hash 2109731621, now seen corresponding path program 1 times [2022-12-06 07:35:59,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:59,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155170634] [2022-12-06 07:35:59,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:59,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:59,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:59,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:59,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:59,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155170634] [2022-12-06 07:35:59,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155170634] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:59,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:59,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:59,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156002022] [2022-12-06 07:35:59,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:59,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:59,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:59,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:59,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:59,272 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:59,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:59,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:59,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:59,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:59,312 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:59,312 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:59,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:59,313 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:59,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:59,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:59,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:59,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:59,313 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:59,313 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:59,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:59,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:59,314 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:59,314 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:59,314 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:59,314 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:59,315 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:59,315 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:59,315 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:59,315 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:59,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:59,318 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:59,318 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:59,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:59,319 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:59,319 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:59,409 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:59,412 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 07:35:59,412 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:59,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:59,412 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:59,412 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:59,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3326 [2022-12-06 07:35:59,412 INFO L420 AbstractCegarLoop]: === Iteration 3328 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:59,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:59,413 INFO L85 PathProgramCache]: Analyzing trace with hash 2140207814, now seen corresponding path program 1 times [2022-12-06 07:35:59,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:59,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357389261] [2022-12-06 07:35:59,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:59,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:59,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-06 07:35:59,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:59,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357389261] [2022-12-06 07:35:59,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357389261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:59,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:59,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:59,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060529705] [2022-12-06 07:35:59,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:59,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:59,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:59,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:59,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:59,528 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:59,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:59,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:59,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:59,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:59,585 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:59,585 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:59,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:59,585 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:59,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:59,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:59,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:59,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:59,586 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:59,586 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:59,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:59,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:59,587 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:59,587 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:59,587 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:59,588 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:59,588 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:59,588 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:59,588 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:59,588 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:59,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:59,591 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:59,591 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:59,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:59,591 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:59,591 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:35:59,666 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:59,667 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:35:59,668 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:35:59,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:59,668 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:59,668 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:59,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3327 [2022-12-06 07:35:59,668 INFO L420 AbstractCegarLoop]: === Iteration 3329 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:59,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:59,668 INFO L85 PathProgramCache]: Analyzing trace with hash -2127977373, now seen corresponding path program 1 times [2022-12-06 07:35:59,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:59,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023991545] [2022-12-06 07:35:59,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:59,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:59,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-06 07:35:59,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:59,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023991545] [2022-12-06 07:35:59,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023991545] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:59,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:59,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:59,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316477780] [2022-12-06 07:35:59,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:59,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:59,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:59,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:59,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:59,741 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:59,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:59,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:59,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:59,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:59,779 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:35:59,779 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:35:59,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:35:59,780 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:35:59,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:59,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:59,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:59,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:59,780 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:59,780 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:59,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:59,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:59,781 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:59,781 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:59,781 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:59,781 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:59,781 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:59,782 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:59,782 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:59,782 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:59,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:59,784 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:35:59,784 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:35:59,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:35:59,784 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:59,784 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:35:59,859 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:59,861 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:35:59,861 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:35:59,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:59,861 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:59,861 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:59,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3328 [2022-12-06 07:35:59,861 INFO L420 AbstractCegarLoop]: === Iteration 3330 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:35:59,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:59,861 INFO L85 PathProgramCache]: Analyzing trace with hash -2097501180, now seen corresponding path program 1 times [2022-12-06 07:35:59,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:59,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435880122] [2022-12-06 07:35:59,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:59,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:59,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-06 07:35:59,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:59,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435880122] [2022-12-06 07:35:59,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435880122] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:59,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:59,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:35:59,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716305876] [2022-12-06 07:35:59,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:59,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:59,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:59,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:59,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:59,929 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:35:59,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:59,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:59,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:35:59,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:59,964 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:35:59,964 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:35:59,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:35:59,965 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:35:59,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:59,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:59,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:59,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:35:59,965 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:35:59,965 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:35:59,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:35:59,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:59,966 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:59,966 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:35:59,966 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:35:59,966 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:59,966 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:59,966 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:59,966 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:59,966 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:59,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:59,968 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:35:59,969 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:35:59,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:35:59,969 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:35:59,969 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:00,043 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:00,045 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:00,045 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:00,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:00,045 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:00,045 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:00,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3329 [2022-12-06 07:36:00,045 INFO L420 AbstractCegarLoop]: === Iteration 3331 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:00,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:00,045 INFO L85 PathProgramCache]: Analyzing trace with hash -2070719071, now seen corresponding path program 1 times [2022-12-06 07:36:00,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:00,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874757379] [2022-12-06 07:36:00,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:00,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:00,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:00,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:00,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874757379] [2022-12-06 07:36:00,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874757379] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:00,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:00,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:00,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618891326] [2022-12-06 07:36:00,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:00,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:00,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:00,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:00,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:00,116 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:00,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:00,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:00,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:00,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:00,157 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:00,157 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:00,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:00,157 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:00,157 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:00,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:00,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:00,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:00,158 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:00,158 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:00,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:00,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:00,159 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:00,159 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:00,159 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:00,159 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:00,159 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:00,159 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:00,159 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:00,159 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:00,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:00,161 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:00,161 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:00,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:00,162 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:00,162 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:00,235 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:00,236 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:36:00,236 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:00,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:00,236 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:00,236 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:00,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3330 [2022-12-06 07:36:00,237 INFO L420 AbstractCegarLoop]: === Iteration 3332 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:00,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:00,237 INFO L85 PathProgramCache]: Analyzing trace with hash -2040242878, now seen corresponding path program 1 times [2022-12-06 07:36:00,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:00,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484998587] [2022-12-06 07:36:00,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:00,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:00,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:00,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-06 07:36:00,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:00,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484998587] [2022-12-06 07:36:00,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484998587] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:00,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:00,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:00,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120706685] [2022-12-06 07:36:00,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:00,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:00,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:00,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:00,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:00,305 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:00,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:00,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:00,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:00,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:00,341 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:00,341 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:00,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:00,341 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:00,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:00,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:00,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:00,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:00,342 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:00,342 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:00,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:00,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:00,343 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:00,343 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:00,343 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:00,343 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:00,343 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:00,343 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:00,343 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:00,343 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:00,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:00,345 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:00,345 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:00,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:00,346 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:00,346 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:00,420 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:00,421 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:00,421 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:00,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:00,421 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:00,421 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:00,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3331 [2022-12-06 07:36:00,421 INFO L420 AbstractCegarLoop]: === Iteration 3333 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:00,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:00,422 INFO L85 PathProgramCache]: Analyzing trace with hash -2013460769, now seen corresponding path program 1 times [2022-12-06 07:36:00,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:00,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676902641] [2022-12-06 07:36:00,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:00,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:00,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-06 07:36:00,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:00,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676902641] [2022-12-06 07:36:00,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676902641] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:00,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:00,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:00,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876655455] [2022-12-06 07:36:00,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:00,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:00,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:00,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:00,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:00,494 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:00,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:00,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:00,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:00,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:00,529 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:00,530 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:00,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:00,530 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:00,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:00,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:00,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:00,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:00,531 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:00,531 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:00,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:00,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:00,531 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:00,531 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:00,532 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:00,532 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:00,532 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:00,532 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:00,532 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:00,532 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:00,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:00,534 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:00,534 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:00,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:00,534 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:00,534 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:00,608 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:00,609 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:36:00,609 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:00,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:00,609 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:00,609 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:00,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3332 [2022-12-06 07:36:00,610 INFO L420 AbstractCegarLoop]: === Iteration 3334 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:00,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:00,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1982984576, now seen corresponding path program 1 times [2022-12-06 07:36:00,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:00,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182312446] [2022-12-06 07:36:00,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:00,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:00,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-06 07:36:00,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:00,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182312446] [2022-12-06 07:36:00,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182312446] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:00,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:00,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:00,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404471434] [2022-12-06 07:36:00,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:00,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:00,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:00,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:00,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:00,679 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:00,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:00,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:00,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:00,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:00,726 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:00,727 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:00,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:00,727 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:00,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:00,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:00,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:00,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:00,727 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:00,728 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:00,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:00,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:00,728 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:00,728 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:00,728 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:00,728 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:00,728 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:00,729 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:00,729 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:00,729 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:00,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:00,731 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:00,731 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:00,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:00,731 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:00,731 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:00,806 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:00,807 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:00,807 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:00,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:00,807 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:00,807 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:00,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3333 [2022-12-06 07:36:00,807 INFO L420 AbstractCegarLoop]: === Iteration 3335 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:00,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:00,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1956202467, now seen corresponding path program 1 times [2022-12-06 07:36:00,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:00,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345393182] [2022-12-06 07:36:00,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:00,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:00,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-06 07:36:00,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:00,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345393182] [2022-12-06 07:36:00,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345393182] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:00,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:00,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:00,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56453700] [2022-12-06 07:36:00,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:00,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:00,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:00,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:00,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:00,879 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:00,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:00,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:00,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:00,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:00,920 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:00,920 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:00,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:00,921 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:00,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:00,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:00,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:00,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:00,921 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:00,921 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:00,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:00,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:00,922 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:00,922 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:00,922 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:00,922 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:00,922 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:00,922 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:00,923 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:00,923 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:00,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:00,925 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:00,925 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:00,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:00,925 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:00,925 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:00,999 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:01,001 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:01,001 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:01,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:01,001 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:01,001 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:01,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3334 [2022-12-06 07:36:01,001 INFO L420 AbstractCegarLoop]: === Iteration 3336 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:01,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:01,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1925726274, now seen corresponding path program 1 times [2022-12-06 07:36:01,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:01,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015499117] [2022-12-06 07:36:01,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:01,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:01,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:01,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-06 07:36:01,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:01,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015499117] [2022-12-06 07:36:01,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015499117] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:01,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:01,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:01,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199332739] [2022-12-06 07:36:01,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:01,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:01,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:01,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:01,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:01,070 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:01,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:01,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:01,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:01,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:01,107 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:01,107 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:01,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:01,107 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:01,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:01,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:01,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:01,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:01,108 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:01,108 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:01,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:01,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:01,109 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:01,109 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:01,109 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:01,109 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:01,109 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:01,109 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:01,109 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:01,109 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:01,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:01,111 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:01,111 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:01,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:01,112 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:01,112 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:01,186 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:01,187 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:01,187 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:01,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:01,187 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:01,187 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:01,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3335 [2022-12-06 07:36:01,187 INFO L420 AbstractCegarLoop]: === Iteration 3337 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:01,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:01,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1898944165, now seen corresponding path program 1 times [2022-12-06 07:36:01,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:01,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097799095] [2022-12-06 07:36:01,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:01,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:01,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-06 07:36:01,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:01,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097799095] [2022-12-06 07:36:01,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097799095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:01,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:01,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:01,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876469921] [2022-12-06 07:36:01,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:01,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:01,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:01,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:01,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:01,257 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:01,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:01,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:01,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:01,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:01,298 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:01,298 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:01,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:01,298 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:01,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:01,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:01,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:01,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:01,299 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:01,299 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:01,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:01,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:01,299 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:01,300 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:01,300 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:01,300 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:01,300 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:01,300 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:01,300 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:01,300 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:01,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:01,302 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:01,302 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:01,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:01,302 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:01,303 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:01,376 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:01,377 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:36:01,377 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:01,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:01,378 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:01,378 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:01,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3336 [2022-12-06 07:36:01,378 INFO L420 AbstractCegarLoop]: === Iteration 3338 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:01,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:01,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1868467972, now seen corresponding path program 1 times [2022-12-06 07:36:01,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:01,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327024127] [2022-12-06 07:36:01,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:01,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:01,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:01,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-06 07:36:01,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:01,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327024127] [2022-12-06 07:36:01,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327024127] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:01,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:01,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:01,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401398235] [2022-12-06 07:36:01,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:01,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:01,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:01,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:01,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:01,446 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:01,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:01,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:01,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:01,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:01,488 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:01,489 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:01,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:01,489 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:01,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:01,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:01,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:01,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:01,490 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:01,490 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:01,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:01,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:01,490 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:01,490 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:01,491 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:01,491 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:01,491 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:01,491 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:01,491 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:01,491 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:01,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:01,493 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:01,493 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:01,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:01,493 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:01,493 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:01,567 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:01,568 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:36:01,568 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:01,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:01,568 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:01,568 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:01,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3337 [2022-12-06 07:36:01,569 INFO L420 AbstractCegarLoop]: === Iteration 3339 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:01,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:01,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1841685863, now seen corresponding path program 1 times [2022-12-06 07:36:01,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:01,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324504149] [2022-12-06 07:36:01,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:01,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:01,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-06 07:36:01,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:01,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324504149] [2022-12-06 07:36:01,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324504149] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:01,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:01,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:01,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939317770] [2022-12-06 07:36:01,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:01,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:01,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:01,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:01,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:01,640 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:01,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:01,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:01,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:01,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:01,675 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:01,675 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:01,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:01,675 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:01,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:01,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:01,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:01,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:01,676 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:01,676 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:01,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:01,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:01,676 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:01,677 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:01,677 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:01,677 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:01,677 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:01,677 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:01,677 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:01,677 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:01,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:01,679 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:01,679 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:01,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:01,680 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:01,680 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:01,755 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:01,757 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:01,757 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:01,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:01,757 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:01,757 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:01,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3338 [2022-12-06 07:36:01,757 INFO L420 AbstractCegarLoop]: === Iteration 3340 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:01,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:01,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1811209670, now seen corresponding path program 1 times [2022-12-06 07:36:01,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:01,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907911860] [2022-12-06 07:36:01,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:01,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:01,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36: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-06 07:36:01,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:01,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907911860] [2022-12-06 07:36:01,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907911860] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:01,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:01,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:01,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616355001] [2022-12-06 07:36:01,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:01,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:01,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:01,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:01,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:01,826 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:01,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:01,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:01,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:01,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:01,863 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:01,863 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:01,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:01,864 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:01,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:01,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:01,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:01,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:01,864 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:01,864 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:01,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:01,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:01,865 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:01,865 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:01,865 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:01,865 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:01,865 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:01,866 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:01,866 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:01,866 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:01,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:01,868 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:01,868 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:01,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:01,868 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:01,868 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:01,943 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:01,944 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:01,945 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:01,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:01,945 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:01,945 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:01,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3339 [2022-12-06 07:36:01,945 INFO L420 AbstractCegarLoop]: === Iteration 3341 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:01,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:01,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1784427561, now seen corresponding path program 1 times [2022-12-06 07:36:01,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:01,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449925686] [2022-12-06 07:36:01,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:01,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:02,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:02,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:02,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449925686] [2022-12-06 07:36:02,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449925686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:02,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:02,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:02,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906335921] [2022-12-06 07:36:02,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:02,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:02,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:02,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:02,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:02,029 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:02,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:02,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:02,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:02,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:02,065 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:02,066 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:02,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:02,066 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:02,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:02,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:02,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:02,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:02,067 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:02,067 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:02,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:02,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:02,067 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:02,067 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:02,067 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:02,067 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:02,068 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:02,068 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:02,068 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:02,068 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:02,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:02,070 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:02,070 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:02,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 144 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:02,070 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:02,070 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:02,143 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:02,145 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:02,145 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:02,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:02,145 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:02,145 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:02,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3340 [2022-12-06 07:36:02,145 INFO L420 AbstractCegarLoop]: === Iteration 3342 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:02,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:02,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1753951368, now seen corresponding path program 1 times [2022-12-06 07:36:02,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:02,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849348710] [2022-12-06 07:36:02,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:02,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:02,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-06 07:36:02,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:02,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849348710] [2022-12-06 07:36:02,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849348710] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:02,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:02,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:02,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095769747] [2022-12-06 07:36:02,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:02,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:02,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:02,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:02,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:02,214 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:02,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:02,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:02,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:02,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:02,251 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:02,251 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:02,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:02,252 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:02,252 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:02,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:02,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:02,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:02,252 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:02,252 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:02,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:02,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:02,253 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:02,253 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:02,253 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:02,253 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:02,253 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:02,253 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:02,253 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:02,253 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:02,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:02,256 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:02,256 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:02,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:02,256 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:02,256 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:02,331 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:02,333 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:02,333 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:02,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:02,333 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:02,333 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:02,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3341 [2022-12-06 07:36:02,333 INFO L420 AbstractCegarLoop]: === Iteration 3343 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:02,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:02,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1727169259, now seen corresponding path program 1 times [2022-12-06 07:36:02,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:02,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656559102] [2022-12-06 07:36:02,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:02,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:02,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-06 07:36:02,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:02,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656559102] [2022-12-06 07:36:02,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656559102] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:02,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:02,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:02,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815937694] [2022-12-06 07:36:02,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:02,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:02,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:02,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:02,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:02,404 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:02,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:02,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:02,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:02,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:02,440 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:02,441 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:02,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:02,441 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:02,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:02,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:02,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:02,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:02,442 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:02,442 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:02,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:02,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:02,442 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:02,442 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:02,443 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:02,443 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:02,443 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:02,443 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:02,443 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:02,443 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:02,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:02,445 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:02,445 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:02,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:02,445 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:02,445 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:02,518 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:02,520 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:36:02,520 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:02,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:02,520 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:02,520 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:02,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3342 [2022-12-06 07:36:02,520 INFO L420 AbstractCegarLoop]: === Iteration 3344 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:02,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:02,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1696693066, now seen corresponding path program 1 times [2022-12-06 07:36:02,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:02,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461426365] [2022-12-06 07:36:02,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:02,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:02,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-06 07:36:02,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:02,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461426365] [2022-12-06 07:36:02,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461426365] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:02,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:02,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:02,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675140395] [2022-12-06 07:36:02,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:02,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:02,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:02,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:02,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:02,588 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:02,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:02,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:02,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:02,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:02,630 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:02,630 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:02,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:02,631 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:02,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:02,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:02,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:02,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:02,631 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:02,631 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:02,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:02,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:02,632 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:02,632 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:02,632 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:02,632 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:02,632 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:02,632 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:02,632 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:02,632 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:02,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:02,634 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:02,635 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:02,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:02,635 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:02,635 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:02,708 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:02,710 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:02,710 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:02,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:02,710 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:02,710 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:02,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3343 [2022-12-06 07:36:02,710 INFO L420 AbstractCegarLoop]: === Iteration 3345 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:02,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:02,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1669910957, now seen corresponding path program 1 times [2022-12-06 07:36:02,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:02,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934673795] [2022-12-06 07:36:02,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:02,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:02,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-06 07:36:02,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:02,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934673795] [2022-12-06 07:36:02,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934673795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:02,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:02,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:02,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320090982] [2022-12-06 07:36:02,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:02,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:02,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:02,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:02,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:02,780 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:02,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:02,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:02,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:02,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:02,820 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:02,820 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:02,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:02,820 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:02,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:02,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:02,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:02,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:02,821 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:02,821 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:02,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:02,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:02,821 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:02,822 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:02,822 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:02,822 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:02,822 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:02,822 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:02,822 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:02,822 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:02,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:02,824 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:02,824 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:02,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:02,825 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:02,825 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:02,898 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:02,899 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:36:02,899 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:02,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:02,899 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:02,899 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:02,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3344 [2022-12-06 07:36:02,899 INFO L420 AbstractCegarLoop]: === Iteration 3346 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:02,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:02,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1639434764, now seen corresponding path program 1 times [2022-12-06 07:36:02,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:02,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868037208] [2022-12-06 07:36:02,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:02,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:02,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-06 07:36:02,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:02,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868037208] [2022-12-06 07:36:02,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868037208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:02,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:02,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:02,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546030881] [2022-12-06 07:36:02,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:02,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:02,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:02,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:02,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:02,969 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:02,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:02,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:02,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:02,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:03,010 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:03,010 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:03,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:03,011 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:03,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:03,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:03,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:03,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:03,011 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:03,011 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:03,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:03,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:03,012 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:03,012 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:03,012 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:03,012 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:03,012 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:03,013 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:03,013 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:03,013 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:03,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:03,015 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:03,015 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:03,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:03,015 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:03,015 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:03,090 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:03,091 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:03,091 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:03,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:03,091 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:03,091 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:03,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3345 [2022-12-06 07:36:03,091 INFO L420 AbstractCegarLoop]: === Iteration 3347 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:03,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:03,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1612652655, now seen corresponding path program 1 times [2022-12-06 07:36:03,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:03,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653956543] [2022-12-06 07:36:03,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:03,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:03,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:03,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:03,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653956543] [2022-12-06 07:36:03,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653956543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:03,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:03,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:03,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657875036] [2022-12-06 07:36:03,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:03,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:03,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:03,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:03,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:03,181 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:03,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:03,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:03,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:03,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:03,222 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:03,222 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:03,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:03,223 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:03,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:03,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:03,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:03,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:03,223 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:03,223 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:03,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:03,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:03,224 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:03,224 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:03,224 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:03,224 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:03,224 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:03,224 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:03,224 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:03,224 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:03,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:03,227 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:03,227 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:03,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:03,227 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:03,227 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:03,301 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:03,302 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:03,302 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:03,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:03,303 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:03,303 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:03,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3346 [2022-12-06 07:36:03,303 INFO L420 AbstractCegarLoop]: === Iteration 3348 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:03,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:03,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1582176462, now seen corresponding path program 1 times [2022-12-06 07:36:03,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:03,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734851713] [2022-12-06 07:36:03,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:03,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:03,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:03,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-06 07:36:03,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:03,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734851713] [2022-12-06 07:36:03,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734851713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:03,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:03,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:03,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603023734] [2022-12-06 07:36:03,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:03,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:03,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:03,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:03,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:03,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:03,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:03,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:03,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:03,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:03,414 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:03,414 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:03,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:03,414 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:03,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:03,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:03,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:03,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:03,415 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:03,415 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:03,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:03,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:03,415 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:03,415 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:03,416 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:03,416 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:03,416 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:03,416 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:03,416 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:03,416 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:03,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:03,418 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:03,418 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:03,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:03,418 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:03,418 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:03,492 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:03,493 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:36:03,493 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:03,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:03,494 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:03,494 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:03,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3347 [2022-12-06 07:36:03,494 INFO L420 AbstractCegarLoop]: === Iteration 3349 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:03,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:03,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1555394353, now seen corresponding path program 1 times [2022-12-06 07:36:03,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:03,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76175318] [2022-12-06 07:36:03,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:03,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:03,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:03,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-06 07:36:03,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:03,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76175318] [2022-12-06 07:36:03,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76175318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:03,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:03,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:03,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917638738] [2022-12-06 07:36:03,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:03,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:03,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:03,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:03,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:03,564 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:03,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:03,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:03,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:03,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:03,602 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:03,602 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:03,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:03,603 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:03,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:03,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:03,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:03,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:03,603 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:03,603 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:03,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:03,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:03,604 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:03,604 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:03,604 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:03,604 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:03,604 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:03,604 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:03,604 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:03,604 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:03,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:03,606 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:03,606 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:03,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:03,607 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:03,607 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:03,682 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:03,683 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:03,683 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:03,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:03,683 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:03,683 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:03,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3348 [2022-12-06 07:36:03,683 INFO L420 AbstractCegarLoop]: === Iteration 3350 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:03,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:03,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1524918160, now seen corresponding path program 1 times [2022-12-06 07:36:03,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:03,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762185562] [2022-12-06 07:36:03,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:03,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:03,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-06 07:36:03,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:03,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762185562] [2022-12-06 07:36:03,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762185562] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:03,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:03,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:03,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92412930] [2022-12-06 07:36:03,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:03,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:03,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:03,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:03,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:03,751 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:03,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:03,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:03,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:03,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:03,787 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:03,787 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:03,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:03,788 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:03,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:03,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:03,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:03,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:03,788 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:03,788 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:03,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:03,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:03,789 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:03,789 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:03,789 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:03,789 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:03,789 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:03,790 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:03,790 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:03,790 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:03,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:03,792 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:03,792 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:03,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:03,792 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:03,792 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:03,865 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:03,867 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:03,867 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:03,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:03,867 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:03,867 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:03,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3349 [2022-12-06 07:36:03,867 INFO L420 AbstractCegarLoop]: === Iteration 3351 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:03,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:03,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1498136051, now seen corresponding path program 1 times [2022-12-06 07:36:03,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:03,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156715953] [2022-12-06 07:36:03,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:03,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:03,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-06 07:36:03,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:03,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156715953] [2022-12-06 07:36:03,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156715953] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:03,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:03,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:03,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962107451] [2022-12-06 07:36:03,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:03,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:03,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:03,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:03,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:03,938 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:03,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:03,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:03,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:03,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:03,979 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:03,979 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:03,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:03,979 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:03,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:03,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:03,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:03,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:03,980 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:03,980 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:03,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:03,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:03,980 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:03,980 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:03,981 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:03,981 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:03,981 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:03,981 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:03,981 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:03,981 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:03,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:03,983 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:03,983 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:03,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:03,983 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:03,984 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:04,058 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:04,059 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:04,059 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:04,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:04,059 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:04,059 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:04,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3350 [2022-12-06 07:36:04,059 INFO L420 AbstractCegarLoop]: === Iteration 3352 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:04,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:04,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1467659858, now seen corresponding path program 1 times [2022-12-06 07:36:04,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:04,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968215666] [2022-12-06 07:36:04,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:04,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:04,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-06 07:36:04,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:04,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968215666] [2022-12-06 07:36:04,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968215666] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:04,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:04,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:04,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473052834] [2022-12-06 07:36:04,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:04,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:04,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:04,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:04,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:04,129 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:04,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:04,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:04,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:04,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:04,166 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:04,166 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:04,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:04,166 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:04,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:04,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:04,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:04,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:04,167 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:04,167 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:04,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:04,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:04,167 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:04,167 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:04,168 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:04,168 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:04,168 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:04,168 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:04,168 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:04,168 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:04,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:04,170 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:04,170 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:04,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:04,170 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:04,170 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:04,245 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:04,246 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:04,246 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:04,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:04,247 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:04,247 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:04,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3351 [2022-12-06 07:36:04,247 INFO L420 AbstractCegarLoop]: === Iteration 3353 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:04,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:04,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1440877749, now seen corresponding path program 1 times [2022-12-06 07:36:04,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:04,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815969695] [2022-12-06 07:36:04,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:04,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:04,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-06 07:36:04,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:04,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815969695] [2022-12-06 07:36:04,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815969695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:04,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:04,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:04,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658395130] [2022-12-06 07:36:04,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:04,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:04,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:04,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:04,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:04,319 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:04,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:04,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:04,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:04,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:04,372 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:04,372 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:04,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:04,373 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:04,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:04,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:04,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:04,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:04,373 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:04,373 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:04,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:04,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:04,374 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:04,374 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:04,374 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:04,374 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:04,374 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:04,374 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:04,374 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:04,374 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:04,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:04,376 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:04,377 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:04,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:04,377 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:04,377 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:04,453 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:04,454 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:04,454 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:04,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:04,454 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:04,454 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:04,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3352 [2022-12-06 07:36:04,454 INFO L420 AbstractCegarLoop]: === Iteration 3354 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:04,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:04,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1410401556, now seen corresponding path program 1 times [2022-12-06 07:36:04,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:04,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483965828] [2022-12-06 07:36:04,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:04,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:04,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:04,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-06 07:36:04,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:04,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483965828] [2022-12-06 07:36:04,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483965828] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:04,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:04,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:04,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802807743] [2022-12-06 07:36:04,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:04,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:04,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:04,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:04,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:04,524 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:04,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:04,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:04,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:04,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:04,560 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:04,561 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:04,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:04,561 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:04,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:04,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:04,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:04,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:04,562 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:04,562 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:04,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:04,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:04,562 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:04,562 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:04,562 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:04,562 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:04,563 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:04,563 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:04,563 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:04,563 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:04,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:04,565 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:04,565 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:04,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:04,565 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:04,565 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:04,639 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:04,641 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:04,641 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:04,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:04,641 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:04,641 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:04,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3353 [2022-12-06 07:36:04,641 INFO L420 AbstractCegarLoop]: === Iteration 3355 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:04,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:04,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1383619447, now seen corresponding path program 1 times [2022-12-06 07:36:04,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:04,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984414945] [2022-12-06 07:36:04,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:04,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:04,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:04,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:04,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:04,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984414945] [2022-12-06 07:36:04,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984414945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:04,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:04,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:04,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047008319] [2022-12-06 07:36:04,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:04,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:04,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:04,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:04,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:04,712 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:04,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:04,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:04,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:04,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:04,752 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:04,752 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:04,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:04,753 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:04,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:04,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:04,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:04,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:04,753 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:04,753 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:04,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:04,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:04,754 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:04,754 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:04,754 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:04,754 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:04,754 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:04,754 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:04,754 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:04,755 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:04,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:04,757 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:04,757 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:04,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:04,757 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:04,757 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:04,832 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:04,833 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:04,833 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:04,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:04,833 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:04,833 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:04,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3354 [2022-12-06 07:36:04,834 INFO L420 AbstractCegarLoop]: === Iteration 3356 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:04,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:04,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1353143254, now seen corresponding path program 1 times [2022-12-06 07:36:04,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:04,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215739360] [2022-12-06 07:36:04,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:04,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:04,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-06 07:36:04,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:04,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215739360] [2022-12-06 07:36:04,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215739360] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:04,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:04,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:04,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624957771] [2022-12-06 07:36:04,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:04,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:04,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:04,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:04,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:04,901 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:04,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:04,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:04,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:04,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:04,937 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:04,938 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:04,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:04,938 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:04,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:04,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:04,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:04,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:04,939 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:04,939 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:04,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:04,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:04,939 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:04,939 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:04,940 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:04,940 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:04,940 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:04,940 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:04,940 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:04,940 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:04,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:04,942 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:04,942 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:04,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:04,942 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:04,942 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:05,018 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:05,019 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:05,019 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:05,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:05,019 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:05,019 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:05,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3355 [2022-12-06 07:36:05,020 INFO L420 AbstractCegarLoop]: === Iteration 3357 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:05,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:05,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1326361145, now seen corresponding path program 1 times [2022-12-06 07:36:05,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:05,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917629355] [2022-12-06 07:36:05,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:05,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:05,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-06 07:36:05,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:05,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917629355] [2022-12-06 07:36:05,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917629355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:05,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:05,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:05,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016477197] [2022-12-06 07:36:05,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:05,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:05,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:05,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:05,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:05,091 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:05,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:05,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:05,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:05,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:05,126 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:05,126 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:05,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:05,127 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:05,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:05,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:05,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:05,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:05,127 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:05,127 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:05,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:05,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:05,128 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:05,128 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:05,128 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:05,128 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:05,128 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:05,129 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:05,129 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:05,129 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:05,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:05,131 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:05,131 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:05,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:05,131 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:05,131 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:05,206 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:05,207 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:05,207 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:05,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:05,207 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:05,207 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:05,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3356 [2022-12-06 07:36:05,208 INFO L420 AbstractCegarLoop]: === Iteration 3358 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:05,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:05,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1295884952, now seen corresponding path program 1 times [2022-12-06 07:36:05,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:05,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288331141] [2022-12-06 07:36:05,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:05,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:05,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:05,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:05,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288331141] [2022-12-06 07:36:05,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288331141] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:05,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:05,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:05,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473221120] [2022-12-06 07:36:05,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:05,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:05,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:05,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:05,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:05,276 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:05,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:05,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:05,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:05,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:05,318 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:05,318 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:05,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:05,319 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:05,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:05,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:05,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:05,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:05,319 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:05,319 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:05,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:05,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:05,320 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:05,320 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:05,320 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:05,320 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:05,320 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:05,320 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:05,320 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:05,321 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:05,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:05,323 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:05,323 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:05,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:05,323 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:05,323 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:05,396 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:05,398 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:05,398 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:05,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:05,398 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:05,398 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:05,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3357 [2022-12-06 07:36:05,398 INFO L420 AbstractCegarLoop]: === Iteration 3359 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:05,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:05,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1269102843, now seen corresponding path program 1 times [2022-12-06 07:36:05,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:05,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170468885] [2022-12-06 07:36:05,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:05,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:05,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-06 07:36:05,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:05,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170468885] [2022-12-06 07:36:05,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170468885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:05,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:05,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:05,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129422500] [2022-12-06 07:36:05,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:05,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:05,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:05,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:05,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:05,468 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:05,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:05,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:05,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:05,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:05,504 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:05,504 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:05,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:05,504 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:05,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:05,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:05,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:05,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:05,505 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:05,505 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:05,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:05,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:05,506 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:05,506 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:05,506 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:05,506 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:05,506 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:05,506 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:05,506 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:05,506 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:05,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:05,508 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:05,508 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:05,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 144 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:05,509 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:05,509 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:05,584 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:05,586 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:05,586 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:05,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:05,586 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:05,586 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:05,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3358 [2022-12-06 07:36:05,586 INFO L420 AbstractCegarLoop]: === Iteration 3360 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:05,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:05,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1238626650, now seen corresponding path program 1 times [2022-12-06 07:36:05,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:05,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131736692] [2022-12-06 07:36:05,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:05,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:05,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-06 07:36:05,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:05,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131736692] [2022-12-06 07:36:05,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131736692] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:05,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:05,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:05,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351173097] [2022-12-06 07:36:05,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:05,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:05,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:05,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:05,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:05,664 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:05,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:05,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:05,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:05,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:05,705 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:05,705 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:05,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:05,706 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:05,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:05,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:05,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:05,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:05,706 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:05,706 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:05,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:05,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:05,707 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:05,707 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:05,707 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:05,707 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:05,707 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:05,708 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:05,708 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:05,708 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:05,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:05,710 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:05,710 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:05,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:05,710 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:05,710 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:05,784 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:05,785 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:05,785 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:05,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:05,785 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:05,786 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:05,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3359 [2022-12-06 07:36:05,786 INFO L420 AbstractCegarLoop]: === Iteration 3361 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:05,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:05,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1211844541, now seen corresponding path program 1 times [2022-12-06 07:36:05,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:05,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311154737] [2022-12-06 07:36:05,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:05,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:05,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-06 07:36:05,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:05,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311154737] [2022-12-06 07:36:05,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311154737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:05,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:05,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:05,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387816929] [2022-12-06 07:36:05,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:05,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:05,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:05,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:05,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:05,867 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:05,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:05,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:05,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:05,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:05,923 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:05,923 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:05,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:05,924 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:05,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:05,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:05,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:05,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:05,924 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:05,924 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:05,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:05,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:05,925 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:05,925 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:05,925 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:05,925 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:05,925 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:05,925 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:05,925 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:05,925 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:05,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:05,928 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:05,928 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:05,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:05,928 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:05,928 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:06,008 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:06,009 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:36:06,009 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:06,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:06,009 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:06,009 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:06,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3360 [2022-12-06 07:36:06,009 INFO L420 AbstractCegarLoop]: === Iteration 3362 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:06,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:06,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1181368348, now seen corresponding path program 1 times [2022-12-06 07:36:06,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:06,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437350938] [2022-12-06 07:36:06,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:06,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:06,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-06 07:36:06,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:06,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437350938] [2022-12-06 07:36:06,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437350938] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:06,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:06,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:06,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189863800] [2022-12-06 07:36:06,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:06,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:06,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:06,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:06,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:06,077 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:06,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:06,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:06,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:06,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:06,119 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:06,119 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:06,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:06,119 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:06,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:06,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:06,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:06,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:06,120 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:06,120 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:06,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:06,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:06,121 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:06,121 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:06,121 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:06,121 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:06,121 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:06,121 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:06,121 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:06,121 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:06,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:06,123 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:06,124 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:06,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:06,124 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:06,124 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:06,198 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:06,199 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:06,199 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:06,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:06,199 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:06,199 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:06,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3361 [2022-12-06 07:36:06,200 INFO L420 AbstractCegarLoop]: === Iteration 3363 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:06,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:06,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1154586239, now seen corresponding path program 1 times [2022-12-06 07:36:06,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:06,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803343572] [2022-12-06 07:36:06,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:06,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:06,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-06 07:36:06,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:06,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803343572] [2022-12-06 07:36:06,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803343572] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:06,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:06,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:06,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146448382] [2022-12-06 07:36:06,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:06,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:06,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:06,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:06,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:06,270 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:06,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:06,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:06,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:06,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:06,309 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:06,309 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:06,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 372 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:06,310 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:06,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:06,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:06,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:06,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:06,310 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:06,310 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:06,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:06,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:06,311 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:06,311 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:06,311 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:06,311 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:06,311 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:06,311 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:06,311 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:06,311 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:06,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:06,313 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:06,313 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:06,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:06,314 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:06,314 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:06,387 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:06,388 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:36:06,388 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:06,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:06,388 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:06,388 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:06,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3362 [2022-12-06 07:36:06,388 INFO L420 AbstractCegarLoop]: === Iteration 3364 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:06,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:06,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1124110046, now seen corresponding path program 1 times [2022-12-06 07:36:06,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:06,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755788681] [2022-12-06 07:36:06,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:06,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:06,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-06 07:36:06,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:06,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755788681] [2022-12-06 07:36:06,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755788681] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:06,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:06,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:06,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035556772] [2022-12-06 07:36:06,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:06,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:06,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:06,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:06,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:06,455 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:06,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:06,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:06,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:06,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:06,497 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:06,497 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:06,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:06,497 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:06,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:06,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:06,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:06,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:06,498 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:06,498 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:06,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:06,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:06,498 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:06,498 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:06,499 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:06,499 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:06,499 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:06,499 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:06,499 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:06,499 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:06,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:06,501 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:06,501 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:06,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:06,501 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:06,501 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:06,574 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:06,575 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:36:06,575 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:06,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:06,576 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:06,576 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:06,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3363 [2022-12-06 07:36:06,576 INFO L420 AbstractCegarLoop]: === Iteration 3365 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:06,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:06,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1097327937, now seen corresponding path program 1 times [2022-12-06 07:36:06,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:06,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710141920] [2022-12-06 07:36:06,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:06,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:06,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:06,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:06,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:06,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710141920] [2022-12-06 07:36:06,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710141920] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:06,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:06,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:06,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494297888] [2022-12-06 07:36:06,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:06,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:06,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:06,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:06,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:06,647 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:06,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:06,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:06,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:06,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:06,681 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:06,681 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:06,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:06,682 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:06,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:06,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:06,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:06,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:06,682 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:06,682 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:06,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:06,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:06,683 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:06,683 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:06,683 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:06,683 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:06,683 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:06,683 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:06,684 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:06,684 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:06,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:06,686 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:06,686 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:06,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:06,686 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:06,686 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:06,760 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:06,761 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:06,761 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:06,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:06,761 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:06,761 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:06,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3364 [2022-12-06 07:36:06,761 INFO L420 AbstractCegarLoop]: === Iteration 3366 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:06,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:06,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1066851744, now seen corresponding path program 1 times [2022-12-06 07:36:06,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:06,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935208472] [2022-12-06 07:36:06,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:06,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:06,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-06 07:36:06,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:06,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935208472] [2022-12-06 07:36:06,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935208472] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:06,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:06,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:06,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194743393] [2022-12-06 07:36:06,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:06,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:06,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:06,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:06,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:06,849 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:06,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:06,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:06,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:06,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:06,889 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:06,890 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:06,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:06,890 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:06,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:06,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:06,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:06,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:06,891 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:06,891 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:06,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:06,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:06,891 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:06,891 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:06,891 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:06,891 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:06,892 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:06,892 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:06,892 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:06,892 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:06,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:06,894 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:06,894 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:06,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:06,894 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:06,894 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:06,969 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:06,970 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:06,970 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:06,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:06,970 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:06,970 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:06,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3365 [2022-12-06 07:36:06,970 INFO L420 AbstractCegarLoop]: === Iteration 3367 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:06,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:06,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1040069635, now seen corresponding path program 1 times [2022-12-06 07:36:06,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:06,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962905875] [2022-12-06 07:36:06,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:06,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:07,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:07,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:07,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962905875] [2022-12-06 07:36:07,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962905875] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:07,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:07,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:07,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144226080] [2022-12-06 07:36:07,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:07,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:07,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:07,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:07,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:07,040 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:07,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:07,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:07,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:07,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:07,076 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:07,076 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:07,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:07,077 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:07,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:07,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:07,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:07,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:07,077 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:07,077 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:07,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:07,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:07,078 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:07,078 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:07,078 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:07,078 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:07,078 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:07,079 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:07,079 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:07,079 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:07,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:07,081 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:07,081 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:07,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:07,081 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:07,081 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:07,156 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:07,157 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:07,157 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:07,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:07,157 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:07,157 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:07,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3366 [2022-12-06 07:36:07,157 INFO L420 AbstractCegarLoop]: === Iteration 3368 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:07,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:07,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1009593442, now seen corresponding path program 1 times [2022-12-06 07:36:07,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:07,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520455777] [2022-12-06 07:36:07,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:07,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:07,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:07,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-06 07:36:07,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:07,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520455777] [2022-12-06 07:36:07,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520455777] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:07,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:07,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:07,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217897237] [2022-12-06 07:36:07,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:07,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:07,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:07,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:07,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:07,229 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:07,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:07,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:07,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:07,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:07,265 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:07,265 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:07,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:07,265 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:07,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:07,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:07,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:07,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:07,266 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:07,266 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:07,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:07,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:07,267 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:07,267 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:07,267 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:07,267 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:07,267 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:07,267 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:07,267 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:07,267 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:07,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:07,269 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:07,269 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:07,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:07,270 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:07,270 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:07,343 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:07,344 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:36:07,344 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:07,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:07,344 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:07,344 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:07,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3367 [2022-12-06 07:36:07,345 INFO L420 AbstractCegarLoop]: === Iteration 3369 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:07,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:07,345 INFO L85 PathProgramCache]: Analyzing trace with hash -982811333, now seen corresponding path program 1 times [2022-12-06 07:36:07,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:07,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395550668] [2022-12-06 07:36:07,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:07,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:07,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-06 07:36:07,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:07,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395550668] [2022-12-06 07:36:07,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395550668] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:07,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:07,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:07,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197354065] [2022-12-06 07:36:07,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:07,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:07,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:07,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:07,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:07,415 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:07,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:07,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:07,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:07,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:07,451 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:07,451 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:07,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:07,451 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:07,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:07,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:07,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:07,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:07,452 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:07,452 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:07,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:07,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:07,453 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:07,453 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:07,453 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:07,453 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:07,453 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:07,453 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:07,453 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:07,453 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:07,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:07,455 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:07,456 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:07,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:07,456 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:07,456 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:07,530 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:07,531 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:07,531 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:07,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:07,532 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:07,532 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:07,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3368 [2022-12-06 07:36:07,532 INFO L420 AbstractCegarLoop]: === Iteration 3370 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:07,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:07,532 INFO L85 PathProgramCache]: Analyzing trace with hash -952335140, now seen corresponding path program 1 times [2022-12-06 07:36:07,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:07,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660422254] [2022-12-06 07:36:07,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:07,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:07,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:07,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-06 07:36:07,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:07,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660422254] [2022-12-06 07:36:07,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660422254] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:07,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:07,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:07,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584397016] [2022-12-06 07:36:07,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:07,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:07,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:07,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:07,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:07,607 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:07,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:07,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:07,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:07,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:07,643 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:07,643 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:07,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:07,644 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:07,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:07,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:07,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:07,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:07,644 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:07,644 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:07,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:07,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:07,645 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:07,645 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:07,645 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:07,645 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:07,645 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:07,645 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:07,645 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:07,645 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:07,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:07,648 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:07,648 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:07,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:07,648 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:07,648 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:07,722 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:07,723 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:07,723 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:07,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:07,723 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:07,723 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:07,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3369 [2022-12-06 07:36:07,723 INFO L420 AbstractCegarLoop]: === Iteration 3371 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:07,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:07,724 INFO L85 PathProgramCache]: Analyzing trace with hash -925553031, now seen corresponding path program 1 times [2022-12-06 07:36:07,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:07,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247183817] [2022-12-06 07:36:07,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:07,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:07,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-06 07:36:07,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:07,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247183817] [2022-12-06 07:36:07,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247183817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:07,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:07,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:07,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928398882] [2022-12-06 07:36:07,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:07,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:07,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:07,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:07,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:07,794 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:07,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:07,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:07,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:07,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:07,836 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:07,836 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:07,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:07,837 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:07,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:07,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:07,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:07,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:07,837 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:07,837 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:07,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:07,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:07,838 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:07,838 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:07,838 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:07,838 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:07,838 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:07,838 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:07,838 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:07,838 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:07,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:07,841 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:07,841 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:07,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:07,841 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:07,841 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:07,915 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:07,917 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:07,917 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:07,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:07,917 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:07,917 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:07,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3370 [2022-12-06 07:36:07,917 INFO L420 AbstractCegarLoop]: === Iteration 3372 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:07,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:07,917 INFO L85 PathProgramCache]: Analyzing trace with hash -895076838, now seen corresponding path program 1 times [2022-12-06 07:36:07,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:07,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175280692] [2022-12-06 07:36:07,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:07,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:08,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-06 07:36:08,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:08,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175280692] [2022-12-06 07:36:08,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175280692] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:08,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:08,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:08,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359960712] [2022-12-06 07:36:08,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:08,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:08,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:08,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:08,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:08,006 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:08,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:08,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:08,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:08,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:08,047 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:08,048 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:08,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:08,048 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:08,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:08,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:08,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:08,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:08,048 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:08,049 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:08,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:08,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:08,049 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:08,049 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:08,049 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:08,049 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:08,049 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:08,050 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:08,050 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:08,050 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:08,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:08,052 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:08,052 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:08,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:08,052 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:08,052 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:08,143 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:08,145 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 07:36:08,145 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:08,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:08,145 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:08,145 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:08,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3371 [2022-12-06 07:36:08,146 INFO L420 AbstractCegarLoop]: === Iteration 3373 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:08,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:08,146 INFO L85 PathProgramCache]: Analyzing trace with hash -868294729, now seen corresponding path program 1 times [2022-12-06 07:36:08,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:08,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214092922] [2022-12-06 07:36:08,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:08,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:08,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-06 07:36:08,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:08,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214092922] [2022-12-06 07:36:08,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214092922] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:08,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:08,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:08,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804999317] [2022-12-06 07:36:08,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:08,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:08,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:08,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:08,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:08,223 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:08,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:08,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:08,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:08,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:08,265 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:08,265 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:08,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:08,266 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:08,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:08,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:08,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:08,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:08,266 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:08,266 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:08,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:08,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:08,267 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:08,267 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:08,267 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:08,267 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:08,267 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:08,267 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:08,267 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:08,267 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:08,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:08,270 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:08,270 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:08,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:08,270 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:08,270 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:08,345 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:08,346 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:08,347 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:08,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:08,347 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:08,347 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:08,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3372 [2022-12-06 07:36:08,347 INFO L420 AbstractCegarLoop]: === Iteration 3374 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:08,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:08,347 INFO L85 PathProgramCache]: Analyzing trace with hash -837818536, now seen corresponding path program 1 times [2022-12-06 07:36:08,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:08,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826809278] [2022-12-06 07:36:08,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:08,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:08,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-06 07:36:08,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:08,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826809278] [2022-12-06 07:36:08,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826809278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:08,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:08,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:08,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6903945] [2022-12-06 07:36:08,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:08,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:08,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:08,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:08,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:08,415 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:08,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:08,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:08,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:08,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:08,456 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:08,457 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:08,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:08,457 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:08,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:08,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:08,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:08,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:08,457 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:08,458 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:08,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:08,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:08,458 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:08,458 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:08,458 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:08,458 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:08,458 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:08,459 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:08,459 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:08,459 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:08,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:08,461 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:08,461 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:08,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 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 116. Up to 16 conditions per place. [2022-12-06 07:36:08,461 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:08,461 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:08,537 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:08,539 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:36:08,539 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:08,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:08,539 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:08,539 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:08,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3373 [2022-12-06 07:36:08,539 INFO L420 AbstractCegarLoop]: === Iteration 3375 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:08,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:08,539 INFO L85 PathProgramCache]: Analyzing trace with hash -811036427, now seen corresponding path program 1 times [2022-12-06 07:36:08,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:08,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149698757] [2022-12-06 07:36:08,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:08,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:08,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-06 07:36:08,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:08,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149698757] [2022-12-06 07:36:08,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149698757] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:08,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:08,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:08,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746642776] [2022-12-06 07:36:08,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:08,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:08,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:08,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:08,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:08,609 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:08,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:08,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:08,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:08,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:08,650 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:08,650 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:08,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:08,651 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:08,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:08,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:08,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:08,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:08,651 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:08,651 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:08,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:08,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:08,652 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:08,652 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:08,652 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:08,652 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:08,652 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:08,653 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:08,653 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:08,653 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:08,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:08,655 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:08,655 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:08,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:08,655 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:08,655 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:08,729 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:08,730 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:08,730 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:08,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:08,730 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:08,730 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:08,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3374 [2022-12-06 07:36:08,730 INFO L420 AbstractCegarLoop]: === Iteration 3376 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:08,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:08,731 INFO L85 PathProgramCache]: Analyzing trace with hash -780560234, now seen corresponding path program 1 times [2022-12-06 07:36:08,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:08,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023631876] [2022-12-06 07:36:08,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:08,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:08,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-06 07:36:08,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:08,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023631876] [2022-12-06 07:36:08,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023631876] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:08,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:08,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:08,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711162816] [2022-12-06 07:36:08,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:08,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:08,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:08,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:08,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:08,800 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:08,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:08,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:08,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:08,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:08,842 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:08,842 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:08,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:08,843 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:08,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:08,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:08,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:08,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:08,843 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:08,843 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:08,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:08,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:08,844 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:08,844 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:08,844 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:08,844 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:08,844 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:08,844 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:08,844 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:08,844 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:08,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:08,847 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:08,847 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:08,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:08,847 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:08,847 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:08,922 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:08,923 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:08,923 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:08,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:08,923 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:08,923 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:08,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3375 [2022-12-06 07:36:08,924 INFO L420 AbstractCegarLoop]: === Iteration 3377 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:08,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:08,924 INFO L85 PathProgramCache]: Analyzing trace with hash -753778125, now seen corresponding path program 1 times [2022-12-06 07:36:08,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:08,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054633343] [2022-12-06 07:36:08,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:08,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:08,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:08,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:08,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054633343] [2022-12-06 07:36:08,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054633343] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:08,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:08,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:08,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990342403] [2022-12-06 07:36:08,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:08,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:08,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:08,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:08,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:08,993 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:08,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:08,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:08,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:08,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:09,029 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:09,029 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:09,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:09,030 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:09,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:09,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:09,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:09,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:09,030 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:09,030 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:09,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:09,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:09,031 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:09,031 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:09,031 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:09,031 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:09,031 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:09,032 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:09,032 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:09,032 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:09,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:09,034 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:09,034 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:09,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:09,034 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:09,034 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:09,108 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:09,109 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:09,109 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:09,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:09,109 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:09,109 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:09,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3376 [2022-12-06 07:36:09,109 INFO L420 AbstractCegarLoop]: === Iteration 3378 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:09,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:09,110 INFO L85 PathProgramCache]: Analyzing trace with hash -723301932, now seen corresponding path program 1 times [2022-12-06 07:36:09,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:09,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160287250] [2022-12-06 07:36:09,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:09,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:09,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-06 07:36:09,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:09,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160287250] [2022-12-06 07:36:09,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160287250] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:09,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:09,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:09,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640186411] [2022-12-06 07:36:09,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:09,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:09,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:09,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:09,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:09,177 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:09,177 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:09,177 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:09,177 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:09,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:09,219 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:09,220 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:09,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:09,220 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:09,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:09,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:09,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:09,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:09,221 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:09,221 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:09,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:09,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:09,221 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:09,221 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:09,221 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:09,222 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:09,222 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:09,222 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:09,222 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:09,222 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:09,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:09,224 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:09,224 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:09,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:09,224 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:09,224 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:09,298 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:09,299 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:36:09,299 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:09,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:09,299 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:09,299 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:09,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3377 [2022-12-06 07:36:09,299 INFO L420 AbstractCegarLoop]: === Iteration 3379 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:09,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:09,299 INFO L85 PathProgramCache]: Analyzing trace with hash -696519823, now seen corresponding path program 1 times [2022-12-06 07:36:09,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:09,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468187616] [2022-12-06 07:36:09,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:09,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:09,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-06 07:36:09,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:09,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468187616] [2022-12-06 07:36:09,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468187616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:09,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:09,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:09,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734960561] [2022-12-06 07:36:09,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:09,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:09,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:09,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:09,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:09,379 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:09,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:09,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:09,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:09,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:09,414 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:09,414 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:09,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:09,415 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:09,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:09,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:09,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:09,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:09,415 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:09,416 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:09,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:09,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:09,416 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:09,416 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:09,416 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:09,416 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:09,416 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:09,417 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:09,417 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:09,417 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:09,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:09,419 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:09,419 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:09,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 144 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:09,419 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:09,419 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:09,493 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:09,495 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:09,495 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:09,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:09,495 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:09,495 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:09,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3378 [2022-12-06 07:36:09,495 INFO L420 AbstractCegarLoop]: === Iteration 3380 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:09,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:09,495 INFO L85 PathProgramCache]: Analyzing trace with hash -666043630, now seen corresponding path program 1 times [2022-12-06 07:36:09,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:09,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947133812] [2022-12-06 07:36:09,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:09,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:09,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-06 07:36:09,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:09,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947133812] [2022-12-06 07:36:09,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947133812] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:09,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:09,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:09,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125535616] [2022-12-06 07:36:09,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:09,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:09,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:09,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:09,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:09,566 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:09,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:09,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:09,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:09,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:09,601 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:09,602 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:09,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:09,602 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:09,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:09,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:09,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:09,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:09,603 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:09,603 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:09,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:09,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:09,603 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:09,603 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:09,603 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:09,604 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:09,604 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:09,604 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:09,604 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:09,604 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:09,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:09,606 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:09,606 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:09,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:09,606 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:09,606 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:09,680 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:09,682 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:09,682 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:09,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:09,682 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:09,682 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:09,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3379 [2022-12-06 07:36:09,682 INFO L420 AbstractCegarLoop]: === Iteration 3381 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:09,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:09,682 INFO L85 PathProgramCache]: Analyzing trace with hash -639261521, now seen corresponding path program 1 times [2022-12-06 07:36:09,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:09,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952269948] [2022-12-06 07:36:09,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:09,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:09,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-06 07:36:09,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:09,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952269948] [2022-12-06 07:36:09,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952269948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:09,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:09,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:09,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045011901] [2022-12-06 07:36:09,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:09,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:09,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:09,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:09,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:09,752 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:09,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:09,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:09,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:09,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:09,793 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:09,794 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:09,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:09,794 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:09,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:09,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:09,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:09,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:09,795 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:09,795 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:09,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:09,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:09,795 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:09,795 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:09,795 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:09,796 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:09,796 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:09,796 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:09,796 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:09,796 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:09,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:09,798 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:09,798 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:09,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:09,798 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:09,798 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:09,873 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:09,875 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:09,875 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:09,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:09,875 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:09,875 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:09,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3380 [2022-12-06 07:36:09,875 INFO L420 AbstractCegarLoop]: === Iteration 3382 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:09,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:09,875 INFO L85 PathProgramCache]: Analyzing trace with hash -608785328, now seen corresponding path program 1 times [2022-12-06 07:36:09,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:09,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161572219] [2022-12-06 07:36:09,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:09,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:09,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:09,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-06 07:36:09,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:09,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161572219] [2022-12-06 07:36:09,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161572219] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:09,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:09,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:09,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741184055] [2022-12-06 07:36:09,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:09,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:09,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:09,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:09,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:09,944 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:09,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:09,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:09,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:09,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:09,980 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:09,980 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:09,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:09,980 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:09,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:09,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:09,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:09,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:09,981 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:09,981 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:09,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:09,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:09,982 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:09,982 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:09,982 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:09,982 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:09,982 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:09,982 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:09,982 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:09,982 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:09,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:09,984 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:09,984 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:09,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:09,985 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:09,985 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:10,059 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:10,060 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:10,060 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:10,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:10,060 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:10,060 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:10,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3381 [2022-12-06 07:36:10,061 INFO L420 AbstractCegarLoop]: === Iteration 3383 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:10,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:10,061 INFO L85 PathProgramCache]: Analyzing trace with hash -582003219, now seen corresponding path program 1 times [2022-12-06 07:36:10,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:10,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938218609] [2022-12-06 07:36:10,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:10,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:10,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:10,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-06 07:36:10,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:10,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938218609] [2022-12-06 07:36:10,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938218609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:10,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:10,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:10,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518081144] [2022-12-06 07:36:10,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:10,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:10,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:10,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:10,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:10,134 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:10,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:10,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:10,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:10,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:10,169 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:10,170 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:10,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:10,170 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:10,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:10,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:10,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:10,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:10,171 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:10,171 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:10,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:10,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:10,171 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:10,171 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:10,172 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:10,172 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:10,172 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:10,172 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:10,172 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:10,172 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:10,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:10,174 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:10,174 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:10,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:10,174 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:10,174 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:10,250 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:10,251 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:10,252 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:10,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:10,252 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:10,252 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:10,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3382 [2022-12-06 07:36:10,252 INFO L420 AbstractCegarLoop]: === Iteration 3384 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:10,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:10,252 INFO L85 PathProgramCache]: Analyzing trace with hash -551527026, now seen corresponding path program 1 times [2022-12-06 07:36:10,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:10,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058915826] [2022-12-06 07:36:10,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:10,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:10,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-06 07:36:10,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:10,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058915826] [2022-12-06 07:36:10,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058915826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:10,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:10,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:10,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161226565] [2022-12-06 07:36:10,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:10,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:10,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:10,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:10,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:10,320 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:10,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:10,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:10,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:10,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:10,362 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:10,362 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:10,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:10,363 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:10,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:10,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:10,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:10,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:10,363 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:10,363 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:10,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:10,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:10,364 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:10,364 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:10,364 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:10,364 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:10,364 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:10,364 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:10,364 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:10,364 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:10,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:10,367 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:10,367 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:10,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:10,367 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:10,367 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:10,441 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:10,442 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:10,442 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:10,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:10,442 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:10,442 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:10,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3383 [2022-12-06 07:36:10,442 INFO L420 AbstractCegarLoop]: === Iteration 3385 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:10,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:10,443 INFO L85 PathProgramCache]: Analyzing trace with hash -524744917, now seen corresponding path program 1 times [2022-12-06 07:36:10,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:10,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726418188] [2022-12-06 07:36:10,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:10,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:10,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-06 07:36:10,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:10,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726418188] [2022-12-06 07:36:10,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726418188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:10,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:10,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:10,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495648434] [2022-12-06 07:36:10,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:10,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:10,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:10,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:10,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:10,532 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:10,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:10,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:10,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:10,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:10,567 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:10,567 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:10,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:10,567 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:10,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:10,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:10,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:10,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:10,568 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:10,568 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:10,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:10,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:10,569 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:10,569 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:10,569 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:10,569 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:10,569 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:10,569 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:10,569 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:10,569 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:10,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:10,571 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:10,571 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:10,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:10,572 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:10,572 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:10,646 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:10,647 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:10,648 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:10,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:10,648 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:10,648 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:10,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3384 [2022-12-06 07:36:10,648 INFO L420 AbstractCegarLoop]: === Iteration 3386 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:10,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:10,648 INFO L85 PathProgramCache]: Analyzing trace with hash -494268724, now seen corresponding path program 1 times [2022-12-06 07:36:10,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:10,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798839024] [2022-12-06 07:36:10,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:10,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:10,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:10,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-06 07:36:10,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:10,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798839024] [2022-12-06 07:36:10,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798839024] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:10,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:10,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:10,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244235309] [2022-12-06 07:36:10,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:10,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:10,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:10,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:10,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:10,717 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:10,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:10,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:10,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:10,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:10,759 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:10,759 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:10,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:10,760 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:10,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:10,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:10,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:10,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:10,760 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:10,760 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:10,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:10,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:10,761 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:10,761 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:10,761 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:10,761 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:10,761 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:10,761 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:10,761 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:10,761 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:10,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:10,763 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:10,764 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:10,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:10,764 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:10,764 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:10,838 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:10,839 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:10,839 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:10,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:10,839 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:10,839 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:10,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3385 [2022-12-06 07:36:10,840 INFO L420 AbstractCegarLoop]: === Iteration 3387 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:10,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:10,840 INFO L85 PathProgramCache]: Analyzing trace with hash -467486615, now seen corresponding path program 1 times [2022-12-06 07:36:10,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:10,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209344725] [2022-12-06 07:36:10,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:10,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:10,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:10,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:10,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209344725] [2022-12-06 07:36:10,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209344725] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:10,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:10,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:10,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699461546] [2022-12-06 07:36:10,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:10,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:10,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:10,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:10,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:10,910 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:10,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:10,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:10,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:10,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:10,949 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:10,949 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:10,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:10,950 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:10,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:10,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:10,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:10,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:10,950 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:10,950 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:10,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:10,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:10,951 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:10,951 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:10,951 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:10,951 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:10,951 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:10,951 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:10,951 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:10,951 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:10,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:10,954 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:10,954 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:10,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 143 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:10,954 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:10,954 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:11,028 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:11,029 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:11,029 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:11,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:11,029 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:11,029 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:11,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3386 [2022-12-06 07:36:11,029 INFO L420 AbstractCegarLoop]: === Iteration 3388 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:11,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:11,030 INFO L85 PathProgramCache]: Analyzing trace with hash -437010422, now seen corresponding path program 1 times [2022-12-06 07:36:11,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:11,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001076264] [2022-12-06 07:36:11,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:11,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:11,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-06 07:36:11,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:11,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001076264] [2022-12-06 07:36:11,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001076264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:11,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:11,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:11,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566395410] [2022-12-06 07:36:11,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:11,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:11,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:11,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:11,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:11,098 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:11,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:11,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:11,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:11,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:11,139 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:11,139 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:11,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:11,139 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:11,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:11,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:11,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:11,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:11,140 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:11,140 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:11,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:11,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:11,141 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:11,141 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:11,141 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:11,141 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:11,141 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:11,141 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:11,141 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:11,141 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:11,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:11,143 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:11,143 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:11,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:11,144 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:11,144 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:11,217 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:11,219 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:11,219 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:11,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:11,219 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:11,219 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:11,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3387 [2022-12-06 07:36:11,219 INFO L420 AbstractCegarLoop]: === Iteration 3389 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:11,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:11,219 INFO L85 PathProgramCache]: Analyzing trace with hash -410228313, now seen corresponding path program 1 times [2022-12-06 07:36:11,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:11,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683545973] [2022-12-06 07:36:11,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:11,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:11,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-06 07:36:11,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:11,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683545973] [2022-12-06 07:36:11,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683545973] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:11,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:11,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:11,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524125262] [2022-12-06 07:36:11,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:11,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:11,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:11,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:11,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:11,290 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:11,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:11,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:11,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:11,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:11,331 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:11,331 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:11,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:11,332 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:11,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:11,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:11,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:11,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:11,332 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:11,332 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:11,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:11,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:11,333 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:11,333 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:11,333 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:11,333 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:11,333 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:11,334 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:11,334 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:11,334 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:11,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:11,336 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:11,336 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:11,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:11,336 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:11,336 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:11,410 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:11,412 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:11,412 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:11,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:11,412 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:11,412 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:11,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3388 [2022-12-06 07:36:11,412 INFO L420 AbstractCegarLoop]: === Iteration 3390 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:11,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:11,412 INFO L85 PathProgramCache]: Analyzing trace with hash -379752120, now seen corresponding path program 1 times [2022-12-06 07:36:11,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:11,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089708489] [2022-12-06 07:36:11,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:11,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:11,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-06 07:36:11,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:11,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089708489] [2022-12-06 07:36:11,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089708489] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:11,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:11,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:11,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833857098] [2022-12-06 07:36:11,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:11,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:11,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:11,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:11,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:11,485 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:11,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:11,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:11,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:11,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:11,521 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:11,521 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:11,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:11,522 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:11,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:11,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:11,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:11,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:11,522 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:11,522 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:11,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:11,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:11,523 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:11,523 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:11,523 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:11,523 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:11,523 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:11,523 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:11,523 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:11,523 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:11,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:11,525 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:11,525 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:11,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:11,526 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:11,526 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:11,598 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:11,600 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:36:11,600 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:11,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:11,600 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:11,600 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:11,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3389 [2022-12-06 07:36:11,600 INFO L420 AbstractCegarLoop]: === Iteration 3391 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:11,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:11,600 INFO L85 PathProgramCache]: Analyzing trace with hash -352970011, now seen corresponding path program 1 times [2022-12-06 07:36:11,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:11,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832989405] [2022-12-06 07:36:11,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:11,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:11,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-06 07:36:11,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:11,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832989405] [2022-12-06 07:36:11,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832989405] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:11,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:11,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:11,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844939388] [2022-12-06 07:36:11,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:11,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:11,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:11,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:11,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:11,687 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:11,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:11,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:11,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:11,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:11,722 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:11,722 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:11,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:11,723 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:11,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:11,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:11,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:11,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:11,723 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:11,723 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:11,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:11,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:11,724 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:11,724 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:11,724 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:11,724 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:11,724 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:11,724 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:11,724 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:11,724 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:11,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:11,726 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:11,727 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:11,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:11,727 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:11,727 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:11,801 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:11,802 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:11,802 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:11,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:11,802 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:11,802 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:11,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3390 [2022-12-06 07:36:11,802 INFO L420 AbstractCegarLoop]: === Iteration 3392 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:11,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:11,803 INFO L85 PathProgramCache]: Analyzing trace with hash -322493818, now seen corresponding path program 1 times [2022-12-06 07:36:11,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:11,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549174266] [2022-12-06 07:36:11,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:11,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:11,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-06 07:36:11,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:11,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549174266] [2022-12-06 07:36:11,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549174266] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:11,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:11,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:11,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056309757] [2022-12-06 07:36:11,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:11,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:11,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:11,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:11,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:11,871 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:11,871 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:11,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:11,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:11,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:11,912 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:11,912 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:11,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:11,913 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:11,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:11,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:11,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:11,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:11,913 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:11,913 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:11,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:11,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:11,914 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:11,914 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:11,914 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:11,914 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:11,914 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:11,914 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:11,914 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:11,914 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:11,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:11,916 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:11,916 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:11,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 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 116. Up to 16 conditions per place. [2022-12-06 07:36:11,917 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:11,917 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:12,004 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:12,005 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-06 07:36:12,005 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:12,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:12,005 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:12,005 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:12,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3391 [2022-12-06 07:36:12,005 INFO L420 AbstractCegarLoop]: === Iteration 3393 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:12,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:12,006 INFO L85 PathProgramCache]: Analyzing trace with hash -295711709, now seen corresponding path program 1 times [2022-12-06 07:36:12,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:12,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151940636] [2022-12-06 07:36:12,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:12,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:12,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-06 07:36:12,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:12,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151940636] [2022-12-06 07:36:12,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151940636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:12,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:12,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:12,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367944265] [2022-12-06 07:36:12,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:12,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:12,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:12,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:12,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:12,075 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:12,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:12,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:12,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:12,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:12,117 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:12,117 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:12,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:12,117 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:12,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:12,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:12,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:12,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:12,118 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:12,118 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:12,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:12,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:12,119 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:12,119 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:12,119 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:12,119 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:12,119 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:12,119 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:12,119 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:12,119 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:12,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:12,121 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:12,121 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:12,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:12,122 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:12,122 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:12,196 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:12,198 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:12,198 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:12,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:12,198 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:12,198 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:12,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3392 [2022-12-06 07:36:12,198 INFO L420 AbstractCegarLoop]: === Iteration 3394 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:12,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:12,198 INFO L85 PathProgramCache]: Analyzing trace with hash -265235516, now seen corresponding path program 1 times [2022-12-06 07:36:12,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:12,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163305659] [2022-12-06 07:36:12,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:12,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36: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-06 07:36:12,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:12,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163305659] [2022-12-06 07:36:12,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163305659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:12,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:12,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:12,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812442992] [2022-12-06 07:36:12,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:12,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:12,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:12,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:12,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:12,268 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:12,268 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:12,268 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:12,268 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:12,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:12,305 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:12,305 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:12,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:12,305 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:12,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:12,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:12,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:12,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:12,306 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:12,306 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:12,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:12,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:12,306 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:12,307 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:12,307 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:12,307 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:12,307 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:12,307 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:12,307 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:12,307 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:12,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:12,309 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:12,309 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:12,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:12,309 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:12,310 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:12,384 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:12,385 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:12,385 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:12,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:12,386 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:12,386 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:12,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3393 [2022-12-06 07:36:12,386 INFO L420 AbstractCegarLoop]: === Iteration 3395 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:12,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:12,386 INFO L85 PathProgramCache]: Analyzing trace with hash -238453407, now seen corresponding path program 1 times [2022-12-06 07:36:12,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:12,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898782393] [2022-12-06 07:36:12,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:12,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:12,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:12,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:12,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898782393] [2022-12-06 07:36:12,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898782393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:12,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:12,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:12,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479060359] [2022-12-06 07:36:12,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:12,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:12,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:12,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:12,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:12,456 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:12,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:12,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:12,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:12,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:12,495 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:12,495 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:12,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:12,495 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:12,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:12,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:12,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:12,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:12,496 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:12,496 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:12,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:12,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:12,497 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:12,497 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:12,497 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:12,497 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:12,497 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:12,497 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:12,497 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:12,497 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:12,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:12,499 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:12,499 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:12,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:12,500 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:12,500 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:12,573 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:12,575 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:12,575 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:12,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:12,575 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:12,575 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:12,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3394 [2022-12-06 07:36:12,575 INFO L420 AbstractCegarLoop]: === Iteration 3396 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:12,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:12,575 INFO L85 PathProgramCache]: Analyzing trace with hash -207977214, now seen corresponding path program 1 times [2022-12-06 07:36:12,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:12,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155406955] [2022-12-06 07:36:12,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:12,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:12,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:12,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:12,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155406955] [2022-12-06 07:36:12,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155406955] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:12,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:12,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:12,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093240657] [2022-12-06 07:36:12,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:12,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:12,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:12,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:12,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:12,645 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:12,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:12,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:12,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:12,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:12,686 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:12,686 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:12,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:12,687 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:12,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:12,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:12,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:12,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:12,687 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:12,687 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:12,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:12,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:12,688 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:12,688 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:12,688 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:12,688 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:12,688 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:12,688 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:12,688 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:12,688 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:12,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:12,690 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:12,690 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:12,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:12,691 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:12,691 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:12,766 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:12,768 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:12,768 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:12,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:12,768 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:12,768 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:12,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3395 [2022-12-06 07:36:12,768 INFO L420 AbstractCegarLoop]: === Iteration 3397 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:12,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:12,768 INFO L85 PathProgramCache]: Analyzing trace with hash -181195105, now seen corresponding path program 1 times [2022-12-06 07:36:12,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:12,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311731687] [2022-12-06 07:36:12,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:12,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:12,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-06 07:36:12,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:12,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311731687] [2022-12-06 07:36:12,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311731687] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:12,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:12,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:12,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151594336] [2022-12-06 07:36:12,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:12,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:12,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:12,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:12,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:12,838 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:12,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:12,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:12,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:12,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:12,890 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:12,890 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:12,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:12,891 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:12,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:12,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:12,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:12,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:12,891 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:12,891 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:12,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:12,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:12,892 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:12,892 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:12,892 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:12,892 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:12,892 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:12,892 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:12,892 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:12,892 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:12,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:12,895 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:12,895 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:12,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:12,895 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:12,895 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:12,970 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:12,971 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:12,971 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:12,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:12,971 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:12,971 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:12,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3396 [2022-12-06 07:36:12,971 INFO L420 AbstractCegarLoop]: === Iteration 3398 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:12,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:12,972 INFO L85 PathProgramCache]: Analyzing trace with hash -150718912, now seen corresponding path program 1 times [2022-12-06 07:36:12,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:12,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384486100] [2022-12-06 07:36:12,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:12,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:13,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-06 07:36:13,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:13,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384486100] [2022-12-06 07:36:13,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384486100] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:13,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:13,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:13,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107177660] [2022-12-06 07:36:13,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:13,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:13,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:13,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:13,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:13,039 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:13,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:13,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:13,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:13,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:13,081 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:13,081 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:13,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:13,081 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:13,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:13,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:13,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:13,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:13,082 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:13,082 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:13,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:13,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:13,082 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:13,082 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:13,083 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:13,083 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:13,083 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:13,083 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:13,083 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:13,083 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:13,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:13,085 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:13,085 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:13,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:13,085 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:13,085 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:13,158 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:13,160 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:36:13,160 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:13,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:13,160 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:13,160 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:13,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3397 [2022-12-06 07:36:13,160 INFO L420 AbstractCegarLoop]: === Iteration 3399 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:13,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:13,160 INFO L85 PathProgramCache]: Analyzing trace with hash -123936803, now seen corresponding path program 1 times [2022-12-06 07:36:13,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:13,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298290457] [2022-12-06 07:36:13,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:13,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:13,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-06 07:36:13,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:13,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298290457] [2022-12-06 07:36:13,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298290457] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:13,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:13,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:13,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856231532] [2022-12-06 07:36:13,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:13,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:13,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:13,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:13,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:13,232 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:13,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:13,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:13,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:13,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:13,266 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:13,266 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:13,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 373 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:13,267 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:13,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:13,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:13,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:13,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:13,267 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:13,267 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:13,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:13,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:13,268 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:13,268 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:13,268 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:13,268 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:13,268 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:13,269 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:13,269 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:13,269 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:13,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:13,271 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:13,271 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:13,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:13,271 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:13,271 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:13,345 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:13,347 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:13,347 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:13,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:13,347 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:13,347 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:13,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3398 [2022-12-06 07:36:13,347 INFO L420 AbstractCegarLoop]: === Iteration 3400 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:13,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:13,347 INFO L85 PathProgramCache]: Analyzing trace with hash -93460610, now seen corresponding path program 1 times [2022-12-06 07:36:13,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:13,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297106835] [2022-12-06 07:36:13,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:13,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:13,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-06 07:36:13,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:13,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297106835] [2022-12-06 07:36:13,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297106835] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:13,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:13,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:13,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430340031] [2022-12-06 07:36:13,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:13,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:13,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:13,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:13,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:13,415 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:13,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:13,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:13,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:13,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:13,452 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:13,452 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:13,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:13,452 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:13,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:13,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:13,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:13,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:13,453 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:13,453 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:13,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:13,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:13,454 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:13,454 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:13,454 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:13,454 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:13,454 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:13,454 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:13,454 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:13,454 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:13,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:13,456 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:13,456 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:13,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:13,457 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:13,457 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:13,531 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:13,532 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:13,532 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:13,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:13,532 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:13,532 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:13,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3399 [2022-12-06 07:36:13,532 INFO L420 AbstractCegarLoop]: === Iteration 3401 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:13,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:13,533 INFO L85 PathProgramCache]: Analyzing trace with hash -66678501, now seen corresponding path program 1 times [2022-12-06 07:36:13,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:13,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699036138] [2022-12-06 07:36:13,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:13,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:13,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-06 07:36:13,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:13,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699036138] [2022-12-06 07:36:13,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699036138] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:13,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:13,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:13,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794126707] [2022-12-06 07:36:13,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:13,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:13,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:13,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:13,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:13,602 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:13,602 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:13,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:13,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:13,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:13,638 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:13,638 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:13,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:13,639 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:13,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:13,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:13,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:13,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:13,639 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:13,639 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:13,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:13,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:13,640 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:13,640 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:13,640 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:13,640 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:13,640 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:13,640 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:13,640 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:13,640 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:13,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:13,642 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:13,643 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:13,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:13,643 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:13,643 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:13,714 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:13,716 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:36:13,716 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:13,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:13,716 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:13,716 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:13,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3400 [2022-12-06 07:36:13,716 INFO L420 AbstractCegarLoop]: === Iteration 3402 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:13,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:13,716 INFO L85 PathProgramCache]: Analyzing trace with hash -36202308, now seen corresponding path program 1 times [2022-12-06 07:36:13,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:13,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823200283] [2022-12-06 07:36:13,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:13,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:13,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-06 07:36:13,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:13,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823200283] [2022-12-06 07:36:13,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823200283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:13,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:13,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:13,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197786273] [2022-12-06 07:36:13,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:13,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:13,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:13,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:13,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:13,784 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:13,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:13,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:13,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:13,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:13,820 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:13,820 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:13,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:13,821 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:13,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:13,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:13,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:13,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:13,821 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:13,821 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:13,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:13,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:13,822 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:13,822 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:13,822 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:13,822 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:13,822 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:13,822 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:13,822 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:13,822 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:13,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:13,824 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:13,824 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:13,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:13,825 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:13,825 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:13,898 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:13,899 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:36:13,899 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:13,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:13,900 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:13,900 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:13,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3401 [2022-12-06 07:36:13,900 INFO L420 AbstractCegarLoop]: === Iteration 3403 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:13,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:13,900 INFO L85 PathProgramCache]: Analyzing trace with hash -9420199, now seen corresponding path program 1 times [2022-12-06 07:36:13,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:13,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21473513] [2022-12-06 07:36:13,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:13,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:13,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-06 07:36:13,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:13,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21473513] [2022-12-06 07:36:13,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21473513] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:13,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:13,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:13,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58255696] [2022-12-06 07:36:13,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:13,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:13,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:13,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:13,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:13,971 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:13,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:13,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:13,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:13,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:14,009 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:14,010 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:14,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:14,010 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:14,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:14,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:14,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:14,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:14,011 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:14,011 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:14,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:14,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:14,011 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:14,011 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:14,012 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:14,012 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:14,012 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:14,012 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:14,012 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:14,012 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:14,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:14,014 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:14,014 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:14,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:14,014 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:14,014 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:14,088 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:14,089 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:36:14,089 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:14,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:14,089 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:14,089 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:14,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3402 [2022-12-06 07:36:14,090 INFO L420 AbstractCegarLoop]: === Iteration 3404 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:14,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:14,090 INFO L85 PathProgramCache]: Analyzing trace with hash 21055994, now seen corresponding path program 1 times [2022-12-06 07:36:14,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:14,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120602756] [2022-12-06 07:36:14,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:14,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:14,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-06 07:36:14,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:14,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120602756] [2022-12-06 07:36:14,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120602756] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:14,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:14,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:14,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819094597] [2022-12-06 07:36:14,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:14,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:14,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:14,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:14,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:14,168 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:14,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:14,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:14,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:14,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:14,211 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:14,211 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:14,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:14,211 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:14,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:14,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:14,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:14,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:14,212 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:14,212 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:14,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:14,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:14,212 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:14,213 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:14,213 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:14,213 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:14,213 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:14,213 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:14,213 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:14,213 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:14,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:14,215 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:14,215 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:14,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:14,216 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:14,216 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:14,289 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:14,290 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:36:14,290 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:14,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:14,290 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:14,290 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:14,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3403 [2022-12-06 07:36:14,290 INFO L420 AbstractCegarLoop]: === Iteration 3405 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:14,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:14,290 INFO L85 PathProgramCache]: Analyzing trace with hash 47838103, now seen corresponding path program 1 times [2022-12-06 07:36:14,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:14,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377236143] [2022-12-06 07:36:14,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:14,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:14,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-06 07:36:14,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:14,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377236143] [2022-12-06 07:36:14,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377236143] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:14,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:14,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:14,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319326558] [2022-12-06 07:36:14,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:14,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:14,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:14,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:14,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:14,360 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:14,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:14,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:14,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:14,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:14,393 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:14,394 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:14,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 371 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:14,394 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:14,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:14,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:14,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:14,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:14,394 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:14,395 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:14,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:14,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:14,395 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:14,395 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:14,395 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:14,395 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:14,395 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:14,396 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:14,396 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:14,396 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:14,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:14,398 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:14,398 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:14,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:14,398 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:14,398 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:14,472 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:14,473 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:14,473 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:14,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:14,473 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:14,473 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:14,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3404 [2022-12-06 07:36:14,474 INFO L420 AbstractCegarLoop]: === Iteration 3406 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:14,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:14,474 INFO L85 PathProgramCache]: Analyzing trace with hash 78314296, now seen corresponding path program 1 times [2022-12-06 07:36:14,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:14,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785442208] [2022-12-06 07:36:14,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:14,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:14,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-06 07:36:14,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:14,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785442208] [2022-12-06 07:36:14,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785442208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:14,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:14,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:14,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684687357] [2022-12-06 07:36:14,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:14,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:14,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:14,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:14,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:14,540 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:14,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:14,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:14,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:14,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:14,582 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:14,582 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:14,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:14,583 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:14,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:14,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:14,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:14,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:14,583 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:14,584 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:14,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:14,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:14,584 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:14,584 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:14,584 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:14,584 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:14,584 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:14,585 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:14,585 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:14,585 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:14,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:14,587 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:14,587 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:14,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:14,587 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:14,587 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:14,662 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:14,663 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:14,663 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:14,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:14,663 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:14,663 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:14,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3405 [2022-12-06 07:36:14,663 INFO L420 AbstractCegarLoop]: === Iteration 3407 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:14,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:14,664 INFO L85 PathProgramCache]: Analyzing trace with hash 105096405, now seen corresponding path program 1 times [2022-12-06 07:36:14,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:14,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471930978] [2022-12-06 07:36:14,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:14,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:14,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:14,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-06 07:36:14,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:14,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471930978] [2022-12-06 07:36:14,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471930978] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:14,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:14,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:14,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948081922] [2022-12-06 07:36:14,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:14,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:14,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:14,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:14,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:14,734 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:14,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:14,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:14,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:14,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:14,775 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:14,775 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:14,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:14,776 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:14,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:14,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:14,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:14,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:14,776 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:14,776 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:14,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:14,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:14,777 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:14,777 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:14,777 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:14,777 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:14,777 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:14,777 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:14,777 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:14,777 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:14,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:14,779 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:14,780 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:14,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:14,780 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:14,780 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:14,855 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:14,856 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:14,856 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:14,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:14,856 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:14,856 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:14,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3406 [2022-12-06 07:36:14,856 INFO L420 AbstractCegarLoop]: === Iteration 3408 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:14,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:14,856 INFO L85 PathProgramCache]: Analyzing trace with hash 135572598, now seen corresponding path program 1 times [2022-12-06 07:36:14,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:14,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955554631] [2022-12-06 07:36:14,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:14,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:14,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-06 07:36:14,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:14,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955554631] [2022-12-06 07:36:14,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955554631] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:14,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:14,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:14,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818348115] [2022-12-06 07:36:14,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:14,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:14,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:14,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:14,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:14,925 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:14,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:14,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:14,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:14,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:14,967 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:14,967 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:14,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:14,968 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:14,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:14,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:14,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:14,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:14,968 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:14,968 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:14,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:14,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:14,969 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:14,969 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:14,969 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:14,969 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:14,969 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:14,969 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:14,969 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:14,969 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:14,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:14,972 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:14,972 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:14,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:14,972 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:14,972 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:15,045 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:15,047 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:15,047 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:15,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:15,047 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:15,047 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:15,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3407 [2022-12-06 07:36:15,047 INFO L420 AbstractCegarLoop]: === Iteration 3409 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:15,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:15,047 INFO L85 PathProgramCache]: Analyzing trace with hash 162354707, now seen corresponding path program 1 times [2022-12-06 07:36:15,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:15,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351098927] [2022-12-06 07:36:15,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:15,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:15,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-06 07:36:15,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:15,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351098927] [2022-12-06 07:36:15,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351098927] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:15,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:15,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:15,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235641538] [2022-12-06 07:36:15,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:15,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:15,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:15,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:15,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:15,119 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:15,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:15,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:15,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:15,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:15,154 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:15,154 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:15,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:15,155 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:15,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:15,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:15,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:15,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:15,155 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:15,155 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:15,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:15,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:15,156 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:15,156 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:15,156 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:15,156 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:15,156 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:15,157 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:15,157 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:15,157 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:15,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:15,159 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:15,159 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:15,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:15,159 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:15,159 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:15,233 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:15,234 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:15,235 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:15,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:15,235 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:15,235 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:15,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3408 [2022-12-06 07:36:15,235 INFO L420 AbstractCegarLoop]: === Iteration 3410 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:15,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:15,235 INFO L85 PathProgramCache]: Analyzing trace with hash 192830900, now seen corresponding path program 1 times [2022-12-06 07:36:15,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:15,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606254053] [2022-12-06 07:36:15,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:15,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:15,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:15,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-06 07:36:15,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:15,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606254053] [2022-12-06 07:36:15,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606254053] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:15,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:15,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:15,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699006354] [2022-12-06 07:36:15,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:15,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:15,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:15,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:15,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:15,320 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:15,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:15,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:15,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:15,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:15,361 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:15,361 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:15,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:15,362 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:15,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:15,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:15,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:15,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:15,362 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:15,362 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:15,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:15,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:15,363 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:15,363 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:15,363 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:15,363 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:15,363 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:15,364 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:15,364 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:15,364 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:15,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:15,366 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:15,366 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:15,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 118 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:15,366 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:15,366 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:15,439 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:15,441 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:15,441 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:15,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:15,441 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:15,441 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:15,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3409 [2022-12-06 07:36:15,441 INFO L420 AbstractCegarLoop]: === Iteration 3411 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:15,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:15,441 INFO L85 PathProgramCache]: Analyzing trace with hash 219613009, now seen corresponding path program 1 times [2022-12-06 07:36:15,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:15,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068330246] [2022-12-06 07:36:15,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:15,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:15,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-06 07:36:15,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:15,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068330246] [2022-12-06 07:36:15,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068330246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:15,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:15,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:15,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903148215] [2022-12-06 07:36:15,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:15,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:15,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:15,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:15,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:15,511 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:15,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:15,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:15,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:15,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:15,548 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:15,548 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:15,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:15,548 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:15,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:15,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:15,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:15,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:15,549 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:15,549 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:15,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:15,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:15,550 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:15,550 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:15,550 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:15,550 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:15,550 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:15,550 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:15,550 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:15,550 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:15,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:15,552 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:15,552 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:15,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:15,553 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:15,553 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:15,626 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:15,628 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:15,628 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:15,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:15,628 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:15,628 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:15,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3410 [2022-12-06 07:36:15,628 INFO L420 AbstractCegarLoop]: === Iteration 3412 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:15,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:15,628 INFO L85 PathProgramCache]: Analyzing trace with hash 250089202, now seen corresponding path program 1 times [2022-12-06 07:36:15,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:15,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901405228] [2022-12-06 07:36:15,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:15,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:15,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-06 07:36:15,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:15,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901405228] [2022-12-06 07:36:15,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901405228] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:15,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:15,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:15,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770990877] [2022-12-06 07:36:15,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:15,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:15,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:15,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:15,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:15,698 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:15,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:15,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:15,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:15,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:15,751 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:15,751 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:15,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:15,752 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:15,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:15,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:15,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:15,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:15,752 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:15,752 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:15,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:15,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:15,753 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:15,753 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:15,753 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:15,753 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:15,753 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:15,753 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:15,753 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:15,754 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:15,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:15,756 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:15,756 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:15,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:15,756 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:15,756 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:15,833 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:15,834 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:36:15,834 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:15,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:15,834 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:15,835 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:15,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3411 [2022-12-06 07:36:15,835 INFO L420 AbstractCegarLoop]: === Iteration 3413 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:15,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:15,835 INFO L85 PathProgramCache]: Analyzing trace with hash 276871311, now seen corresponding path program 1 times [2022-12-06 07:36:15,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:15,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611901379] [2022-12-06 07:36:15,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:15,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36: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-06 07:36:15,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:15,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611901379] [2022-12-06 07:36:15,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611901379] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:15,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:15,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:15,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625396134] [2022-12-06 07:36:15,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:15,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:15,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:15,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:15,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:15,903 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:15,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:15,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:15,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:15,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:15,944 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:15,944 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:15,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:15,945 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:15,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:15,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:15,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:15,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:15,945 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:15,945 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:15,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:15,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:15,946 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:15,946 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:15,946 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:15,946 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:15,946 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:15,946 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:15,946 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:15,946 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:15,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:15,948 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:15,949 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:15,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:15,949 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:15,949 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:16,024 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:16,025 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:16,025 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:16,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:16,025 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:16,025 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:16,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3412 [2022-12-06 07:36:16,026 INFO L420 AbstractCegarLoop]: === Iteration 3414 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:16,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:16,026 INFO L85 PathProgramCache]: Analyzing trace with hash 307347504, now seen corresponding path program 1 times [2022-12-06 07:36:16,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:16,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818214150] [2022-12-06 07:36:16,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:16,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:16,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-06 07:36:16,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:16,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818214150] [2022-12-06 07:36:16,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818214150] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:16,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:16,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:16,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569932112] [2022-12-06 07:36:16,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:16,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:16,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:16,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:16,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:16,093 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:16,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:16,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:16,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:16,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:16,134 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:16,134 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:16,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 349 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:16,134 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:16,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:16,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:16,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:16,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:16,135 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:16,135 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:16,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:16,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:16,135 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:16,136 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:16,136 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:16,136 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:16,136 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:16,136 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:16,136 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:16,136 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:16,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:16,138 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:16,138 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:16,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:16,138 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:16,139 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:16,215 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:16,216 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:16,216 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:16,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:16,216 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:16,216 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:16,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3413 [2022-12-06 07:36:16,216 INFO L420 AbstractCegarLoop]: === Iteration 3415 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:16,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:16,217 INFO L85 PathProgramCache]: Analyzing trace with hash 334129613, now seen corresponding path program 1 times [2022-12-06 07:36:16,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:16,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915702459] [2022-12-06 07:36:16,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:16,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:16,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:16,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:16,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915702459] [2022-12-06 07:36:16,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915702459] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:16,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:16,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:16,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261645151] [2022-12-06 07:36:16,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:16,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:16,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:16,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:16,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:16,287 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:16,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:16,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:16,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:16,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:16,323 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:16,323 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:16,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:16,323 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:16,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:16,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:16,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:16,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:16,324 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:16,324 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:16,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:16,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:16,325 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:16,325 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:16,325 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:16,325 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:16,325 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:16,325 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:16,325 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:16,325 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:16,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:16,327 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:16,327 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:16,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:16,328 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:16,328 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:16,403 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:16,405 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:16,405 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:16,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:16,405 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:16,405 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:16,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3414 [2022-12-06 07:36:16,405 INFO L420 AbstractCegarLoop]: === Iteration 3416 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:16,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:16,405 INFO L85 PathProgramCache]: Analyzing trace with hash 364605806, now seen corresponding path program 1 times [2022-12-06 07:36:16,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:16,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541010005] [2022-12-06 07:36:16,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:16,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:16,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:16,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:16,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541010005] [2022-12-06 07:36:16,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541010005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:16,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:16,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:16,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601069278] [2022-12-06 07:36:16,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:16,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:16,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:16,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:16,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:16,491 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:16,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:16,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:16,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:16,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:16,526 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:16,527 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:16,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:16,527 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:16,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:16,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:16,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:16,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:16,527 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:16,528 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:16,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:16,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:16,528 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:16,528 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:16,528 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:16,528 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:16,528 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:16,529 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:16,529 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:16,529 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:16,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:16,531 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:16,531 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:16,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:16,531 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:16,531 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:16,605 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:16,606 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:16,606 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:16,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:16,606 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:16,606 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:16,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3415 [2022-12-06 07:36:16,606 INFO L420 AbstractCegarLoop]: === Iteration 3417 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:16,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:16,607 INFO L85 PathProgramCache]: Analyzing trace with hash 391387915, now seen corresponding path program 1 times [2022-12-06 07:36:16,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:16,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030963492] [2022-12-06 07:36:16,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:16,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:16,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-06 07:36:16,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:16,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030963492] [2022-12-06 07:36:16,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030963492] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:16,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:16,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:16,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7220655] [2022-12-06 07:36:16,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:16,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:16,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:16,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:16,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:16,678 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:16,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:16,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:16,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:16,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:16,715 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:16,715 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:16,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 354 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:16,715 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:16,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:16,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:16,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:16,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:16,716 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:16,716 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:16,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:16,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:16,717 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:16,717 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:16,717 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:16,717 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:16,717 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:16,717 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:16,717 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:16,717 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:16,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:16,719 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:16,719 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:16,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:16,720 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:16,720 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:16,793 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:16,795 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:16,795 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:16,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:16,795 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:16,795 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:16,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3416 [2022-12-06 07:36:16,795 INFO L420 AbstractCegarLoop]: === Iteration 3418 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:16,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:16,795 INFO L85 PathProgramCache]: Analyzing trace with hash 421864108, now seen corresponding path program 1 times [2022-12-06 07:36:16,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:16,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848966358] [2022-12-06 07:36:16,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:16,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:16,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-06 07:36:16,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:16,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848966358] [2022-12-06 07:36:16,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848966358] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:16,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:16,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:16,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986430082] [2022-12-06 07:36:16,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:16,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:16,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:16,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:16,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:16,863 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:16,863 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:16,863 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:16,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:16,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:16,905 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:16,906 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:16,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:16,906 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:16,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:16,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:16,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:16,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:16,907 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:16,907 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:16,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:16,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:16,907 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:16,907 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:16,908 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:16,908 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:16,908 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:16,908 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:16,908 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:16,908 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:16,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:16,910 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:16,910 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:16,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:16,910 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:16,910 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:16,985 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:16,987 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:16,987 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:16,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:16,987 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:16,987 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:16,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3417 [2022-12-06 07:36:16,987 INFO L420 AbstractCegarLoop]: === Iteration 3419 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:16,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:16,987 INFO L85 PathProgramCache]: Analyzing trace with hash 448646217, now seen corresponding path program 1 times [2022-12-06 07:36:16,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:16,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502432218] [2022-12-06 07:36:16,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:16,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:17,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:17,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:17,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502432218] [2022-12-06 07:36:17,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502432218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:17,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:17,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:17,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645635179] [2022-12-06 07:36:17,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:17,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:17,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:17,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:17,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:17,057 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:17,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:17,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:17,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:17,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:17,097 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:17,097 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:17,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:17,097 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:17,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:17,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:17,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:17,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:17,098 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:17,098 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:17,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:17,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:17,098 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:17,098 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:17,099 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:17,099 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:17,099 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:17,099 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:17,099 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:17,099 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:17,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:17,101 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:17,101 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:17,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:17,101 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:17,101 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:17,176 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:17,178 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:17,178 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:17,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:17,178 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:17,178 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:17,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3418 [2022-12-06 07:36:17,178 INFO L420 AbstractCegarLoop]: === Iteration 3420 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:17,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:17,178 INFO L85 PathProgramCache]: Analyzing trace with hash 479122410, now seen corresponding path program 1 times [2022-12-06 07:36:17,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:17,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784992414] [2022-12-06 07:36:17,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:17,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:17,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-06 07:36:17,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:17,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784992414] [2022-12-06 07:36:17,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784992414] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:17,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:17,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:17,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247607344] [2022-12-06 07:36:17,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:17,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:17,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:17,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:17,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:17,248 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:17,248 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:17,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:17,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:17,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:17,290 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:17,290 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:17,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:17,290 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:17,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:17,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:17,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:17,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:17,291 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:17,291 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:17,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:17,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:17,292 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:17,292 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:17,292 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:17,292 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:17,292 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:17,292 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:17,292 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:17,292 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:17,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:17,294 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:17,294 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:17,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:17,295 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:17,295 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:17,367 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:17,369 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:36:17,369 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:17,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:17,369 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:17,369 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:17,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3419 [2022-12-06 07:36:17,369 INFO L420 AbstractCegarLoop]: === Iteration 3421 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:17,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:17,369 INFO L85 PathProgramCache]: Analyzing trace with hash 505904519, now seen corresponding path program 1 times [2022-12-06 07:36:17,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:17,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864117851] [2022-12-06 07:36:17,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:17,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:17,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-06 07:36:17,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:17,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864117851] [2022-12-06 07:36:17,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864117851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:17,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:17,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:17,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534399344] [2022-12-06 07:36:17,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:17,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:17,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:17,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:17,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:17,441 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:17,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:17,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:17,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:17,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:17,482 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:17,482 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:17,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:17,482 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:17,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:17,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:17,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:17,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:17,483 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:17,483 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:17,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:17,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:17,484 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:17,484 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:17,484 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:17,484 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:17,484 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:17,484 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:17,484 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:17,484 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:17,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:17,486 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:17,486 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:17,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:17,487 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:17,487 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:17,561 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:17,562 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:17,562 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:17,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:17,562 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:17,562 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:17,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3420 [2022-12-06 07:36:17,562 INFO L420 AbstractCegarLoop]: === Iteration 3422 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:17,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:17,563 INFO L85 PathProgramCache]: Analyzing trace with hash 536380712, now seen corresponding path program 1 times [2022-12-06 07:36:17,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:17,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035483964] [2022-12-06 07:36:17,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:17,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:17,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-06 07:36:17,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:17,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035483964] [2022-12-06 07:36:17,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035483964] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:17,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:17,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:17,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832234277] [2022-12-06 07:36:17,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:17,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:17,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:17,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:17,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:17,631 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:17,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:17,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:17,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:17,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:17,672 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:17,672 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:17,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:17,672 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:17,672 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:17,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:17,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:17,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:17,673 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:17,673 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:17,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:17,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:17,673 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:17,673 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:17,674 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:17,674 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:17,674 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:17,674 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:17,674 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:17,674 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:17,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:17,676 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:17,676 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:17,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:17,676 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:17,676 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:17,763 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:17,764 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-06 07:36:17,764 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:17,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:17,764 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:17,764 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:17,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3421 [2022-12-06 07:36:17,764 INFO L420 AbstractCegarLoop]: === Iteration 3423 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:17,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:17,765 INFO L85 PathProgramCache]: Analyzing trace with hash 563162821, now seen corresponding path program 1 times [2022-12-06 07:36:17,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:17,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176153255] [2022-12-06 07:36:17,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:17,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36: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-06 07:36:17,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:17,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176153255] [2022-12-06 07:36:17,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176153255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:17,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:17,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:17,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406964394] [2022-12-06 07:36:17,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:17,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:17,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:17,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:17,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:17,836 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:17,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:17,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:17,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:17,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:17,877 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:17,877 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:17,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:17,878 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:17,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:17,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:17,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:17,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:17,878 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:17,878 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:17,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:17,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:17,879 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:17,879 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:17,879 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:17,879 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:17,879 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:17,879 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:17,879 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:17,879 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:17,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:17,882 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:17,882 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:17,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:17,882 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:17,882 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:17,956 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:17,958 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:17,958 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:17,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:17,958 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:17,958 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:17,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3422 [2022-12-06 07:36:17,958 INFO L420 AbstractCegarLoop]: === Iteration 3424 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:17,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:17,958 INFO L85 PathProgramCache]: Analyzing trace with hash 593639014, now seen corresponding path program 1 times [2022-12-06 07:36:17,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:17,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11397308] [2022-12-06 07:36:17,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:17,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36: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-06 07:36:18,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:18,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11397308] [2022-12-06 07:36:18,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11397308] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:18,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:18,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:18,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154293426] [2022-12-06 07:36:18,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:18,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:18,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:18,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:18,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:18,028 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:18,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:18,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:18,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:18,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:18,069 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:18,069 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:18,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 336 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:18,069 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:18,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:18,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:18,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:18,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:18,070 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:18,070 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:18,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:18,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:18,071 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:18,071 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:18,071 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:18,071 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:18,071 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:18,071 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:18,071 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:18,071 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:18,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:18,073 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:18,073 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:18,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:18,074 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:18,074 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:18,147 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:18,148 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:36:18,148 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:18,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:18,148 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:18,148 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:18,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3423 [2022-12-06 07:36:18,148 INFO L420 AbstractCegarLoop]: === Iteration 3425 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:18,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:18,149 INFO L85 PathProgramCache]: Analyzing trace with hash 620421123, now seen corresponding path program 1 times [2022-12-06 07:36:18,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:18,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830322112] [2022-12-06 07:36:18,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:18,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:18,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-06 07:36:18,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:18,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830322112] [2022-12-06 07:36:18,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830322112] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:18,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:18,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:18,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014111273] [2022-12-06 07:36:18,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:18,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:18,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:18,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:18,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:18,219 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:18,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:18,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:18,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:18,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:18,255 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:18,255 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:18,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:18,256 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:18,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:18,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:18,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:18,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:18,256 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:18,256 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:18,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:18,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:18,257 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:18,257 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:18,257 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:18,257 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:18,257 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:18,257 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:18,257 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:18,257 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:18,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:18,260 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:18,260 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:18,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:18,260 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:18,260 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:18,335 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:18,337 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:18,337 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:18,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:18,337 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:18,337 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:18,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3424 [2022-12-06 07:36:18,337 INFO L420 AbstractCegarLoop]: === Iteration 3426 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:18,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:18,337 INFO L85 PathProgramCache]: Analyzing trace with hash 650897316, now seen corresponding path program 1 times [2022-12-06 07:36:18,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:18,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307685180] [2022-12-06 07:36:18,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:18,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:18,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-06 07:36:18,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:18,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307685180] [2022-12-06 07:36:18,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307685180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:18,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:18,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:18,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378585940] [2022-12-06 07:36:18,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:18,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:18,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:18,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:18,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:18,405 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:18,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:18,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:18,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:18,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:18,447 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:18,447 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:18,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:18,447 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:18,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:18,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:18,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:18,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:18,448 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:18,448 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:18,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:18,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:18,448 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:18,448 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:18,449 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:18,449 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:18,449 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:18,449 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:18,449 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:18,449 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:18,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:18,451 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:18,451 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:18,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:18,451 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:18,451 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:18,526 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:18,528 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:18,528 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:18,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:18,528 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:18,528 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:18,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3425 [2022-12-06 07:36:18,528 INFO L420 AbstractCegarLoop]: === Iteration 3427 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:18,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:18,528 INFO L85 PathProgramCache]: Analyzing trace with hash 677679425, now seen corresponding path program 1 times [2022-12-06 07:36:18,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:18,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577826420] [2022-12-06 07:36:18,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:18,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:18,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-06 07:36:18,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:18,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577826420] [2022-12-06 07:36:18,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577826420] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:18,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:18,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:18,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143882218] [2022-12-06 07:36:18,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:18,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:18,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:18,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:18,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:18,599 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:18,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:18,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:18,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:18,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:18,640 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:18,640 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:18,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:18,641 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:18,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:18,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:18,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:18,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:18,641 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:18,641 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:18,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:18,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:18,642 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:18,642 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:18,642 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:18,642 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:18,642 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:18,642 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:18,642 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:18,643 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:18,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:18,645 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:18,645 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:18,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:18,645 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:18,645 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:18,720 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:18,721 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:18,721 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:18,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:18,721 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:18,721 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:18,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3426 [2022-12-06 07:36:18,721 INFO L420 AbstractCegarLoop]: === Iteration 3428 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:18,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:18,722 INFO L85 PathProgramCache]: Analyzing trace with hash 708155618, now seen corresponding path program 1 times [2022-12-06 07:36:18,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:18,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351151349] [2022-12-06 07:36:18,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:18,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:18,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:18,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:18,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:18,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351151349] [2022-12-06 07:36:18,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351151349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:18,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:18,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:18,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546605083] [2022-12-06 07:36:18,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:18,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:18,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:18,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:18,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:18,790 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:18,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:18,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:18,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:18,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:18,831 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:18,831 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:18,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:18,832 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:18,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:18,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:18,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:18,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:18,832 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:18,832 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:18,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:18,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:18,833 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:18,833 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:18,833 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:18,833 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:18,833 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:18,833 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:18,833 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:18,834 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:18,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:18,836 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:18,836 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:18,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:18,836 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:18,836 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:18,910 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:18,911 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:18,911 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:18,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:18,911 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:18,911 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:18,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3427 [2022-12-06 07:36:18,911 INFO L420 AbstractCegarLoop]: === Iteration 3429 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:18,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:18,912 INFO L85 PathProgramCache]: Analyzing trace with hash 734937727, now seen corresponding path program 1 times [2022-12-06 07:36:18,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:18,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47565958] [2022-12-06 07:36:18,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:18,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:18,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-06 07:36:18,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:18,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47565958] [2022-12-06 07:36:18,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47565958] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:18,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:18,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:18,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188602825] [2022-12-06 07:36:18,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:18,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:18,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:18,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:18,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:18,995 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:18,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:18,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:18,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:18,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:19,037 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:19,037 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:19,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:19,037 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:19,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:19,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:19,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:19,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:19,038 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:19,038 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:19,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:19,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:19,039 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:19,039 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:19,039 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:19,039 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:19,039 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:19,039 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:19,039 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:19,039 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:19,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:19,041 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:19,041 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:19,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:19,042 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:19,042 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:19,115 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:19,116 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:36:19,117 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:19,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:19,117 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:19,117 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:19,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3428 [2022-12-06 07:36:19,117 INFO L420 AbstractCegarLoop]: === Iteration 3430 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:19,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:19,117 INFO L85 PathProgramCache]: Analyzing trace with hash 765413920, now seen corresponding path program 1 times [2022-12-06 07:36:19,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:19,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756970394] [2022-12-06 07:36:19,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:19,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:19,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-06 07:36:19,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:19,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756970394] [2022-12-06 07:36:19,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756970394] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:19,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:19,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:19,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051672033] [2022-12-06 07:36:19,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:19,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:19,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:19,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:19,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:19,185 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:19,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:19,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:19,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:19,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:19,227 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:19,228 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:19,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:19,228 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:19,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:19,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:19,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:19,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:19,228 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:19,229 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:19,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:19,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:19,229 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:19,229 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:19,229 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:19,229 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:19,229 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:19,230 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:19,230 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:19,230 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:19,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:19,232 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:19,232 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:19,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:19,232 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:19,232 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:19,306 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:19,308 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:19,308 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:19,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:19,308 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:19,308 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:19,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3429 [2022-12-06 07:36:19,308 INFO L420 AbstractCegarLoop]: === Iteration 3431 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:19,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:19,308 INFO L85 PathProgramCache]: Analyzing trace with hash 792196029, now seen corresponding path program 1 times [2022-12-06 07:36:19,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:19,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481395249] [2022-12-06 07:36:19,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:19,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:19,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-06 07:36:19,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:19,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481395249] [2022-12-06 07:36:19,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481395249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:19,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:19,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:19,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677315158] [2022-12-06 07:36:19,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:19,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:19,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:19,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:19,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:19,377 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:19,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:19,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:19,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:19,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:19,413 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:19,413 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:19,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:19,413 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:19,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:19,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:19,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:19,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:19,414 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:19,414 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:19,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:19,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:19,415 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:19,415 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:19,415 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:19,415 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:19,415 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:19,415 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:19,415 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:19,415 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:19,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:19,417 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:19,417 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:19,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:19,418 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:19,418 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:19,492 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:19,494 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:19,494 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:19,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:19,494 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:19,494 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:19,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3430 [2022-12-06 07:36:19,494 INFO L420 AbstractCegarLoop]: === Iteration 3432 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:19,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:19,494 INFO L85 PathProgramCache]: Analyzing trace with hash 822672222, now seen corresponding path program 1 times [2022-12-06 07:36:19,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:19,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599668834] [2022-12-06 07:36:19,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:19,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:19,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-06 07:36:19,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:19,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599668834] [2022-12-06 07:36:19,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599668834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:19,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:19,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:19,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295606603] [2022-12-06 07:36:19,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:19,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:19,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:19,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:19,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:19,562 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:19,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:19,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:19,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:19,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:19,598 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:19,598 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:19,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:19,599 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:19,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:19,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:19,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:19,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:19,599 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:19,599 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:19,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:19,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:19,600 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:19,600 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:19,600 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:19,600 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:19,600 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:19,601 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:19,601 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:19,601 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:19,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:19,603 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:19,603 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:19,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:19,603 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:19,603 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:19,676 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:19,677 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:36:19,677 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:19,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:19,677 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:19,677 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:19,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3431 [2022-12-06 07:36:19,678 INFO L420 AbstractCegarLoop]: === Iteration 3433 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:19,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:19,678 INFO L85 PathProgramCache]: Analyzing trace with hash 849454331, now seen corresponding path program 1 times [2022-12-06 07:36:19,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:19,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662313754] [2022-12-06 07:36:19,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:19,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:19,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-06 07:36:19,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:19,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662313754] [2022-12-06 07:36:19,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662313754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:19,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:19,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:19,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669516613] [2022-12-06 07:36:19,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:19,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:19,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:19,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:19,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:19,748 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:19,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:19,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:19,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:19,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:19,788 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:19,788 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:19,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:19,789 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:19,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:19,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:19,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:19,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:19,789 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:19,789 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:19,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:19,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:19,790 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:19,790 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:19,790 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:19,790 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:19,790 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:19,790 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:19,791 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:19,791 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:19,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:19,793 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:19,793 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:19,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:19,793 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:19,793 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:19,867 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:19,868 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:19,868 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:19,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:19,868 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:19,868 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:19,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3432 [2022-12-06 07:36:19,868 INFO L420 AbstractCegarLoop]: === Iteration 3434 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:19,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:19,869 INFO L85 PathProgramCache]: Analyzing trace with hash 879930524, now seen corresponding path program 1 times [2022-12-06 07:36:19,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:19,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60771899] [2022-12-06 07:36:19,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:19,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:19,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:19,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:19,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60771899] [2022-12-06 07:36:19,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60771899] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:19,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:19,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:19,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014802255] [2022-12-06 07:36:19,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:19,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:19,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:19,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:19,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:19,936 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:19,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:19,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:19,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:19,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:19,972 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:19,972 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:19,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:19,973 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:19,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:19,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:19,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:19,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:19,973 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:19,973 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:19,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:19,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:19,974 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:19,974 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:19,974 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:19,974 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:19,974 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:19,974 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:19,974 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:19,974 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:19,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:19,977 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:19,977 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:19,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:19,977 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:19,977 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:20,056 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:20,057 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 07:36:20,057 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:20,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:20,057 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:20,057 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:20,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3433 [2022-12-06 07:36:20,057 INFO L420 AbstractCegarLoop]: === Iteration 3435 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:20,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:20,058 INFO L85 PathProgramCache]: Analyzing trace with hash 906712633, now seen corresponding path program 1 times [2022-12-06 07:36:20,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:20,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821167690] [2022-12-06 07:36:20,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:20,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:20,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-06 07:36:20,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:20,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821167690] [2022-12-06 07:36:20,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821167690] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:20,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:20,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:20,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690717786] [2022-12-06 07:36:20,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:20,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:20,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:20,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:20,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:20,144 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:20,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:20,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:20,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:20,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:20,185 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:20,185 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:20,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:20,185 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:20,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:20,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:20,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:20,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:20,186 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:20,186 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:20,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:20,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:20,187 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:20,187 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:20,187 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:20,187 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:20,187 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:20,187 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:20,187 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:20,187 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:20,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:20,189 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:20,189 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:20,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:20,190 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:20,190 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:20,264 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:20,265 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:20,265 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:20,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:20,265 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:20,265 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:20,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3434 [2022-12-06 07:36:20,265 INFO L420 AbstractCegarLoop]: === Iteration 3436 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:20,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:20,266 INFO L85 PathProgramCache]: Analyzing trace with hash 937188826, now seen corresponding path program 1 times [2022-12-06 07:36:20,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:20,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341323018] [2022-12-06 07:36:20,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:20,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:20,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-06 07:36:20,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:20,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341323018] [2022-12-06 07:36:20,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341323018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:20,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:20,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:20,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064680265] [2022-12-06 07:36:20,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:20,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:20,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:20,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:20,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:20,335 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:20,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:20,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:20,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:20,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:20,371 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:20,372 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:20,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:20,372 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:20,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:20,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:20,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:20,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:20,373 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:20,373 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:20,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:20,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:20,373 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:20,373 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:20,373 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:20,373 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:20,374 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:20,374 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:20,374 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:20,374 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:20,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:20,376 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:20,376 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:20,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:20,376 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:20,376 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:20,452 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:20,453 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:20,453 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:20,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:20,453 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:20,453 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:20,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3435 [2022-12-06 07:36:20,453 INFO L420 AbstractCegarLoop]: === Iteration 3437 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:20,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:20,454 INFO L85 PathProgramCache]: Analyzing trace with hash 963970935, now seen corresponding path program 1 times [2022-12-06 07:36:20,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:20,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42968087] [2022-12-06 07:36:20,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:20,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:20,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36: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-06 07:36:20,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:20,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42968087] [2022-12-06 07:36:20,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42968087] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:20,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:20,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:20,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148599903] [2022-12-06 07:36:20,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:20,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:20,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:20,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:20,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:20,524 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:20,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:20,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:20,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:20,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:20,565 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:20,565 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:20,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:20,566 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:20,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:20,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:20,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:20,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:20,566 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:20,566 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:20,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:20,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:20,567 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:20,567 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:20,567 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:20,567 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:20,567 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:20,567 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:20,567 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:20,567 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:20,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:20,569 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:20,569 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:20,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:20,570 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:20,570 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:20,643 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:20,644 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:36:20,645 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:20,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:20,645 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:20,645 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:20,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3436 [2022-12-06 07:36:20,645 INFO L420 AbstractCegarLoop]: === Iteration 3438 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:20,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:20,645 INFO L85 PathProgramCache]: Analyzing trace with hash 994447128, now seen corresponding path program 1 times [2022-12-06 07:36:20,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:20,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781465280] [2022-12-06 07:36:20,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:20,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:20,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:20,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:20,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781465280] [2022-12-06 07:36:20,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781465280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:20,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:20,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:20,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736038604] [2022-12-06 07:36:20,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:20,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:20,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:20,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:20,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:20,712 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:20,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:20,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:20,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:20,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:20,752 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:20,752 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:20,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:20,753 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:20,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:20,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:20,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:20,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:20,753 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:20,753 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:20,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:20,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:20,754 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:20,754 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:20,754 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:20,754 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:20,754 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:20,754 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:20,754 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:20,754 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:20,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:20,757 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:20,757 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:20,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:20,757 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:20,757 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:20,833 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:20,835 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:36:20,835 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:20,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:20,835 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:20,835 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:20,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3437 [2022-12-06 07:36:20,835 INFO L420 AbstractCegarLoop]: === Iteration 3439 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:20,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:20,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1021229237, now seen corresponding path program 1 times [2022-12-06 07:36:20,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:20,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895542445] [2022-12-06 07:36:20,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:20,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:20,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-06 07:36:20,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:20,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895542445] [2022-12-06 07:36:20,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895542445] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:20,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:20,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:20,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890512047] [2022-12-06 07:36:20,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:20,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:20,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:20,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:20,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:20,905 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:20,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:20,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:20,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:20,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:20,947 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:20,947 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:20,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:20,947 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:20,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:20,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:20,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:20,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:20,948 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:20,948 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:20,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:20,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:20,948 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:20,948 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:20,949 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:20,949 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:20,949 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:20,949 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:20,949 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:20,949 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:20,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:20,951 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:20,951 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:20,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:20,951 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:20,951 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:21,027 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:21,029 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:21,029 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:21,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:21,029 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:21,029 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:21,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3438 [2022-12-06 07:36:21,029 INFO L420 AbstractCegarLoop]: === Iteration 3440 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:21,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:21,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1051705430, now seen corresponding path program 1 times [2022-12-06 07:36:21,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:21,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881827252] [2022-12-06 07:36:21,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:21,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:21,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-06 07:36:21,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:21,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881827252] [2022-12-06 07:36:21,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881827252] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:21,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:21,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:21,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098440669] [2022-12-06 07:36:21,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:21,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:21,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:21,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:21,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:21,096 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:21,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:21,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:21,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:21,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:21,133 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:21,133 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:21,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:21,133 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:21,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:21,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:21,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:21,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:21,134 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:21,134 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:21,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:21,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:21,135 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:21,135 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:21,135 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:21,135 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:21,135 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:21,135 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:21,135 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:21,135 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:21,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:21,137 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:21,137 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:21,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:21,138 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:21,138 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:21,214 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:21,216 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:36:21,216 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:21,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:21,216 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:21,216 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:21,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3439 [2022-12-06 07:36:21,216 INFO L420 AbstractCegarLoop]: === Iteration 3441 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:21,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:21,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1078487539, now seen corresponding path program 1 times [2022-12-06 07:36:21,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:21,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636534252] [2022-12-06 07:36:21,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:21,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:21,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:21,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:21,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636534252] [2022-12-06 07:36:21,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636534252] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:21,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:21,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:21,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902147483] [2022-12-06 07:36:21,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:21,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:21,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:21,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:21,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:21,287 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:21,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:21,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:21,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:21,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:21,341 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:21,341 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:21,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:21,342 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:21,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:21,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:21,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:21,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:21,342 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:21,342 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:21,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:21,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:21,343 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:21,343 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:21,343 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:21,343 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:21,343 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:21,343 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:21,343 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:21,343 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:21,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:21,346 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:21,346 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:21,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:21,346 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:21,346 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:21,421 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:21,422 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:21,422 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:21,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:21,422 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:21,422 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:21,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3440 [2022-12-06 07:36:21,422 INFO L420 AbstractCegarLoop]: === Iteration 3442 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:21,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:21,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1108963732, now seen corresponding path program 1 times [2022-12-06 07:36:21,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:21,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120312726] [2022-12-06 07:36:21,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:21,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:21,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:21,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:21,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120312726] [2022-12-06 07:36:21,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120312726] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:21,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:21,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:21,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565590115] [2022-12-06 07:36:21,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:21,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:21,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:21,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:21,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:21,491 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:21,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:21,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:21,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:21,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:21,533 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:21,534 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:21,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 347 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:21,534 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:21,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:21,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:21,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:21,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:21,535 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:21,535 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:21,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:21,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:21,535 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:21,535 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:21,536 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:21,536 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:21,536 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:21,536 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:21,536 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:21,536 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:21,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:21,538 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:21,538 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:21,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:21,538 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:21,538 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:21,613 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:21,614 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:21,614 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:21,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:21,614 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:21,614 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:21,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3441 [2022-12-06 07:36:21,614 INFO L420 AbstractCegarLoop]: === Iteration 3443 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:21,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:21,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1135745841, now seen corresponding path program 1 times [2022-12-06 07:36:21,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:21,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457571700] [2022-12-06 07:36:21,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:21,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36: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-06 07:36:21,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:21,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457571700] [2022-12-06 07:36:21,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457571700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:21,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:21,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:21,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789935240] [2022-12-06 07:36:21,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:21,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:21,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:21,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:21,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:21,684 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:21,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:21,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:21,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:21,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:21,719 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:21,719 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:21,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:21,719 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:21,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:21,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:21,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:21,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:21,720 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:21,720 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:21,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:21,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:21,721 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:21,721 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:21,721 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:21,721 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:21,721 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:21,721 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:21,721 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:21,721 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:21,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:21,723 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:21,723 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:21,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:21,724 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:21,724 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:21,797 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:21,798 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:36:21,798 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:21,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:21,799 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:21,799 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:21,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3442 [2022-12-06 07:36:21,799 INFO L420 AbstractCegarLoop]: === Iteration 3444 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:21,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:21,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1166222034, now seen corresponding path program 1 times [2022-12-06 07:36:21,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:21,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681530708] [2022-12-06 07:36:21,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:21,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:21,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:21,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:21,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681530708] [2022-12-06 07:36:21,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681530708] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:21,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:21,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:21,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894901709] [2022-12-06 07:36:21,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:21,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:21,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:21,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:21,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:21,866 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:21,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:21,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:21,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:21,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:21,907 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:21,907 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:21,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:21,907 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:21,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:21,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:21,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:21,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:21,908 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:21,908 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:21,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:21,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:21,909 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:21,909 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:21,909 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:21,909 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:21,909 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:21,909 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:21,909 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:21,909 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:21,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:21,911 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:21,911 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:21,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:21,912 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:21,912 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:21,985 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:21,986 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:36:21,986 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:21,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:21,986 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:21,986 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:21,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3443 [2022-12-06 07:36:21,987 INFO L420 AbstractCegarLoop]: === Iteration 3445 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:21,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:21,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1193004143, now seen corresponding path program 1 times [2022-12-06 07:36:21,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:21,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106893729] [2022-12-06 07:36:21,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:21,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:22,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:22,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:22,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106893729] [2022-12-06 07:36:22,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106893729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:22,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:22,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:22,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591176683] [2022-12-06 07:36:22,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:22,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:22,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:22,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:22,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:22,057 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:22,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:22,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:22,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:22,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:22,098 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:22,099 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:22,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:22,099 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:22,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:22,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:22,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:22,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:22,100 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:22,100 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:22,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:22,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:22,100 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:22,100 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:22,101 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:22,101 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:22,101 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:22,101 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:22,101 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:22,101 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:22,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:22,103 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:22,103 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:22,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:22,103 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:22,103 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:22,180 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:22,182 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:36:22,182 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:22,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:22,182 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:22,182 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:22,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3444 [2022-12-06 07:36:22,182 INFO L420 AbstractCegarLoop]: === Iteration 3446 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:22,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:22,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1223480336, now seen corresponding path program 1 times [2022-12-06 07:36:22,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:22,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205882526] [2022-12-06 07:36:22,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:22,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:22,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:22,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-06 07:36:22,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:22,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205882526] [2022-12-06 07:36:22,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205882526] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:22,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:22,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:22,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073680680] [2022-12-06 07:36:22,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:22,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:22,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:22,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:22,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:22,249 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:22,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:22,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:22,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:22,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:22,285 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:22,285 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:22,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:22,286 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:22,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:22,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:22,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:22,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:22,286 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:22,286 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:22,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:22,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:22,287 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:22,287 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:22,287 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:22,287 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:22,287 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:22,287 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:22,288 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:22,288 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:22,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:22,290 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:22,290 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:22,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:22,290 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:22,290 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:22,364 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:22,366 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:22,366 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:22,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:22,366 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:22,366 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:22,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3445 [2022-12-06 07:36:22,366 INFO L420 AbstractCegarLoop]: === Iteration 3447 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:22,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:22,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1250262445, now seen corresponding path program 1 times [2022-12-06 07:36:22,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:22,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737907551] [2022-12-06 07:36:22,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:22,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:22,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-06 07:36:22,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:22,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737907551] [2022-12-06 07:36:22,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737907551] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:22,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:22,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:22,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180884537] [2022-12-06 07:36:22,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:22,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:22,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:22,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:22,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:22,437 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:22,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:22,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:22,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:22,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:22,476 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:22,476 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:22,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:22,476 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:22,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:22,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:22,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:22,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:22,477 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:22,477 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:22,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:22,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:22,478 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:22,478 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:22,478 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:22,478 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:22,478 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:22,478 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:22,478 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:22,478 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:22,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:22,480 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:22,480 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:22,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:22,481 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:22,481 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:22,558 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:22,560 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:36:22,560 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:22,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:22,560 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:22,560 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:22,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3446 [2022-12-06 07:36:22,560 INFO L420 AbstractCegarLoop]: === Iteration 3448 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:22,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:22,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1280738638, now seen corresponding path program 1 times [2022-12-06 07:36:22,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:22,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396245984] [2022-12-06 07:36:22,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:22,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:22,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-06 07:36:22,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:22,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396245984] [2022-12-06 07:36:22,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396245984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:22,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:22,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:22,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392482633] [2022-12-06 07:36:22,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:22,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:22,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:22,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:22,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:22,637 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:22,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:22,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:22,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:22,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:22,674 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:22,674 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:22,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:22,675 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:22,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:22,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:22,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:22,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:22,675 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:22,675 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:22,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:22,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:22,676 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:22,676 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:22,676 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:22,676 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:22,676 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:22,676 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:22,676 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:22,676 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:22,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:22,679 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:22,679 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:22,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:22,679 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:22,679 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:22,754 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:22,755 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:22,755 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:22,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:22,755 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:22,755 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:22,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3447 [2022-12-06 07:36:22,756 INFO L420 AbstractCegarLoop]: === Iteration 3449 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:22,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:22,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1307520747, now seen corresponding path program 1 times [2022-12-06 07:36:22,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:22,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195373918] [2022-12-06 07:36:22,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:22,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:22,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:22,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:22,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195373918] [2022-12-06 07:36:22,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195373918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:22,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:22,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:22,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985073246] [2022-12-06 07:36:22,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:22,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:22,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:22,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:22,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:22,828 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:22,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:22,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:22,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:22,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:22,869 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:22,869 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:22,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:22,869 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:22,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:22,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:22,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:22,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:22,870 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:22,870 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:22,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:22,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:22,871 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:22,871 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:22,871 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:22,871 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:22,871 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:22,871 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:22,871 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:22,871 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:22,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:22,873 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:22,873 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:22,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:22,874 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:22,874 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:22,972 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:22,974 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-06 07:36:22,974 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:22,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:22,974 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:22,975 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:22,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3448 [2022-12-06 07:36:22,975 INFO L420 AbstractCegarLoop]: === Iteration 3450 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:22,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:22,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1337996940, now seen corresponding path program 1 times [2022-12-06 07:36:22,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:22,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62285959] [2022-12-06 07:36:22,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:22,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:23,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:23,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:23,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62285959] [2022-12-06 07:36:23,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62285959] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:23,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:23,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:23,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690887243] [2022-12-06 07:36:23,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:23,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:23,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:23,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:23,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:23,065 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:23,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:23,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:23,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:23,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:23,113 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:23,113 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:23,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:23,114 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:23,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:23,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:23,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:23,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:23,115 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:23,115 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:23,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:23,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:23,116 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:23,116 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:23,116 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:23,116 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:23,116 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:23,116 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:23,116 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:23,116 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:23,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:23,119 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:23,119 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:23,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:23,120 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:23,120 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:23,211 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:23,213 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 07:36:23,213 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:23,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:23,213 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:23,213 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:23,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3449 [2022-12-06 07:36:23,214 INFO L420 AbstractCegarLoop]: === Iteration 3451 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:23,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:23,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1364779049, now seen corresponding path program 1 times [2022-12-06 07:36:23,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:23,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445952539] [2022-12-06 07:36:23,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:23,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:23,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-06 07:36:23,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:23,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445952539] [2022-12-06 07:36:23,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445952539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:23,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:23,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:23,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272863637] [2022-12-06 07:36:23,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:23,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:23,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:23,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:23,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:23,313 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:23,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:23,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:23,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:23,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:23,369 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:23,369 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:23,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:23,369 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:23,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:23,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:23,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:23,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:23,370 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:23,370 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:23,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:23,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:23,371 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:23,371 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:23,371 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:23,372 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:23,372 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:23,372 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:23,372 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:23,372 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:23,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:23,375 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:23,375 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:23,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:23,375 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:23,375 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:23,469 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:23,471 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 07:36:23,471 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:23,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:23,471 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:23,471 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:23,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3450 [2022-12-06 07:36:23,472 INFO L420 AbstractCegarLoop]: === Iteration 3452 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:23,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:23,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1395255242, now seen corresponding path program 1 times [2022-12-06 07:36:23,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:23,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200191421] [2022-12-06 07:36:23,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:23,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:23,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-06 07:36:23,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:23,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200191421] [2022-12-06 07:36:23,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200191421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:23,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:23,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:23,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026722739] [2022-12-06 07:36:23,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:23,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:23,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:23,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:23,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:23,555 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:23,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:23,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:23,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:23,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:23,591 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:23,591 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:23,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:23,592 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:23,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:23,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:23,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:23,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:23,592 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:23,592 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:23,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:23,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:23,593 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:23,593 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:23,593 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:23,593 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:23,593 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:23,593 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:23,593 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:23,593 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:23,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:23,595 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:23,596 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:23,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:23,596 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:23,596 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:23,670 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:23,672 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:23,672 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:23,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:23,672 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:23,672 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:23,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3451 [2022-12-06 07:36:23,672 INFO L420 AbstractCegarLoop]: === Iteration 3453 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:23,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:23,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1422037351, now seen corresponding path program 1 times [2022-12-06 07:36:23,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:23,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401683773] [2022-12-06 07:36:23,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:23,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:23,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-06 07:36:23,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:23,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401683773] [2022-12-06 07:36:23,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401683773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:23,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:23,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:23,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444463504] [2022-12-06 07:36:23,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:23,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:23,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:23,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:23,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:23,742 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:23,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:23,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:23,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:23,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:23,783 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:23,783 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:23,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:23,784 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:23,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:23,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:23,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:23,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:23,784 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:23,784 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:23,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:23,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:23,785 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:23,785 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:23,785 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:23,785 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:23,785 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:23,785 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:23,786 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:23,786 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:23,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:23,788 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:23,788 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:23,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:23,788 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:23,788 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:23,864 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:23,865 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:23,866 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:23,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:23,866 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:23,866 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:23,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3452 [2022-12-06 07:36:23,866 INFO L420 AbstractCegarLoop]: === Iteration 3454 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:23,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:23,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1452513544, now seen corresponding path program 1 times [2022-12-06 07:36:23,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:23,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249945415] [2022-12-06 07:36:23,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:23,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:23,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-06 07:36:23,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:23,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249945415] [2022-12-06 07:36:23,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249945415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:23,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:23,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:23,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172079426] [2022-12-06 07:36:23,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:23,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:23,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:23,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:23,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:23,952 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:23,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:23,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:23,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:23,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:23,988 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:23,989 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:23,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:23,989 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:23,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:23,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:23,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:23,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:23,990 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:23,990 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:23,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:23,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:23,990 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:23,990 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:23,990 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:23,990 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:23,991 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:23,991 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:23,991 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:23,991 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:23,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:23,993 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:23,993 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:23,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:23,993 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:23,993 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:24,069 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:24,070 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:24,070 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:24,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:24,070 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:24,070 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:24,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3453 [2022-12-06 07:36:24,071 INFO L420 AbstractCegarLoop]: === Iteration 3455 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:24,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:24,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1479295653, now seen corresponding path program 1 times [2022-12-06 07:36:24,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:24,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600618794] [2022-12-06 07:36:24,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:24,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:24,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:24,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:24,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600618794] [2022-12-06 07:36:24,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600618794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:24,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:24,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:24,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646265320] [2022-12-06 07:36:24,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:24,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:24,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:24,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:24,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:24,142 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:24,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:24,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:24,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:24,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:24,178 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:24,178 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:24,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:24,178 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:24,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:24,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:24,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:24,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:24,179 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:24,179 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:24,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:24,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:24,180 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:24,180 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:24,180 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:24,180 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:24,180 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:24,180 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:24,180 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:24,180 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:24,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:24,182 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:24,182 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:24,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:24,183 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:24,183 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:24,267 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:24,268 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 07:36:24,268 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:24,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:24,268 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:24,268 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:24,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3454 [2022-12-06 07:36:24,269 INFO L420 AbstractCegarLoop]: === Iteration 3456 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:24,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:24,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1509771846, now seen corresponding path program 1 times [2022-12-06 07:36:24,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:24,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982404877] [2022-12-06 07:36:24,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:24,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:24,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-06 07:36:24,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:24,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982404877] [2022-12-06 07:36:24,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982404877] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:24,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:24,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:24,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174491684] [2022-12-06 07:36:24,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:24,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:24,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:24,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:24,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:24,337 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:24,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:24,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:24,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:24,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:24,372 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:24,372 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:24,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:24,373 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:24,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:24,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:24,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:24,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:24,373 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:24,373 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:24,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:24,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:24,374 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:24,374 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:24,374 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:24,374 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:24,374 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:24,374 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:24,374 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:24,374 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:24,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:24,377 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:24,377 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:24,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:24,377 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:24,377 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:24,451 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:24,452 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:24,452 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:24,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:24,452 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:24,452 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:24,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3455 [2022-12-06 07:36:24,453 INFO L420 AbstractCegarLoop]: === Iteration 3457 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:24,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:24,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1536553955, now seen corresponding path program 1 times [2022-12-06 07:36:24,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:24,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791221959] [2022-12-06 07:36:24,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:24,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:24,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-06 07:36:24,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:24,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791221959] [2022-12-06 07:36:24,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791221959] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:24,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:24,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:24,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383394588] [2022-12-06 07:36:24,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:24,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:24,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:24,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:24,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:24,524 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:24,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:24,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:24,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:24,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:24,561 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:24,561 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:24,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:24,562 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:24,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:24,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:24,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:24,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:24,562 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:24,562 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:24,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:24,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:24,563 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:24,563 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:24,564 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:24,564 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:24,564 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:24,564 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:24,564 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:24,564 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:24,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:24,566 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:24,566 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:24,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:24,567 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:24,567 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:24,642 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:24,643 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:24,643 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:24,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:24,643 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:24,644 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:24,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3456 [2022-12-06 07:36:24,644 INFO L420 AbstractCegarLoop]: === Iteration 3458 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:24,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:24,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1567030148, now seen corresponding path program 1 times [2022-12-06 07:36:24,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:24,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890990881] [2022-12-06 07:36:24,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:24,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:24,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-06 07:36:24,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:24,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890990881] [2022-12-06 07:36:24,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890990881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:24,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:24,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:24,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791669389] [2022-12-06 07:36:24,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:24,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:24,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:24,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:24,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:24,713 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:24,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:24,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:24,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:24,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:24,754 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:24,754 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:24,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:24,754 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:24,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:24,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:24,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:24,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:24,755 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:24,755 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:24,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:24,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:24,755 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:24,756 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:24,756 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:24,756 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:24,756 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:24,756 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:24,756 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:24,756 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:24,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:24,758 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:24,758 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:24,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:24,759 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:24,759 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:24,833 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:24,834 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:24,834 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:24,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:24,834 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:24,834 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:24,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3457 [2022-12-06 07:36:24,834 INFO L420 AbstractCegarLoop]: === Iteration 3459 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:24,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:24,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1593812257, now seen corresponding path program 1 times [2022-12-06 07:36:24,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:24,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877078976] [2022-12-06 07:36:24,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:24,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:24,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-06 07:36:24,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:24,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877078976] [2022-12-06 07:36:24,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877078976] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:24,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:24,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:24,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325268787] [2022-12-06 07:36:24,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:24,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:24,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:24,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:24,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:24,905 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:24,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:24,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:24,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:24,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:24,941 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:24,942 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:24,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:24,942 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:24,942 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:24,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:24,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:24,942 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:24,943 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:24,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:24,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:24,943 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:24,943 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:24,943 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:24,943 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:24,943 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:24,944 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:24,944 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:24,944 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:24,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:24,946 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:24,946 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:24,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:24,946 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:24,946 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:25,020 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:25,022 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:25,022 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:25,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:25,022 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:25,022 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:25,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3458 [2022-12-06 07:36:25,022 INFO L420 AbstractCegarLoop]: === Iteration 3460 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:25,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:25,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1624288450, now seen corresponding path program 1 times [2022-12-06 07:36:25,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:25,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40558625] [2022-12-06 07:36:25,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:25,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:25,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-06 07:36:25,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:25,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40558625] [2022-12-06 07:36:25,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40558625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:25,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:25,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:25,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008612292] [2022-12-06 07:36:25,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:25,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:25,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:25,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:25,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:25,110 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:25,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:25,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:25,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:25,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:25,147 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:25,147 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:25,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:25,148 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:25,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:25,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:25,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:25,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:25,148 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:25,148 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:25,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:25,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:25,149 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:25,149 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:25,149 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:25,149 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:25,149 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:25,149 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:25,149 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:25,150 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:25,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:25,152 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:25,152 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:25,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:25,152 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:25,152 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:25,226 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:25,228 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:25,228 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:25,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:25,228 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:25,228 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:25,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3459 [2022-12-06 07:36:25,228 INFO L420 AbstractCegarLoop]: === Iteration 3461 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:25,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:25,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1651070559, now seen corresponding path program 1 times [2022-12-06 07:36:25,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:25,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128258277] [2022-12-06 07:36:25,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:25,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:25,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-06 07:36:25,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:25,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128258277] [2022-12-06 07:36:25,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128258277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:25,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:25,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:25,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462060820] [2022-12-06 07:36:25,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:25,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:25,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:25,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:25,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:25,302 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:25,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:25,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:25,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:25,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:25,343 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:25,343 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:25,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:25,344 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:25,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:25,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:25,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:25,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:25,344 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:25,344 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:25,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:25,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:25,345 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:25,345 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:25,345 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:25,345 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:25,345 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:25,345 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:25,345 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:25,345 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:25,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:25,348 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:25,348 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:25,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:25,348 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:25,348 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:25,423 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:25,424 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:25,424 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:25,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:25,424 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:25,424 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:25,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3460 [2022-12-06 07:36:25,424 INFO L420 AbstractCegarLoop]: === Iteration 3462 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:25,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:25,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1681546752, now seen corresponding path program 1 times [2022-12-06 07:36:25,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:25,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958063183] [2022-12-06 07:36:25,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:25,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:25,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-06 07:36:25,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:25,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958063183] [2022-12-06 07:36:25,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958063183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:25,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:25,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:25,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443451578] [2022-12-06 07:36:25,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:25,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:25,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:25,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:25,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:25,492 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:25,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:25,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:25,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:25,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:25,533 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:25,534 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:25,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:25,534 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:25,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:25,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:25,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:25,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:25,535 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:25,535 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:25,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:25,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:25,535 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:25,535 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:25,535 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:25,535 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:25,536 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:25,536 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:25,536 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:25,536 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:25,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:25,538 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:25,538 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:25,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:25,538 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:25,538 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:25,614 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:25,616 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:36:25,616 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:25,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:25,616 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:25,616 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:25,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3461 [2022-12-06 07:36:25,616 INFO L420 AbstractCegarLoop]: === Iteration 3463 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:25,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:25,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1708328861, now seen corresponding path program 1 times [2022-12-06 07:36:25,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:25,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691998025] [2022-12-06 07:36:25,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:25,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:25,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-06 07:36:25,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:25,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691998025] [2022-12-06 07:36:25,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691998025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:25,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:25,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:25,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729604891] [2022-12-06 07:36:25,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:25,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:25,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:25,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:25,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:25,687 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:25,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:25,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:25,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:25,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:25,723 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:25,723 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:25,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:25,723 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:25,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:25,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:25,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:25,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:25,724 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:25,724 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:25,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:25,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:25,725 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:25,725 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:25,725 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:25,725 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:25,725 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:25,725 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:25,725 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:25,725 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:25,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:25,727 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:25,727 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:25,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:25,728 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:25,728 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:25,803 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:25,804 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:25,804 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:25,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:25,804 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:25,804 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:25,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3462 [2022-12-06 07:36:25,804 INFO L420 AbstractCegarLoop]: === Iteration 3464 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:25,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:25,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1738805054, now seen corresponding path program 1 times [2022-12-06 07:36:25,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:25,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528439497] [2022-12-06 07:36:25,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:25,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:25,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-06 07:36:25,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:25,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528439497] [2022-12-06 07:36:25,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528439497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:25,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:25,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:25,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096931125] [2022-12-06 07:36:25,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:25,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:25,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:25,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:25,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:25,874 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:25,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:25,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:25,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:25,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:25,917 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:25,917 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:25,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:25,917 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:25,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:25,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:25,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:25,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:25,918 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:25,918 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:25,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:25,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:25,919 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:25,919 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:25,919 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:25,919 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:25,919 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:25,919 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:25,919 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:25,919 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:25,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:25,921 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:25,921 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:25,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:25,922 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:25,922 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:25,996 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:25,997 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:25,997 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:25,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:25,997 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:25,997 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:25,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3463 [2022-12-06 07:36:25,997 INFO L420 AbstractCegarLoop]: === Iteration 3465 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:25,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:25,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1765587163, now seen corresponding path program 1 times [2022-12-06 07:36:25,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:25,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304749326] [2022-12-06 07:36:25,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:25,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:26,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-06 07:36:26,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:26,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304749326] [2022-12-06 07:36:26,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304749326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:26,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:26,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:26,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163484402] [2022-12-06 07:36:26,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:26,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:26,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:26,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:26,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:26,082 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:26,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:26,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:26,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:26,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:26,127 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:26,127 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:26,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:26,127 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:26,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:26,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:26,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:26,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:26,128 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:26,128 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:26,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:26,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:26,128 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:26,128 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:26,129 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:26,129 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:26,129 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:26,129 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:26,129 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:26,129 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:26,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:26,131 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:26,131 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:26,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:26,131 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:26,131 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:26,208 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:26,209 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:26,209 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:26,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:26,209 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:26,209 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:26,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3464 [2022-12-06 07:36:26,209 INFO L420 AbstractCegarLoop]: === Iteration 3466 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:26,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:26,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1796063356, now seen corresponding path program 1 times [2022-12-06 07:36:26,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:26,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049899928] [2022-12-06 07:36:26,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:26,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:26,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-06 07:36:26,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:26,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049899928] [2022-12-06 07:36:26,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049899928] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:26,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:26,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:26,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9154793] [2022-12-06 07:36:26,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:26,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:26,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:26,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:26,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:26,279 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:26,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:26,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:26,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:26,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:26,327 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:26,327 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:26,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:26,328 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:26,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:26,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:26,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:26,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:26,328 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:26,328 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:26,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:26,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:26,329 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:26,329 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:26,329 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:26,329 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:26,329 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:26,329 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:26,329 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:26,330 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:26,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:26,332 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:26,332 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:26,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:26,332 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:26,332 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:26,406 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:26,407 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:26,407 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:26,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:26,408 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:26,408 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:26,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3465 [2022-12-06 07:36:26,408 INFO L420 AbstractCegarLoop]: === Iteration 3467 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:26,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:26,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1822845465, now seen corresponding path program 1 times [2022-12-06 07:36:26,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:26,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852702727] [2022-12-06 07:36:26,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:26,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:26,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:26,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-06 07:36:26,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:26,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852702727] [2022-12-06 07:36:26,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852702727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:26,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:26,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:26,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401942693] [2022-12-06 07:36:26,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:26,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:26,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:26,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:26,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:26,480 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:26,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:26,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:26,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:26,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:26,514 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:26,514 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:26,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:26,515 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:26,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:26,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:26,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:26,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:26,515 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:26,515 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:26,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:26,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:26,516 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:26,516 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:26,516 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:26,516 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:26,516 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:26,516 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:26,516 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:26,516 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:26,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:26,518 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:26,519 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:26,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:26,519 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:26,519 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:26,594 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:26,596 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:26,596 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:26,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:26,596 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:26,596 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:26,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3466 [2022-12-06 07:36:26,596 INFO L420 AbstractCegarLoop]: === Iteration 3468 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:26,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:26,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1853321658, now seen corresponding path program 1 times [2022-12-06 07:36:26,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:26,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930511447] [2022-12-06 07:36:26,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:26,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:26,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-06 07:36:26,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:26,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930511447] [2022-12-06 07:36:26,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930511447] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:26,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:26,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:26,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526626196] [2022-12-06 07:36:26,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:26,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:26,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:26,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:26,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:26,665 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:26,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:26,665 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:26,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:26,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:26,706 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:26,706 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:26,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:26,706 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:26,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:26,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:26,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:26,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:26,707 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:26,707 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:26,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:26,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:26,708 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:26,708 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:26,708 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:26,708 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:26,708 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:26,708 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:26,708 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:26,708 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:26,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:26,710 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:26,710 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:26,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:26,711 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:26,711 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:26,786 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:26,787 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:26,787 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:26,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:26,788 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:26,788 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:26,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3467 [2022-12-06 07:36:26,788 INFO L420 AbstractCegarLoop]: === Iteration 3469 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:26,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:26,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1880103767, now seen corresponding path program 1 times [2022-12-06 07:36:26,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:26,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857175532] [2022-12-06 07:36:26,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:26,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:26,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-06 07:36:26,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:26,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857175532] [2022-12-06 07:36:26,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857175532] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:26,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:26,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:26,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368489747] [2022-12-06 07:36:26,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:26,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:26,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:26,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:26,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:26,857 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:26,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:26,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:26,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:26,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:26,898 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:26,898 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:26,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:26,899 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:26,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:26,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:26,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:26,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:26,899 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:26,899 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:26,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:26,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:26,900 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:26,900 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:26,900 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:26,900 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:26,900 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:26,900 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:26,900 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:26,900 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:26,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:26,903 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:26,903 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:26,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:26,903 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:26,903 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:26,977 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:26,979 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:26,979 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:26,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:26,979 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:26,979 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:26,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3468 [2022-12-06 07:36:26,979 INFO L420 AbstractCegarLoop]: === Iteration 3470 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:26,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:26,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1910579960, now seen corresponding path program 1 times [2022-12-06 07:36:26,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:26,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962586854] [2022-12-06 07:36:26,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:26,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:27,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-06 07:36:27,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:27,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962586854] [2022-12-06 07:36:27,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962586854] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:27,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:27,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:27,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143183513] [2022-12-06 07:36:27,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:27,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:27,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:27,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:27,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:27,047 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:27,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:27,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:27,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:27,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:27,088 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:27,089 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:27,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:27,089 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:27,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:27,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:27,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:27,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:27,090 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:27,090 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:27,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:27,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:27,090 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:27,090 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:27,090 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:27,090 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:27,091 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:27,091 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:27,091 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:27,091 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:27,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:27,093 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:27,093 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:27,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:27,093 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:27,093 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:27,167 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:27,169 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:27,169 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:27,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:27,169 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:27,169 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:27,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3469 [2022-12-06 07:36:27,169 INFO L420 AbstractCegarLoop]: === Iteration 3471 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:27,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:27,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1937362069, now seen corresponding path program 1 times [2022-12-06 07:36:27,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:27,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958917218] [2022-12-06 07:36:27,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:27,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:27,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-06 07:36:27,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:27,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958917218] [2022-12-06 07:36:27,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958917218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:27,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:27,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:27,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415543516] [2022-12-06 07:36:27,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:27,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:27,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:27,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:27,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:27,240 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:27,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:27,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:27,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:27,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:27,281 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:27,281 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:27,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:27,282 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:27,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:27,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:27,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:27,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:27,282 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:27,282 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:27,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:27,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:27,283 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:27,283 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:27,283 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:27,283 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:27,283 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:27,284 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:27,284 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:27,284 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:27,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:27,286 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:27,286 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:27,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:27,286 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:27,286 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:27,366 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:27,367 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:36:27,367 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:27,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:27,367 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:27,368 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:27,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3470 [2022-12-06 07:36:27,368 INFO L420 AbstractCegarLoop]: === Iteration 3472 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:27,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:27,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1967838262, now seen corresponding path program 1 times [2022-12-06 07:36:27,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:27,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156250136] [2022-12-06 07:36:27,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:27,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:27,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-06 07:36:27,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:27,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156250136] [2022-12-06 07:36:27,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156250136] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:27,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:27,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:27,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619332200] [2022-12-06 07:36:27,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:27,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:27,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:27,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:27,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:27,440 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:27,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:27,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:27,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:27,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:27,482 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:27,482 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:27,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:27,483 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:27,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:27,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:27,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:27,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:27,483 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:27,483 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:27,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:27,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:27,484 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:27,484 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:27,484 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:27,484 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:27,484 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:27,484 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:27,484 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:27,485 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:27,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:27,487 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:27,487 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:27,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 122 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:27,487 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:27,487 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:27,562 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:27,564 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:27,564 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:27,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:27,564 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:27,564 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:27,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3471 [2022-12-06 07:36:27,565 INFO L420 AbstractCegarLoop]: === Iteration 3473 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:27,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:27,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1994620371, now seen corresponding path program 1 times [2022-12-06 07:36:27,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:27,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600709714] [2022-12-06 07:36:27,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:27,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36: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-06 07:36:27,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:27,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600709714] [2022-12-06 07:36:27,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600709714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:27,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:27,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:27,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380478776] [2022-12-06 07:36:27,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:27,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:27,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:27,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:27,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:27,659 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:27,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:27,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:27,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:27,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:27,699 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:27,699 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:27,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 375 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:27,699 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:27,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:27,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:27,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:27,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:27,700 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:27,700 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:27,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:27,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:27,700 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:27,701 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:27,701 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:27,701 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:27,701 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:27,701 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:27,701 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:27,701 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:27,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:27,703 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:27,703 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:27,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:27,704 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:27,704 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:27,780 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:27,781 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:27,782 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:27,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:27,782 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:27,782 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:27,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3472 [2022-12-06 07:36:27,782 INFO L420 AbstractCegarLoop]: === Iteration 3474 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:27,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:27,782 INFO L85 PathProgramCache]: Analyzing trace with hash 2025096564, now seen corresponding path program 1 times [2022-12-06 07:36:27,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:27,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736770059] [2022-12-06 07:36:27,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:27,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:27,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-06 07:36:27,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:27,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736770059] [2022-12-06 07:36:27,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736770059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:27,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:27,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:27,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051827571] [2022-12-06 07:36:27,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:27,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:27,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:27,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:27,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:27,852 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:27,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:27,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:27,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:27,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:27,888 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:27,889 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:27,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:27,889 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:27,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:27,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:27,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:27,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:27,890 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:27,890 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:27,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:27,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:27,890 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:27,890 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:27,890 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:27,891 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:27,891 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:27,891 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:27,891 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:27,891 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:27,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:27,893 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:27,893 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:27,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 118 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:27,893 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:27,893 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:27,968 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:27,969 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:27,969 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:27,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:27,969 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:27,969 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:27,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3473 [2022-12-06 07:36:27,969 INFO L420 AbstractCegarLoop]: === Iteration 3475 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:27,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:27,970 INFO L85 PathProgramCache]: Analyzing trace with hash 2051878673, now seen corresponding path program 1 times [2022-12-06 07:36:27,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:27,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346036887] [2022-12-06 07:36:27,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:27,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:28,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-06 07:36:28,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:28,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346036887] [2022-12-06 07:36:28,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346036887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:28,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:28,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:28,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561730236] [2022-12-06 07:36:28,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:28,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:28,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:28,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:28,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:28,045 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:28,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:28,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:28,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:28,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:28,082 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:28,082 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:28,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:28,083 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:28,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:28,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:28,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:28,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:28,083 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:28,083 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:28,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:28,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:28,084 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:28,084 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:28,084 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:28,084 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:28,084 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:28,084 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:28,084 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:28,084 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:28,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:28,086 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:28,087 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:28,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:28,087 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:28,087 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:28,161 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:28,163 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:28,163 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:28,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:28,163 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:28,163 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:28,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3474 [2022-12-06 07:36:28,163 INFO L420 AbstractCegarLoop]: === Iteration 3476 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:28,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:28,163 INFO L85 PathProgramCache]: Analyzing trace with hash 2082354866, now seen corresponding path program 1 times [2022-12-06 07:36:28,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:28,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523082345] [2022-12-06 07:36:28,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:28,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:28,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-06 07:36:28,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:28,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523082345] [2022-12-06 07:36:28,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523082345] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:28,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:28,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:28,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773839782] [2022-12-06 07:36:28,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:28,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:28,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:28,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:28,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:28,235 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:28,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:28,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:28,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:28,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:28,273 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:28,273 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:28,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:28,273 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:28,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:28,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:28,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:28,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:28,274 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:28,274 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:28,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:28,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:28,275 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:28,275 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:28,275 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:28,275 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:28,275 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:28,275 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:28,275 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:28,275 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:28,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:28,277 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:28,277 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:28,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:28,278 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:28,278 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:28,355 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:28,357 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:36:28,357 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:28,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:28,357 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:28,357 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:28,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3475 [2022-12-06 07:36:28,357 INFO L420 AbstractCegarLoop]: === Iteration 3477 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:28,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:28,357 INFO L85 PathProgramCache]: Analyzing trace with hash 2109136975, now seen corresponding path program 1 times [2022-12-06 07:36:28,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:28,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641033076] [2022-12-06 07:36:28,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:28,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:28,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36: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-06 07:36:28,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:28,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641033076] [2022-12-06 07:36:28,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641033076] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:28,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:28,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:28,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129873798] [2022-12-06 07:36:28,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:28,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:28,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:28,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:28,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:28,429 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:28,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:28,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:28,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:28,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:28,466 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:28,466 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:28,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:28,466 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:28,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:28,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:28,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:28,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:28,467 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:28,467 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:28,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:28,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:28,467 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:28,468 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:28,468 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:28,468 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:28,468 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:28,468 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:28,468 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:28,468 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:28,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:28,470 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:28,470 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:28,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:28,470 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:28,471 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:28,545 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:28,547 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:28,547 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:28,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:28,547 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:28,547 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:28,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3476 [2022-12-06 07:36:28,547 INFO L420 AbstractCegarLoop]: === Iteration 3478 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:28,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:28,547 INFO L85 PathProgramCache]: Analyzing trace with hash 2139613168, now seen corresponding path program 1 times [2022-12-06 07:36:28,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:28,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286346288] [2022-12-06 07:36:28,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:28,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:28,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:28,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-06 07:36:28,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:28,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286346288] [2022-12-06 07:36:28,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286346288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:28,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:28,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:28,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506321783] [2022-12-06 07:36:28,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:28,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:28,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:28,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:28,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:28,616 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:28,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:28,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:28,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:28,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:28,659 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:28,659 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:28,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:28,660 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:28,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:28,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:28,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:28,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:28,660 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:28,660 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:28,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:28,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:28,661 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:28,661 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:28,661 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:28,661 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:28,661 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:28,661 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:28,661 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:28,661 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:28,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:28,664 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:28,664 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:28,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:28,664 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:28,664 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:28,739 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:28,741 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:28,741 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:28,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:28,741 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:28,741 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:28,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3477 [2022-12-06 07:36:28,741 INFO L420 AbstractCegarLoop]: === Iteration 3479 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:28,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:28,741 INFO L85 PathProgramCache]: Analyzing trace with hash -2128572019, now seen corresponding path program 1 times [2022-12-06 07:36:28,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:28,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594923924] [2022-12-06 07:36:28,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:28,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:28,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-06 07:36:28,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:28,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594923924] [2022-12-06 07:36:28,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594923924] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:28,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:28,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:28,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462102518] [2022-12-06 07:36:28,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:28,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:28,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:28,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:28,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:28,831 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:28,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:28,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:28,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:28,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:28,871 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:28,872 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:28,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:28,872 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:28,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:28,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:28,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:28,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:28,873 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:28,873 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:28,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:28,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:28,873 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:28,873 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:28,873 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:28,873 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:28,874 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:28,874 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:28,874 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:28,874 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:28,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:28,876 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:28,876 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:28,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:28,876 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:28,876 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:28,951 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:28,953 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:28,953 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:28,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:28,953 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:28,953 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:28,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3478 [2022-12-06 07:36:28,953 INFO L420 AbstractCegarLoop]: === Iteration 3480 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:28,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:28,953 INFO L85 PathProgramCache]: Analyzing trace with hash -2098095826, now seen corresponding path program 1 times [2022-12-06 07:36:28,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:28,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223691391] [2022-12-06 07:36:28,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:28,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:29,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-06 07:36:29,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:29,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223691391] [2022-12-06 07:36:29,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223691391] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:29,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:29,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:29,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734534837] [2022-12-06 07:36:29,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:29,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:29,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:29,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:29,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:29,024 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:29,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:29,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:29,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:29,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:29,065 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:29,065 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:29,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:29,065 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:29,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:29,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:29,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:29,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:29,066 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:29,066 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:29,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:29,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:29,067 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:29,067 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:29,067 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:29,067 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:29,067 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:29,067 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:29,067 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:29,067 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:29,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:29,069 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:29,069 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:29,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:29,070 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:29,070 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:29,143 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:29,144 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:36:29,145 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:29,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:29,145 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:29,145 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:29,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3479 [2022-12-06 07:36:29,145 INFO L420 AbstractCegarLoop]: === Iteration 3481 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:29,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:29,145 INFO L85 PathProgramCache]: Analyzing trace with hash -2071313717, now seen corresponding path program 1 times [2022-12-06 07:36:29,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:29,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964506011] [2022-12-06 07:36:29,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:29,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:29,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-06 07:36:29,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:29,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964506011] [2022-12-06 07:36:29,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964506011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:29,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:29,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:29,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80610254] [2022-12-06 07:36:29,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:29,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:29,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:29,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:29,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:29,216 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:29,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:29,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:29,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:29,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:29,251 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:29,251 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:29,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:29,252 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:29,252 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:29,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:29,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:29,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:29,252 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:29,252 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:29,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:29,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:29,253 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:29,253 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:29,253 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:29,253 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:29,253 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:29,253 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:29,253 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:29,254 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:29,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:29,256 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:29,256 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:29,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:29,256 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:29,256 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:29,333 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:29,335 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:36:29,335 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:29,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:29,335 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:29,335 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:29,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3480 [2022-12-06 07:36:29,335 INFO L420 AbstractCegarLoop]: === Iteration 3482 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:29,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:29,335 INFO L85 PathProgramCache]: Analyzing trace with hash -2040837524, now seen corresponding path program 1 times [2022-12-06 07:36:29,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:29,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276790901] [2022-12-06 07:36:29,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:29,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:29,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-06 07:36:29,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:29,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276790901] [2022-12-06 07:36:29,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276790901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:29,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:29,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:29,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793961203] [2022-12-06 07:36:29,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:29,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:29,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:29,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:29,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:29,404 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:29,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:29,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:29,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:29,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:29,446 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:29,446 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:29,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:29,446 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:29,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:29,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:29,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:29,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:29,447 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:29,447 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:29,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:29,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:29,448 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:29,448 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:29,448 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:29,448 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:29,448 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:29,448 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:29,448 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:29,448 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:29,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:29,450 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:29,450 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:29,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:29,451 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:29,451 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:29,527 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:29,528 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:29,528 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:29,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:29,528 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:29,528 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:29,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3481 [2022-12-06 07:36:29,528 INFO L420 AbstractCegarLoop]: === Iteration 3483 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:29,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:29,529 INFO L85 PathProgramCache]: Analyzing trace with hash -2014055415, now seen corresponding path program 1 times [2022-12-06 07:36:29,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:29,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992445657] [2022-12-06 07:36:29,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:29,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:29,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-06 07:36:29,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:29,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992445657] [2022-12-06 07:36:29,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992445657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:29,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:29,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:29,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867228302] [2022-12-06 07:36:29,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:29,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:29,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:29,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:29,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:29,602 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:29,602 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:29,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:29,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:29,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:29,641 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:29,641 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:29,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:29,641 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:29,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:29,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:29,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:29,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:29,642 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:29,642 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:29,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:29,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:29,642 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:29,643 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:29,643 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:29,643 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:29,643 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:29,643 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:29,643 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:29,643 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:29,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:29,645 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:29,645 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:29,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:29,645 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:29,646 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:29,721 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:29,723 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:29,723 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:29,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:29,723 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:29,723 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:29,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3482 [2022-12-06 07:36:29,723 INFO L420 AbstractCegarLoop]: === Iteration 3484 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:29,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:29,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1983579222, now seen corresponding path program 1 times [2022-12-06 07:36:29,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:29,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559545377] [2022-12-06 07:36:29,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:29,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:29,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-06 07:36:29,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:29,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559545377] [2022-12-06 07:36:29,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559545377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:29,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:29,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:29,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119608589] [2022-12-06 07:36:29,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:29,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:29,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:29,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:29,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:29,793 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:29,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:29,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:29,793 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:29,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:29,836 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:29,836 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:29,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:29,837 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:29,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:29,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:29,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:29,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:29,837 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:29,837 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:29,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:29,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:29,838 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:29,838 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:29,838 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:29,838 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:29,838 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:29,838 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:29,838 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:29,838 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:29,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:29,841 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:29,841 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:29,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:29,841 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:29,841 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:29,914 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:29,916 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:29,916 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:29,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:29,916 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:29,916 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:29,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3483 [2022-12-06 07:36:29,916 INFO L420 AbstractCegarLoop]: === Iteration 3485 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:29,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:29,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1956797113, now seen corresponding path program 1 times [2022-12-06 07:36:29,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:29,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133974138] [2022-12-06 07:36:29,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:29,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:30,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:30,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:30,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133974138] [2022-12-06 07:36:30,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133974138] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:30,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:30,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:30,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362207387] [2022-12-06 07:36:30,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:30,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:30,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:30,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:30,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:30,004 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:30,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:30,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:30,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:30,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:30,050 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:30,050 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:30,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 379 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:30,051 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:30,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:30,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:30,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:30,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:30,051 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:30,051 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:30,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:30,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:30,052 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:30,052 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:30,052 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:30,052 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:30,052 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:30,052 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:30,052 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:30,052 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:30,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:30,054 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:30,055 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:30,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:30,055 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:30,055 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:30,131 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:30,132 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:30,132 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:30,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:30,133 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:30,133 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:30,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3484 [2022-12-06 07:36:30,133 INFO L420 AbstractCegarLoop]: === Iteration 3486 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:30,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:30,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1926320920, now seen corresponding path program 1 times [2022-12-06 07:36:30,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:30,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682293379] [2022-12-06 07:36:30,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:30,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:30,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-06 07:36:30,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:30,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682293379] [2022-12-06 07:36:30,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682293379] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:30,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:30,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:30,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775723535] [2022-12-06 07:36:30,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:30,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:30,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:30,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:30,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:30,201 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:30,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:30,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:30,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:30,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:30,244 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:30,245 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:30,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:30,245 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:30,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:30,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:30,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:30,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:30,245 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:30,246 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:30,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:30,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:30,246 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:30,246 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:30,246 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:30,246 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:30,247 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:30,247 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:30,247 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:30,247 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:30,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:30,249 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:30,249 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:30,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:30,249 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:30,249 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:30,324 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:30,325 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:30,325 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:30,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:30,325 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:30,325 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:30,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3485 [2022-12-06 07:36:30,326 INFO L420 AbstractCegarLoop]: === Iteration 3487 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:30,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:30,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1899538811, now seen corresponding path program 1 times [2022-12-06 07:36:30,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:30,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158567057] [2022-12-06 07:36:30,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:30,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:30,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-06 07:36:30,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:30,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158567057] [2022-12-06 07:36:30,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158567057] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:30,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:30,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:30,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261066043] [2022-12-06 07:36:30,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:30,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:30,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:30,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:30,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:30,398 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:30,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:30,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:30,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:30,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:30,439 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:30,440 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:30,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:30,440 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:30,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:30,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:30,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:30,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:30,441 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:30,441 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:30,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:30,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:30,441 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:30,441 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:30,442 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:30,442 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:30,442 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:30,442 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:30,442 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:30,442 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:30,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:30,444 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:30,444 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:30,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:30,444 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:30,444 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:30,518 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:30,519 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:36:30,519 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:30,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:30,519 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:30,519 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:30,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3486 [2022-12-06 07:36:30,519 INFO L420 AbstractCegarLoop]: === Iteration 3488 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:30,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:30,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1869062618, now seen corresponding path program 1 times [2022-12-06 07:36:30,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:30,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523827275] [2022-12-06 07:36:30,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:30,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:30,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-06 07:36:30,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:30,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523827275] [2022-12-06 07:36:30,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523827275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:30,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:30,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:30,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482783922] [2022-12-06 07:36:30,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:30,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:30,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:30,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:30,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:30,590 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:30,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:30,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:30,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:30,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:30,626 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:30,627 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:30,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:30,627 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:30,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:30,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:30,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:30,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:30,628 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:30,628 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:30,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:30,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:30,628 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:30,628 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:30,629 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:30,629 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:30,629 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:30,629 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:30,629 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:30,629 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:30,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:30,631 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:30,631 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:30,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 122 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:30,631 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:30,632 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:30,707 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:30,708 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:30,709 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:30,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:30,709 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:30,709 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:30,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3487 [2022-12-06 07:36:30,709 INFO L420 AbstractCegarLoop]: === Iteration 3489 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:30,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:30,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1842280509, now seen corresponding path program 1 times [2022-12-06 07:36:30,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:30,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449669303] [2022-12-06 07:36:30,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:30,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:30,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-06 07:36:30,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:30,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449669303] [2022-12-06 07:36:30,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449669303] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:30,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:30,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:30,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036752675] [2022-12-06 07:36:30,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:30,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:30,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:30,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:30,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:30,784 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:30,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:30,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:30,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:30,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:30,818 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:30,819 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:30,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:30,819 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:30,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:30,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:30,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:30,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:30,820 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:30,820 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:30,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:30,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:30,820 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:30,820 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:30,820 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:30,821 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:30,821 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:30,821 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:30,821 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:30,821 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:30,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:30,823 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:30,823 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:30,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:30,823 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:30,823 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:30,897 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:30,899 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:30,899 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:30,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:30,899 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:30,899 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:30,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3488 [2022-12-06 07:36:30,899 INFO L420 AbstractCegarLoop]: === Iteration 3490 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:30,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:30,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1811804316, now seen corresponding path program 1 times [2022-12-06 07:36:30,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:30,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649939998] [2022-12-06 07:36:30,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:30,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:30,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-06 07:36:30,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:30,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649939998] [2022-12-06 07:36:30,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649939998] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:30,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:30,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:30,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664899629] [2022-12-06 07:36:30,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:30,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:30,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:30,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:30,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:30,970 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:30,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:30,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:30,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:30,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:31,007 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:31,007 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:31,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:31,008 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:31,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:31,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:31,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:31,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:31,008 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:31,008 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:31,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:31,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:31,009 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:31,009 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:31,009 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:31,009 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:31,009 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:31,009 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:31,010 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:31,010 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:31,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:31,012 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:31,012 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:31,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:31,012 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:31,012 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:31,086 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:31,087 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:31,088 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:31,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:31,088 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:31,088 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:31,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3489 [2022-12-06 07:36:31,088 INFO L420 AbstractCegarLoop]: === Iteration 3491 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:31,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:31,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1785022207, now seen corresponding path program 1 times [2022-12-06 07:36:31,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:31,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889094563] [2022-12-06 07:36:31,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:31,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:31,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-06 07:36:31,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:31,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889094563] [2022-12-06 07:36:31,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889094563] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:31,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:31,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:31,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841610463] [2022-12-06 07:36:31,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:31,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:31,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:31,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:31,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:31,160 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:31,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:31,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:31,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:31,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:31,215 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:31,215 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:31,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:31,215 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:31,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:31,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:31,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:31,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:31,216 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:31,216 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:31,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:31,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:31,217 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:31,217 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:31,217 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:31,217 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:31,217 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:31,217 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:31,217 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:31,217 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:31,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:31,219 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:31,219 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:31,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:31,220 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:31,220 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:31,294 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:31,296 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:31,296 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:31,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:31,296 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:31,296 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:31,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3490 [2022-12-06 07:36:31,296 INFO L420 AbstractCegarLoop]: === Iteration 3492 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:31,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:31,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1754546014, now seen corresponding path program 1 times [2022-12-06 07:36:31,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:31,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164996662] [2022-12-06 07:36:31,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:31,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:31,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-06 07:36:31,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:31,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164996662] [2022-12-06 07:36:31,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164996662] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:31,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:31,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:31,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407945164] [2022-12-06 07:36:31,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:31,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:31,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:31,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:31,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:31,363 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:31,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:31,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:31,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:31,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:31,405 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:31,405 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:31,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:31,405 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:31,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:31,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:31,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:31,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:31,406 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:31,406 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:31,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:31,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:31,406 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:31,406 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:31,407 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:31,407 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:31,407 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:31,407 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:31,407 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:31,407 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:31,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:31,409 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:31,409 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:31,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:31,409 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:31,409 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:31,484 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:31,485 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:31,485 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:31,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:31,486 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:31,486 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:31,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3491 [2022-12-06 07:36:31,486 INFO L420 AbstractCegarLoop]: === Iteration 3493 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:31,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:31,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1727763905, now seen corresponding path program 1 times [2022-12-06 07:36:31,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:31,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728503375] [2022-12-06 07:36:31,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:31,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:31,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-06 07:36:31,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:31,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728503375] [2022-12-06 07:36:31,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728503375] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:31,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:31,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:31,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695860263] [2022-12-06 07:36:31,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:31,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:31,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:31,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:31,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:31,558 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:31,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:31,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:31,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:31,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:31,595 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:31,595 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:31,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:31,596 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:31,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:31,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:31,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:31,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:31,596 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:31,596 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:31,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:31,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:31,597 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:31,597 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:31,597 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:31,597 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:31,597 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:31,597 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:31,597 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:31,597 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:31,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:31,600 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:31,600 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:31,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:31,600 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:31,600 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:31,677 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:31,678 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:36:31,678 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:31,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:31,678 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:31,678 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:31,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3492 [2022-12-06 07:36:31,679 INFO L420 AbstractCegarLoop]: === Iteration 3494 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:31,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:31,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1697287712, now seen corresponding path program 1 times [2022-12-06 07:36:31,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:31,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305253913] [2022-12-06 07:36:31,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:31,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:31,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-06 07:36:31,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:31,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305253913] [2022-12-06 07:36:31,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305253913] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:31,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:31,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:31,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492473348] [2022-12-06 07:36:31,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:31,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:31,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:31,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:31,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:31,746 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:31,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:31,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:31,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:31,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:31,788 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:31,788 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:31,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 349 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:31,789 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:31,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:31,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:31,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:31,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:31,789 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:31,789 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:31,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:31,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:31,790 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:31,790 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:31,790 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:31,790 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:31,790 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:31,790 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:31,790 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:31,791 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:31,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:31,793 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:31,793 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:31,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:31,793 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:31,793 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:31,869 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:31,870 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:31,870 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:31,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:31,870 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:31,870 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:31,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3493 [2022-12-06 07:36:31,870 INFO L420 AbstractCegarLoop]: === Iteration 3495 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:31,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:31,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1670505603, now seen corresponding path program 1 times [2022-12-06 07:36:31,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:31,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414663705] [2022-12-06 07:36:31,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:31,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:31,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-06 07:36:31,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:31,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414663705] [2022-12-06 07:36:31,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414663705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:31,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:31,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:31,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245222036] [2022-12-06 07:36:31,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:31,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:31,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:31,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:31,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:31,941 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:31,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:31,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:31,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:31,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:31,977 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:31,978 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:31,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:31,978 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:31,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:31,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:31,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:31,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:31,979 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:31,979 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:31,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:31,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:31,979 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:31,979 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:31,980 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:31,980 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:31,980 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:31,980 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:31,980 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:31,980 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:31,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:31,982 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:31,982 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:31,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:31,982 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:31,983 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:32,055 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:32,057 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:36:32,057 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:32,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:32,057 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:32,057 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:32,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3494 [2022-12-06 07:36:32,057 INFO L420 AbstractCegarLoop]: === Iteration 3496 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:32,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:32,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1640029410, now seen corresponding path program 1 times [2022-12-06 07:36:32,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:32,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865268639] [2022-12-06 07:36:32,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:32,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:32,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-06 07:36:32,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:32,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865268639] [2022-12-06 07:36:32,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865268639] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:32,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:32,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:32,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505842626] [2022-12-06 07:36:32,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:32,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:32,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:32,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:32,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:32,128 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:32,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:32,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:32,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:32,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:32,170 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:32,171 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:32,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:32,171 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:32,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:32,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:32,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:32,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:32,171 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:32,172 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:32,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:32,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:32,172 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:32,172 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:32,172 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:32,172 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:32,172 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:32,173 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:32,173 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:32,173 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:32,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:32,175 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:32,175 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:32,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:32,175 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:32,175 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:32,250 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:32,251 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:32,251 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:32,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:32,251 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:32,252 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:32,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3495 [2022-12-06 07:36:32,252 INFO L420 AbstractCegarLoop]: === Iteration 3497 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:32,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:32,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1613247301, now seen corresponding path program 1 times [2022-12-06 07:36:32,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:32,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119560377] [2022-12-06 07:36:32,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:32,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:32,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-06 07:36:32,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:32,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119560377] [2022-12-06 07:36:32,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119560377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:32,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:32,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:32,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855630960] [2022-12-06 07:36:32,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:32,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:32,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:32,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:32,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:32,324 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:32,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:32,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:32,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:32,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:32,365 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:32,365 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:32,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:32,366 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:32,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:32,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:32,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:32,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:32,366 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:32,366 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:32,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:32,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:32,367 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:32,367 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:32,367 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:32,367 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:32,367 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:32,368 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:32,368 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:32,368 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:32,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:32,370 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:32,370 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:32,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:32,370 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:32,370 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:32,444 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:32,446 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:32,446 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:32,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:32,446 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:32,446 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:32,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3496 [2022-12-06 07:36:32,446 INFO L420 AbstractCegarLoop]: === Iteration 3498 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:32,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:32,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1582771108, now seen corresponding path program 1 times [2022-12-06 07:36:32,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:32,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825859801] [2022-12-06 07:36:32,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:32,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:32,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-06 07:36:32,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:32,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825859801] [2022-12-06 07:36:32,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825859801] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:32,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:32,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:32,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121895756] [2022-12-06 07:36:32,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:32,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:32,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:32,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:32,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:32,525 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:32,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:32,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:32,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:32,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:32,567 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:32,567 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:32,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:32,568 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:32,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:32,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:32,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:32,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:32,568 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:32,568 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:32,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:32,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:32,569 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:32,569 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:32,569 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:32,569 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:32,569 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:32,569 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:32,569 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:32,569 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:32,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:32,571 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:32,572 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:32,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:32,572 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:32,572 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:32,646 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:32,647 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:32,647 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:32,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:32,647 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:32,648 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:32,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3497 [2022-12-06 07:36:32,648 INFO L420 AbstractCegarLoop]: === Iteration 3499 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:32,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:32,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1555988999, now seen corresponding path program 1 times [2022-12-06 07:36:32,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:32,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892950124] [2022-12-06 07:36:32,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:32,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:32,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:32,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-06 07:36:32,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:32,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892950124] [2022-12-06 07:36:32,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892950124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:32,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:32,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:32,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027189203] [2022-12-06 07:36:32,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:32,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:32,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:32,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:32,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:32,719 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:32,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:32,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:32,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:32,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:32,755 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:32,755 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:32,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:32,755 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:32,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:32,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:32,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:32,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:32,756 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:32,756 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:32,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:32,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:32,756 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:32,756 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:32,757 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:32,757 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:32,757 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:32,757 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:32,757 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:32,757 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:32,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:32,759 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:32,759 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:32,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:32,760 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:32,760 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:32,834 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:32,836 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:32,836 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:32,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:32,836 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:32,836 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:32,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3498 [2022-12-06 07:36:32,836 INFO L420 AbstractCegarLoop]: === Iteration 3500 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:32,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:32,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1525512806, now seen corresponding path program 1 times [2022-12-06 07:36:32,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:32,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285115347] [2022-12-06 07:36:32,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:32,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:32,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-06 07:36:32,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:32,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285115347] [2022-12-06 07:36:32,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285115347] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:32,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:32,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:32,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258431594] [2022-12-06 07:36:32,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:32,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:32,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:32,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:32,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:32,904 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:32,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:32,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:32,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:32,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:32,945 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:32,945 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:32,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:32,945 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:32,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:32,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:32,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:32,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:32,946 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:32,946 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:32,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:32,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:32,947 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:32,947 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:32,947 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:32,947 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:32,947 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:32,947 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:32,947 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:32,947 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:32,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:32,949 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:32,949 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:32,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:32,950 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:32,950 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:33,024 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:33,025 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:33,025 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:33,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:33,025 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:33,025 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:33,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3499 [2022-12-06 07:36:33,026 INFO L420 AbstractCegarLoop]: === Iteration 3501 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:33,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:33,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1498730697, now seen corresponding path program 1 times [2022-12-06 07:36:33,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:33,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857104010] [2022-12-06 07:36:33,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:33,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:33,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-06 07:36:33,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:33,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857104010] [2022-12-06 07:36:33,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857104010] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:33,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:33,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:33,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029684668] [2022-12-06 07:36:33,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:33,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:33,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:33,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:33,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:33,098 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:33,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:33,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:33,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:33,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:33,134 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:33,134 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:33,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:33,135 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:33,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:33,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:33,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:33,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:33,135 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:33,135 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:33,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:33,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:33,136 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:33,136 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:33,136 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:33,136 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:33,136 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:33,136 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:33,136 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:33,136 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:33,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:33,139 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:33,139 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:33,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:33,139 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:33,139 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:33,214 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:33,216 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:33,216 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:33,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:33,216 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:33,216 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:33,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3500 [2022-12-06 07:36:33,216 INFO L420 AbstractCegarLoop]: === Iteration 3502 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:33,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:33,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1468254504, now seen corresponding path program 1 times [2022-12-06 07:36:33,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:33,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974963838] [2022-12-06 07:36:33,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:33,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:33,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:33,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:33,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974963838] [2022-12-06 07:36:33,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974963838] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:33,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:33,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:33,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169725200] [2022-12-06 07:36:33,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:33,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:33,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:33,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:33,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:33,284 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:33,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:33,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:33,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:33,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:33,327 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:33,327 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:33,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:33,327 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:33,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:33,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:33,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:33,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:33,328 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:33,328 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:33,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:33,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:33,329 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:33,329 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:33,329 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:33,329 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:33,329 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:33,329 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:33,329 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:33,329 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:33,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:33,331 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:33,331 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:33,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:33,332 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:33,332 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:33,406 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:33,408 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:33,408 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:33,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:33,408 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:33,408 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:33,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3501 [2022-12-06 07:36:33,408 INFO L420 AbstractCegarLoop]: === Iteration 3503 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:33,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:33,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1441472395, now seen corresponding path program 1 times [2022-12-06 07:36:33,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:33,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288246691] [2022-12-06 07:36:33,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:33,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:33,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-06 07:36:33,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:33,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288246691] [2022-12-06 07:36:33,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288246691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:33,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:33,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:33,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479994121] [2022-12-06 07:36:33,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:33,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:33,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:33,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:33,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:33,484 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:33,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:33,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:33,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:33,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:33,523 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:33,523 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:33,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:33,524 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:33,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:33,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:33,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:33,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:33,524 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:33,524 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:33,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:33,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:33,525 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:33,525 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:33,525 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:33,525 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:33,525 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:33,525 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:33,525 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:33,525 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:33,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:33,528 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:33,528 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:33,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:33,528 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:33,528 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:33,606 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:33,607 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:36:33,607 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:33,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:33,607 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:33,607 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:33,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3502 [2022-12-06 07:36:33,608 INFO L420 AbstractCegarLoop]: === Iteration 3504 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:33,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:33,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1410996202, now seen corresponding path program 1 times [2022-12-06 07:36:33,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:33,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516871628] [2022-12-06 07:36:33,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:33,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:33,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-06 07:36:33,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:33,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516871628] [2022-12-06 07:36:33,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516871628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:33,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:33,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:33,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961330761] [2022-12-06 07:36:33,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:33,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:33,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:33,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:33,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:33,698 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:33,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:33,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:33,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:33,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:33,741 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:33,741 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:33,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:33,741 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:33,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:33,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:33,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:33,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:33,742 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:33,742 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:33,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:33,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:33,743 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:33,743 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:33,743 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:33,743 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:33,743 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:33,743 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:33,743 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:33,743 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:33,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:33,745 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:33,745 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:33,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:33,746 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:33,746 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:33,825 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:33,826 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 07:36:33,827 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:33,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:33,827 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:33,827 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:33,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3503 [2022-12-06 07:36:33,827 INFO L420 AbstractCegarLoop]: === Iteration 3505 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:33,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:33,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1384214093, now seen corresponding path program 1 times [2022-12-06 07:36:33,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:33,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830951522] [2022-12-06 07:36:33,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:33,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36: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-06 07:36:33,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:33,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830951522] [2022-12-06 07:36:33,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830951522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:33,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:33,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:33,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074897955] [2022-12-06 07:36:33,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:33,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:33,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:33,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:33,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:33,900 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:33,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:33,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:33,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:33,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:33,935 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:33,935 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:33,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 373 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:33,935 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:33,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:33,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:33,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:33,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:33,936 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:33,936 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:33,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:33,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:33,936 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:33,936 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:33,937 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:33,937 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:33,937 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:33,937 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:33,937 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:33,937 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:33,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:33,939 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:33,939 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:33,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:33,940 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:33,940 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:34,013 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:34,014 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:36:34,015 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:34,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:34,015 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:34,015 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:34,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3504 [2022-12-06 07:36:34,015 INFO L420 AbstractCegarLoop]: === Iteration 3506 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:34,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:34,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1353737900, now seen corresponding path program 1 times [2022-12-06 07:36:34,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:34,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254680966] [2022-12-06 07:36:34,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:34,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:34,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:34,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-06 07:36:34,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:34,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254680966] [2022-12-06 07:36:34,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254680966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:34,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:34,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:34,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192393024] [2022-12-06 07:36:34,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:34,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:34,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:34,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:34,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:34,084 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:34,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:34,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:34,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:34,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:34,126 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:34,126 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:34,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:34,126 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:34,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:34,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:34,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:34,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:34,127 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:34,127 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:34,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:34,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:34,128 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:34,128 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:34,128 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:34,128 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:34,128 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:34,128 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:34,128 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:34,128 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:34,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:34,130 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:34,130 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:34,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:34,131 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:34,131 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:34,206 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:34,207 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:34,207 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:34,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:34,207 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:34,207 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:34,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3505 [2022-12-06 07:36:34,208 INFO L420 AbstractCegarLoop]: === Iteration 3507 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:34,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:34,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1326955791, now seen corresponding path program 1 times [2022-12-06 07:36:34,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:34,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361955093] [2022-12-06 07:36:34,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:34,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:34,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-06 07:36:34,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:34,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361955093] [2022-12-06 07:36:34,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361955093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:34,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:34,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:34,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219750245] [2022-12-06 07:36:34,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:34,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:34,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:34,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:34,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:34,280 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:34,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:34,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:34,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:34,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:34,321 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:34,322 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:34,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:34,322 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:34,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:34,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:34,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:34,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:34,323 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:34,323 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:34,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:34,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:34,323 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:34,323 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:34,324 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:34,324 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:34,324 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:34,324 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:34,324 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:34,324 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:34,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:34,326 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:34,326 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:34,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:34,326 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:34,326 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:34,403 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:34,404 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:34,405 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:34,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:34,405 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:34,405 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:34,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3506 [2022-12-06 07:36:34,405 INFO L420 AbstractCegarLoop]: === Iteration 3508 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:34,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:34,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1296479598, now seen corresponding path program 1 times [2022-12-06 07:36:34,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:34,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056251203] [2022-12-06 07:36:34,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:34,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:34,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-06 07:36:34,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:34,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056251203] [2022-12-06 07:36:34,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056251203] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:34,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:34,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:34,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480545282] [2022-12-06 07:36:34,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:34,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:34,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:34,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:34,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:34,479 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:34,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:34,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:34,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:34,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:34,521 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:34,521 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:34,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:34,522 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:34,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:34,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:34,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:34,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:34,522 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:34,522 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:34,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:34,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:34,523 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:34,523 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:34,523 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:34,523 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:34,523 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:34,523 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:34,523 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:34,523 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:34,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:34,526 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:34,526 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:34,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:34,526 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:34,526 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:34,601 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:34,603 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:34,603 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:34,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:34,603 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:34,603 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:34,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3507 [2022-12-06 07:36:34,603 INFO L420 AbstractCegarLoop]: === Iteration 3509 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:34,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:34,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1269697489, now seen corresponding path program 1 times [2022-12-06 07:36:34,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:34,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047001256] [2022-12-06 07:36:34,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:34,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:34,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:34,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-06 07:36:34,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:34,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047001256] [2022-12-06 07:36:34,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047001256] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:34,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:34,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:34,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534696711] [2022-12-06 07:36:34,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:34,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:34,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:34,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:34,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:34,678 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:34,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:34,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:34,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:34,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:34,714 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:34,714 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:34,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:34,715 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:34,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:34,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:34,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:34,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:34,715 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:34,715 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:34,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:34,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:34,716 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:34,716 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:34,716 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:34,716 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:34,716 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:34,716 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:34,716 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:34,716 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:34,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:34,719 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:34,719 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:34,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:34,719 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:34,719 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:34,793 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:34,794 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:34,794 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:34,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:34,794 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:34,794 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:34,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3508 [2022-12-06 07:36:34,794 INFO L420 AbstractCegarLoop]: === Iteration 3510 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:34,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:34,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1239221296, now seen corresponding path program 1 times [2022-12-06 07:36:34,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:34,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44136568] [2022-12-06 07:36:34,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:34,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:34,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-06 07:36:34,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:34,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44136568] [2022-12-06 07:36:34,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44136568] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:34,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:34,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:34,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747339888] [2022-12-06 07:36:34,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:34,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:34,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:34,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:34,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:34,887 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:34,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:34,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:34,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:34,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:34,924 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:34,924 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:34,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:34,925 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:34,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:34,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:34,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:34,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:34,925 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:34,925 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:34,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:34,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:34,926 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:34,926 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:34,926 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:34,926 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:34,926 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:34,926 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:34,926 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:34,927 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:34,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:34,929 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:34,929 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:34,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:34,929 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:34,929 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:35,006 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:35,007 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:36:35,007 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:35,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:35,007 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:35,007 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:35,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3509 [2022-12-06 07:36:35,007 INFO L420 AbstractCegarLoop]: === Iteration 3511 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:35,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:35,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1212439187, now seen corresponding path program 1 times [2022-12-06 07:36:35,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:35,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030996270] [2022-12-06 07:36:35,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:35,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:35,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:35,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:35,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030996270] [2022-12-06 07:36:35,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030996270] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:35,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:35,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:35,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558417141] [2022-12-06 07:36:35,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:35,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:35,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:35,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:35,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:35,081 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:35,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:35,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:35,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:35,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:35,120 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:35,120 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:35,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 371 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:35,121 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:35,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:35,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:35,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:35,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:35,121 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:35,121 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:35,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:35,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:35,122 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:35,122 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:35,122 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:35,122 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:35,122 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:35,122 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:35,122 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:35,122 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:35,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:35,125 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:35,125 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:35,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:35,125 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:35,125 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:35,200 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:35,201 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:35,201 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:35,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:35,202 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:35,202 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:35,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3510 [2022-12-06 07:36:35,202 INFO L420 AbstractCegarLoop]: === Iteration 3512 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:35,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:35,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1181962994, now seen corresponding path program 1 times [2022-12-06 07:36:35,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:35,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586389356] [2022-12-06 07:36:35,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:35,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:35,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:35,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-06 07:36:35,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:35,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586389356] [2022-12-06 07:36:35,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586389356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:35,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:35,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:35,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649396549] [2022-12-06 07:36:35,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:35,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:35,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:35,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:35,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:35,273 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:35,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:35,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:35,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:35,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:35,316 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:35,316 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:35,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:35,316 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:35,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:35,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:35,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:35,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:35,317 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:35,317 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:35,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:35,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:35,317 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:35,318 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:35,318 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:35,318 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:35,318 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:35,318 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:35,318 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:35,318 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:35,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:35,320 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:35,320 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:35,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:35,321 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:35,321 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:35,393 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:35,395 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:36:35,395 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:35,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:35,395 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:35,395 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:35,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3511 [2022-12-06 07:36:35,395 INFO L420 AbstractCegarLoop]: === Iteration 3513 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:35,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:35,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1155180885, now seen corresponding path program 1 times [2022-12-06 07:36:35,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:35,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027448981] [2022-12-06 07:36:35,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:35,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:35,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:35,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:35,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027448981] [2022-12-06 07:36:35,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027448981] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:35,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:35,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:35,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147888218] [2022-12-06 07:36:35,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:35,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:35,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:35,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:35,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:35,472 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:35,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:35,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:35,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:35,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:35,513 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:35,513 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:35,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:35,514 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:35,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:35,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:35,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:35,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:35,514 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:35,514 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:35,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:35,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:35,515 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:35,515 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:35,515 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:35,515 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:35,515 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:35,515 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:35,515 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:35,515 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:35,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:35,518 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:35,518 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:35,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:35,518 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:35,518 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:35,598 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:35,599 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:36:35,600 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:35,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:35,600 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:35,600 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:35,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3512 [2022-12-06 07:36:35,600 INFO L420 AbstractCegarLoop]: === Iteration 3514 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:35,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:35,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1124704692, now seen corresponding path program 1 times [2022-12-06 07:36:35,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:35,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456459645] [2022-12-06 07:36:35,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:35,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:35,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-06 07:36:35,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:35,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456459645] [2022-12-06 07:36:35,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456459645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:35,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:35,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:35,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571459574] [2022-12-06 07:36:35,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:35,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:35,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:35,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:35,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:35,670 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:35,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:35,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:35,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:35,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:35,712 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:35,713 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:35,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:35,713 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:35,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:35,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:35,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:35,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:35,713 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:35,714 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:35,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:35,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:35,714 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:35,714 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:35,714 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:35,714 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:35,715 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:35,715 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:35,715 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:35,715 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:35,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:35,717 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:35,717 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:35,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:35,717 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:35,717 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:35,798 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:35,800 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-06 07:36:35,800 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:35,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:35,800 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:35,800 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:35,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3513 [2022-12-06 07:36:35,800 INFO L420 AbstractCegarLoop]: === Iteration 3515 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:35,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:35,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1097922583, now seen corresponding path program 1 times [2022-12-06 07:36:35,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:35,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982996034] [2022-12-06 07:36:35,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:35,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:35,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:35,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:35,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982996034] [2022-12-06 07:36:35,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982996034] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:35,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:35,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:35,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980144106] [2022-12-06 07:36:35,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:35,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:35,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:35,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:35,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:35,875 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:35,875 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:35,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:35,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:35,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:35,918 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:35,919 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:35,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:35,919 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:35,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:35,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:35,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:35,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:35,920 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:35,920 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:35,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:35,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:35,920 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:35,920 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:35,920 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:35,921 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:35,921 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:35,921 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:35,921 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:35,921 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:35,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:35,923 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:35,923 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:35,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:35,923 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:35,923 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:35,999 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:36,001 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:36,001 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:36,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:36,001 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:36,001 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:36,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3514 [2022-12-06 07:36:36,001 INFO L420 AbstractCegarLoop]: === Iteration 3516 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:36,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:36,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1067446390, now seen corresponding path program 1 times [2022-12-06 07:36:36,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:36,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130192892] [2022-12-06 07:36:36,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:36,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:36,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-06 07:36:36,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:36,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130192892] [2022-12-06 07:36:36,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130192892] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:36,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:36,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:36,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753193977] [2022-12-06 07:36:36,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:36,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:36,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:36,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:36,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:36,077 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:36,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:36,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:36,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:36,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:36,131 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:36,131 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:36,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:36,131 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:36,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:36,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:36,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:36,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:36,132 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:36,132 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:36,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:36,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:36,133 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:36,133 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:36,133 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:36,133 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:36,133 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:36,133 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:36,133 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:36,133 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:36,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:36,135 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:36,135 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:36,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:36,136 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:36,136 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:36,212 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:36,213 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:36,213 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:36,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:36,213 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:36,213 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:36,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3515 [2022-12-06 07:36:36,213 INFO L420 AbstractCegarLoop]: === Iteration 3517 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:36,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:36,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1040664281, now seen corresponding path program 1 times [2022-12-06 07:36:36,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:36,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404273807] [2022-12-06 07:36:36,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:36,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:36,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-06 07:36:36,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:36,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404273807] [2022-12-06 07:36:36,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404273807] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:36,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:36,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:36,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505654437] [2022-12-06 07:36:36,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:36,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:36,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:36,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:36,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:36,284 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:36,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:36,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:36,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:36,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:36,326 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:36,326 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:36,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:36,327 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:36,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:36,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:36,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:36,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:36,327 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:36,327 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:36,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:36,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:36,328 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:36,328 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:36,328 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:36,328 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:36,328 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:36,328 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:36,328 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:36,329 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:36,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:36,331 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:36,331 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:36,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:36,331 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:36,331 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:36,406 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:36,407 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:36,407 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:36,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:36,407 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:36,407 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:36,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3516 [2022-12-06 07:36:36,407 INFO L420 AbstractCegarLoop]: === Iteration 3518 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:36,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:36,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1010188088, now seen corresponding path program 1 times [2022-12-06 07:36:36,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:36,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074018183] [2022-12-06 07:36:36,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:36,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:36,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-06 07:36:36,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:36,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074018183] [2022-12-06 07:36:36,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074018183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:36,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:36,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:36,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119482272] [2022-12-06 07:36:36,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:36,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:36,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:36,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:36,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:36,476 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:36,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:36,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:36,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:36,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:36,518 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:36,518 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:36,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:36,518 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:36,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:36,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:36,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:36,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:36,519 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:36,519 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:36,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:36,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:36,519 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:36,519 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:36,520 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:36,520 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:36,520 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:36,520 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:36,520 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:36,520 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:36,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:36,522 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:36,522 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:36,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:36,522 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:36,522 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:36,600 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:36,601 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:36:36,601 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:36,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:36,602 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:36,602 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:36,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3517 [2022-12-06 07:36:36,602 INFO L420 AbstractCegarLoop]: === Iteration 3519 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:36,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:36,602 INFO L85 PathProgramCache]: Analyzing trace with hash -983405979, now seen corresponding path program 1 times [2022-12-06 07:36:36,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:36,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092655942] [2022-12-06 07:36:36,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:36,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36: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-06 07:36:36,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:36,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092655942] [2022-12-06 07:36:36,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092655942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:36,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:36,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:36,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880009267] [2022-12-06 07:36:36,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:36,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:36,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:36,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:36,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:36,672 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:36,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:36,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:36,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:36,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:36,708 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:36,708 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:36,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:36,708 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:36,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:36,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:36,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:36,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:36,709 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:36,709 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:36,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:36,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:36,709 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:36,710 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:36,710 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:36,710 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:36,710 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:36,710 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:36,710 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:36,710 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:36,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:36,712 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:36,712 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:36,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:36,712 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:36,713 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:36,795 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:36,797 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 07:36:36,797 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:36,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:36,797 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:36,797 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:36,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3518 [2022-12-06 07:36:36,797 INFO L420 AbstractCegarLoop]: === Iteration 3520 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:36,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:36,797 INFO L85 PathProgramCache]: Analyzing trace with hash -952929786, now seen corresponding path program 1 times [2022-12-06 07:36:36,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:36,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115829845] [2022-12-06 07:36:36,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:36,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:36,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-06 07:36:36,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:36,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115829845] [2022-12-06 07:36:36,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115829845] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:36,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:36,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:36,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359604223] [2022-12-06 07:36:36,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:36,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:36,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:36,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:36,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:36,865 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:36,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:36,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:36,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:36,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:36,901 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:36,901 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:36,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:36,902 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:36,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:36,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:36,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:36,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:36,902 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:36,902 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:36,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:36,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:36,903 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:36,903 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:36,903 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:36,903 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:36,903 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:36,903 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:36,903 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:36,903 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:36,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:36,905 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:36,906 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:36,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:36,906 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:36,906 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:36,987 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:36,988 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 07:36:36,988 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:36,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:36,988 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:36,988 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:36,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3519 [2022-12-06 07:36:36,988 INFO L420 AbstractCegarLoop]: === Iteration 3521 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:36,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:36,989 INFO L85 PathProgramCache]: Analyzing trace with hash -926147677, now seen corresponding path program 1 times [2022-12-06 07:36:36,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:36,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372275905] [2022-12-06 07:36:36,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:36,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:37,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-06 07:36:37,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:37,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372275905] [2022-12-06 07:36:37,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372275905] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:37,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:37,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:37,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718723352] [2022-12-06 07:36:37,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:37,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:37,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:37,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:37,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:37,059 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:37,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:37,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:37,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:37,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:37,100 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:37,100 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:37,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:37,101 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:37,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:37,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:37,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:37,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:37,101 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:37,101 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:37,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:37,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:37,102 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:37,102 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:37,102 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:37,102 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:37,102 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:37,102 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:37,103 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:37,103 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:37,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:37,105 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:37,105 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:37,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:37,105 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:37,105 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:37,183 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:37,185 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 07:36:37,185 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:37,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:37,185 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:37,185 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:37,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3520 [2022-12-06 07:36:37,186 INFO L420 AbstractCegarLoop]: === Iteration 3522 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:37,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:37,186 INFO L85 PathProgramCache]: Analyzing trace with hash -895671484, now seen corresponding path program 1 times [2022-12-06 07:36:37,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:37,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304765403] [2022-12-06 07:36:37,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:37,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:37,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-06 07:36:37,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:37,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304765403] [2022-12-06 07:36:37,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304765403] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:37,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:37,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:37,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995251807] [2022-12-06 07:36:37,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:37,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:37,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:37,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:37,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:37,260 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:37,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:37,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:37,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:37,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:37,303 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:37,303 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:37,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:37,303 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:37,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:37,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:37,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:37,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:37,304 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:37,304 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:37,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:37,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:37,305 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:37,305 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:37,305 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:37,305 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:37,305 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:37,305 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:37,305 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:37,305 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:37,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:37,307 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:37,307 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:37,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:37,308 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:37,308 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:37,380 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:37,382 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:36:37,382 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:37,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:37,382 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:37,382 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:37,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3521 [2022-12-06 07:36:37,382 INFO L420 AbstractCegarLoop]: === Iteration 3523 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:37,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:37,382 INFO L85 PathProgramCache]: Analyzing trace with hash -868889375, now seen corresponding path program 1 times [2022-12-06 07:36:37,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:37,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542107850] [2022-12-06 07:36:37,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:37,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:37,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-06 07:36:37,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:37,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542107850] [2022-12-06 07:36:37,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542107850] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:37,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:37,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:37,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093600210] [2022-12-06 07:36:37,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:37,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:37,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:37,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:37,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:37,463 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:37,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:37,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:37,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:37,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:37,505 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:37,505 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:37,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:37,505 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:37,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:37,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:37,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:37,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:37,506 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:37,506 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:37,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:37,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:37,506 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:37,506 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:37,507 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:37,507 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:37,507 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:37,507 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:37,507 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:37,507 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:37,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:37,509 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:37,509 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:37,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:37,509 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:37,509 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:37,585 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:37,586 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:37,586 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:37,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:37,586 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:37,586 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:37,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3522 [2022-12-06 07:36:37,586 INFO L420 AbstractCegarLoop]: === Iteration 3524 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:37,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:37,586 INFO L85 PathProgramCache]: Analyzing trace with hash -838413182, now seen corresponding path program 1 times [2022-12-06 07:36:37,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:37,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654880754] [2022-12-06 07:36:37,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:37,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:37,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-06 07:36:37,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:37,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654880754] [2022-12-06 07:36:37,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654880754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:37,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:37,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:37,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082924547] [2022-12-06 07:36:37,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:37,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:37,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:37,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:37,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:37,654 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:37,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:37,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:37,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:37,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:37,691 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:37,691 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:37,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:37,691 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:37,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:37,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:37,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:37,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:37,692 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:37,692 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:37,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:37,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:37,692 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:37,692 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:37,693 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:37,693 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:37,693 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:37,693 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:37,693 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:37,693 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:37,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:37,695 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:37,695 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:37,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:37,695 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:37,695 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:37,771 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:37,772 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:37,772 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:37,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:37,772 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:37,772 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:37,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3523 [2022-12-06 07:36:37,772 INFO L420 AbstractCegarLoop]: === Iteration 3525 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:37,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:37,772 INFO L85 PathProgramCache]: Analyzing trace with hash -811631073, now seen corresponding path program 1 times [2022-12-06 07:36:37,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:37,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111171166] [2022-12-06 07:36:37,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:37,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:37,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-06 07:36:37,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:37,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111171166] [2022-12-06 07:36:37,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111171166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:37,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:37,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:37,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750349947] [2022-12-06 07:36:37,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:37,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:37,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:37,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:37,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:37,843 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:37,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:37,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:37,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:37,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:37,884 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:37,884 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:37,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:37,884 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:37,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:37,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:37,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:37,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:37,885 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:37,885 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:37,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:37,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:37,886 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:37,886 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:37,886 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:37,886 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:37,886 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:37,886 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:37,886 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:37,886 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:37,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:37,888 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:37,888 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:37,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:37,889 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:37,889 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:37,964 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:37,966 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:37,966 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:37,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:37,966 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:37,966 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:37,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3524 [2022-12-06 07:36:37,967 INFO L420 AbstractCegarLoop]: === Iteration 3526 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:37,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:37,967 INFO L85 PathProgramCache]: Analyzing trace with hash -781154880, now seen corresponding path program 1 times [2022-12-06 07:36:37,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:37,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948847814] [2022-12-06 07:36:37,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:37,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:38,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-06 07:36:38,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:38,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948847814] [2022-12-06 07:36:38,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948847814] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:38,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:38,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:38,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143108866] [2022-12-06 07:36:38,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:38,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:38,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:38,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:38,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:38,042 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:38,042 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:38,042 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:38,042 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:38,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:38,080 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:38,080 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:38,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:38,080 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:38,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:38,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:38,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:38,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:38,081 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:38,081 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:38,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:38,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:38,082 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:38,082 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:38,082 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:38,082 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:38,082 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:38,082 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:38,082 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:38,082 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:38,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:38,084 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:38,084 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:38,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:38,085 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:38,085 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:38,158 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:38,160 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:38,160 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:38,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:38,160 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:38,160 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:38,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3525 [2022-12-06 07:36:38,160 INFO L420 AbstractCegarLoop]: === Iteration 3527 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:38,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:38,160 INFO L85 PathProgramCache]: Analyzing trace with hash -754372771, now seen corresponding path program 1 times [2022-12-06 07:36:38,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:38,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961844310] [2022-12-06 07:36:38,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:38,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36: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-06 07:36:38,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:38,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961844310] [2022-12-06 07:36:38,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961844310] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:38,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:38,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:38,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596811719] [2022-12-06 07:36:38,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:38,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:38,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:38,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:38,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:38,231 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:38,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:38,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:38,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:38,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:38,267 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:38,267 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:38,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:38,267 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:38,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:38,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:38,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:38,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:38,268 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:38,268 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:38,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:38,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:38,268 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:38,269 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:38,269 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:38,269 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:38,269 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:38,269 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:38,269 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:38,269 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:38,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:38,271 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:38,271 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:38,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 145 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:38,272 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:38,272 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:38,346 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:38,348 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:38,348 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:38,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:38,348 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:38,348 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:38,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3526 [2022-12-06 07:36:38,348 INFO L420 AbstractCegarLoop]: === Iteration 3528 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:38,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:38,348 INFO L85 PathProgramCache]: Analyzing trace with hash -723896578, now seen corresponding path program 1 times [2022-12-06 07:36:38,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:38,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769697533] [2022-12-06 07:36:38,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:38,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:38,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-06 07:36:38,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:38,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769697533] [2022-12-06 07:36:38,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769697533] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:38,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:38,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:38,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533288433] [2022-12-06 07:36:38,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:38,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:38,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:38,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:38,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:38,418 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:38,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:38,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:38,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:38,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:38,461 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:38,461 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:38,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:38,462 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:38,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:38,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:38,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:38,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:38,462 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:38,462 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:38,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:38,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:38,463 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:38,463 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:38,463 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:38,463 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:38,463 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:38,463 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:38,463 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:38,463 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:38,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:38,466 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:38,466 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:38,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:38,466 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:38,466 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:38,543 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:38,544 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:36:38,544 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:38,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:38,544 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:38,544 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:38,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3527 [2022-12-06 07:36:38,544 INFO L420 AbstractCegarLoop]: === Iteration 3529 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:38,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:38,545 INFO L85 PathProgramCache]: Analyzing trace with hash -697114469, now seen corresponding path program 1 times [2022-12-06 07:36:38,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:38,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401056155] [2022-12-06 07:36:38,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:38,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:38,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-06 07:36:38,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:38,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401056155] [2022-12-06 07:36:38,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401056155] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:38,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:38,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:38,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015470423] [2022-12-06 07:36:38,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:38,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:38,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:38,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:38,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:38,639 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:38,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:38,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:38,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:38,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:38,674 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:38,674 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:38,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 363 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:38,675 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:38,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:38,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:38,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:38,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:38,675 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:38,675 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:38,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:38,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:38,676 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:38,676 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:38,676 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:38,676 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:38,676 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:38,676 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:38,676 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:38,677 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:38,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:38,679 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:38,679 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:38,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:38,679 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:38,679 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:38,756 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:38,757 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:36:38,757 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:38,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:38,757 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:38,757 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:38,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3528 [2022-12-06 07:36:38,758 INFO L420 AbstractCegarLoop]: === Iteration 3530 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:38,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:38,758 INFO L85 PathProgramCache]: Analyzing trace with hash -666638276, now seen corresponding path program 1 times [2022-12-06 07:36:38,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:38,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103998268] [2022-12-06 07:36:38,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:38,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:38,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-06 07:36:38,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:38,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103998268] [2022-12-06 07:36:38,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103998268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:38,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:38,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:38,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794434842] [2022-12-06 07:36:38,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:38,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:38,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:38,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:38,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:38,830 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:38,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:38,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:38,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:38,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:38,873 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:38,873 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:38,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:38,874 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:38,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:38,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:38,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:38,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:38,874 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:38,874 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:38,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:38,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:38,875 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:38,875 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:38,875 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:38,875 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:38,875 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:38,876 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:38,876 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:38,876 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:38,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:38,878 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:38,878 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:38,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:38,878 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:38,878 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:38,957 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:38,958 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 07:36:38,958 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:38,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:38,958 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:38,959 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:38,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3529 [2022-12-06 07:36:38,959 INFO L420 AbstractCegarLoop]: === Iteration 3531 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:38,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:38,959 INFO L85 PathProgramCache]: Analyzing trace with hash -639856167, now seen corresponding path program 1 times [2022-12-06 07:36:38,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:38,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131110460] [2022-12-06 07:36:38,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:38,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:39,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-06 07:36:39,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:39,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131110460] [2022-12-06 07:36:39,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131110460] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:39,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:39,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:39,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430968881] [2022-12-06 07:36:39,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:39,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:39,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:39,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:39,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:39,031 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:39,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:39,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:39,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:39,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:39,073 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:39,073 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:39,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:39,074 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:39,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:39,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:39,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:39,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:39,074 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:39,074 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:39,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:39,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:39,075 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:39,075 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:39,075 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:39,075 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:39,075 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:39,075 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:39,075 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:39,075 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:39,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:39,077 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:39,078 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:39,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:39,078 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:39,078 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:39,153 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:39,155 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:39,155 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:39,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:39,155 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:39,155 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:39,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3530 [2022-12-06 07:36:39,155 INFO L420 AbstractCegarLoop]: === Iteration 3532 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:39,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:39,155 INFO L85 PathProgramCache]: Analyzing trace with hash -609379974, now seen corresponding path program 1 times [2022-12-06 07:36:39,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:39,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137498482] [2022-12-06 07:36:39,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:39,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:39,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-06 07:36:39,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:39,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137498482] [2022-12-06 07:36:39,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137498482] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:39,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:39,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:39,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239998819] [2022-12-06 07:36:39,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:39,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:39,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:39,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:39,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:39,223 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:39,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:39,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:39,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:39,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:39,259 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:39,259 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:39,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:39,260 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:39,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:39,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:39,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:39,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:39,260 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:39,260 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:39,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:39,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:39,261 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:39,261 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:39,261 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:39,261 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:39,261 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:39,262 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:39,262 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:39,262 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:39,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:39,264 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:39,264 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:39,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:39,264 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:39,264 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:39,339 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:39,340 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:39,340 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:39,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:39,340 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:39,340 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:39,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3531 [2022-12-06 07:36:39,340 INFO L420 AbstractCegarLoop]: === Iteration 3533 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:39,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:39,341 INFO L85 PathProgramCache]: Analyzing trace with hash -582597865, now seen corresponding path program 1 times [2022-12-06 07:36:39,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:39,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507673574] [2022-12-06 07:36:39,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:39,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:39,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-06 07:36:39,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:39,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507673574] [2022-12-06 07:36:39,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507673574] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:39,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:39,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:39,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515134654] [2022-12-06 07:36:39,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:39,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:39,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:39,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:39,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:39,411 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:39,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:39,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:39,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:39,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:39,452 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:39,452 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:39,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:39,453 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:39,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:39,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:39,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:39,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:39,453 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:39,453 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:39,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:39,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:39,454 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:39,454 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:39,454 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:39,454 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:39,454 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:39,454 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:39,454 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:39,454 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:39,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:39,457 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:39,457 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:39,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:39,457 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:39,457 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:39,533 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:39,534 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:39,534 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:39,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:39,534 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:39,534 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:39,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3532 [2022-12-06 07:36:39,534 INFO L420 AbstractCegarLoop]: === Iteration 3534 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:39,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:39,534 INFO L85 PathProgramCache]: Analyzing trace with hash -552121672, now seen corresponding path program 1 times [2022-12-06 07:36:39,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:39,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090477045] [2022-12-06 07:36:39,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:39,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:39,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-06 07:36:39,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:39,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090477045] [2022-12-06 07:36:39,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090477045] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:39,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:39,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:39,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522904657] [2022-12-06 07:36:39,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:39,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:39,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:39,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:39,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:39,603 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:39,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:39,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:39,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:39,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:39,645 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:39,645 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:39,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:39,646 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:39,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:39,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:39,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:39,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:39,646 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:39,646 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:39,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:39,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:39,647 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:39,647 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:39,647 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:39,647 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:39,647 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:39,647 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:39,647 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:39,647 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:39,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:39,650 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:39,650 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:39,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:39,650 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:39,650 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:39,726 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:39,727 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:39,727 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:39,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:39,727 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:39,727 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:39,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3533 [2022-12-06 07:36:39,728 INFO L420 AbstractCegarLoop]: === Iteration 3535 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:39,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:39,728 INFO L85 PathProgramCache]: Analyzing trace with hash -525339563, now seen corresponding path program 1 times [2022-12-06 07:36:39,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:39,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597023237] [2022-12-06 07:36:39,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:39,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:39,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-06 07:36:39,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:39,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597023237] [2022-12-06 07:36:39,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597023237] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:39,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:39,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:39,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954014083] [2022-12-06 07:36:39,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:39,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:39,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:39,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:39,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:39,818 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:39,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:39,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:39,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:39,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:39,853 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:39,854 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:39,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:39,854 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:39,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:39,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:39,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:39,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:39,855 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:39,855 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:39,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:39,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:39,855 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:39,855 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:39,856 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:39,856 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:39,856 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:39,856 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:39,856 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:39,856 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:39,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:39,858 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:39,858 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:39,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:39,858 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:39,858 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:39,933 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:39,934 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:39,934 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:39,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:39,934 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:39,934 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:39,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3534 [2022-12-06 07:36:39,935 INFO L420 AbstractCegarLoop]: === Iteration 3536 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:39,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:39,935 INFO L85 PathProgramCache]: Analyzing trace with hash -494863370, now seen corresponding path program 1 times [2022-12-06 07:36:39,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:39,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215065092] [2022-12-06 07:36:39,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:39,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:40,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:40,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:40,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215065092] [2022-12-06 07:36:40,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215065092] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:40,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:40,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:40,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641074592] [2022-12-06 07:36:40,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:40,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:40,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:40,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:40,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:40,003 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:40,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:40,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:40,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:40,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:40,039 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:40,039 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:40,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:40,040 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:40,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:40,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:40,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:40,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:40,040 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:40,040 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:40,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:40,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:40,041 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:40,041 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:40,041 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:40,042 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:40,042 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:40,042 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:40,042 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:40,042 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:40,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:40,045 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:40,045 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:40,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:40,045 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:40,045 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:40,127 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:40,128 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-06 07:36:40,128 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:40,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:40,128 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:40,128 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:40,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3535 [2022-12-06 07:36:40,129 INFO L420 AbstractCegarLoop]: === Iteration 3537 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:40,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:40,129 INFO L85 PathProgramCache]: Analyzing trace with hash -468081261, now seen corresponding path program 1 times [2022-12-06 07:36:40,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:40,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255798515] [2022-12-06 07:36:40,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:40,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:40,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:40,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-06 07:36:40,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:40,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255798515] [2022-12-06 07:36:40,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255798515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:40,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:40,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:40,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204710170] [2022-12-06 07:36:40,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:40,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:40,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:40,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:40,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:40,203 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:40,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:40,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:40,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:40,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:40,246 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:40,246 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:40,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:40,247 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:40,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:40,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:40,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:40,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:40,248 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:40,248 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:40,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:40,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:40,249 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:40,249 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:40,249 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:40,249 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:40,249 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:40,249 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:40,249 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:40,249 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:40,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:40,252 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:40,252 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:40,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:40,253 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:40,253 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:40,336 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:40,337 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 07:36:40,337 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:40,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:40,337 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:40,337 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:40,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3536 [2022-12-06 07:36:40,337 INFO L420 AbstractCegarLoop]: === Iteration 3538 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:40,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:40,338 INFO L85 PathProgramCache]: Analyzing trace with hash -437605068, now seen corresponding path program 1 times [2022-12-06 07:36:40,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:40,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474646803] [2022-12-06 07:36:40,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:40,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:40,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:40,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-06 07:36:40,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:40,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474646803] [2022-12-06 07:36:40,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474646803] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:40,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:40,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:40,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905900192] [2022-12-06 07:36:40,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:40,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:40,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:40,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:40,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:40,405 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:40,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:40,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:40,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:40,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:40,448 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:40,448 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:40,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:40,448 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:40,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:40,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:40,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:40,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:40,449 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:40,449 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:40,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:40,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:40,449 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:40,450 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:40,450 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:40,450 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:40,450 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:40,450 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:40,450 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:40,450 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:40,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:40,452 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:40,452 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:40,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:40,453 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:40,453 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:40,528 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:40,529 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:40,529 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:40,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:40,529 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:40,529 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:40,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3537 [2022-12-06 07:36:40,530 INFO L420 AbstractCegarLoop]: === Iteration 3539 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:40,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:40,530 INFO L85 PathProgramCache]: Analyzing trace with hash -410822959, now seen corresponding path program 1 times [2022-12-06 07:36:40,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:40,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204731736] [2022-12-06 07:36:40,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:40,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:40,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-06 07:36:40,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:40,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204731736] [2022-12-06 07:36:40,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204731736] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:40,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:40,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:40,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10428560] [2022-12-06 07:36:40,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:40,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:40,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:40,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:40,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:40,602 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:40,602 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:40,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:40,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:40,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:40,638 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:40,638 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:40,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:40,638 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:40,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:40,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:40,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:40,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:40,639 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:40,639 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:40,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:40,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:40,640 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:40,640 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:40,640 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:40,640 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:40,640 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:40,640 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:40,640 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:40,640 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:40,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:40,642 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:40,642 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:40,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:40,643 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:40,643 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:40,718 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:40,719 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:40,719 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:40,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:40,719 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:40,719 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:40,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3538 [2022-12-06 07:36:40,719 INFO L420 AbstractCegarLoop]: === Iteration 3540 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:40,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:40,720 INFO L85 PathProgramCache]: Analyzing trace with hash -380346766, now seen corresponding path program 1 times [2022-12-06 07:36:40,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:40,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663424669] [2022-12-06 07:36:40,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:40,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:40,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-06 07:36:40,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:40,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663424669] [2022-12-06 07:36:40,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663424669] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:40,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:40,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:40,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426607054] [2022-12-06 07:36:40,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:40,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:40,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:40,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:40,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:40,788 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:40,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:40,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:40,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:40,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:40,824 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:40,824 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:40,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:40,825 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:40,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:40,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:40,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:40,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:40,825 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:40,825 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:40,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:40,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:40,826 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:40,826 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:40,826 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:40,826 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:40,826 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:40,827 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:40,827 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:40,827 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:40,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:40,829 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:40,829 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:40,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 116 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:40,829 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:40,829 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:40,906 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:40,908 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:36:40,908 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:40,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:40,908 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:40,908 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:40,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3539 [2022-12-06 07:36:40,908 INFO L420 AbstractCegarLoop]: === Iteration 3541 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:40,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:40,908 INFO L85 PathProgramCache]: Analyzing trace with hash -353564657, now seen corresponding path program 1 times [2022-12-06 07:36:40,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:40,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291989757] [2022-12-06 07:36:40,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:40,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:40,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-06 07:36:40,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:40,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291989757] [2022-12-06 07:36:40,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291989757] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:40,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:40,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:40,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118347538] [2022-12-06 07:36:40,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:40,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:40,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:40,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:40,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:40,981 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:40,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:40,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:40,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:40,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:41,030 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:41,030 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:41,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:41,030 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:41,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:41,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:41,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:41,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:41,031 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:41,031 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:41,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:41,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:41,032 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:41,032 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:41,032 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:41,032 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:41,032 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:41,032 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:41,032 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:41,032 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:41,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:41,034 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:41,034 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:41,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:41,035 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:41,035 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:41,110 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:41,112 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:41,112 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:41,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:41,112 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:41,112 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:41,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3540 [2022-12-06 07:36:41,112 INFO L420 AbstractCegarLoop]: === Iteration 3542 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:41,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:41,112 INFO L85 PathProgramCache]: Analyzing trace with hash -323088464, now seen corresponding path program 1 times [2022-12-06 07:36:41,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:41,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074449074] [2022-12-06 07:36:41,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:41,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:41,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-06 07:36:41,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:41,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074449074] [2022-12-06 07:36:41,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074449074] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:41,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:41,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:41,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084862776] [2022-12-06 07:36:41,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:41,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:41,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:41,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:41,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:41,180 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:41,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:41,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:41,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:41,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:41,222 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:41,222 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:41,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:41,223 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:41,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:41,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:41,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:41,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:41,223 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:41,223 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:41,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:41,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:41,224 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:41,224 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:41,224 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:41,224 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:41,224 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:41,224 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:41,224 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:41,225 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:41,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:41,227 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:41,227 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:41,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:41,227 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:41,227 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:41,302 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:41,303 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:41,303 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:41,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:41,303 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:41,303 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:41,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3541 [2022-12-06 07:36:41,304 INFO L420 AbstractCegarLoop]: === Iteration 3543 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:41,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:41,304 INFO L85 PathProgramCache]: Analyzing trace with hash -296306355, now seen corresponding path program 1 times [2022-12-06 07:36:41,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:41,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489646381] [2022-12-06 07:36:41,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:41,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:41,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-06 07:36:41,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:41,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489646381] [2022-12-06 07:36:41,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489646381] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:41,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:41,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:41,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462998914] [2022-12-06 07:36:41,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:41,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:41,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:41,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:41,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:41,374 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:41,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:41,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:41,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:41,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:41,416 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:41,417 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:41,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:41,417 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:41,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:41,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:41,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:41,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:41,418 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:41,418 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:41,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:41,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:41,418 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:41,418 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:41,418 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:41,419 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:41,419 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:41,419 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:41,419 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:41,419 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:41,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:41,421 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:41,421 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:41,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:41,421 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:41,421 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:41,497 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:41,499 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:41,499 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:41,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:41,499 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:41,499 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:41,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3542 [2022-12-06 07:36:41,499 INFO L420 AbstractCegarLoop]: === Iteration 3544 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:41,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:41,499 INFO L85 PathProgramCache]: Analyzing trace with hash -265830162, now seen corresponding path program 1 times [2022-12-06 07:36:41,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:41,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055381147] [2022-12-06 07:36:41,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:41,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:41,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-06 07:36:41,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:41,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055381147] [2022-12-06 07:36:41,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055381147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:41,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:41,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:41,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830670290] [2022-12-06 07:36:41,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:41,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:41,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:41,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:41,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:41,566 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:41,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:41,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:41,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:41,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:41,608 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:41,608 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:41,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 337 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:41,608 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:41,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:41,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:41,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:41,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:41,609 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:41,609 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:41,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:41,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:41,610 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:41,610 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:41,610 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:41,610 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:41,610 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:41,610 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:41,610 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:41,610 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:41,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:41,612 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:41,612 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:41,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:41,613 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:41,613 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:41,686 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:41,688 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:41,688 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:41,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:41,688 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:41,688 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:41,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3543 [2022-12-06 07:36:41,688 INFO L420 AbstractCegarLoop]: === Iteration 3545 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:41,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:41,688 INFO L85 PathProgramCache]: Analyzing trace with hash -239048053, now seen corresponding path program 1 times [2022-12-06 07:36:41,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:41,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412774902] [2022-12-06 07:36:41,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:41,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:41,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-06 07:36:41,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:41,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412774902] [2022-12-06 07:36:41,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412774902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:41,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:41,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:41,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308370888] [2022-12-06 07:36:41,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:41,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:41,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:41,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:41,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:41,759 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:41,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:41,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:41,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:41,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:41,799 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:41,800 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:41,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:41,800 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:41,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:41,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:41,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:41,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:41,801 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:41,801 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:41,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:41,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:41,801 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:41,801 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:41,802 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:41,802 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:41,802 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:41,802 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:41,802 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:41,802 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:41,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:41,804 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:41,804 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:41,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:41,804 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:41,804 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:41,880 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:41,882 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:41,882 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:41,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:41,882 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:41,882 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:41,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3544 [2022-12-06 07:36:41,882 INFO L420 AbstractCegarLoop]: === Iteration 3546 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:41,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:41,882 INFO L85 PathProgramCache]: Analyzing trace with hash -208571860, now seen corresponding path program 1 times [2022-12-06 07:36:41,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:41,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547461598] [2022-12-06 07:36:41,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:41,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:41,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:41,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-06 07:36:41,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:41,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547461598] [2022-12-06 07:36:41,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547461598] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:41,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:41,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:41,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759499496] [2022-12-06 07:36:41,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:41,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:41,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:41,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:41,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:41,950 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:41,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:41,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:41,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:41,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:41,986 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:41,987 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:41,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:41,987 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:41,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:41,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:41,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:41,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:41,988 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:41,988 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:41,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:41,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:41,988 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:41,988 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:41,988 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:41,988 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:41,989 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:41,989 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:41,989 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:41,989 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:41,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:41,991 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:41,991 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:41,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:41,991 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:41,991 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:42,066 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:42,068 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:42,068 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:42,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:42,068 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:42,068 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:42,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3545 [2022-12-06 07:36:42,068 INFO L420 AbstractCegarLoop]: === Iteration 3547 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:42,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:42,068 INFO L85 PathProgramCache]: Analyzing trace with hash -181789751, now seen corresponding path program 1 times [2022-12-06 07:36:42,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:42,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277668669] [2022-12-06 07:36:42,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:42,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:42,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-06 07:36:42,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:42,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277668669] [2022-12-06 07:36:42,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277668669] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:42,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:42,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:42,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221723605] [2022-12-06 07:36:42,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:42,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:42,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:42,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:42,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:42,143 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:42,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:42,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:42,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:42,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:42,177 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:42,177 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:42,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:42,177 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:42,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:42,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:42,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:42,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:42,178 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:42,178 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:42,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:42,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:42,179 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:42,179 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:42,179 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:42,179 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:42,179 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:42,179 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:42,179 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:42,179 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:42,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:42,181 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:42,181 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:42,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:42,182 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:42,182 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:42,257 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:42,259 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:42,259 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:42,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:42,259 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:42,259 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:42,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3546 [2022-12-06 07:36:42,259 INFO L420 AbstractCegarLoop]: === Iteration 3548 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:42,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:42,260 INFO L85 PathProgramCache]: Analyzing trace with hash -151313558, now seen corresponding path program 1 times [2022-12-06 07:36:42,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:42,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148230489] [2022-12-06 07:36:42,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:42,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:42,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-06 07:36:42,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:42,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148230489] [2022-12-06 07:36:42,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148230489] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:42,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:42,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:42,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573008655] [2022-12-06 07:36:42,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:42,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:42,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:42,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:42,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:42,336 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:42,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:42,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:42,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:42,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:42,372 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:42,372 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:42,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:42,372 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:42,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:42,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:42,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:42,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:42,373 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:42,373 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:42,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:42,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:42,374 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:42,374 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:42,374 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:42,374 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:42,374 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:42,374 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:42,374 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:42,374 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:42,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:42,376 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:42,376 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:42,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:42,377 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:42,377 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:42,453 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:42,454 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:42,454 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:42,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:42,454 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:42,454 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:42,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3547 [2022-12-06 07:36:42,454 INFO L420 AbstractCegarLoop]: === Iteration 3549 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:42,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:42,455 INFO L85 PathProgramCache]: Analyzing trace with hash -124531449, now seen corresponding path program 1 times [2022-12-06 07:36:42,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:42,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765213950] [2022-12-06 07:36:42,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:42,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:42,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:42,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-06 07:36:42,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:42,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765213950] [2022-12-06 07:36:42,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765213950] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:42,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:42,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:42,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886115220] [2022-12-06 07:36:42,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:42,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:42,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:42,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:42,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:42,528 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:42,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:42,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:42,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:42,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:42,564 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:42,564 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:42,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:42,565 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:42,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:42,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:42,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:42,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:42,565 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:42,565 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:42,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:42,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:42,566 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:42,566 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:42,566 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:42,566 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:42,566 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:42,567 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:42,567 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:42,567 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:42,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:42,569 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:42,569 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:42,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:42,569 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:42,569 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:42,645 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:42,647 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:36:42,647 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:42,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:42,647 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:42,647 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:42,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3548 [2022-12-06 07:36:42,647 INFO L420 AbstractCegarLoop]: === Iteration 3550 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:42,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:42,647 INFO L85 PathProgramCache]: Analyzing trace with hash -94055256, now seen corresponding path program 1 times [2022-12-06 07:36:42,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:42,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991682753] [2022-12-06 07:36:42,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:42,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:42,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:42,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-06 07:36:42,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:42,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991682753] [2022-12-06 07:36:42,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991682753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:42,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:42,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:42,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684681712] [2022-12-06 07:36:42,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:42,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:42,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:42,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:42,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:42,718 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:42,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:42,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:42,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:42,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:42,759 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:42,759 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:42,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:42,759 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:42,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:42,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:42,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:42,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:42,760 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:42,760 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:42,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:42,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:42,760 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:42,760 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:42,761 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:42,761 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:42,761 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:42,761 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:42,761 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:42,761 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:42,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:42,763 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:42,763 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:42,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:42,763 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:42,763 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:42,837 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:42,838 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:36:42,838 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:42,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:42,838 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:42,838 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:42,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3549 [2022-12-06 07:36:42,838 INFO L420 AbstractCegarLoop]: === Iteration 3551 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:42,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:42,838 INFO L85 PathProgramCache]: Analyzing trace with hash -67273147, now seen corresponding path program 1 times [2022-12-06 07:36:42,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:42,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504212333] [2022-12-06 07:36:42,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:42,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:42,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-06 07:36:42,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:42,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504212333] [2022-12-06 07:36:42,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504212333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:42,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:42,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:42,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253532292] [2022-12-06 07:36:42,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:42,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:42,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:42,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:42,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:42,908 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:42,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:42,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:42,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:42,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:42,949 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:42,949 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:42,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:42,950 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:42,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:42,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:42,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:42,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:42,950 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:42,950 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:42,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:42,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:42,951 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:42,951 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:42,951 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:42,951 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:42,951 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:42,952 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:42,952 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:42,952 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:42,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:42,954 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:42,954 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:42,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:42,954 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:42,954 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:43,036 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:43,037 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-06 07:36:43,037 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:43,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:43,037 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:43,037 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:43,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3550 [2022-12-06 07:36:43,037 INFO L420 AbstractCegarLoop]: === Iteration 3552 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:43,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:43,037 INFO L85 PathProgramCache]: Analyzing trace with hash -36796954, now seen corresponding path program 1 times [2022-12-06 07:36:43,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:43,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898467644] [2022-12-06 07:36:43,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:43,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:43,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-06 07:36:43,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:43,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898467644] [2022-12-06 07:36:43,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898467644] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:43,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:43,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:43,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259869079] [2022-12-06 07:36:43,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:43,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:43,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:43,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:43,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:43,120 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:43,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:43,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:43,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:43,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:43,162 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:43,163 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:43,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:43,163 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:43,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:43,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:43,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:43,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:43,164 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:43,164 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:43,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:43,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:43,164 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:43,164 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:43,164 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:43,164 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:43,164 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:43,165 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:43,165 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:43,165 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:43,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:43,167 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:43,167 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:43,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:43,167 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:43,167 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:43,242 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:43,243 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:43,243 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:43,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:43,243 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:43,244 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:43,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3551 [2022-12-06 07:36:43,244 INFO L420 AbstractCegarLoop]: === Iteration 3553 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:43,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:43,244 INFO L85 PathProgramCache]: Analyzing trace with hash -10014845, now seen corresponding path program 1 times [2022-12-06 07:36:43,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:43,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778056584] [2022-12-06 07:36:43,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:43,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:43,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:43,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:43,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778056584] [2022-12-06 07:36:43,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778056584] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:43,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:43,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:43,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024549004] [2022-12-06 07:36:43,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:43,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:43,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:43,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:43,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:43,316 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:43,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:43,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:43,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:43,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:43,356 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:43,356 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:43,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 366 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:43,357 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:43,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:43,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:43,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:43,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:43,357 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:43,357 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:43,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:43,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:43,358 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:43,358 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:43,358 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:43,358 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:43,358 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:43,358 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:43,358 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:43,358 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:43,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:43,360 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:43,361 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:43,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:43,361 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:43,361 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:43,435 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:43,437 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:43,437 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:43,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:43,437 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:43,437 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:43,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3552 [2022-12-06 07:36:43,437 INFO L420 AbstractCegarLoop]: === Iteration 3554 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:43,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:43,437 INFO L85 PathProgramCache]: Analyzing trace with hash 20461348, now seen corresponding path program 1 times [2022-12-06 07:36:43,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:43,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15083766] [2022-12-06 07:36:43,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:43,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:43,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-06 07:36:43,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:43,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15083766] [2022-12-06 07:36:43,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15083766] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:43,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:43,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:43,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976890010] [2022-12-06 07:36:43,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:43,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:43,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:43,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:43,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:43,519 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:43,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:43,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:43,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:43,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:43,559 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:43,560 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:43,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:43,560 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:43,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:43,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:43,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:43,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:43,560 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:43,561 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:43,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:43,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:43,561 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:43,561 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:43,561 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:43,561 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:43,561 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:43,562 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:43,562 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:43,562 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:43,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:43,564 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:43,564 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:43,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:43,564 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:43,564 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:43,640 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:43,642 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:36:43,642 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:43,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:43,642 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:43,642 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:43,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3553 [2022-12-06 07:36:43,642 INFO L420 AbstractCegarLoop]: === Iteration 3555 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:43,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:43,642 INFO L85 PathProgramCache]: Analyzing trace with hash 47243457, now seen corresponding path program 1 times [2022-12-06 07:36:43,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:43,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267495632] [2022-12-06 07:36:43,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:43,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:43,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-06 07:36:43,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:43,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267495632] [2022-12-06 07:36:43,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267495632] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:43,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:43,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:43,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812787768] [2022-12-06 07:36:43,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:43,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:43,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:43,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:43,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:43,713 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:43,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:43,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:43,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:43,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:43,756 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:43,757 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:43,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:43,757 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:43,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:43,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:43,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:43,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:43,758 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:43,758 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:43,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:43,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:43,758 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:43,758 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:43,759 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:43,759 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:43,759 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:43,759 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:43,759 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:43,759 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:43,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:43,761 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:43,761 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:43,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:43,761 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:43,761 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:43,841 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:43,843 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:36:43,843 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:43,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:43,843 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:43,843 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:43,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3554 [2022-12-06 07:36:43,843 INFO L420 AbstractCegarLoop]: === Iteration 3556 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:43,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:43,843 INFO L85 PathProgramCache]: Analyzing trace with hash 77719650, now seen corresponding path program 1 times [2022-12-06 07:36:43,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:43,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856438426] [2022-12-06 07:36:43,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:43,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:43,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:43,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-06 07:36:43,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:43,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856438426] [2022-12-06 07:36:43,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856438426] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:43,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:43,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:43,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329508552] [2022-12-06 07:36:43,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:43,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:43,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:43,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:43,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:43,911 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:43,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:43,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:43,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:43,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:43,955 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:43,955 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:43,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:43,956 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:43,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:43,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:43,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:43,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:43,956 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:43,956 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:43,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:43,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:43,957 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:43,957 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:43,957 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:43,957 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:43,957 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:43,957 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:43,957 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:43,957 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:43,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:43,960 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:43,960 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:43,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:43,960 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:43,960 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:44,033 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:44,034 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:36:44,034 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:44,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:44,034 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:44,034 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:44,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3555 [2022-12-06 07:36:44,034 INFO L420 AbstractCegarLoop]: === Iteration 3557 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:44,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:44,034 INFO L85 PathProgramCache]: Analyzing trace with hash 104501759, now seen corresponding path program 1 times [2022-12-06 07:36:44,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:44,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878881039] [2022-12-06 07:36:44,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:44,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36: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-06 07:36:44,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:44,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878881039] [2022-12-06 07:36:44,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878881039] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:44,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:44,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:44,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24282968] [2022-12-06 07:36:44,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:44,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:44,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:44,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:44,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:44,104 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:44,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:44,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:44,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:44,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:44,139 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:44,139 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:44,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:44,140 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:44,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:44,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:44,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:44,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:44,140 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:44,140 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:44,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:44,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:44,141 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:44,141 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:44,141 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:44,141 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:44,141 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:44,141 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:44,141 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:44,141 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:44,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:44,144 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:44,144 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:44,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:44,144 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:44,144 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:44,219 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:44,221 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:44,221 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:44,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:44,221 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:44,221 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:44,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3556 [2022-12-06 07:36:44,221 INFO L420 AbstractCegarLoop]: === Iteration 3558 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:44,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:44,221 INFO L85 PathProgramCache]: Analyzing trace with hash 134977952, now seen corresponding path program 1 times [2022-12-06 07:36:44,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:44,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748862468] [2022-12-06 07:36:44,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:44,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:44,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-06 07:36:44,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:44,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748862468] [2022-12-06 07:36:44,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748862468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:44,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:44,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:44,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697059210] [2022-12-06 07:36:44,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:44,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:44,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:44,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:44,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:44,288 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:44,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:44,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:44,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:44,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:44,329 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:44,329 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:44,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:44,330 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:44,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:44,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:44,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:44,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:44,330 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:44,330 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:44,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:44,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:44,331 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:44,331 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:44,331 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:44,331 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:44,331 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:44,331 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:44,331 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:44,331 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:44,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:44,333 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:44,334 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:44,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:44,334 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:44,334 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:44,408 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:44,409 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:44,409 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:44,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:44,409 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:44,409 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:44,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3557 [2022-12-06 07:36:44,410 INFO L420 AbstractCegarLoop]: === Iteration 3559 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:44,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:44,410 INFO L85 PathProgramCache]: Analyzing trace with hash 161760061, now seen corresponding path program 1 times [2022-12-06 07:36:44,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:44,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955457965] [2022-12-06 07:36:44,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:44,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:44,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-06 07:36:44,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:44,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955457965] [2022-12-06 07:36:44,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955457965] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:44,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:44,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:44,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794736106] [2022-12-06 07:36:44,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:44,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:44,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:44,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:44,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:44,482 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:44,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:44,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:44,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:44,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:44,517 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:44,517 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:44,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:44,518 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:44,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:44,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:44,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:44,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:44,518 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:44,518 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:44,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:44,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:44,519 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:44,519 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:44,519 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:44,519 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:44,519 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:44,519 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:44,519 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:44,520 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:44,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:44,522 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:44,522 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:44,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:44,522 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:44,522 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:44,598 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:44,599 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:44,599 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:44,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:44,599 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:44,599 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:44,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3558 [2022-12-06 07:36:44,599 INFO L420 AbstractCegarLoop]: === Iteration 3560 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:44,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:44,600 INFO L85 PathProgramCache]: Analyzing trace with hash 192236254, now seen corresponding path program 1 times [2022-12-06 07:36:44,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:44,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066653312] [2022-12-06 07:36:44,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:44,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:44,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:44,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-06 07:36:44,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:44,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066653312] [2022-12-06 07:36:44,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066653312] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:44,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:44,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:44,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388468014] [2022-12-06 07:36:44,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:44,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:44,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:44,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:44,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:44,690 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:44,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:44,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:44,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:44,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:44,726 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:44,726 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:44,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:44,726 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:44,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:44,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:44,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:44,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:44,727 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:44,727 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:44,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:44,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:44,728 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:44,728 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:44,728 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:44,728 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:44,728 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:44,728 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:44,728 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:44,728 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:44,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:44,730 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:44,730 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:44,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:44,731 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:44,731 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:44,806 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:44,808 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:44,808 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:44,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:44,808 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:44,808 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:44,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3559 [2022-12-06 07:36:44,808 INFO L420 AbstractCegarLoop]: === Iteration 3561 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:44,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:44,808 INFO L85 PathProgramCache]: Analyzing trace with hash 219018363, now seen corresponding path program 1 times [2022-12-06 07:36:44,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:44,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738922460] [2022-12-06 07:36:44,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:44,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:44,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-06 07:36:44,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:44,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738922460] [2022-12-06 07:36:44,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738922460] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:44,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:44,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:44,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501290715] [2022-12-06 07:36:44,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:44,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:44,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:44,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:44,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:44,879 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:44,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:44,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:44,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:44,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:44,920 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:44,921 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:44,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:44,921 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:44,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:44,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:44,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:44,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:44,922 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:44,922 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:44,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:44,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:44,922 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:44,922 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:44,922 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:44,923 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:44,923 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:44,923 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:44,923 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:44,923 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:44,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:44,925 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:44,925 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:44,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:44,925 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:44,925 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:45,000 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:45,001 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:45,001 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:45,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:45,001 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:45,001 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:45,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3560 [2022-12-06 07:36:45,002 INFO L420 AbstractCegarLoop]: === Iteration 3562 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:45,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:45,002 INFO L85 PathProgramCache]: Analyzing trace with hash 249494556, now seen corresponding path program 1 times [2022-12-06 07:36:45,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:45,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680683734] [2022-12-06 07:36:45,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:45,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:45,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:45,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-06 07:36:45,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:45,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680683734] [2022-12-06 07:36:45,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680683734] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:45,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:45,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:45,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086413454] [2022-12-06 07:36:45,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:45,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:45,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:45,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:45,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:45,074 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:45,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:45,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:45,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:45,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:45,116 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:45,116 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:45,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:45,117 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:45,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:45,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:45,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:45,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:45,117 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:45,117 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:45,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:45,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:45,118 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:45,118 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:45,118 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:45,118 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:45,118 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:45,118 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:45,118 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:45,119 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:45,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:45,121 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:45,121 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:45,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:45,121 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:45,121 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:45,196 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:45,197 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:45,197 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:45,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:45,197 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:45,197 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:45,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3561 [2022-12-06 07:36:45,197 INFO L420 AbstractCegarLoop]: === Iteration 3563 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:45,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:45,198 INFO L85 PathProgramCache]: Analyzing trace with hash 276276665, now seen corresponding path program 1 times [2022-12-06 07:36:45,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:45,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565927932] [2022-12-06 07:36:45,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:45,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:45,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-06 07:36:45,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:45,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565927932] [2022-12-06 07:36:45,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565927932] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:45,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:45,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:45,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260031451] [2022-12-06 07:36:45,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:45,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:45,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:45,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:45,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:45,269 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:45,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:45,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:45,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:45,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:45,310 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:45,310 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:45,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:45,311 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:45,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:45,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:45,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:45,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:45,311 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:45,311 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:45,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:45,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:45,312 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:45,312 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:45,312 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:45,312 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:45,312 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:45,313 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:45,313 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:45,313 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:45,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:45,315 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:45,315 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:45,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:45,315 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:45,315 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:45,390 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:45,392 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:45,392 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:45,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:45,392 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:45,392 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:45,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3562 [2022-12-06 07:36:45,392 INFO L420 AbstractCegarLoop]: === Iteration 3564 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:45,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:45,393 INFO L85 PathProgramCache]: Analyzing trace with hash 306752858, now seen corresponding path program 1 times [2022-12-06 07:36:45,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:45,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455861484] [2022-12-06 07:36:45,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:45,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:45,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-06 07:36:45,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:45,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455861484] [2022-12-06 07:36:45,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455861484] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:45,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:45,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:45,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98253932] [2022-12-06 07:36:45,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:45,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:45,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:45,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:45,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:45,462 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:45,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:45,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:45,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:45,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:45,499 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:45,499 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:45,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:45,500 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:45,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:45,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:45,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:45,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:45,500 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:45,500 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:45,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:45,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:45,501 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:45,501 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:45,501 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:45,501 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:45,501 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:45,501 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:45,502 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:45,502 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:45,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:45,504 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:45,504 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:45,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:45,504 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:45,504 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:45,581 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:45,582 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:36:45,582 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:45,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:45,582 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:45,583 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:45,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3563 [2022-12-06 07:36:45,583 INFO L420 AbstractCegarLoop]: === Iteration 3565 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:45,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:45,583 INFO L85 PathProgramCache]: Analyzing trace with hash 333534967, now seen corresponding path program 1 times [2022-12-06 07:36:45,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:45,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897726434] [2022-12-06 07:36:45,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:45,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:45,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-06 07:36:45,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:45,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897726434] [2022-12-06 07:36:45,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897726434] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:45,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:45,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:45,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737868949] [2022-12-06 07:36:45,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:45,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:45,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:45,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:45,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:45,659 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:45,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:45,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:45,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:45,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:45,700 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:45,700 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:45,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:45,700 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:45,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:45,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:45,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:45,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:45,701 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:45,701 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:45,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:45,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:45,702 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:45,702 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:45,702 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:45,702 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:45,702 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:45,702 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:45,702 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:45,702 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:45,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:45,704 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:45,705 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:45,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:45,705 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:45,705 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:45,780 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:45,781 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:45,782 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:45,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:45,782 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:45,782 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:45,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3564 [2022-12-06 07:36:45,782 INFO L420 AbstractCegarLoop]: === Iteration 3566 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:45,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:45,782 INFO L85 PathProgramCache]: Analyzing trace with hash 364011160, now seen corresponding path program 1 times [2022-12-06 07:36:45,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:45,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456660728] [2022-12-06 07:36:45,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:45,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:45,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:45,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-06 07:36:45,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:45,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456660728] [2022-12-06 07:36:45,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456660728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:45,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:45,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:45,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114964180] [2022-12-06 07:36:45,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:45,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:45,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:45,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:45,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:45,867 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:45,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:45,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:45,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:45,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:45,909 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:45,909 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:45,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:45,910 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:45,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:45,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:45,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:45,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:45,910 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:45,910 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:45,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:45,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:45,911 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:45,911 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:45,911 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:45,911 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:45,911 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:45,911 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:45,911 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:45,911 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:45,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:45,914 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:45,914 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:45,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:45,914 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:45,914 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:45,989 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:45,990 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:45,990 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:45,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:45,990 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:45,990 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:45,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3565 [2022-12-06 07:36:45,991 INFO L420 AbstractCegarLoop]: === Iteration 3567 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:45,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:45,991 INFO L85 PathProgramCache]: Analyzing trace with hash 390793269, now seen corresponding path program 1 times [2022-12-06 07:36:45,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:45,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415340087] [2022-12-06 07:36:45,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:45,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:46,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-06 07:36:46,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:46,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415340087] [2022-12-06 07:36:46,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415340087] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:46,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:46,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:46,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931936368] [2022-12-06 07:36:46,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:46,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:46,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:46,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:46,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:46,064 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:46,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:46,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:46,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:46,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:46,100 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:46,100 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:46,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:46,101 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:46,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:46,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:46,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:46,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:46,101 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:46,101 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:46,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:46,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:46,102 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:46,102 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:46,102 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:46,102 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:46,102 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:46,103 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:46,103 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:46,103 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:46,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:46,105 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:46,105 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:46,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:46,105 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:46,105 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:46,181 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:46,182 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:46,182 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:46,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:46,182 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:46,182 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:46,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3566 [2022-12-06 07:36:46,182 INFO L420 AbstractCegarLoop]: === Iteration 3568 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:46,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:46,183 INFO L85 PathProgramCache]: Analyzing trace with hash 421269462, now seen corresponding path program 1 times [2022-12-06 07:36:46,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:46,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482559633] [2022-12-06 07:36:46,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:46,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:46,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-06 07:36:46,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:46,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482559633] [2022-12-06 07:36:46,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482559633] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:46,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:46,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:46,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426954020] [2022-12-06 07:36:46,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:46,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:46,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:46,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:46,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:46,254 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:46,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:46,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:46,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:46,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:46,291 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:46,291 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:46,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:46,291 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:46,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:46,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:46,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:46,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:46,292 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:46,292 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:46,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:46,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:46,292 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:46,293 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:46,293 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:46,293 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:46,293 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:46,293 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:46,293 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:46,293 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:46,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:46,295 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:46,295 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:46,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:46,296 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:46,296 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:46,370 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:46,372 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:46,372 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:46,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:46,372 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:46,372 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:46,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3567 [2022-12-06 07:36:46,372 INFO L420 AbstractCegarLoop]: === Iteration 3569 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:46,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:46,372 INFO L85 PathProgramCache]: Analyzing trace with hash 448051571, now seen corresponding path program 1 times [2022-12-06 07:36:46,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:46,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770486817] [2022-12-06 07:36:46,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:46,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:46,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:46,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-06 07:36:46,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:46,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770486817] [2022-12-06 07:36:46,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770486817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:46,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:46,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:46,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470988436] [2022-12-06 07:36:46,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:46,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:46,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:46,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:46,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:46,443 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:46,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:46,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:46,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:46,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:46,477 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:46,477 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:46,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:46,478 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:46,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:46,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:46,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:46,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:46,478 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:46,478 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:46,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:46,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:46,479 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:46,479 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:46,479 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:46,479 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:46,479 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:46,480 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:46,480 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:46,480 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:46,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:46,482 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:46,482 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:46,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:46,482 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:46,482 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:46,563 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:46,564 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 07:36:46,564 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:46,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:46,565 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:46,565 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:46,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3568 [2022-12-06 07:36:46,565 INFO L420 AbstractCegarLoop]: === Iteration 3570 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:46,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:46,565 INFO L85 PathProgramCache]: Analyzing trace with hash 478527764, now seen corresponding path program 1 times [2022-12-06 07:36:46,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:46,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106858900] [2022-12-06 07:36:46,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:46,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:46,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-06 07:36:46,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:46,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106858900] [2022-12-06 07:36:46,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106858900] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:46,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:46,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:46,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867571958] [2022-12-06 07:36:46,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:46,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:46,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:46,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:46,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:46,635 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:46,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:46,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:46,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:46,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:46,678 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:46,679 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:46,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:46,679 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:46,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:46,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:46,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:46,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:46,680 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:46,680 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:46,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:46,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:46,680 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:46,680 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:46,680 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:46,680 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:46,681 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:46,681 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:46,681 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:46,681 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:46,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:46,683 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:46,683 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:46,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:46,683 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:46,683 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:46,758 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:46,759 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:46,759 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:46,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:46,759 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:46,759 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:46,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3569 [2022-12-06 07:36:46,760 INFO L420 AbstractCegarLoop]: === Iteration 3571 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:46,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:46,760 INFO L85 PathProgramCache]: Analyzing trace with hash 505309873, now seen corresponding path program 1 times [2022-12-06 07:36:46,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:46,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668111060] [2022-12-06 07:36:46,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:46,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:46,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-06 07:36:46,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:46,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668111060] [2022-12-06 07:36:46,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668111060] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:46,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:46,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:46,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924713895] [2022-12-06 07:36:46,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:46,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:46,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:46,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:46,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:46,832 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:46,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:46,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:46,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:46,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:46,872 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:46,872 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:46,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:46,873 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:46,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:46,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:46,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:46,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:46,873 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:46,873 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:46,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:46,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:46,874 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:46,874 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:46,874 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:46,874 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:46,874 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:46,875 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:46,875 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:46,875 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:46,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:46,877 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:46,877 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:46,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:46,877 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:46,877 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:46,953 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:46,955 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:36:46,955 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:46,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:46,955 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:46,955 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:46,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3570 [2022-12-06 07:36:46,955 INFO L420 AbstractCegarLoop]: === Iteration 3572 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:46,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:46,956 INFO L85 PathProgramCache]: Analyzing trace with hash 535786066, now seen corresponding path program 1 times [2022-12-06 07:36:46,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:46,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055375832] [2022-12-06 07:36:46,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:46,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:46,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:47,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-06 07:36:47,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:47,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055375832] [2022-12-06 07:36:47,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055375832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:47,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:47,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:47,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991837093] [2022-12-06 07:36:47,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:47,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:47,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:47,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:47,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:47,031 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:47,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:47,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:47,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:47,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:47,087 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:47,087 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:47,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:47,088 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:47,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:47,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:47,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:47,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:47,088 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:47,088 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:47,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:47,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:47,089 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:47,089 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:47,089 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:47,089 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:47,089 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:47,089 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:47,089 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:47,089 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:47,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:47,092 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:47,092 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:47,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:47,092 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:47,092 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:47,169 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:47,170 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:36:47,170 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:47,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:47,170 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:47,170 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:47,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3571 [2022-12-06 07:36:47,170 INFO L420 AbstractCegarLoop]: === Iteration 3573 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:47,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:47,170 INFO L85 PathProgramCache]: Analyzing trace with hash 562568175, now seen corresponding path program 1 times [2022-12-06 07:36:47,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:47,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850819290] [2022-12-06 07:36:47,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:47,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:47,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-06 07:36:47,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:47,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850819290] [2022-12-06 07:36:47,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850819290] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:47,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:47,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:47,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706684743] [2022-12-06 07:36:47,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:47,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:47,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:47,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:47,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:47,243 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:47,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:47,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:47,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:47,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:47,281 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:47,281 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:47,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:47,282 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:47,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:47,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:47,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:47,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:47,282 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:47,282 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:47,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:47,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:47,283 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:47,283 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:47,283 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:47,283 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:47,283 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:47,284 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:47,284 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:47,284 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:47,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:47,286 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:47,286 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:47,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:47,286 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:47,286 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:47,362 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:47,363 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:47,364 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:47,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:47,364 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:47,364 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:47,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3572 [2022-12-06 07:36:47,364 INFO L420 AbstractCegarLoop]: === Iteration 3574 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:47,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:47,364 INFO L85 PathProgramCache]: Analyzing trace with hash 593044368, now seen corresponding path program 1 times [2022-12-06 07:36:47,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:47,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474580975] [2022-12-06 07:36:47,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:47,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:47,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-06 07:36:47,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:47,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474580975] [2022-12-06 07:36:47,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474580975] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:47,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:47,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:47,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13791387] [2022-12-06 07:36:47,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:47,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:47,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:47,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:47,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:47,436 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:47,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:47,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:47,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:47,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:47,478 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:47,478 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:47,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:47,479 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:47,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:47,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:47,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:47,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:47,479 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:47,479 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:47,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:47,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:47,480 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:47,480 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:47,480 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:47,480 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:47,480 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:47,480 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:47,481 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:47,481 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:47,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:47,483 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:47,483 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:47,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:47,483 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:47,483 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:47,558 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:47,560 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:47,560 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:47,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:47,560 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:47,560 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:47,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3573 [2022-12-06 07:36:47,560 INFO L420 AbstractCegarLoop]: === Iteration 3575 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:47,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:47,560 INFO L85 PathProgramCache]: Analyzing trace with hash 619826477, now seen corresponding path program 1 times [2022-12-06 07:36:47,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:47,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579869747] [2022-12-06 07:36:47,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:47,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:47,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-06 07:36:47,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:47,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579869747] [2022-12-06 07:36:47,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579869747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:47,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:47,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:47,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555217052] [2022-12-06 07:36:47,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:47,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:47,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:47,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:47,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:47,632 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:47,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:47,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:47,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:47,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:47,672 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:47,672 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:47,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:47,672 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:47,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:47,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:47,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:47,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:47,673 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:47,673 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:47,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:47,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:47,674 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:47,674 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:47,674 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:47,674 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:47,674 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:47,674 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:47,674 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:47,674 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:47,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:47,676 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:47,677 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:47,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:47,677 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:47,677 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:47,752 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:47,753 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:47,753 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:47,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:47,753 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:47,753 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:47,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3574 [2022-12-06 07:36:47,753 INFO L420 AbstractCegarLoop]: === Iteration 3576 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:47,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:47,754 INFO L85 PathProgramCache]: Analyzing trace with hash 650302670, now seen corresponding path program 1 times [2022-12-06 07:36:47,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:47,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297333415] [2022-12-06 07:36:47,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:47,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:47,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-06 07:36:47,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:47,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297333415] [2022-12-06 07:36:47,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297333415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:47,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:47,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:47,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685818531] [2022-12-06 07:36:47,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:47,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:47,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:47,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:47,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:47,824 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:47,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:47,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:47,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:47,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:47,866 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:47,866 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:47,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:47,866 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:47,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:47,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:47,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:47,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:47,867 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:47,867 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:47,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:47,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:47,867 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:47,867 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:47,868 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:47,868 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:47,868 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:47,868 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:47,868 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:47,868 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:47,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:47,870 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:47,870 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:47,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:47,870 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:47,870 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:47,944 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:47,946 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:47,946 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:47,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:47,946 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:47,946 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:47,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3575 [2022-12-06 07:36:47,946 INFO L420 AbstractCegarLoop]: === Iteration 3577 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:47,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:47,946 INFO L85 PathProgramCache]: Analyzing trace with hash 677084779, now seen corresponding path program 1 times [2022-12-06 07:36:47,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:47,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381255637] [2022-12-06 07:36:47,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:47,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:48,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-06 07:36:48,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:48,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381255637] [2022-12-06 07:36:48,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381255637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:48,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:48,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:48,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290896854] [2022-12-06 07:36:48,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:48,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:48,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:48,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:48,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:48,018 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:48,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:48,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:48,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:48,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:48,059 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:48,060 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:48,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:48,060 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:48,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:48,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:48,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:48,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:48,061 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:48,061 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:48,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:48,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:48,061 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:48,061 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:48,062 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:48,062 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:48,062 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:48,062 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:48,062 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:48,062 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:48,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:48,064 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:48,064 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:48,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:48,064 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:48,064 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:48,141 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:48,143 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:36:48,143 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:48,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:48,143 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:48,143 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:48,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3576 [2022-12-06 07:36:48,143 INFO L420 AbstractCegarLoop]: === Iteration 3578 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:48,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:48,143 INFO L85 PathProgramCache]: Analyzing trace with hash 707560972, now seen corresponding path program 1 times [2022-12-06 07:36:48,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:48,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032090066] [2022-12-06 07:36:48,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:48,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:48,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-06 07:36:48,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:48,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032090066] [2022-12-06 07:36:48,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032090066] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:48,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:48,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:48,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891392095] [2022-12-06 07:36:48,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:48,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:48,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:48,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:48,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:48,212 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:48,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:48,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:48,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:48,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:48,247 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:48,248 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:48,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:48,248 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:48,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:48,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:48,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:48,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:48,249 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:48,249 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:48,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:48,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:48,249 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:48,249 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:48,249 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:48,249 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:48,250 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:48,250 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:48,250 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:48,250 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:48,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:48,252 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:48,252 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:48,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:48,252 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:48,252 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:48,338 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:48,340 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-06 07:36:48,340 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:48,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:48,340 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:48,340 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:48,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3577 [2022-12-06 07:36:48,340 INFO L420 AbstractCegarLoop]: === Iteration 3579 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:48,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:48,340 INFO L85 PathProgramCache]: Analyzing trace with hash 734343081, now seen corresponding path program 1 times [2022-12-06 07:36:48,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:48,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329606123] [2022-12-06 07:36:48,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:48,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:48,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-06 07:36:48,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:48,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329606123] [2022-12-06 07:36:48,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329606123] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:48,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:48,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:48,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812281109] [2022-12-06 07:36:48,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:48,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:48,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:48,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:48,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:48,413 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:48,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:48,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:48,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:48,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:48,449 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:48,449 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:48,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:48,449 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:48,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:48,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:48,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:48,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:48,450 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:48,450 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:48,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:48,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:48,450 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:48,451 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:48,451 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:48,451 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:48,451 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:48,451 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:48,451 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:48,451 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:48,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:48,453 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:48,453 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:48,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:48,454 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:48,454 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:48,528 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:48,529 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:48,529 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:48,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:48,529 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:48,529 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:48,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3578 [2022-12-06 07:36:48,529 INFO L420 AbstractCegarLoop]: === Iteration 3580 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:48,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:48,530 INFO L85 PathProgramCache]: Analyzing trace with hash 764819274, now seen corresponding path program 1 times [2022-12-06 07:36:48,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:48,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266158209] [2022-12-06 07:36:48,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:48,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:48,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-06 07:36:48,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:48,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266158209] [2022-12-06 07:36:48,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266158209] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:48,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:48,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:48,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741028344] [2022-12-06 07:36:48,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:48,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:48,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:48,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:48,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:48,597 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:48,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:48,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:48,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:48,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:48,634 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:48,634 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:48,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:48,634 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:48,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:48,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:48,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:48,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:48,635 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:48,635 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:48,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:48,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:48,636 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:48,636 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:48,636 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:48,636 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:48,636 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:48,636 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:48,636 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:48,636 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:48,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:48,638 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:48,638 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:48,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:48,639 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:48,639 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:48,717 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:48,718 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:36:48,719 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:48,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:48,719 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:48,719 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:48,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3579 [2022-12-06 07:36:48,719 INFO L420 AbstractCegarLoop]: === Iteration 3581 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:48,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:48,719 INFO L85 PathProgramCache]: Analyzing trace with hash 791601383, now seen corresponding path program 1 times [2022-12-06 07:36:48,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:48,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119046246] [2022-12-06 07:36:48,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:48,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:48,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-06 07:36:48,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:48,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119046246] [2022-12-06 07:36:48,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119046246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:48,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:48,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:48,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001137453] [2022-12-06 07:36:48,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:48,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:48,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:48,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:48,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:48,792 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:48,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:48,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:48,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:48,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:48,831 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:48,831 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:48,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:48,832 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:48,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:48,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:48,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:48,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:48,832 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:48,832 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:48,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:48,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:48,833 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:48,833 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:48,833 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:48,833 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:48,833 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:48,833 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:48,834 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:48,834 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:48,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:48,836 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:48,836 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:48,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:48,836 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:48,836 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:48,909 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:48,911 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:48,911 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:48,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:48,911 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:48,911 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:48,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3580 [2022-12-06 07:36:48,911 INFO L420 AbstractCegarLoop]: === Iteration 3582 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:48,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:48,911 INFO L85 PathProgramCache]: Analyzing trace with hash 822077576, now seen corresponding path program 1 times [2022-12-06 07:36:48,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:48,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658448975] [2022-12-06 07:36:48,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:48,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:48,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-06 07:36:48,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:48,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658448975] [2022-12-06 07:36:48,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658448975] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:48,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:48,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:48,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979896760] [2022-12-06 07:36:48,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:48,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:48,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:48,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:48,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:48,979 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:48,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:48,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:48,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:48,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:49,016 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:49,016 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:49,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 349 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:49,016 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:49,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:49,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:49,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:49,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:49,017 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:49,017 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:49,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:49,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:49,017 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:49,017 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:49,018 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:49,018 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:49,018 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:49,018 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:49,018 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:49,018 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:49,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:49,020 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:49,020 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:49,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 129 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:49,020 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:49,020 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:49,097 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:49,098 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:49,098 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:49,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:49,098 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:49,098 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:49,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3581 [2022-12-06 07:36:49,098 INFO L420 AbstractCegarLoop]: === Iteration 3583 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:49,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:49,099 INFO L85 PathProgramCache]: Analyzing trace with hash 848859685, now seen corresponding path program 1 times [2022-12-06 07:36:49,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:49,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729587192] [2022-12-06 07:36:49,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:49,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:49,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-06 07:36:49,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:49,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729587192] [2022-12-06 07:36:49,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729587192] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:49,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:49,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:49,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889779133] [2022-12-06 07:36:49,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:49,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:49,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:49,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:49,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:49,169 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:49,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:49,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:49,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:49,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:49,210 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:49,210 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:49,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 364 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:49,211 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:49,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:49,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:49,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:49,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:49,211 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:49,211 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:49,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:49,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:49,212 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:49,212 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:49,212 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:49,212 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:49,212 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:49,212 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:49,212 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:49,212 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:49,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:49,215 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:49,215 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:49,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:49,215 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:49,215 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:49,290 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:49,292 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:49,292 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:49,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:49,292 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:49,292 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:49,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3582 [2022-12-06 07:36:49,292 INFO L420 AbstractCegarLoop]: === Iteration 3584 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:49,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:49,292 INFO L85 PathProgramCache]: Analyzing trace with hash 879335878, now seen corresponding path program 1 times [2022-12-06 07:36:49,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:49,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983378856] [2022-12-06 07:36:49,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:49,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:49,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-06 07:36:49,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:49,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983378856] [2022-12-06 07:36:49,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983378856] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:49,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:49,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:49,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470033292] [2022-12-06 07:36:49,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:49,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:49,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:49,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:49,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:49,373 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:49,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:49,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:49,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:49,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:49,414 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:49,414 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:49,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:49,414 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:49,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:49,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:49,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:49,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:49,415 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:49,415 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:49,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:49,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:49,416 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:49,416 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:49,416 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:49,416 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:49,416 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:49,416 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:49,416 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:49,416 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:49,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:49,418 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:49,418 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:49,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:49,419 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:49,419 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:49,492 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:49,493 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:36:49,494 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:49,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:49,494 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:49,494 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:49,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3583 [2022-12-06 07:36:49,494 INFO L420 AbstractCegarLoop]: === Iteration 3585 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:49,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:49,494 INFO L85 PathProgramCache]: Analyzing trace with hash 906117987, now seen corresponding path program 1 times [2022-12-06 07:36:49,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:49,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914558520] [2022-12-06 07:36:49,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:49,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:49,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:49,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-06 07:36:49,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:49,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914558520] [2022-12-06 07:36:49,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914558520] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:49,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:49,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:49,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679427873] [2022-12-06 07:36:49,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:49,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:49,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:49,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:49,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:49,577 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:49,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:49,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:49,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:49,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:49,618 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:49,618 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:49,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:49,619 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:49,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:49,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:49,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:49,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:49,619 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:49,619 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:49,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:49,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:49,620 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:49,620 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:49,620 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:49,620 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:49,620 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:49,620 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:49,620 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:49,620 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:49,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:49,622 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:49,622 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:49,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:49,623 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:49,623 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:49,698 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:49,699 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:49,699 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:49,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:49,699 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:49,699 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:49,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3584 [2022-12-06 07:36:49,699 INFO L420 AbstractCegarLoop]: === Iteration 3586 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:49,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:49,699 INFO L85 PathProgramCache]: Analyzing trace with hash 936594180, now seen corresponding path program 1 times [2022-12-06 07:36:49,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:49,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173401148] [2022-12-06 07:36:49,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:49,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:49,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-06 07:36:49,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:49,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173401148] [2022-12-06 07:36:49,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173401148] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:49,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:49,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:49,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477794257] [2022-12-06 07:36:49,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:49,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:49,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:49,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:49,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:49,767 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:49,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:49,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:49,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:49,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:49,802 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:49,802 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:49,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:49,803 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:49,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:49,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:49,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:49,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:49,803 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:49,803 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:49,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:49,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:49,804 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:49,804 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:49,804 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:49,804 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:49,804 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:49,805 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:49,805 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:49,805 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:49,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:49,807 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:49,807 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:49,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:49,807 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:49,807 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:49,881 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:49,883 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:49,883 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:49,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:49,883 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:49,883 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:49,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3585 [2022-12-06 07:36:49,883 INFO L420 AbstractCegarLoop]: === Iteration 3587 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:49,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:49,883 INFO L85 PathProgramCache]: Analyzing trace with hash 963376289, now seen corresponding path program 1 times [2022-12-06 07:36:49,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:49,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005779305] [2022-12-06 07:36:49,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:49,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:49,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-06 07:36:49,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:49,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005779305] [2022-12-06 07:36:49,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005779305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:49,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:49,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:49,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785361252] [2022-12-06 07:36:49,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:49,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:49,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:49,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:49,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:49,954 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:49,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:49,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:49,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:49,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:49,990 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:49,990 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:49,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 355 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:49,990 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:49,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:49,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:49,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:49,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:49,991 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:49,991 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:49,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:49,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:49,992 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:49,992 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:49,992 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:49,992 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:49,992 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:49,992 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:49,992 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:49,992 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:49,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:49,994 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:49,994 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:49,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:49,995 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:49,995 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:50,070 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:50,071 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:50,071 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:50,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:50,072 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:50,072 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:50,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3586 [2022-12-06 07:36:50,072 INFO L420 AbstractCegarLoop]: === Iteration 3588 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:50,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:50,072 INFO L85 PathProgramCache]: Analyzing trace with hash 993852482, now seen corresponding path program 1 times [2022-12-06 07:36:50,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:50,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470014196] [2022-12-06 07:36:50,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:50,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:50,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:50,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-06 07:36:50,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:50,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470014196] [2022-12-06 07:36:50,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470014196] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:50,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:50,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:50,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453370148] [2022-12-06 07:36:50,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:50,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:50,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:50,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:50,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:50,140 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:50,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:50,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:50,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:50,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:50,176 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:50,176 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:50,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:50,177 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:50,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:50,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:50,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:50,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:50,177 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:50,177 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:50,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:50,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:50,178 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:50,178 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:50,178 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:50,178 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:50,178 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:50,178 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:50,178 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:50,179 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:50,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:50,181 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:50,181 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:50,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:50,181 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:50,181 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:50,256 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:50,258 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:50,258 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:50,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:50,258 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:50,258 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:50,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3587 [2022-12-06 07:36:50,258 INFO L420 AbstractCegarLoop]: === Iteration 3589 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:50,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:50,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1020634591, now seen corresponding path program 1 times [2022-12-06 07:36:50,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:50,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104059399] [2022-12-06 07:36:50,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:50,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:50,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:50,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-06 07:36:50,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:50,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104059399] [2022-12-06 07:36:50,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104059399] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:50,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:50,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:50,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197773091] [2022-12-06 07:36:50,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:50,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:50,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:50,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:50,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:50,331 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:50,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:50,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:50,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:50,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:50,368 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:50,368 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:50,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:50,368 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:50,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:50,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:50,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:50,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:50,369 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:50,369 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:50,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:50,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:50,369 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:50,369 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:50,370 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:50,370 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:50,370 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:50,370 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:50,370 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:50,370 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:50,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:50,372 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:50,372 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:50,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:50,372 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:50,372 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:50,464 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:50,465 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 07:36:50,465 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:50,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:50,465 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:50,465 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:50,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3588 [2022-12-06 07:36:50,465 INFO L420 AbstractCegarLoop]: === Iteration 3590 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:50,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:50,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1051110784, now seen corresponding path program 1 times [2022-12-06 07:36:50,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:50,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033227330] [2022-12-06 07:36:50,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:50,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:50,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-06 07:36:50,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:50,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033227330] [2022-12-06 07:36:50,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033227330] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:50,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:50,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:50,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648200428] [2022-12-06 07:36:50,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:50,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:50,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:50,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:50,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:50,538 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:50,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:50,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:50,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:50,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:50,573 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:50,573 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:50,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:50,574 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:50,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:50,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:50,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:50,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:50,574 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:50,575 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:50,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:50,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:50,575 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:50,575 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:50,575 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:50,575 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:50,575 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:50,576 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:50,576 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:50,576 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:50,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:50,578 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:50,578 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:50,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:50,578 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:50,578 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:50,654 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:50,655 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:50,655 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:50,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:50,655 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:50,655 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:50,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3589 [2022-12-06 07:36:50,655 INFO L420 AbstractCegarLoop]: === Iteration 3591 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:50,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:50,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1077892893, now seen corresponding path program 1 times [2022-12-06 07:36:50,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:50,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949594824] [2022-12-06 07:36:50,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:50,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36: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-06 07:36:50,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:50,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949594824] [2022-12-06 07:36:50,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949594824] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:50,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:50,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:50,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185666445] [2022-12-06 07:36:50,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:50,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:50,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:50,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:50,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:50,744 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:50,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:50,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:50,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:50,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:50,786 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:50,786 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:50,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:50,786 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:50,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:50,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:50,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:50,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:50,787 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:50,787 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:50,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:50,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:50,787 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:50,788 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:50,788 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:50,788 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:50,788 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:50,788 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:50,788 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:50,788 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:50,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:50,790 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:50,790 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:50,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:50,790 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:50,791 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:50,874 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:50,876 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 07:36:50,876 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:50,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:50,876 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:50,876 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:50,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3590 [2022-12-06 07:36:50,876 INFO L420 AbstractCegarLoop]: === Iteration 3592 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:50,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:50,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1108369086, now seen corresponding path program 1 times [2022-12-06 07:36:50,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:50,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533260839] [2022-12-06 07:36:50,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:50,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:50,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:50,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-06 07:36:50,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:50,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533260839] [2022-12-06 07:36:50,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533260839] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:50,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:50,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:50,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597633906] [2022-12-06 07:36:50,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:50,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:50,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:50,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:50,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:50,966 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:50,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:50,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:50,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:50,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:51,009 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:51,009 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:51,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:51,009 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:51,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:51,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:51,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:51,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:51,010 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:51,010 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:51,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:51,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:51,011 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:51,011 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:51,011 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:51,011 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:51,011 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:51,011 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:51,011 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:51,011 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:51,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:51,013 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:51,013 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:51,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:51,014 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:51,014 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:51,089 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:51,090 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:51,090 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:51,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:51,090 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:51,090 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:51,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3591 [2022-12-06 07:36:51,090 INFO L420 AbstractCegarLoop]: === Iteration 3593 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:51,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:51,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1135151195, now seen corresponding path program 1 times [2022-12-06 07:36:51,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:51,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058417264] [2022-12-06 07:36:51,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:51,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:51,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-06 07:36:51,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:51,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058417264] [2022-12-06 07:36:51,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058417264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:51,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:51,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:51,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62087727] [2022-12-06 07:36:51,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:51,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:51,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:51,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:51,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:51,162 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:51,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:51,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:51,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:51,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:51,198 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:51,198 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:51,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:51,199 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:51,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:51,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:51,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:51,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:51,199 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:51,199 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:51,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:51,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:51,200 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:51,200 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:51,200 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:51,200 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:51,200 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:51,200 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:51,200 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:51,200 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:51,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:51,203 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:51,203 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:51,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:51,203 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:51,203 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:51,278 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:51,279 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:51,279 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:51,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:51,280 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:51,280 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:51,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3592 [2022-12-06 07:36:51,280 INFO L420 AbstractCegarLoop]: === Iteration 3594 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:51,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:51,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1165627388, now seen corresponding path program 1 times [2022-12-06 07:36:51,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:51,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233222140] [2022-12-06 07:36:51,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:51,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:51,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-06 07:36:51,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:51,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233222140] [2022-12-06 07:36:51,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233222140] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:51,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:51,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:51,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127997143] [2022-12-06 07:36:51,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:51,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:51,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:51,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:51,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:51,349 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:51,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:51,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:51,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:51,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:51,385 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:51,385 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:51,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:51,385 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:51,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:51,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:51,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:51,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:51,386 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:51,386 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:51,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:51,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:51,387 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:51,387 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:51,387 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:51,387 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:51,387 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:51,387 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:51,387 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:51,387 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:51,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:51,389 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:51,389 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:51,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:51,390 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:51,390 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:51,463 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:51,465 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:51,465 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:51,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:51,465 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:51,465 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:51,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3593 [2022-12-06 07:36:51,465 INFO L420 AbstractCegarLoop]: === Iteration 3595 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:51,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:51,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1192409497, now seen corresponding path program 1 times [2022-12-06 07:36:51,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:51,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376681903] [2022-12-06 07:36:51,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:51,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:51,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-06 07:36:51,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:51,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376681903] [2022-12-06 07:36:51,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376681903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:51,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:51,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:51,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887054849] [2022-12-06 07:36:51,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:51,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:51,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:51,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:51,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:51,537 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:51,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:51,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:51,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:51,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:51,572 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:51,572 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:51,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:51,573 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:51,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:51,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:51,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:51,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:51,573 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:51,573 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:51,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:51,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:51,574 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:51,574 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:51,574 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:51,574 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:51,574 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:51,575 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:51,575 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:51,575 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:51,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:51,577 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:51,577 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:51,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:51,577 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:51,577 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:51,655 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:51,656 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:36:51,656 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:51,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:51,656 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:51,656 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:51,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3594 [2022-12-06 07:36:51,656 INFO L420 AbstractCegarLoop]: === Iteration 3596 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:51,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:51,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1222885690, now seen corresponding path program 1 times [2022-12-06 07:36:51,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:51,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945431576] [2022-12-06 07:36:51,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:51,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:51,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:51,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-06 07:36:51,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:51,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945431576] [2022-12-06 07:36:51,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945431576] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:51,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:51,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:51,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063342447] [2022-12-06 07:36:51,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:51,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:51,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:51,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:51,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:51,726 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:51,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:51,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:51,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:51,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:51,769 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:51,769 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:51,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:51,769 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:51,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:51,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:51,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:51,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:51,770 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:51,770 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:51,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:51,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:51,771 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:51,771 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:51,771 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:51,771 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:51,771 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:51,771 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:51,771 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:51,771 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:51,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:51,773 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:51,773 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:51,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:51,774 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:51,774 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:51,847 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:51,849 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:51,849 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:51,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:51,849 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:51,849 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:51,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3595 [2022-12-06 07:36:51,849 INFO L420 AbstractCegarLoop]: === Iteration 3597 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:51,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:51,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1249667799, now seen corresponding path program 1 times [2022-12-06 07:36:51,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:51,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698695435] [2022-12-06 07:36:51,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:51,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:51,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-06 07:36:51,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:51,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698695435] [2022-12-06 07:36:51,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698695435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:51,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:51,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:51,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748919324] [2022-12-06 07:36:51,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:51,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:51,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:51,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:51,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:51,939 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:51,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:51,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:51,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:51,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:51,978 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:51,978 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:51,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 374 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:51,978 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:51,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:51,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:51,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:51,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:51,979 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:51,979 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:51,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:51,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:51,979 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:51,980 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:51,980 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:51,980 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:51,980 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:51,980 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:51,980 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:51,980 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:51,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:51,982 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:51,982 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:51,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:51,982 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:51,983 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:52,060 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:52,062 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:36:52,062 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:52,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:52,062 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:52,062 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:52,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3596 [2022-12-06 07:36:52,062 INFO L420 AbstractCegarLoop]: === Iteration 3598 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:52,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:52,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1280143992, now seen corresponding path program 1 times [2022-12-06 07:36:52,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:52,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89991441] [2022-12-06 07:36:52,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:52,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:52,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-06 07:36:52,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:52,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89991441] [2022-12-06 07:36:52,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89991441] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:52,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:52,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:52,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420265744] [2022-12-06 07:36:52,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:52,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:52,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:52,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:52,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:52,138 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:52,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:52,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:52,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:52,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:52,174 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:52,174 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:52,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:52,175 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:52,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:52,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:52,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:52,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:52,175 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:52,175 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:52,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:52,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:52,176 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:52,176 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:52,176 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:52,176 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:52,176 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:52,176 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:52,176 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:52,176 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:52,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:52,178 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:52,179 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:52,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 118 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:52,179 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:52,179 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:52,254 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:52,256 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:52,256 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:52,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:52,256 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:52,256 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:52,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3597 [2022-12-06 07:36:52,256 INFO L420 AbstractCegarLoop]: === Iteration 3599 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:52,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:52,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1306926101, now seen corresponding path program 1 times [2022-12-06 07:36:52,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:52,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559846301] [2022-12-06 07:36:52,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:52,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:52,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-06 07:36:52,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:52,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559846301] [2022-12-06 07:36:52,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559846301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:52,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:52,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:52,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842570536] [2022-12-06 07:36:52,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:52,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:52,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:52,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:52,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:52,328 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:52,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:52,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:52,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:52,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:52,364 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:52,364 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:52,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:52,365 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:52,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:52,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:52,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:52,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:52,365 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:52,365 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:52,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:52,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:52,366 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:52,366 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:52,366 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:52,366 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:52,366 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:52,366 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:52,366 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:52,366 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:52,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:52,369 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:52,369 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:52,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:52,369 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:52,369 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:52,446 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:52,447 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:36:52,447 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:52,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:52,447 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:52,447 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:52,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3598 [2022-12-06 07:36:52,448 INFO L420 AbstractCegarLoop]: === Iteration 3600 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:52,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:52,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1337402294, now seen corresponding path program 1 times [2022-12-06 07:36:52,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:52,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765667196] [2022-12-06 07:36:52,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:52,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:52,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-06 07:36:52,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:52,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765667196] [2022-12-06 07:36:52,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765667196] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:52,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:52,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:52,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823366136] [2022-12-06 07:36:52,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:52,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:52,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:52,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:52,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:52,517 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:52,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:52,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:52,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:52,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:52,554 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:52,554 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:52,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:52,554 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:52,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:52,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:52,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:52,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:52,555 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:52,555 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:52,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:52,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:52,555 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:52,555 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:52,556 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:52,556 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:52,556 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:52,556 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:52,556 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:52,556 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:52,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:52,558 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:52,558 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:52,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:52,558 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:52,558 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:52,633 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:52,635 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:52,635 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:52,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:52,635 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:52,635 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:52,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3599 [2022-12-06 07:36:52,635 INFO L420 AbstractCegarLoop]: === Iteration 3601 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:52,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:52,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1364184403, now seen corresponding path program 1 times [2022-12-06 07:36:52,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:52,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094505798] [2022-12-06 07:36:52,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:52,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:52,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-06 07:36:52,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:52,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094505798] [2022-12-06 07:36:52,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094505798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:52,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:52,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:52,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021000853] [2022-12-06 07:36:52,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:52,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:52,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:52,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:52,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:52,708 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:52,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:52,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:52,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:52,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:52,743 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:52,743 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:52,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:52,744 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:52,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:52,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:52,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:52,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:52,744 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:52,745 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:52,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:52,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:52,745 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:52,745 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:52,745 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:52,745 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:52,745 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:52,746 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:52,746 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:52,746 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:52,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:52,748 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:52,748 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:52,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:52,748 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:52,748 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:52,822 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:52,824 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:52,824 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:52,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:52,824 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:52,824 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:52,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3600 [2022-12-06 07:36:52,824 INFO L420 AbstractCegarLoop]: === Iteration 3602 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:52,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:52,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1394660596, now seen corresponding path program 1 times [2022-12-06 07:36:52,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:52,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317221913] [2022-12-06 07:36:52,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:52,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:52,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-06 07:36:52,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:52,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317221913] [2022-12-06 07:36:52,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317221913] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:52,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:52,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:52,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362288899] [2022-12-06 07:36:52,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:52,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:52,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:52,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:52,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:52,895 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:52,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:52,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:52,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:52,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:52,938 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:52,938 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:52,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:52,938 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:52,939 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:52,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:52,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:52,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:52,939 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:52,939 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:52,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:52,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:52,940 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:52,940 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:52,940 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:52,940 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:52,940 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:52,940 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:52,940 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:52,940 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:52,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:52,942 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:52,942 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:52,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:52,943 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:52,943 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:53,017 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:53,018 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:53,018 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:53,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:53,018 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:53,018 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:53,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3601 [2022-12-06 07:36:53,019 INFO L420 AbstractCegarLoop]: === Iteration 3603 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:53,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:53,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1421442705, now seen corresponding path program 1 times [2022-12-06 07:36:53,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:53,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732873918] [2022-12-06 07:36:53,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:53,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:53,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:53,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:53,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732873918] [2022-12-06 07:36:53,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732873918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:53,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:53,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:53,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145650861] [2022-12-06 07:36:53,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:53,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:53,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:53,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:53,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:53,108 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:53,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:53,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:53,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:53,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:53,144 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:53,144 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:53,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:53,145 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:53,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:53,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:53,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:53,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:53,145 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:53,145 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:53,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:53,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:53,146 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:53,146 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:53,146 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:53,146 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:53,146 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:53,146 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:53,146 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:53,146 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:53,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:53,149 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:53,149 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:53,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:53,149 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:53,149 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:53,223 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:53,225 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:53,225 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:53,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:53,225 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:53,225 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:53,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3602 [2022-12-06 07:36:53,225 INFO L420 AbstractCegarLoop]: === Iteration 3604 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:53,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:53,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1451918898, now seen corresponding path program 1 times [2022-12-06 07:36:53,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:53,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144577088] [2022-12-06 07:36:53,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:53,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:53,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-06 07:36:53,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:53,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144577088] [2022-12-06 07:36:53,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144577088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:53,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:53,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:53,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910303127] [2022-12-06 07:36:53,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:53,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:53,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:53,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:53,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:53,295 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:53,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:53,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:53,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:53,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:53,337 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:53,337 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:53,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:53,338 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:53,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:53,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:53,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:53,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:53,338 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:53,338 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:53,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:53,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:53,339 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:53,339 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:53,339 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:53,339 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:53,339 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:53,339 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:53,340 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:53,340 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:53,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:53,342 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:53,342 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:53,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:53,342 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:53,342 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:53,416 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:53,417 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:53,417 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:53,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:53,417 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:53,418 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:53,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3603 [2022-12-06 07:36:53,418 INFO L420 AbstractCegarLoop]: === Iteration 3605 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:53,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:53,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1478701007, now seen corresponding path program 1 times [2022-12-06 07:36:53,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:53,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927605813] [2022-12-06 07:36:53,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:53,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36: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-06 07:36:53,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:53,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927605813] [2022-12-06 07:36:53,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927605813] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:53,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:53,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:53,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938890761] [2022-12-06 07:36:53,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:53,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:53,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:53,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:53,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:53,489 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:53,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:53,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:53,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:53,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:53,528 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:53,528 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:53,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 375 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:53,529 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:53,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:53,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:53,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:53,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:53,529 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:53,529 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:53,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:53,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:53,530 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:53,530 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:53,530 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:53,530 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:53,530 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:53,530 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:53,530 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:53,530 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:53,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:53,533 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:53,533 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:53,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:53,533 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:53,533 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:53,608 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:53,610 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:53,610 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:53,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:53,610 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:53,610 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:53,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3604 [2022-12-06 07:36:53,610 INFO L420 AbstractCegarLoop]: === Iteration 3606 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:53,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:53,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1509177200, now seen corresponding path program 1 times [2022-12-06 07:36:53,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:53,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072967055] [2022-12-06 07:36:53,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:53,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:53,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-06 07:36:53,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:53,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072967055] [2022-12-06 07:36:53,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072967055] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:53,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:53,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:53,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104564047] [2022-12-06 07:36:53,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:53,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:53,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:53,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:53,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:53,679 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:53,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:53,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:53,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:53,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:53,721 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:53,721 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:53,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:53,722 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:53,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:53,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:53,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:53,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:53,722 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:53,722 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:53,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:53,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:53,723 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:53,723 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:53,723 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:53,723 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:53,723 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:53,724 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:53,724 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:53,724 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:53,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:53,726 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:53,726 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:53,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:53,726 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:53,726 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:53,802 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:53,803 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:53,803 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:53,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:53,803 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:53,803 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:53,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3605 [2022-12-06 07:36:53,803 INFO L420 AbstractCegarLoop]: === Iteration 3607 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:53,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:53,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1535959309, now seen corresponding path program 1 times [2022-12-06 07:36:53,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:53,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832742530] [2022-12-06 07:36:53,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:53,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:53,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:53,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:53,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832742530] [2022-12-06 07:36:53,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832742530] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:53,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:53,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:53,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70712650] [2022-12-06 07:36:53,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:53,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:53,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:53,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:53,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:53,886 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:53,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:53,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:53,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:53,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:53,925 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:53,925 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:53,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:53,926 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:53,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:53,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:53,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:53,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:53,926 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:53,926 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:53,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:53,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:53,927 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:53,927 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:53,927 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:53,927 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:53,927 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:53,927 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:53,927 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:53,927 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:53,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:53,929 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:53,929 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:53,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:53,930 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:53,930 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:54,004 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:54,006 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:54,006 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:54,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:54,006 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:54,006 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:54,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3606 [2022-12-06 07:36:54,006 INFO L420 AbstractCegarLoop]: === Iteration 3608 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:54,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:54,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1566435502, now seen corresponding path program 1 times [2022-12-06 07:36:54,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:54,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691405336] [2022-12-06 07:36:54,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:54,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:54,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-06 07:36:54,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:54,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691405336] [2022-12-06 07:36:54,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691405336] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:54,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:54,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:54,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243070980] [2022-12-06 07:36:54,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:54,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:54,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:54,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:54,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:54,077 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:54,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:54,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:54,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:54,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:54,113 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:54,113 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:54,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:54,113 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:54,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:54,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:54,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:54,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:54,114 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:54,114 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:54,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:54,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:54,115 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:54,115 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:54,115 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:54,115 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:54,115 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:54,115 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:54,115 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:54,115 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:54,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:54,117 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:54,117 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:54,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:54,118 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:54,118 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:54,191 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:54,193 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:54,193 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:54,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:54,193 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:54,193 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:54,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3607 [2022-12-06 07:36:54,193 INFO L420 AbstractCegarLoop]: === Iteration 3609 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:54,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:54,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1593217611, now seen corresponding path program 1 times [2022-12-06 07:36:54,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:54,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839931761] [2022-12-06 07:36:54,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:54,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:54,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-06 07:36:54,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:54,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839931761] [2022-12-06 07:36:54,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839931761] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:54,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:54,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:54,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643412788] [2022-12-06 07:36:54,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:54,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:54,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:54,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:54,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:54,264 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:54,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:54,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:54,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:54,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:54,300 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:54,301 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:54,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:54,301 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:54,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:54,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:54,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:54,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:54,302 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:54,302 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:54,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:54,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:54,302 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:54,302 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:54,302 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:54,303 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:54,303 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:54,303 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:54,303 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:54,303 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:54,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:54,316 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:54,317 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:54,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 142 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:54,317 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:54,317 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:54,391 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:54,393 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-06 07:36:54,393 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:54,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:54,393 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:54,393 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:54,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3608 [2022-12-06 07:36:54,393 INFO L420 AbstractCegarLoop]: === Iteration 3610 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:54,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:54,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1623693804, now seen corresponding path program 1 times [2022-12-06 07:36:54,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:54,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691916582] [2022-12-06 07:36:54,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:54,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:54,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:54,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:54,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:54,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691916582] [2022-12-06 07:36:54,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691916582] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:54,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:54,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:54,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311283486] [2022-12-06 07:36:54,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:54,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:54,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:54,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:54,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:54,462 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:54,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:54,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:54,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:54,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:54,500 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:54,500 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:54,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 344 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:54,501 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:54,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:54,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:54,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:54,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:54,501 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:54,501 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:54,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:54,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:54,502 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:54,502 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:54,502 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:54,502 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:54,502 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:54,503 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:54,503 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:54,503 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:54,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:54,505 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:54,505 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:54,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:54,505 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:54,505 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:54,584 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:54,585 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 07:36:54,585 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:54,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:54,586 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:54,586 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:54,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3609 [2022-12-06 07:36:54,586 INFO L420 AbstractCegarLoop]: === Iteration 3611 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:54,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:54,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1650475913, now seen corresponding path program 1 times [2022-12-06 07:36:54,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:54,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069424354] [2022-12-06 07:36:54,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:54,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:54,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-06 07:36:54,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:54,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069424354] [2022-12-06 07:36:54,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069424354] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:54,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:54,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:54,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248328773] [2022-12-06 07:36:54,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:54,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:54,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:54,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:54,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:54,658 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:54,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:54,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:54,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:54,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:54,693 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:54,694 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:54,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:54,694 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:54,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:54,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:54,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:54,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:54,695 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:54,695 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:54,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:54,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:54,695 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:54,695 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:54,696 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:54,696 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:54,696 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:54,696 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:54,696 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:54,696 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:54,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:54,698 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:54,698 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:54,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:54,698 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:54,698 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:54,773 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:54,774 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:54,775 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:54,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:54,775 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:54,775 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:54,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3610 [2022-12-06 07:36:54,775 INFO L420 AbstractCegarLoop]: === Iteration 3612 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:54,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:54,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1680952106, now seen corresponding path program 1 times [2022-12-06 07:36:54,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:54,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235794355] [2022-12-06 07:36:54,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:54,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36: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-06 07:36:54,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:54,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235794355] [2022-12-06 07:36:54,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235794355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:54,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:54,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:54,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751423512] [2022-12-06 07:36:54,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:54,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:54,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:54,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:54,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:54,844 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:54,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:54,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:54,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:54,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:54,886 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:54,886 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:54,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:54,887 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:54,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:54,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:54,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:54,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:54,887 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:54,887 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:54,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:54,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:54,888 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:54,888 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:54,888 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:54,888 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:54,888 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:54,888 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:54,888 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:54,888 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:54,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:54,891 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:54,891 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:54,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:54,891 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:54,891 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:54,965 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:54,967 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:54,967 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:54,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:54,967 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:54,967 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:54,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3611 [2022-12-06 07:36:54,967 INFO L420 AbstractCegarLoop]: === Iteration 3613 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:54,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:54,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1707734215, now seen corresponding path program 1 times [2022-12-06 07:36:54,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:54,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728548959] [2022-12-06 07:36:54,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:54,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:55,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-06 07:36:55,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:55,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728548959] [2022-12-06 07:36:55,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728548959] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:55,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:55,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:55,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710815019] [2022-12-06 07:36:55,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:55,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:55,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:55,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:55,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:55,040 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:55,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:55,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:55,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:55,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:55,079 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:55,079 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:55,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:55,080 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:55,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:55,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:55,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:55,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:55,080 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:55,080 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:55,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:55,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:55,081 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:55,081 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:55,081 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:55,081 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:55,081 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:55,081 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:55,081 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:55,081 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:55,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:55,084 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:55,084 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:55,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:55,084 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:55,084 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:55,157 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:55,159 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:55,159 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:55,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:55,159 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:55,159 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:55,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3612 [2022-12-06 07:36:55,159 INFO L420 AbstractCegarLoop]: === Iteration 3614 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:55,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:55,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1738210408, now seen corresponding path program 1 times [2022-12-06 07:36:55,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:55,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605263322] [2022-12-06 07:36:55,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:55,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:55,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36: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-06 07:36:55,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:55,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605263322] [2022-12-06 07:36:55,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605263322] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:55,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:55,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:55,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997527003] [2022-12-06 07:36:55,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:55,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:55,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:55,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:55,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:55,227 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:55,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:55,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:55,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:55,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:55,269 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:55,269 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:55,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 346 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:55,270 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:55,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:55,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:55,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:55,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:55,270 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:55,270 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:55,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:55,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:55,271 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:55,271 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:55,271 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:55,271 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:55,271 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:55,271 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:55,271 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:55,271 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:55,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:55,274 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:55,274 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:55,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:55,274 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:55,274 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:55,348 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:55,349 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:55,349 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:55,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:55,349 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:55,349 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:55,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3613 [2022-12-06 07:36:55,349 INFO L420 AbstractCegarLoop]: === Iteration 3615 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:55,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:55,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1764992517, now seen corresponding path program 1 times [2022-12-06 07:36:55,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:55,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943374502] [2022-12-06 07:36:55,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:55,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36: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-06 07:36:55,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:55,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943374502] [2022-12-06 07:36:55,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943374502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:55,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:55,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:55,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134815291] [2022-12-06 07:36:55,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:55,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:55,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:55,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:55,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:55,420 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:55,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:55,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:55,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:55,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:55,455 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:55,455 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:55,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 359 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:55,456 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:55,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:55,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:55,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:55,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:55,456 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:55,456 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:55,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:55,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:55,457 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:55,457 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:55,457 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:55,457 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:55,457 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:55,457 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:55,457 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:55,457 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:55,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:55,460 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:55,460 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:55,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:55,460 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:55,460 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:55,533 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:55,535 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:55,535 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:55,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:55,535 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:55,535 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:55,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3614 [2022-12-06 07:36:55,535 INFO L420 AbstractCegarLoop]: === Iteration 3616 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:55,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:55,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1795468710, now seen corresponding path program 1 times [2022-12-06 07:36:55,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:55,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591400917] [2022-12-06 07:36:55,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:55,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:55,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-06 07:36:55,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:55,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591400917] [2022-12-06 07:36:55,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591400917] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:55,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:55,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:55,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382343214] [2022-12-06 07:36:55,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:55,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:55,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:55,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:55,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:55,616 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:55,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:55,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:55,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:55,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:55,653 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:55,653 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:55,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:55,653 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:55,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:55,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:55,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:55,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:55,654 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:55,654 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:55,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:55,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:55,654 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:55,654 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:55,655 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:55,655 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:55,655 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:55,655 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:55,655 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:55,655 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:55,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:55,657 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:55,657 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:55,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:55,657 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:55,658 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:55,731 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:55,733 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:55,733 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:55,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:55,733 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:55,733 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:55,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3615 [2022-12-06 07:36:55,733 INFO L420 AbstractCegarLoop]: === Iteration 3617 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:55,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:55,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1822250819, now seen corresponding path program 1 times [2022-12-06 07:36:55,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:55,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138761301] [2022-12-06 07:36:55,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:55,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:55,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-06 07:36:55,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:55,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138761301] [2022-12-06 07:36:55,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138761301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:55,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:55,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:55,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017024902] [2022-12-06 07:36:55,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:55,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:55,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:55,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:55,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:55,805 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:55,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:55,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:55,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:55,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:55,841 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:55,841 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:55,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:55,841 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:55,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:55,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:55,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:55,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:55,842 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:55,842 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:55,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:55,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:55,842 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:55,842 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:55,843 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:55,843 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:55,843 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:55,843 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:55,843 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:55,843 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:55,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:55,845 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:55,845 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:55,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:55,845 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:55,845 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:55,920 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:55,922 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:55,922 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:55,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:55,922 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:55,922 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:55,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3616 [2022-12-06 07:36:55,922 INFO L420 AbstractCegarLoop]: === Iteration 3618 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:55,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:55,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1852727012, now seen corresponding path program 1 times [2022-12-06 07:36:55,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:55,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454743623] [2022-12-06 07:36:55,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:55,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:55,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-06 07:36:55,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:55,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454743623] [2022-12-06 07:36:55,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454743623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:55,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:55,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:55,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516104043] [2022-12-06 07:36:55,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:55,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:55,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:55,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:55,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:55,992 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:55,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:55,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:55,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:55,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:56,034 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:56,034 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:56,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:56,035 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:56,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:56,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:56,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:56,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:56,035 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:56,035 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:56,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:56,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:56,036 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:56,036 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:56,036 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:56,036 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:56,036 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:56,036 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:56,036 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:56,036 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:56,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:56,038 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:56,038 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:56,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:56,039 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:56,039 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:56,114 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:56,115 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:56,115 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:56,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:56,116 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:56,116 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:56,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3617 [2022-12-06 07:36:56,116 INFO L420 AbstractCegarLoop]: === Iteration 3619 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:56,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:56,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1879509121, now seen corresponding path program 1 times [2022-12-06 07:36:56,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:56,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791474844] [2022-12-06 07:36:56,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:56,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36: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-06 07:36:56,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:56,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791474844] [2022-12-06 07:36:56,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791474844] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:56,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:56,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:56,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44361884] [2022-12-06 07:36:56,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:56,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:56,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:56,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:56,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:56,186 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:56,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:56,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:56,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:56,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:56,228 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:56,228 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:56,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 357 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:56,228 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:56,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:56,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:56,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:56,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:56,229 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:56,229 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:56,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:56,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:56,230 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:56,230 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:56,230 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:56,230 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:56,230 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:56,230 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:56,230 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:56,230 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:56,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:56,232 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:56,232 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:56,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:56,233 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:56,233 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:56,309 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:56,310 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:56,310 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:56,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:56,310 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:56,310 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:56,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3618 [2022-12-06 07:36:56,310 INFO L420 AbstractCegarLoop]: === Iteration 3620 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:56,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:56,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1909985314, now seen corresponding path program 1 times [2022-12-06 07:36:56,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:56,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511596568] [2022-12-06 07:36:56,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:56,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:56,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-06 07:36:56,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:56,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511596568] [2022-12-06 07:36:56,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511596568] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:56,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:56,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:56,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247530485] [2022-12-06 07:36:56,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:56,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:56,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:56,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:56,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:56,380 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:56,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:56,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:56,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:56,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:56,416 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:56,417 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:56,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:56,417 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:56,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:56,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:56,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:56,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:56,418 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:56,418 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:56,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:56,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:56,418 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:56,418 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:56,418 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:56,418 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:56,419 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:56,419 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:56,419 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:56,419 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:56,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:56,421 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:56,421 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:56,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:56,421 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:56,421 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:56,497 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:56,499 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:36:56,499 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:56,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:56,499 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:56,499 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:56,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3619 [2022-12-06 07:36:56,499 INFO L420 AbstractCegarLoop]: === Iteration 3621 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:56,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:56,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1936767423, now seen corresponding path program 1 times [2022-12-06 07:36:56,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:56,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556853894] [2022-12-06 07:36:56,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:56,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:56,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-06 07:36:56,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:56,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556853894] [2022-12-06 07:36:56,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556853894] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:56,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:56,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:56,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262377173] [2022-12-06 07:36:56,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:56,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:56,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:56,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:56,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:56,573 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:56,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:56,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:56,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:56,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:56,614 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:56,615 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:56,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:56,615 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:56,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:56,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:56,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:56,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:56,616 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:56,616 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:56,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:56,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:56,616 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:56,616 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:56,616 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:56,617 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:56,617 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:56,617 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:56,617 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:56,617 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:56,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:56,619 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:56,619 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:56,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:56,619 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:56,619 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:56,696 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:56,697 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:56,697 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:56,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:56,697 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:56,697 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:56,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3620 [2022-12-06 07:36:56,697 INFO L420 AbstractCegarLoop]: === Iteration 3622 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:56,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:56,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1967243616, now seen corresponding path program 1 times [2022-12-06 07:36:56,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:56,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096646765] [2022-12-06 07:36:56,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:56,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:56,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:56,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:56,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096646765] [2022-12-06 07:36:56,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096646765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:56,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:56,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:56,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614237089] [2022-12-06 07:36:56,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:56,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:56,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:56,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:56,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:56,786 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:56,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:56,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:56,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:56,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:56,822 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:56,822 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:56,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:56,823 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:56,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:56,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:56,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:56,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:56,823 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:56,823 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:56,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:56,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:56,824 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:56,824 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:56,824 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:56,824 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:56,824 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:56,824 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:56,825 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:56,825 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:56,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:56,827 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:56,827 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:56,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 132 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:56,827 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:56,827 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:56,901 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:56,902 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:36:56,902 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:56,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:56,902 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:56,902 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:56,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3621 [2022-12-06 07:36:56,903 INFO L420 AbstractCegarLoop]: === Iteration 3623 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:56,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:56,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1994025725, now seen corresponding path program 1 times [2022-12-06 07:36:56,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:56,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120543274] [2022-12-06 07:36:56,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:56,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36: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-06 07:36:56,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:56,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120543274] [2022-12-06 07:36:56,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120543274] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:56,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:56,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:56,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079430661] [2022-12-06 07:36:56,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:56,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:56,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:56,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:56,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:56,974 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:56,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:56,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:56,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:56,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:57,013 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:57,013 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:57,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:57,013 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:57,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:57,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:57,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:57,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:57,014 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:57,014 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:57,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:57,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:57,015 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:57,015 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:57,015 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:57,015 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:57,015 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:57,015 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:57,015 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:57,015 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:57,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:57,017 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:57,017 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:57,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:57,018 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:57,018 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:57,094 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:57,095 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:57,095 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:57,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:57,095 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:57,095 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:57,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3622 [2022-12-06 07:36:57,096 INFO L420 AbstractCegarLoop]: === Iteration 3624 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:57,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:57,096 INFO L85 PathProgramCache]: Analyzing trace with hash 2024501918, now seen corresponding path program 1 times [2022-12-06 07:36:57,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:57,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529521173] [2022-12-06 07:36:57,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:57,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:57,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:57,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:57,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529521173] [2022-12-06 07:36:57,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529521173] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:57,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:57,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:57,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717944667] [2022-12-06 07:36:57,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:57,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:57,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:57,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:57,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:57,163 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:57,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:57,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:57,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:57,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:57,205 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:57,205 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:57,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:57,205 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:57,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:57,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:57,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:57,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:57,206 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:57,206 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:57,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:57,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:57,206 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:57,207 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:57,207 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:57,207 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:57,207 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:57,207 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:57,207 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:57,207 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:57,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:57,209 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:57,209 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:57,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:57,209 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:57,210 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:57,282 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:57,284 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:36:57,284 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:57,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:57,284 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:57,284 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:57,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3623 [2022-12-06 07:36:57,284 INFO L420 AbstractCegarLoop]: === Iteration 3625 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:57,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:57,284 INFO L85 PathProgramCache]: Analyzing trace with hash 2051284027, now seen corresponding path program 1 times [2022-12-06 07:36:57,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:57,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445379730] [2022-12-06 07:36:57,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:57,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:57,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-06 07:36:57,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:57,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445379730] [2022-12-06 07:36:57,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445379730] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:57,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:57,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:57,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543245752] [2022-12-06 07:36:57,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:57,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:57,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:57,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:57,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:57,356 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:57,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:57,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:57,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:57,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:57,397 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:57,398 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:57,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:57,398 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:57,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:57,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:57,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:57,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:57,399 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:57,399 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:57,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:57,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:57,399 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:57,399 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:57,400 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:57,400 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:57,400 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:57,400 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:57,400 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:57,400 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:57,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:57,402 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:57,402 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:57,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:57,402 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:57,402 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:57,477 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:57,479 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:57,479 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:57,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:57,479 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:57,479 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:57,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3624 [2022-12-06 07:36:57,479 INFO L420 AbstractCegarLoop]: === Iteration 3626 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:57,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:57,479 INFO L85 PathProgramCache]: Analyzing trace with hash 2081760220, now seen corresponding path program 1 times [2022-12-06 07:36:57,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:57,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826658587] [2022-12-06 07:36:57,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:57,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:57,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-06 07:36:57,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:57,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826658587] [2022-12-06 07:36:57,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826658587] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:57,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:57,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:57,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864590249] [2022-12-06 07:36:57,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:57,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:57,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:57,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:57,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:57,548 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:57,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:57,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:57,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:57,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:57,585 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:57,585 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:36:57,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:57,586 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:57,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:57,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:57,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:57,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:57,586 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:57,586 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:57,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:57,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:57,587 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:57,587 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:57,587 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:57,587 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:57,587 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:57,587 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:57,587 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:57,587 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:57,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:57,589 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:57,589 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:57,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:57,590 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:57,590 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:36:57,665 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:57,667 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:36:57,667 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 168 flow [2022-12-06 07:36:57,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:57,667 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:57,667 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:57,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3625 [2022-12-06 07:36:57,667 INFO L420 AbstractCegarLoop]: === Iteration 3627 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:57,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:57,667 INFO L85 PathProgramCache]: Analyzing trace with hash 2108542329, now seen corresponding path program 1 times [2022-12-06 07:36:57,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:57,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912766589] [2022-12-06 07:36:57,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:57,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:57,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-06 07:36:57,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:57,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912766589] [2022-12-06 07:36:57,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912766589] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:57,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:57,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:57,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406655684] [2022-12-06 07:36:57,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:57,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:57,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:57,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:57,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:57,738 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:57,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:57,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:57,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:57,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:57,772 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-06 07:36:57,772 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 07:36:57,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 126 events. 68/126 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 2 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 387. Up to 103 conditions per place. [2022-12-06 07:36:57,773 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21 selfloop transitions, 10 changer transitions 2/36 dead transitions. [2022-12-06 07:36:57,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:57,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:57,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:57,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:57,773 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:57,773 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 168 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:57,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:57,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:57,774 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:57,774 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:57,774 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:57,774 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:57,774 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:57,775 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:57,775 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:57,775 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:57,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:57,777 INFO L130 PetriNetUnfolder]: 14/48 cut-off events. [2022-12-06 07:36:57,777 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:36:57,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 48 events. 14/48 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 113. Up to 15 conditions per place. [2022-12-06 07:36:57,777 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:57,777 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:36:57,852 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:57,853 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:36:57,853 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 170 flow [2022-12-06 07:36:57,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:57,853 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:57,853 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:57,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3626 [2022-12-06 07:36:57,854 INFO L420 AbstractCegarLoop]: === Iteration 3628 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:57,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:57,854 INFO L85 PathProgramCache]: Analyzing trace with hash 2139018522, now seen corresponding path program 1 times [2022-12-06 07:36:57,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:57,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706272326] [2022-12-06 07:36:57,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:57,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:57,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-06 07:36:57,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:57,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706272326] [2022-12-06 07:36:57,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706272326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:57,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:57,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:36:57,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536826156] [2022-12-06 07:36:57,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:57,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:57,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:57,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:57,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:57,945 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 07:36:57,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:57,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:57,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 07:36:57,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:57,987 INFO L130 PetriNetUnfolder]: 64/120 cut-off events. [2022-12-06 07:36:57,988 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:36:57,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 120 events. 64/120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 2 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 369. Up to 101 conditions per place. [2022-12-06 07:36:57,988 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 19 selfloop transitions, 10 changer transitions 4/36 dead transitions. [2022-12-06 07:36:57,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:57,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:57,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:57,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:36:57,989 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:36:57,989 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 170 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:36:57,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 261 flow [2022-12-06 07:36:57,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:57,989 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:57,989 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:36:57,989 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 07:36:57,990 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:57,990 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:57,990 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:57,990 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:57,990 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:57,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:57,992 INFO L130 PetriNetUnfolder]: 16/48 cut-off events. [2022-12-06 07:36:57,992 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-12-06 07:36:57,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 48 events. 16/48 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 07:36:57,992 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 176 flow [2022-12-06 07:36:57,992 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 Received shutdown request... [2022-12-06 07:36:58,005 WARN L249 SmtUtils]: Removed 7 from assertion stack [2022-12-06 07:36:58,007 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 07:36:58,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3627 [2022-12-06 07:36:58,007 WARN L619 AbstractCegarLoop]: Verification canceled: while TransFormulaUtils was doing sequential composition of 2 TransFormulas,while SimplifyDDAWithTimeout was simplifying term of DAG size 37 for 9ms.. [2022-12-06 07:36:58,008 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 07:36:58,008 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 07:36:58,010 INFO L458 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 07:36:58,014 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 07:36:58,014 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 07:36:58,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 07:36:58 BasicIcfg [2022-12-06 07:36:58,016 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 07:36:58,016 INFO L158 Benchmark]: Toolchain (without parser) took 701710.72ms. Allocated memory was 185.6MB in the beginning and 865.1MB in the end (delta: 679.5MB). Free memory was 146.3MB in the beginning and 623.5MB in the end (delta: -477.1MB). Peak memory consumption was 203.9MB. Max. memory is 8.0GB. [2022-12-06 07:36:58,016 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 185.6MB. Free memory was 161.6MB in the beginning and 161.5MB in the end (delta: 63.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:36:58,016 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.13ms. Allocated memory is still 185.6MB. Free memory was 146.3MB in the beginning and 135.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-12-06 07:36:58,017 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.49ms. Allocated memory is still 185.6MB. Free memory was 135.9MB in the beginning and 134.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:36:58,017 INFO L158 Benchmark]: Boogie Preprocessor took 36.21ms. Allocated memory is still 185.6MB. Free memory was 134.3MB in the beginning and 132.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 07:36:58,017 INFO L158 Benchmark]: RCFGBuilder took 408.77ms. Allocated memory is still 185.6MB. Free memory was 132.7MB in the beginning and 120.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 07:36:58,017 INFO L158 Benchmark]: TraceAbstraction took 701021.38ms. Allocated memory was 185.6MB in the beginning and 865.1MB in the end (delta: 679.5MB). Free memory was 120.1MB in the beginning and 623.5MB in the end (delta: -503.4MB). Peak memory consumption was 177.7MB. Max. memory is 8.0GB. [2022-12-06 07:36:58,017 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 185.6MB. Free memory was 161.6MB in the beginning and 161.5MB in the end (delta: 63.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 203.13ms. Allocated memory is still 185.6MB. Free memory was 146.3MB in the beginning and 135.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.49ms. Allocated memory is still 185.6MB. Free memory was 135.9MB in the beginning and 134.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.21ms. Allocated memory is still 185.6MB. Free memory was 134.3MB in the beginning and 132.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 408.77ms. Allocated memory is still 185.6MB. Free memory was 132.7MB in the beginning and 120.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 701021.38ms. Allocated memory was 185.6MB in the beginning and 865.1MB in the end (delta: 679.5MB). Free memory was 120.1MB in the beginning and 623.5MB in the end (delta: -503.4MB). Peak memory consumption was 177.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 67 PlacesBefore, 20 PlacesAfterwards, 65 TransitionsBefore, 15 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 28 TrivialYvCompositions, 19 ConcurrentYvCompositions, 3 ChoiceCompositions, 50 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 250, independent: 250, independent conditional: 250, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 250, independent: 250, independent conditional: 0, independent unconditional: 250, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 250, independent: 250, independent conditional: 0, independent unconditional: 250, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 250, independent: 250, independent conditional: 0, independent unconditional: 250, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 250, independent: 250, independent conditional: 0, independent unconditional: 250, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 250, independent: 250, independent conditional: 0, independent unconditional: 250, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 250, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 250, unknown conditional: 0, unknown unconditional: 250] , Statistics on independence cache: Total cache size (in pairs): 399, Positive cache size: 399, Positive conditional cache size: 0, Positive unconditional cache size: 399, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 19 PlacesBefore, 19 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 24 PlacesBefore, 23 PlacesAfterwards, 19 TransitionsBefore, 18 TransitionsAfterwards, 70 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 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: 10, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 5, Positive cache size: 5, Positive conditional cache size: 0, Positive unconditional cache size: 5, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 27 PlacesBefore, 25 PlacesAfterwards, 23 TransitionsBefore, 21 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 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: 3, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 8, Positive conditional cache size: 2, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional 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.2s, 29 PlacesBefore, 28 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 16, Positive cache size: 16, Positive conditional cache size: 10, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown 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, 31 PlacesBefore, 29 PlacesAfterwards, 29 TransitionsBefore, 27 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 24, Positive conditional cache size: 18, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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: 19, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 28, Positive cache size: 28, Positive conditional cache size: 22, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 29, Positive cache size: 29, Positive conditional cache size: 23, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 32, Positive cache size: 32, Positive conditional cache size: 26, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 33, Positive cache size: 33, Positive conditional cache size: 27, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 36, Positive cache size: 36, Positive conditional cache size: 30, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 30 PlacesBefore, 29 PlacesAfterwards, 28 TransitionsBefore, 27 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): 37, Positive cache size: 37, Positive conditional cache size: 31, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 30 PlacesBefore, 29 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 40, Positive cache size: 40, Positive conditional cache size: 34, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 41, Positive cache size: 41, Positive conditional cache size: 35, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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: 38, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 45, Positive cache size: 45, Positive conditional cache size: 39, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 48, Positive cache size: 48, Positive conditional cache size: 42, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 49, Positive cache size: 49, Positive conditional cache size: 43, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 52, Positive cache size: 52, Positive conditional cache size: 46, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 53, Positive cache size: 53, Positive conditional cache size: 47, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 56, Positive cache size: 56, Positive conditional cache size: 50, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 57, Positive cache size: 57, Positive conditional cache size: 51, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 60, Positive cache size: 60, Positive conditional cache size: 54, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 61, Positive cache size: 61, Positive conditional cache size: 55, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 64, Positive cache size: 64, Positive conditional cache size: 58, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 65, Positive cache size: 65, Positive conditional cache size: 59, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 68, Positive cache size: 68, Positive conditional cache size: 62, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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-06 07:36:58,034 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, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 69, Positive cache size: 69, Positive conditional cache size: 63, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 72, Positive cache size: 72, Positive conditional cache size: 66, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 73, Positive cache size: 73, Positive conditional cache size: 67, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 76, Positive cache size: 76, Positive conditional cache size: 70, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 77, Positive cache size: 77, Positive conditional cache size: 71, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 80, Positive cache size: 80, Positive conditional cache size: 74, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 81, Positive cache size: 81, Positive conditional cache size: 75, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 84, Positive cache size: 84, Positive conditional cache size: 78, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 85, Positive cache size: 85, Positive conditional cache size: 79, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 88, Positive cache size: 88, Positive conditional cache size: 82, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 89, Positive cache size: 89, Positive conditional cache size: 83, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 92, Positive cache size: 92, Positive conditional cache size: 86, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 93, Positive cache size: 93, Positive conditional cache size: 87, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 96, Positive cache size: 96, Positive conditional cache size: 90, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 97, Positive cache size: 97, Positive conditional cache size: 91, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 100, Positive cache size: 100, Positive conditional cache size: 94, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 101, Positive cache size: 101, Positive conditional cache size: 95, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 104, Positive cache size: 104, Positive conditional cache size: 98, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 105, Positive cache size: 105, Positive conditional cache size: 99, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 108, Positive cache size: 108, Positive conditional cache size: 102, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 109, Positive cache size: 109, Positive conditional cache size: 103, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 112, Positive cache size: 112, Positive conditional cache size: 106, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 113, Positive cache size: 113, Positive conditional cache size: 107, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 116, Positive cache size: 116, Positive conditional cache size: 110, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 117, Positive cache size: 117, Positive conditional cache size: 111, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 120, Positive cache size: 120, Positive conditional cache size: 114, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 121, Positive cache size: 121, Positive conditional cache size: 115, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 124, Positive cache size: 124, Positive conditional cache size: 118, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 125, Positive cache size: 125, Positive conditional cache size: 119, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 128, Positive cache size: 128, Positive conditional cache size: 122, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 129, Positive cache size: 129, Positive conditional cache size: 123, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 132, Positive cache size: 132, Positive conditional cache size: 126, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 133, Positive cache size: 133, Positive conditional cache size: 127, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 136, Positive cache size: 136, Positive conditional cache size: 130, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 137, Positive cache size: 137, Positive conditional cache size: 131, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 140, Positive cache size: 140, Positive conditional cache size: 134, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 141, Positive cache size: 141, Positive conditional cache size: 135, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 144, Positive cache size: 144, Positive conditional cache size: 138, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 145, Positive cache size: 145, Positive conditional cache size: 139, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 148, Positive cache size: 148, Positive conditional cache size: 142, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 149, Positive cache size: 149, Positive conditional cache size: 143, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 152, Positive cache size: 152, Positive conditional cache size: 146, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 153, Positive cache size: 153, Positive conditional cache size: 147, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 156, Positive cache size: 156, Positive conditional cache size: 150, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 157, Positive cache size: 157, Positive conditional cache size: 151, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 160, Positive cache size: 160, Positive conditional cache size: 154, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 161, Positive cache size: 161, Positive conditional cache size: 155, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 164, Positive cache size: 164, Positive conditional cache size: 158, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 165, Positive cache size: 165, Positive conditional cache size: 159, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 168, Positive cache size: 168, Positive conditional cache size: 162, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 169, Positive cache size: 169, Positive conditional cache size: 163, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 172, Positive cache size: 172, Positive conditional cache size: 166, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 173, Positive cache size: 173, Positive conditional cache size: 167, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 176, Positive cache size: 176, Positive conditional cache size: 170, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 177, Positive cache size: 177, Positive conditional cache size: 171, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 180, Positive cache size: 180, Positive conditional cache size: 174, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 181, Positive cache size: 181, Positive conditional cache size: 175, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 184, Positive cache size: 184, Positive conditional cache size: 178, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 185, Positive cache size: 185, Positive conditional cache size: 179, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 188, Positive cache size: 188, Positive conditional cache size: 182, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 189, Positive cache size: 189, Positive conditional cache size: 183, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 192, Positive cache size: 192, Positive conditional cache size: 186, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 193, Positive cache size: 193, Positive conditional cache size: 187, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 196, Positive cache size: 196, Positive conditional cache size: 190, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 197, Positive cache size: 197, Positive conditional cache size: 191, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 200, Positive cache size: 200, Positive conditional cache size: 194, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 201, Positive cache size: 201, Positive conditional cache size: 195, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 204, Positive cache size: 204, Positive conditional cache size: 198, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 205, Positive cache size: 205, Positive conditional cache size: 199, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 208, Positive cache size: 208, Positive conditional cache size: 202, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 209, Positive cache size: 209, Positive conditional cache size: 203, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 212, Positive cache size: 212, Positive conditional cache size: 206, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 213, Positive cache size: 213, Positive conditional cache size: 207, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 216, Positive cache size: 216, Positive conditional cache size: 210, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 217, Positive cache size: 217, Positive conditional cache size: 211, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 220, Positive cache size: 220, Positive conditional cache size: 214, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 221, Positive cache size: 221, Positive conditional cache size: 215, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 224, Positive cache size: 224, Positive conditional cache size: 218, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 225, Positive cache size: 225, Positive conditional cache size: 219, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 228, Positive cache size: 228, Positive conditional cache size: 222, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 229, Positive cache size: 229, Positive conditional cache size: 223, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 232, Positive cache size: 232, Positive conditional cache size: 226, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 233, Positive cache size: 233, Positive conditional cache size: 227, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 236, Positive cache size: 236, Positive conditional cache size: 230, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 237, Positive cache size: 237, Positive conditional cache size: 231, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 240, Positive cache size: 240, Positive conditional cache size: 234, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 241, Positive cache size: 241, Positive conditional cache size: 235, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 244, Positive cache size: 244, Positive conditional cache size: 238, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 245, Positive cache size: 245, Positive conditional cache size: 239, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 248, Positive cache size: 248, Positive conditional cache size: 242, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 249, Positive cache size: 249, Positive conditional cache size: 243, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 252, Positive cache size: 252, Positive conditional cache size: 246, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 253, Positive cache size: 253, Positive conditional cache size: 247, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 256, Positive cache size: 256, Positive conditional cache size: 250, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 257, Positive cache size: 257, Positive conditional cache size: 251, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 260, Positive cache size: 260, Positive conditional cache size: 254, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 261, Positive cache size: 261, Positive conditional cache size: 255, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 264, Positive cache size: 264, Positive conditional cache size: 258, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 265, Positive cache size: 265, Positive conditional cache size: 259, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 268, Positive cache size: 268, Positive conditional cache size: 262, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 269, Positive cache size: 269, Positive conditional cache size: 263, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 272, Positive cache size: 272, Positive conditional cache size: 266, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 273, Positive cache size: 273, Positive conditional cache size: 267, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 276, Positive cache size: 276, Positive conditional cache size: 270, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 277, Positive cache size: 277, Positive conditional cache size: 271, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 280, Positive cache size: 280, Positive conditional cache size: 274, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 281, Positive cache size: 281, Positive conditional cache size: 275, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 284, Positive cache size: 284, Positive conditional cache size: 278, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 285, Positive cache size: 285, Positive conditional cache size: 279, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 288, Positive cache size: 288, Positive conditional cache size: 282, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 289, Positive cache size: 289, Positive conditional cache size: 283, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 292, Positive cache size: 292, Positive conditional cache size: 286, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 293, Positive cache size: 293, Positive conditional cache size: 287, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 296, Positive cache size: 296, Positive conditional cache size: 290, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 297, Positive cache size: 297, Positive conditional cache size: 291, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 300, Positive cache size: 300, Positive conditional cache size: 294, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 301, Positive cache size: 301, Positive conditional cache size: 295, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 304, Positive cache size: 304, Positive conditional cache size: 298, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 305, Positive cache size: 305, Positive conditional cache size: 299, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 308, Positive cache size: 308, Positive conditional cache size: 302, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 309, Positive cache size: 309, Positive conditional cache size: 303, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 312, Positive cache size: 312, Positive conditional cache size: 306, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 313, Positive cache size: 313, Positive conditional cache size: 307, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 316, Positive cache size: 316, Positive conditional cache size: 310, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 317, Positive cache size: 317, Positive conditional cache size: 311, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 320, Positive cache size: 320, Positive conditional cache size: 314, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 321, Positive cache size: 321, Positive conditional cache size: 315, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 324, Positive cache size: 324, Positive conditional cache size: 318, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 325, Positive cache size: 325, Positive conditional cache size: 319, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 328, Positive cache size: 328, Positive conditional cache size: 322, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 329, Positive cache size: 329, Positive conditional cache size: 323, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 332, Positive cache size: 332, Positive conditional cache size: 326, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 333, Positive cache size: 333, Positive conditional cache size: 327, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 336, Positive cache size: 336, Positive conditional cache size: 330, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 337, Positive cache size: 337, Positive conditional cache size: 331, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 340, Positive cache size: 340, Positive conditional cache size: 334, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 341, Positive cache size: 341, Positive conditional cache size: 335, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 344, Positive cache size: 344, Positive conditional cache size: 338, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 345, Positive cache size: 345, Positive conditional cache size: 339, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 348, Positive cache size: 348, Positive conditional cache size: 342, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 349, Positive cache size: 349, Positive conditional cache size: 343, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 352, Positive cache size: 352, Positive conditional cache size: 346, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 353, Positive cache size: 353, Positive conditional cache size: 347, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 356, Positive cache size: 356, Positive conditional cache size: 350, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 357, Positive cache size: 357, Positive conditional cache size: 351, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 360, Positive cache size: 360, Positive conditional cache size: 354, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 361, Positive cache size: 361, Positive conditional cache size: 355, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 364, Positive cache size: 364, Positive conditional cache size: 358, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 365, Positive cache size: 365, Positive conditional cache size: 359, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 368, Positive cache size: 368, Positive conditional cache size: 362, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 369, Positive cache size: 369, Positive conditional cache size: 363, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 372, Positive cache size: 372, Positive conditional cache size: 366, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 373, Positive cache size: 373, Positive conditional cache size: 367, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 376, Positive cache size: 376, Positive conditional cache size: 370, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 377, Positive cache size: 377, Positive conditional cache size: 371, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 380, Positive cache size: 380, Positive conditional cache size: 374, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 381, Positive cache size: 381, Positive conditional cache size: 375, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 384, Positive cache size: 384, Positive conditional cache size: 378, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 385, Positive cache size: 385, Positive conditional cache size: 379, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 388, Positive cache size: 388, Positive conditional cache size: 382, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 389, Positive cache size: 389, Positive conditional cache size: 383, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 392, Positive cache size: 392, Positive conditional cache size: 386, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 393, Positive cache size: 393, Positive conditional cache size: 387, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 396, Positive cache size: 396, Positive conditional cache size: 390, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 397, Positive cache size: 397, Positive conditional cache size: 391, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 400, Positive cache size: 400, Positive conditional cache size: 394, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 401, Positive cache size: 401, Positive conditional cache size: 395, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 404, Positive cache size: 404, Positive conditional cache size: 398, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 405, Positive cache size: 405, Positive conditional cache size: 399, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 408, Positive cache size: 408, Positive conditional cache size: 402, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 409, Positive cache size: 409, Positive conditional cache size: 403, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 412, Positive cache size: 412, Positive conditional cache size: 406, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 413, Positive cache size: 413, Positive conditional cache size: 407, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 416, Positive cache size: 416, Positive conditional cache size: 410, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 417, Positive cache size: 417, Positive conditional cache size: 411, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 420, Positive cache size: 420, Positive conditional cache size: 414, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 421, Positive cache size: 421, Positive conditional cache size: 415, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 424, Positive cache size: 424, Positive conditional cache size: 418, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 425, Positive cache size: 425, Positive conditional cache size: 419, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 428, Positive cache size: 428, Positive conditional cache size: 422, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 429, Positive cache size: 429, Positive conditional cache size: 423, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 432, Positive cache size: 432, Positive conditional cache size: 426, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 433, Positive cache size: 433, Positive conditional cache size: 427, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 436, Positive cache size: 436, Positive conditional cache size: 430, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 437, Positive cache size: 437, Positive conditional cache size: 431, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 440, Positive cache size: 440, Positive conditional cache size: 434, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 441, Positive cache size: 441, Positive conditional cache size: 435, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 444, Positive cache size: 444, Positive conditional cache size: 438, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 445, Positive cache size: 445, Positive conditional cache size: 439, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 448, Positive cache size: 448, Positive conditional cache size: 442, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 449, Positive cache size: 449, Positive conditional cache size: 443, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 452, Positive cache size: 452, Positive conditional cache size: 446, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 453, Positive cache size: 453, Positive conditional cache size: 447, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 456, Positive cache size: 456, Positive conditional cache size: 450, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 457, Positive cache size: 457, Positive conditional cache size: 451, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 460, Positive cache size: 460, Positive conditional cache size: 454, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 461, Positive cache size: 461, Positive conditional cache size: 455, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 464, Positive cache size: 464, Positive conditional cache size: 458, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 465, Positive cache size: 465, Positive conditional cache size: 459, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 468, Positive cache size: 468, Positive conditional cache size: 462, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 469, Positive cache size: 469, Positive conditional cache size: 463, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 472, Positive cache size: 472, Positive conditional cache size: 466, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 473, Positive cache size: 473, Positive conditional cache size: 467, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 476, Positive cache size: 476, Positive conditional cache size: 470, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 477, Positive cache size: 477, Positive conditional cache size: 471, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 480, Positive cache size: 480, Positive conditional cache size: 474, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 481, Positive cache size: 481, Positive conditional cache size: 475, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 484, Positive cache size: 484, Positive conditional cache size: 478, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 485, Positive cache size: 485, Positive conditional cache size: 479, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 488, Positive cache size: 488, Positive conditional cache size: 482, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 489, Positive cache size: 489, Positive conditional cache size: 483, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 492, Positive cache size: 492, Positive conditional cache size: 486, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 493, Positive cache size: 493, Positive conditional cache size: 487, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 496, Positive cache size: 496, Positive conditional cache size: 490, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 497, Positive cache size: 497, Positive conditional cache size: 491, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 500, Positive cache size: 500, Positive conditional cache size: 494, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 501, Positive cache size: 501, Positive conditional cache size: 495, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 504, Positive cache size: 504, Positive conditional cache size: 498, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 505, Positive cache size: 505, Positive conditional cache size: 499, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 508, Positive cache size: 508, Positive conditional cache size: 502, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 509, Positive cache size: 509, Positive conditional cache size: 503, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 512, Positive cache size: 512, Positive conditional cache size: 506, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 513, Positive cache size: 513, Positive conditional cache size: 507, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 516, Positive cache size: 516, Positive conditional cache size: 510, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 517, Positive cache size: 517, Positive conditional cache size: 511, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 520, Positive cache size: 520, Positive conditional cache size: 514, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 521, Positive cache size: 521, Positive conditional cache size: 515, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 524, Positive cache size: 524, Positive conditional cache size: 518, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 525, Positive cache size: 525, Positive conditional cache size: 519, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 528, Positive cache size: 528, Positive conditional cache size: 522, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 529, Positive cache size: 529, Positive conditional cache size: 523, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 532, Positive cache size: 532, Positive conditional cache size: 526, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 533, Positive cache size: 533, Positive conditional cache size: 527, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 536, Positive cache size: 536, Positive conditional cache size: 530, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 537, Positive cache size: 537, Positive conditional cache size: 531, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 540, Positive cache size: 540, Positive conditional cache size: 534, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 541, Positive cache size: 541, Positive conditional cache size: 535, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 544, Positive cache size: 544, Positive conditional cache size: 538, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 545, Positive cache size: 545, Positive conditional cache size: 539, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 548, Positive cache size: 548, Positive conditional cache size: 542, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 549, Positive cache size: 549, Positive conditional cache size: 543, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 552, Positive cache size: 552, Positive conditional cache size: 546, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 553, Positive cache size: 553, Positive conditional cache size: 547, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 556, Positive cache size: 556, Positive conditional cache size: 550, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 557, Positive cache size: 557, Positive conditional cache size: 551, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 560, Positive cache size: 560, Positive conditional cache size: 554, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 561, Positive cache size: 561, Positive conditional cache size: 555, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 564, Positive cache size: 564, Positive conditional cache size: 558, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 565, Positive cache size: 565, Positive conditional cache size: 559, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 568, Positive cache size: 568, Positive conditional cache size: 562, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 569, Positive cache size: 569, Positive conditional cache size: 563, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 572, Positive cache size: 572, Positive conditional cache size: 566, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 573, Positive cache size: 573, Positive conditional cache size: 567, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 576, Positive cache size: 576, Positive conditional cache size: 570, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 577, Positive cache size: 577, Positive conditional cache size: 571, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 580, Positive cache size: 580, Positive conditional cache size: 574, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 581, Positive cache size: 581, Positive conditional cache size: 575, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 584, Positive cache size: 584, Positive conditional cache size: 578, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 585, Positive cache size: 585, Positive conditional cache size: 579, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 588, Positive cache size: 588, Positive conditional cache size: 582, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 589, Positive cache size: 589, Positive conditional cache size: 583, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 592, Positive cache size: 592, Positive conditional cache size: 586, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 593, Positive cache size: 593, Positive conditional cache size: 587, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 596, Positive cache size: 596, Positive conditional cache size: 590, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 597, Positive cache size: 597, Positive conditional cache size: 591, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 600, Positive cache size: 600, Positive conditional cache size: 594, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 601, Positive cache size: 601, Positive conditional cache size: 595, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 604, Positive cache size: 604, Positive conditional cache size: 598, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 605, Positive cache size: 605, Positive conditional cache size: 599, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 608, Positive cache size: 608, Positive conditional cache size: 602, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 609, Positive cache size: 609, Positive conditional cache size: 603, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 612, Positive cache size: 612, Positive conditional cache size: 606, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 613, Positive cache size: 613, Positive conditional cache size: 607, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 616, Positive cache size: 616, Positive conditional cache size: 610, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 617, Positive cache size: 617, Positive conditional cache size: 611, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 620, Positive cache size: 620, Positive conditional cache size: 614, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 621, Positive cache size: 621, Positive conditional cache size: 615, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 624, Positive cache size: 624, Positive conditional cache size: 618, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 625, Positive cache size: 625, Positive conditional cache size: 619, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 628, Positive cache size: 628, Positive conditional cache size: 622, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 629, Positive cache size: 629, Positive conditional cache size: 623, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 632, Positive cache size: 632, Positive conditional cache size: 626, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 633, Positive cache size: 633, Positive conditional cache size: 627, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 636, Positive cache size: 636, Positive conditional cache size: 630, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 637, Positive cache size: 637, Positive conditional cache size: 631, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 640, Positive cache size: 640, Positive conditional cache size: 634, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 641, Positive cache size: 641, Positive conditional cache size: 635, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 644, Positive cache size: 644, Positive conditional cache size: 638, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 645, Positive cache size: 645, Positive conditional cache size: 639, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 648, Positive cache size: 648, Positive conditional cache size: 642, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 649, Positive cache size: 649, Positive conditional cache size: 643, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 652, Positive cache size: 652, Positive conditional cache size: 646, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 653, Positive cache size: 653, Positive conditional cache size: 647, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 656, Positive cache size: 656, Positive conditional cache size: 650, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 657, Positive cache size: 657, Positive conditional cache size: 651, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 660, Positive cache size: 660, Positive conditional cache size: 654, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 661, Positive cache size: 661, Positive conditional cache size: 655, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 664, Positive cache size: 664, Positive conditional cache size: 658, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 665, Positive cache size: 665, Positive conditional cache size: 659, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 668, Positive cache size: 668, Positive conditional cache size: 662, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 669, Positive cache size: 669, Positive conditional cache size: 663, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 672, Positive cache size: 672, Positive conditional cache size: 666, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 673, Positive cache size: 673, Positive conditional cache size: 667, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 676, Positive cache size: 676, Positive conditional cache size: 670, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 677, Positive cache size: 677, Positive conditional cache size: 671, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 680, Positive cache size: 680, Positive conditional cache size: 674, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 681, Positive cache size: 681, Positive conditional cache size: 675, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 684, Positive cache size: 684, Positive conditional cache size: 678, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 685, Positive cache size: 685, Positive conditional cache size: 679, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 688, Positive cache size: 688, Positive conditional cache size: 682, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 689, Positive cache size: 689, Positive conditional cache size: 683, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 692, Positive cache size: 692, Positive conditional cache size: 686, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 693, Positive cache size: 693, Positive conditional cache size: 687, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 696, Positive cache size: 696, Positive conditional cache size: 690, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 697, Positive cache size: 697, Positive conditional cache size: 691, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 700, Positive cache size: 700, Positive conditional cache size: 694, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 701, Positive cache size: 701, Positive conditional cache size: 695, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 704, Positive cache size: 704, Positive conditional cache size: 698, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 705, Positive cache size: 705, Positive conditional cache size: 699, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 708, Positive cache size: 708, Positive conditional cache size: 702, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 709, Positive cache size: 709, Positive conditional cache size: 703, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 712, Positive cache size: 712, Positive conditional cache size: 706, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 713, Positive cache size: 713, Positive conditional cache size: 707, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 716, Positive cache size: 716, Positive conditional cache size: 710, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 717, Positive cache size: 717, Positive conditional cache size: 711, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 720, Positive cache size: 720, Positive conditional cache size: 714, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 721, Positive cache size: 721, Positive conditional cache size: 715, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 724, Positive cache size: 724, Positive conditional cache size: 718, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 725, Positive cache size: 725, Positive conditional cache size: 719, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 728, Positive cache size: 728, Positive conditional cache size: 722, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 729, Positive cache size: 729, Positive conditional cache size: 723, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 732, Positive cache size: 732, Positive conditional cache size: 726, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 733, Positive cache size: 733, Positive conditional cache size: 727, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 736, Positive cache size: 736, Positive conditional cache size: 730, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 737, Positive cache size: 737, Positive conditional cache size: 731, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 740, Positive cache size: 740, Positive conditional cache size: 734, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 741, Positive cache size: 741, Positive conditional cache size: 735, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 744, Positive cache size: 744, Positive conditional cache size: 738, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 745, Positive cache size: 745, Positive conditional cache size: 739, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 748, Positive cache size: 748, Positive conditional cache size: 742, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 749, Positive cache size: 749, Positive conditional cache size: 743, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 752, Positive cache size: 752, Positive conditional cache size: 746, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 753, Positive cache size: 753, Positive conditional cache size: 747, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 756, Positive cache size: 756, Positive conditional cache size: 750, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 757, Positive cache size: 757, Positive conditional cache size: 751, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 760, Positive cache size: 760, Positive conditional cache size: 754, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 761, Positive cache size: 761, Positive conditional cache size: 755, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 764, Positive cache size: 764, Positive conditional cache size: 758, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 765, Positive cache size: 765, Positive conditional cache size: 759, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 768, Positive cache size: 768, Positive conditional cache size: 762, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 769, Positive cache size: 769, Positive conditional cache size: 763, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 772, Positive cache size: 772, Positive conditional cache size: 766, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 773, Positive cache size: 773, Positive conditional cache size: 767, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 776, Positive cache size: 776, Positive conditional cache size: 770, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 777, Positive cache size: 777, Positive conditional cache size: 771, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 780, Positive cache size: 780, Positive conditional cache size: 774, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 781, Positive cache size: 781, Positive conditional cache size: 775, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 784, Positive cache size: 784, Positive conditional cache size: 778, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 785, Positive cache size: 785, Positive conditional cache size: 779, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 788, Positive cache size: 788, Positive conditional cache size: 782, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 789, Positive cache size: 789, Positive conditional cache size: 783, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 792, Positive cache size: 792, Positive conditional cache size: 786, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 793, Positive cache size: 793, Positive conditional cache size: 787, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 796, Positive cache size: 796, Positive conditional cache size: 790, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 797, Positive cache size: 797, Positive conditional cache size: 791, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 800, Positive cache size: 800, Positive conditional cache size: 794, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 801, Positive cache size: 801, Positive conditional cache size: 795, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 804, Positive cache size: 804, Positive conditional cache size: 798, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 805, Positive cache size: 805, Positive conditional cache size: 799, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 808, Positive cache size: 808, Positive conditional cache size: 802, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 809, Positive cache size: 809, Positive conditional cache size: 803, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 812, Positive cache size: 812, Positive conditional cache size: 806, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 813, Positive cache size: 813, Positive conditional cache size: 807, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 816, Positive cache size: 816, Positive conditional cache size: 810, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 817, Positive cache size: 817, Positive conditional cache size: 811, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 820, Positive cache size: 820, Positive conditional cache size: 814, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 821, Positive cache size: 821, Positive conditional cache size: 815, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 824, Positive cache size: 824, Positive conditional cache size: 818, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 825, Positive cache size: 825, Positive conditional cache size: 819, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 828, Positive cache size: 828, Positive conditional cache size: 822, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 829, Positive cache size: 829, Positive conditional cache size: 823, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 832, Positive cache size: 832, Positive conditional cache size: 826, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 833, Positive cache size: 833, Positive conditional cache size: 827, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 836, Positive cache size: 836, Positive conditional cache size: 830, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 837, Positive cache size: 837, Positive conditional cache size: 831, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 840, Positive cache size: 840, Positive conditional cache size: 834, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 841, Positive cache size: 841, Positive conditional cache size: 835, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 844, Positive cache size: 844, Positive conditional cache size: 838, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 845, Positive cache size: 845, Positive conditional cache size: 839, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 848, Positive cache size: 848, Positive conditional cache size: 842, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 849, Positive cache size: 849, Positive conditional cache size: 843, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 852, Positive cache size: 852, Positive conditional cache size: 846, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 853, Positive cache size: 853, Positive conditional cache size: 847, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 856, Positive cache size: 856, Positive conditional cache size: 850, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 857, Positive cache size: 857, Positive conditional cache size: 851, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 860, Positive cache size: 860, Positive conditional cache size: 854, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 861, Positive cache size: 861, Positive conditional cache size: 855, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 864, Positive cache size: 864, Positive conditional cache size: 858, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 865, Positive cache size: 865, Positive conditional cache size: 859, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 868, Positive cache size: 868, Positive conditional cache size: 862, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 869, Positive cache size: 869, Positive conditional cache size: 863, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 872, Positive cache size: 872, Positive conditional cache size: 866, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 873, Positive cache size: 873, Positive conditional cache size: 867, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 876, Positive cache size: 876, Positive conditional cache size: 870, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 877, Positive cache size: 877, Positive conditional cache size: 871, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 880, Positive cache size: 880, Positive conditional cache size: 874, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 881, Positive cache size: 881, Positive conditional cache size: 875, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 884, Positive cache size: 884, Positive conditional cache size: 878, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 885, Positive cache size: 885, Positive conditional cache size: 879, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 888, Positive cache size: 888, Positive conditional cache size: 882, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 889, Positive cache size: 889, Positive conditional cache size: 883, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 892, Positive cache size: 892, Positive conditional cache size: 886, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 893, Positive cache size: 893, Positive conditional cache size: 887, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 896, Positive cache size: 896, Positive conditional cache size: 890, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 897, Positive cache size: 897, Positive conditional cache size: 891, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 900, Positive cache size: 900, Positive conditional cache size: 894, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 901, Positive cache size: 901, Positive conditional cache size: 895, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 904, Positive cache size: 904, Positive conditional cache size: 898, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 905, Positive cache size: 905, Positive conditional cache size: 899, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 908, Positive cache size: 908, Positive conditional cache size: 902, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 909, Positive cache size: 909, Positive conditional cache size: 903, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 912, Positive cache size: 912, Positive conditional cache size: 906, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 913, Positive cache size: 913, Positive conditional cache size: 907, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 916, Positive cache size: 916, Positive conditional cache size: 910, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 917, Positive cache size: 917, Positive conditional cache size: 911, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 920, Positive cache size: 920, Positive conditional cache size: 914, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 921, Positive cache size: 921, Positive conditional cache size: 915, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 924, Positive cache size: 924, Positive conditional cache size: 918, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 925, Positive cache size: 925, Positive conditional cache size: 919, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 928, Positive cache size: 928, Positive conditional cache size: 922, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 929, Positive cache size: 929, Positive conditional cache size: 923, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 932, Positive cache size: 932, Positive conditional cache size: 926, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 933, Positive cache size: 933, Positive conditional cache size: 927, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 936, Positive cache size: 936, Positive conditional cache size: 930, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 937, Positive cache size: 937, Positive conditional cache size: 931, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 940, Positive cache size: 940, Positive conditional cache size: 934, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 941, Positive cache size: 941, Positive conditional cache size: 935, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 944, Positive cache size: 944, Positive conditional cache size: 938, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 945, Positive cache size: 945, Positive conditional cache size: 939, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 948, Positive cache size: 948, Positive conditional cache size: 942, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 949, Positive cache size: 949, Positive conditional cache size: 943, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 952, Positive cache size: 952, Positive conditional cache size: 946, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 953, Positive cache size: 953, Positive conditional cache size: 947, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 956, Positive cache size: 956, Positive conditional cache size: 950, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 957, Positive cache size: 957, Positive conditional cache size: 951, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 960, Positive cache size: 960, Positive conditional cache size: 954, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 961, Positive cache size: 961, Positive conditional cache size: 955, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 964, Positive cache size: 964, Positive conditional cache size: 958, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 965, Positive cache size: 965, Positive conditional cache size: 959, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 968, Positive cache size: 968, Positive conditional cache size: 962, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 969, Positive cache size: 969, Positive conditional cache size: 963, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 972, Positive cache size: 972, Positive conditional cache size: 966, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 973, Positive cache size: 973, Positive conditional cache size: 967, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 976, Positive cache size: 976, Positive conditional cache size: 970, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 977, Positive cache size: 977, Positive conditional cache size: 971, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 980, Positive cache size: 980, Positive conditional cache size: 974, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 981, Positive cache size: 981, Positive conditional cache size: 975, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 984, Positive cache size: 984, Positive conditional cache size: 978, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 985, Positive cache size: 985, Positive conditional cache size: 979, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 988, Positive cache size: 988, Positive conditional cache size: 982, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 989, Positive cache size: 989, Positive conditional cache size: 983, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 992, Positive cache size: 992, Positive conditional cache size: 986, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 993, Positive cache size: 993, Positive conditional cache size: 987, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 996, Positive cache size: 996, Positive conditional cache size: 990, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 997, Positive cache size: 997, Positive conditional cache size: 991, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1000, Positive cache size: 1000, Positive conditional cache size: 994, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1001, Positive cache size: 1001, Positive conditional cache size: 995, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1004, Positive cache size: 1004, Positive conditional cache size: 998, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1005, Positive cache size: 1005, Positive conditional cache size: 999, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1008, Positive cache size: 1008, Positive conditional cache size: 1002, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1009, Positive cache size: 1009, Positive conditional cache size: 1003, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1012, Positive cache size: 1012, Positive conditional cache size: 1006, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1013, Positive cache size: 1013, Positive conditional cache size: 1007, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1016, Positive cache size: 1016, Positive conditional cache size: 1010, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1017, Positive cache size: 1017, Positive conditional cache size: 1011, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1020, Positive cache size: 1020, Positive conditional cache size: 1014, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1021, Positive cache size: 1021, Positive conditional cache size: 1015, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1024, Positive cache size: 1024, Positive conditional cache size: 1018, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1025, Positive cache size: 1025, Positive conditional cache size: 1019, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1028, Positive cache size: 1028, Positive conditional cache size: 1022, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1029, Positive cache size: 1029, Positive conditional cache size: 1023, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1032, Positive cache size: 1032, Positive conditional cache size: 1026, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1033, Positive cache size: 1033, Positive conditional cache size: 1027, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1036, Positive cache size: 1036, Positive conditional cache size: 1030, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1037, Positive cache size: 1037, Positive conditional cache size: 1031, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1040, Positive cache size: 1040, Positive conditional cache size: 1034, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1041, Positive cache size: 1041, Positive conditional cache size: 1035, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1044, Positive cache size: 1044, Positive conditional cache size: 1038, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1045, Positive cache size: 1045, Positive conditional cache size: 1039, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1048, Positive cache size: 1048, Positive conditional cache size: 1042, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1049, Positive cache size: 1049, Positive conditional cache size: 1043, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1052, Positive cache size: 1052, Positive conditional cache size: 1046, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1053, Positive cache size: 1053, Positive conditional cache size: 1047, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1056, Positive cache size: 1056, Positive conditional cache size: 1050, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1057, Positive cache size: 1057, Positive conditional cache size: 1051, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1060, Positive cache size: 1060, Positive conditional cache size: 1054, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1061, Positive cache size: 1061, Positive conditional cache size: 1055, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1064, Positive cache size: 1064, Positive conditional cache size: 1058, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1065, Positive cache size: 1065, Positive conditional cache size: 1059, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1068, Positive cache size: 1068, Positive conditional cache size: 1062, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1069, Positive cache size: 1069, Positive conditional cache size: 1063, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1072, Positive cache size: 1072, Positive conditional cache size: 1066, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1073, Positive cache size: 1073, Positive conditional cache size: 1067, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1076, Positive cache size: 1076, Positive conditional cache size: 1070, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1077, Positive cache size: 1077, Positive conditional cache size: 1071, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1080, Positive cache size: 1080, Positive conditional cache size: 1074, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1081, Positive cache size: 1081, Positive conditional cache size: 1075, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1084, Positive cache size: 1084, Positive conditional cache size: 1078, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1085, Positive cache size: 1085, Positive conditional cache size: 1079, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1088, Positive cache size: 1088, Positive conditional cache size: 1082, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1089, Positive cache size: 1089, Positive conditional cache size: 1083, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1092, Positive cache size: 1092, Positive conditional cache size: 1086, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1093, Positive cache size: 1093, Positive conditional cache size: 1087, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1096, Positive cache size: 1096, Positive conditional cache size: 1090, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1097, Positive cache size: 1097, Positive conditional cache size: 1091, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1100, Positive cache size: 1100, Positive conditional cache size: 1094, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1101, Positive cache size: 1101, Positive conditional cache size: 1095, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1104, Positive cache size: 1104, Positive conditional cache size: 1098, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1105, Positive cache size: 1105, Positive conditional cache size: 1099, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1108, Positive cache size: 1108, Positive conditional cache size: 1102, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1109, Positive cache size: 1109, Positive conditional cache size: 1103, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1112, Positive cache size: 1112, Positive conditional cache size: 1106, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1113, Positive cache size: 1113, Positive conditional cache size: 1107, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1116, Positive cache size: 1116, Positive conditional cache size: 1110, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1117, Positive cache size: 1117, Positive conditional cache size: 1111, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1120, Positive cache size: 1120, Positive conditional cache size: 1114, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1121, Positive cache size: 1121, Positive conditional cache size: 1115, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1124, Positive cache size: 1124, Positive conditional cache size: 1118, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1125, Positive cache size: 1125, Positive conditional cache size: 1119, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1128, Positive cache size: 1128, Positive conditional cache size: 1122, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1129, Positive cache size: 1129, Positive conditional cache size: 1123, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1132, Positive cache size: 1132, Positive conditional cache size: 1126, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1133, Positive cache size: 1133, Positive conditional cache size: 1127, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1136, Positive cache size: 1136, Positive conditional cache size: 1130, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1137, Positive cache size: 1137, Positive conditional cache size: 1131, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1140, Positive cache size: 1140, Positive conditional cache size: 1134, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1141, Positive cache size: 1141, Positive conditional cache size: 1135, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1144, Positive cache size: 1144, Positive conditional cache size: 1138, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1145, Positive cache size: 1145, Positive conditional cache size: 1139, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1148, Positive cache size: 1148, Positive conditional cache size: 1142, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1149, Positive cache size: 1149, Positive conditional cache size: 1143, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1152, Positive cache size: 1152, Positive conditional cache size: 1146, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1153, Positive cache size: 1153, Positive conditional cache size: 1147, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1156, Positive cache size: 1156, Positive conditional cache size: 1150, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1157, Positive cache size: 1157, Positive conditional cache size: 1151, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1160, Positive cache size: 1160, Positive conditional cache size: 1154, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1161, Positive cache size: 1161, Positive conditional cache size: 1155, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1164, Positive cache size: 1164, Positive conditional cache size: 1158, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1165, Positive cache size: 1165, Positive conditional cache size: 1159, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1168, Positive cache size: 1168, Positive conditional cache size: 1162, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1169, Positive cache size: 1169, Positive conditional cache size: 1163, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1172, Positive cache size: 1172, Positive conditional cache size: 1166, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1173, Positive cache size: 1173, Positive conditional cache size: 1167, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1176, Positive cache size: 1176, Positive conditional cache size: 1170, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1177, Positive cache size: 1177, Positive conditional cache size: 1171, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1180, Positive cache size: 1180, Positive conditional cache size: 1174, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1181, Positive cache size: 1181, Positive conditional cache size: 1175, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1184, Positive cache size: 1184, Positive conditional cache size: 1178, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1185, Positive cache size: 1185, Positive conditional cache size: 1179, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1188, Positive cache size: 1188, Positive conditional cache size: 1182, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1189, Positive cache size: 1189, Positive conditional cache size: 1183, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1192, Positive cache size: 1192, Positive conditional cache size: 1186, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1193, Positive cache size: 1193, Positive conditional cache size: 1187, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1196, Positive cache size: 1196, Positive conditional cache size: 1190, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1197, Positive cache size: 1197, Positive conditional cache size: 1191, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1200, Positive cache size: 1200, Positive conditional cache size: 1194, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1201, Positive cache size: 1201, Positive conditional cache size: 1195, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1204, Positive cache size: 1204, Positive conditional cache size: 1198, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1205, Positive cache size: 1205, Positive conditional cache size: 1199, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1208, Positive cache size: 1208, Positive conditional cache size: 1202, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1209, Positive cache size: 1209, Positive conditional cache size: 1203, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1212, Positive cache size: 1212, Positive conditional cache size: 1206, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1213, Positive cache size: 1213, Positive conditional cache size: 1207, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1216, Positive cache size: 1216, Positive conditional cache size: 1210, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1217, Positive cache size: 1217, Positive conditional cache size: 1211, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1220, Positive cache size: 1220, Positive conditional cache size: 1214, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1221, Positive cache size: 1221, Positive conditional cache size: 1215, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1224, Positive cache size: 1224, Positive conditional cache size: 1218, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1225, Positive cache size: 1225, Positive conditional cache size: 1219, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1228, Positive cache size: 1228, Positive conditional cache size: 1222, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1229, Positive cache size: 1229, Positive conditional cache size: 1223, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1232, Positive cache size: 1232, Positive conditional cache size: 1226, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1233, Positive cache size: 1233, Positive conditional cache size: 1227, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1236, Positive cache size: 1236, Positive conditional cache size: 1230, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1237, Positive cache size: 1237, Positive conditional cache size: 1231, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1240, Positive cache size: 1240, Positive conditional cache size: 1234, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1241, Positive cache size: 1241, Positive conditional cache size: 1235, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1244, Positive cache size: 1244, Positive conditional cache size: 1238, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1245, Positive cache size: 1245, Positive conditional cache size: 1239, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1248, Positive cache size: 1248, Positive conditional cache size: 1242, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1249, Positive cache size: 1249, Positive conditional cache size: 1243, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1252, Positive cache size: 1252, Positive conditional cache size: 1246, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1253, Positive cache size: 1253, Positive conditional cache size: 1247, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1256, Positive cache size: 1256, Positive conditional cache size: 1250, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1257, Positive cache size: 1257, Positive conditional cache size: 1251, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1260, Positive cache size: 1260, Positive conditional cache size: 1254, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1261, Positive cache size: 1261, Positive conditional cache size: 1255, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1264, Positive cache size: 1264, Positive conditional cache size: 1258, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1265, Positive cache size: 1265, Positive conditional cache size: 1259, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1268, Positive cache size: 1268, Positive conditional cache size: 1262, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1269, Positive cache size: 1269, Positive conditional cache size: 1263, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1272, Positive cache size: 1272, Positive conditional cache size: 1266, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1273, Positive cache size: 1273, Positive conditional cache size: 1267, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1276, Positive cache size: 1276, Positive conditional cache size: 1270, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1277, Positive cache size: 1277, Positive conditional cache size: 1271, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1280, Positive cache size: 1280, Positive conditional cache size: 1274, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1281, Positive cache size: 1281, Positive conditional cache size: 1275, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1284, Positive cache size: 1284, Positive conditional cache size: 1278, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1285, Positive cache size: 1285, Positive conditional cache size: 1279, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1288, Positive cache size: 1288, Positive conditional cache size: 1282, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1289, Positive cache size: 1289, Positive conditional cache size: 1283, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1292, Positive cache size: 1292, Positive conditional cache size: 1286, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1293, Positive cache size: 1293, Positive conditional cache size: 1287, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1296, Positive cache size: 1296, Positive conditional cache size: 1290, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1297, Positive cache size: 1297, Positive conditional cache size: 1291, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1300, Positive cache size: 1300, Positive conditional cache size: 1294, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1301, Positive cache size: 1301, Positive conditional cache size: 1295, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1304, Positive cache size: 1304, Positive conditional cache size: 1298, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1305, Positive cache size: 1305, Positive conditional cache size: 1299, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1308, Positive cache size: 1308, Positive conditional cache size: 1302, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1309, Positive cache size: 1309, Positive conditional cache size: 1303, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1312, Positive cache size: 1312, Positive conditional cache size: 1306, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1313, Positive cache size: 1313, Positive conditional cache size: 1307, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1316, Positive cache size: 1316, Positive conditional cache size: 1310, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1317, Positive cache size: 1317, Positive conditional cache size: 1311, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1320, Positive cache size: 1320, Positive conditional cache size: 1314, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1321, Positive cache size: 1321, Positive conditional cache size: 1315, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1324, Positive cache size: 1324, Positive conditional cache size: 1318, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1325, Positive cache size: 1325, Positive conditional cache size: 1319, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1328, Positive cache size: 1328, Positive conditional cache size: 1322, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1329, Positive cache size: 1329, Positive conditional cache size: 1323, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1332, Positive cache size: 1332, Positive conditional cache size: 1326, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1333, Positive cache size: 1333, Positive conditional cache size: 1327, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1336, Positive cache size: 1336, Positive conditional cache size: 1330, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1337, Positive cache size: 1337, Positive conditional cache size: 1331, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1340, Positive cache size: 1340, Positive conditional cache size: 1334, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1341, Positive cache size: 1341, Positive conditional cache size: 1335, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1344, Positive cache size: 1344, Positive conditional cache size: 1338, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1345, Positive cache size: 1345, Positive conditional cache size: 1339, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1348, Positive cache size: 1348, Positive conditional cache size: 1342, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1349, Positive cache size: 1349, Positive conditional cache size: 1343, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1352, Positive cache size: 1352, Positive conditional cache size: 1346, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1353, Positive cache size: 1353, Positive conditional cache size: 1347, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1356, Positive cache size: 1356, Positive conditional cache size: 1350, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1357, Positive cache size: 1357, Positive conditional cache size: 1351, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1360, Positive cache size: 1360, Positive conditional cache size: 1354, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1361, Positive cache size: 1361, Positive conditional cache size: 1355, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1364, Positive cache size: 1364, Positive conditional cache size: 1358, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1365, Positive cache size: 1365, Positive conditional cache size: 1359, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1368, Positive cache size: 1368, Positive conditional cache size: 1362, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1369, Positive cache size: 1369, Positive conditional cache size: 1363, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1372, Positive cache size: 1372, Positive conditional cache size: 1366, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1373, Positive cache size: 1373, Positive conditional cache size: 1367, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1376, Positive cache size: 1376, Positive conditional cache size: 1370, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1377, Positive cache size: 1377, Positive conditional cache size: 1371, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1380, Positive cache size: 1380, Positive conditional cache size: 1374, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1381, Positive cache size: 1381, Positive conditional cache size: 1375, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1384, Positive cache size: 1384, Positive conditional cache size: 1378, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1385, Positive cache size: 1385, Positive conditional cache size: 1379, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1388, Positive cache size: 1388, Positive conditional cache size: 1382, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1389, Positive cache size: 1389, Positive conditional cache size: 1383, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1392, Positive cache size: 1392, Positive conditional cache size: 1386, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1393, Positive cache size: 1393, Positive conditional cache size: 1387, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1396, Positive cache size: 1396, Positive conditional cache size: 1390, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1397, Positive cache size: 1397, Positive conditional cache size: 1391, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1400, Positive cache size: 1400, Positive conditional cache size: 1394, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1401, Positive cache size: 1401, Positive conditional cache size: 1395, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1404, Positive cache size: 1404, Positive conditional cache size: 1398, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1405, Positive cache size: 1405, Positive conditional cache size: 1399, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1408, Positive cache size: 1408, Positive conditional cache size: 1402, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1409, Positive cache size: 1409, Positive conditional cache size: 1403, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1412, Positive cache size: 1412, Positive conditional cache size: 1406, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1413, Positive cache size: 1413, Positive conditional cache size: 1407, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1416, Positive cache size: 1416, Positive conditional cache size: 1410, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1417, Positive cache size: 1417, Positive conditional cache size: 1411, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1420, Positive cache size: 1420, Positive conditional cache size: 1414, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1421, Positive cache size: 1421, Positive conditional cache size: 1415, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1424, Positive cache size: 1424, Positive conditional cache size: 1418, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1425, Positive cache size: 1425, Positive conditional cache size: 1419, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1428, Positive cache size: 1428, Positive conditional cache size: 1422, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1429, Positive cache size: 1429, Positive conditional cache size: 1423, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1432, Positive cache size: 1432, Positive conditional cache size: 1426, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1433, Positive cache size: 1433, Positive conditional cache size: 1427, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1436, Positive cache size: 1436, Positive conditional cache size: 1430, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1437, Positive cache size: 1437, Positive conditional cache size: 1431, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1440, Positive cache size: 1440, Positive conditional cache size: 1434, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1441, Positive cache size: 1441, Positive conditional cache size: 1435, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1444, Positive cache size: 1444, Positive conditional cache size: 1438, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1445, Positive cache size: 1445, Positive conditional cache size: 1439, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1448, Positive cache size: 1448, Positive conditional cache size: 1442, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1449, Positive cache size: 1449, Positive conditional cache size: 1443, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1452, Positive cache size: 1452, Positive conditional cache size: 1446, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1453, Positive cache size: 1453, Positive conditional cache size: 1447, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1456, Positive cache size: 1456, Positive conditional cache size: 1450, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1457, Positive cache size: 1457, Positive conditional cache size: 1451, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1460, Positive cache size: 1460, Positive conditional cache size: 1454, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1461, Positive cache size: 1461, Positive conditional cache size: 1455, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1464, Positive cache size: 1464, Positive conditional cache size: 1458, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1465, Positive cache size: 1465, Positive conditional cache size: 1459, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1468, Positive cache size: 1468, Positive conditional cache size: 1462, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1469, Positive cache size: 1469, Positive conditional cache size: 1463, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1472, Positive cache size: 1472, Positive conditional cache size: 1466, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1473, Positive cache size: 1473, Positive conditional cache size: 1467, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1476, Positive cache size: 1476, Positive conditional cache size: 1470, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1477, Positive cache size: 1477, Positive conditional cache size: 1471, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1480, Positive cache size: 1480, Positive conditional cache size: 1474, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1481, Positive cache size: 1481, Positive conditional cache size: 1475, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1484, Positive cache size: 1484, Positive conditional cache size: 1478, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1485, Positive cache size: 1485, Positive conditional cache size: 1479, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1488, Positive cache size: 1488, Positive conditional cache size: 1482, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1489, Positive cache size: 1489, Positive conditional cache size: 1483, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1492, Positive cache size: 1492, Positive conditional cache size: 1486, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1493, Positive cache size: 1493, Positive conditional cache size: 1487, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1496, Positive cache size: 1496, Positive conditional cache size: 1490, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1497, Positive cache size: 1497, Positive conditional cache size: 1491, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1500, Positive cache size: 1500, Positive conditional cache size: 1494, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1501, Positive cache size: 1501, Positive conditional cache size: 1495, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1504, Positive cache size: 1504, Positive conditional cache size: 1498, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1505, Positive cache size: 1505, Positive conditional cache size: 1499, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1508, Positive cache size: 1508, Positive conditional cache size: 1502, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1509, Positive cache size: 1509, Positive conditional cache size: 1503, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1512, Positive cache size: 1512, Positive conditional cache size: 1506, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1513, Positive cache size: 1513, Positive conditional cache size: 1507, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1516, Positive cache size: 1516, Positive conditional cache size: 1510, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1517, Positive cache size: 1517, Positive conditional cache size: 1511, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1520, Positive cache size: 1520, Positive conditional cache size: 1514, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1521, Positive cache size: 1521, Positive conditional cache size: 1515, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1524, Positive cache size: 1524, Positive conditional cache size: 1518, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1525, Positive cache size: 1525, Positive conditional cache size: 1519, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1528, Positive cache size: 1528, Positive conditional cache size: 1522, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1529, Positive cache size: 1529, Positive conditional cache size: 1523, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1532, Positive cache size: 1532, Positive conditional cache size: 1526, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1533, Positive cache size: 1533, Positive conditional cache size: 1527, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1536, Positive cache size: 1536, Positive conditional cache size: 1530, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1537, Positive cache size: 1537, Positive conditional cache size: 1531, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1540, Positive cache size: 1540, Positive conditional cache size: 1534, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1541, Positive cache size: 1541, Positive conditional cache size: 1535, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1544, Positive cache size: 1544, Positive conditional cache size: 1538, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1545, Positive cache size: 1545, Positive conditional cache size: 1539, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1548, Positive cache size: 1548, Positive conditional cache size: 1542, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1549, Positive cache size: 1549, Positive conditional cache size: 1543, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1552, Positive cache size: 1552, Positive conditional cache size: 1546, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1553, Positive cache size: 1553, Positive conditional cache size: 1547, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1556, Positive cache size: 1556, Positive conditional cache size: 1550, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1557, Positive cache size: 1557, Positive conditional cache size: 1551, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1560, Positive cache size: 1560, Positive conditional cache size: 1554, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1561, Positive cache size: 1561, Positive conditional cache size: 1555, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1564, Positive cache size: 1564, Positive conditional cache size: 1558, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1565, Positive cache size: 1565, Positive conditional cache size: 1559, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1568, Positive cache size: 1568, Positive conditional cache size: 1562, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1569, Positive cache size: 1569, Positive conditional cache size: 1563, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1572, Positive cache size: 1572, Positive conditional cache size: 1566, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1573, Positive cache size: 1573, Positive conditional cache size: 1567, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1576, Positive cache size: 1576, Positive conditional cache size: 1570, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1577, Positive cache size: 1577, Positive conditional cache size: 1571, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1580, Positive cache size: 1580, Positive conditional cache size: 1574, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1581, Positive cache size: 1581, Positive conditional cache size: 1575, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1584, Positive cache size: 1584, Positive conditional cache size: 1578, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1585, Positive cache size: 1585, Positive conditional cache size: 1579, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1588, Positive cache size: 1588, Positive conditional cache size: 1582, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1589, Positive cache size: 1589, Positive conditional cache size: 1583, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1592, Positive cache size: 1592, Positive conditional cache size: 1586, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1593, Positive cache size: 1593, Positive conditional cache size: 1587, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1596, Positive cache size: 1596, Positive conditional cache size: 1590, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1597, Positive cache size: 1597, Positive conditional cache size: 1591, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1600, Positive cache size: 1600, Positive conditional cache size: 1594, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1601, Positive cache size: 1601, Positive conditional cache size: 1595, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1604, Positive cache size: 1604, Positive conditional cache size: 1598, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1605, Positive cache size: 1605, Positive conditional cache size: 1599, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1608, Positive cache size: 1608, Positive conditional cache size: 1602, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1609, Positive cache size: 1609, Positive conditional cache size: 1603, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1612, Positive cache size: 1612, Positive conditional cache size: 1606, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1613, Positive cache size: 1613, Positive conditional cache size: 1607, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1616, Positive cache size: 1616, Positive conditional cache size: 1610, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1617, Positive cache size: 1617, Positive conditional cache size: 1611, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1620, Positive cache size: 1620, Positive conditional cache size: 1614, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1621, Positive cache size: 1621, Positive conditional cache size: 1615, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1624, Positive cache size: 1624, Positive conditional cache size: 1618, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1625, Positive cache size: 1625, Positive conditional cache size: 1619, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1628, Positive cache size: 1628, Positive conditional cache size: 1622, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1629, Positive cache size: 1629, Positive conditional cache size: 1623, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1632, Positive cache size: 1632, Positive conditional cache size: 1626, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1633, Positive cache size: 1633, Positive conditional cache size: 1627, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1636, Positive cache size: 1636, Positive conditional cache size: 1630, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1637, Positive cache size: 1637, Positive conditional cache size: 1631, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1640, Positive cache size: 1640, Positive conditional cache size: 1634, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1641, Positive cache size: 1641, Positive conditional cache size: 1635, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1644, Positive cache size: 1644, Positive conditional cache size: 1638, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1645, Positive cache size: 1645, Positive conditional cache size: 1639, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1648, Positive cache size: 1648, Positive conditional cache size: 1642, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1649, Positive cache size: 1649, Positive conditional cache size: 1643, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1652, Positive cache size: 1652, Positive conditional cache size: 1646, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1653, Positive cache size: 1653, Positive conditional cache size: 1647, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1656, Positive cache size: 1656, Positive conditional cache size: 1650, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1657, Positive cache size: 1657, Positive conditional cache size: 1651, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1660, Positive cache size: 1660, Positive conditional cache size: 1654, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1661, Positive cache size: 1661, Positive conditional cache size: 1655, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1664, Positive cache size: 1664, Positive conditional cache size: 1658, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1665, Positive cache size: 1665, Positive conditional cache size: 1659, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1668, Positive cache size: 1668, Positive conditional cache size: 1662, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1669, Positive cache size: 1669, Positive conditional cache size: 1663, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1672, Positive cache size: 1672, Positive conditional cache size: 1666, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1673, Positive cache size: 1673, Positive conditional cache size: 1667, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1676, Positive cache size: 1676, Positive conditional cache size: 1670, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1677, Positive cache size: 1677, Positive conditional cache size: 1671, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1680, Positive cache size: 1680, Positive conditional cache size: 1674, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1681, Positive cache size: 1681, Positive conditional cache size: 1675, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1684, Positive cache size: 1684, Positive conditional cache size: 1678, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1685, Positive cache size: 1685, Positive conditional cache size: 1679, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1688, Positive cache size: 1688, Positive conditional cache size: 1682, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1689, Positive cache size: 1689, Positive conditional cache size: 1683, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1692, Positive cache size: 1692, Positive conditional cache size: 1686, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1693, Positive cache size: 1693, Positive conditional cache size: 1687, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1696, Positive cache size: 1696, Positive conditional cache size: 1690, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1697, Positive cache size: 1697, Positive conditional cache size: 1691, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1700, Positive cache size: 1700, Positive conditional cache size: 1694, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1701, Positive cache size: 1701, Positive conditional cache size: 1695, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1704, Positive cache size: 1704, Positive conditional cache size: 1698, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1705, Positive cache size: 1705, Positive conditional cache size: 1699, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1708, Positive cache size: 1708, Positive conditional cache size: 1702, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1709, Positive cache size: 1709, Positive conditional cache size: 1703, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1712, Positive cache size: 1712, Positive conditional cache size: 1706, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1713, Positive cache size: 1713, Positive conditional cache size: 1707, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1716, Positive cache size: 1716, Positive conditional cache size: 1710, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1717, Positive cache size: 1717, Positive conditional cache size: 1711, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1720, Positive cache size: 1720, Positive conditional cache size: 1714, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1721, Positive cache size: 1721, Positive conditional cache size: 1715, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1724, Positive cache size: 1724, Positive conditional cache size: 1718, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1725, Positive cache size: 1725, Positive conditional cache size: 1719, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1728, Positive cache size: 1728, Positive conditional cache size: 1722, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1729, Positive cache size: 1729, Positive conditional cache size: 1723, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1732, Positive cache size: 1732, Positive conditional cache size: 1726, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1733, Positive cache size: 1733, Positive conditional cache size: 1727, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1736, Positive cache size: 1736, Positive conditional cache size: 1730, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1737, Positive cache size: 1737, Positive conditional cache size: 1731, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1740, Positive cache size: 1740, Positive conditional cache size: 1734, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1741, Positive cache size: 1741, Positive conditional cache size: 1735, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1744, Positive cache size: 1744, Positive conditional cache size: 1738, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1745, Positive cache size: 1745, Positive conditional cache size: 1739, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1748, Positive cache size: 1748, Positive conditional cache size: 1742, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1749, Positive cache size: 1749, Positive conditional cache size: 1743, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1752, Positive cache size: 1752, Positive conditional cache size: 1746, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1753, Positive cache size: 1753, Positive conditional cache size: 1747, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1756, Positive cache size: 1756, Positive conditional cache size: 1750, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1757, Positive cache size: 1757, Positive conditional cache size: 1751, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1760, Positive cache size: 1760, Positive conditional cache size: 1754, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1761, Positive cache size: 1761, Positive conditional cache size: 1755, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1764, Positive cache size: 1764, Positive conditional cache size: 1758, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1765, Positive cache size: 1765, Positive conditional cache size: 1759, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1768, Positive cache size: 1768, Positive conditional cache size: 1762, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1769, Positive cache size: 1769, Positive conditional cache size: 1763, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1772, Positive cache size: 1772, Positive conditional cache size: 1766, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1773, Positive cache size: 1773, Positive conditional cache size: 1767, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1776, Positive cache size: 1776, Positive conditional cache size: 1770, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1777, Positive cache size: 1777, Positive conditional cache size: 1771, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1780, Positive cache size: 1780, Positive conditional cache size: 1774, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1781, Positive cache size: 1781, Positive conditional cache size: 1775, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1784, Positive cache size: 1784, Positive conditional cache size: 1778, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1785, Positive cache size: 1785, Positive conditional cache size: 1779, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1788, Positive cache size: 1788, Positive conditional cache size: 1782, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1789, Positive cache size: 1789, Positive conditional cache size: 1783, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1792, Positive cache size: 1792, Positive conditional cache size: 1786, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1793, Positive cache size: 1793, Positive conditional cache size: 1787, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1796, Positive cache size: 1796, Positive conditional cache size: 1790, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1797, Positive cache size: 1797, Positive conditional cache size: 1791, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1800, Positive cache size: 1800, Positive conditional cache size: 1794, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1801, Positive cache size: 1801, Positive conditional cache size: 1795, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1804, Positive cache size: 1804, Positive conditional cache size: 1798, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1805, Positive cache size: 1805, Positive conditional cache size: 1799, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1808, Positive cache size: 1808, Positive conditional cache size: 1802, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1809, Positive cache size: 1809, Positive conditional cache size: 1803, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1812, Positive cache size: 1812, Positive conditional cache size: 1806, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1813, Positive cache size: 1813, Positive conditional cache size: 1807, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1816, Positive cache size: 1816, Positive conditional cache size: 1810, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1817, Positive cache size: 1817, Positive conditional cache size: 1811, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1820, Positive cache size: 1820, Positive conditional cache size: 1814, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1821, Positive cache size: 1821, Positive conditional cache size: 1815, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1824, Positive cache size: 1824, Positive conditional cache size: 1818, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1825, Positive cache size: 1825, Positive conditional cache size: 1819, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1828, Positive cache size: 1828, Positive conditional cache size: 1822, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1829, Positive cache size: 1829, Positive conditional cache size: 1823, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1832, Positive cache size: 1832, Positive conditional cache size: 1826, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1833, Positive cache size: 1833, Positive conditional cache size: 1827, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1836, Positive cache size: 1836, Positive conditional cache size: 1830, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1837, Positive cache size: 1837, Positive conditional cache size: 1831, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1840, Positive cache size: 1840, Positive conditional cache size: 1834, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1841, Positive cache size: 1841, Positive conditional cache size: 1835, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1844, Positive cache size: 1844, Positive conditional cache size: 1838, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1845, Positive cache size: 1845, Positive conditional cache size: 1839, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1848, Positive cache size: 1848, Positive conditional cache size: 1842, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1849, Positive cache size: 1849, Positive conditional cache size: 1843, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1852, Positive cache size: 1852, Positive conditional cache size: 1846, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1853, Positive cache size: 1853, Positive conditional cache size: 1847, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1856, Positive cache size: 1856, Positive conditional cache size: 1850, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1857, Positive cache size: 1857, Positive conditional cache size: 1851, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1860, Positive cache size: 1860, Positive conditional cache size: 1854, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1861, Positive cache size: 1861, Positive conditional cache size: 1855, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1864, Positive cache size: 1864, Positive conditional cache size: 1858, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1865, Positive cache size: 1865, Positive conditional cache size: 1859, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1868, Positive cache size: 1868, Positive conditional cache size: 1862, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1869, Positive cache size: 1869, Positive conditional cache size: 1863, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1872, Positive cache size: 1872, Positive conditional cache size: 1866, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1873, Positive cache size: 1873, Positive conditional cache size: 1867, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1876, Positive cache size: 1876, Positive conditional cache size: 1870, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1877, Positive cache size: 1877, Positive conditional cache size: 1871, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1880, Positive cache size: 1880, Positive conditional cache size: 1874, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1881, Positive cache size: 1881, Positive conditional cache size: 1875, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1884, Positive cache size: 1884, Positive conditional cache size: 1878, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1885, Positive cache size: 1885, Positive conditional cache size: 1879, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1888, Positive cache size: 1888, Positive conditional cache size: 1882, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1889, Positive cache size: 1889, Positive conditional cache size: 1883, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1892, Positive cache size: 1892, Positive conditional cache size: 1886, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1893, Positive cache size: 1893, Positive conditional cache size: 1887, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1896, Positive cache size: 1896, Positive conditional cache size: 1890, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1897, Positive cache size: 1897, Positive conditional cache size: 1891, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1900, Positive cache size: 1900, Positive conditional cache size: 1894, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1901, Positive cache size: 1901, Positive conditional cache size: 1895, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1904, Positive cache size: 1904, Positive conditional cache size: 1898, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1905, Positive cache size: 1905, Positive conditional cache size: 1899, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1908, Positive cache size: 1908, Positive conditional cache size: 1902, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1909, Positive cache size: 1909, Positive conditional cache size: 1903, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1912, Positive cache size: 1912, Positive conditional cache size: 1906, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1913, Positive cache size: 1913, Positive conditional cache size: 1907, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1916, Positive cache size: 1916, Positive conditional cache size: 1910, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1917, Positive cache size: 1917, Positive conditional cache size: 1911, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1920, Positive cache size: 1920, Positive conditional cache size: 1914, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1921, Positive cache size: 1921, Positive conditional cache size: 1915, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1924, Positive cache size: 1924, Positive conditional cache size: 1918, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1925, Positive cache size: 1925, Positive conditional cache size: 1919, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1928, Positive cache size: 1928, Positive conditional cache size: 1922, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1929, Positive cache size: 1929, Positive conditional cache size: 1923, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1932, Positive cache size: 1932, Positive conditional cache size: 1926, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1933, Positive cache size: 1933, Positive conditional cache size: 1927, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1936, Positive cache size: 1936, Positive conditional cache size: 1930, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1937, Positive cache size: 1937, Positive conditional cache size: 1931, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1940, Positive cache size: 1940, Positive conditional cache size: 1934, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1941, Positive cache size: 1941, Positive conditional cache size: 1935, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1944, Positive cache size: 1944, Positive conditional cache size: 1938, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1945, Positive cache size: 1945, Positive conditional cache size: 1939, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1948, Positive cache size: 1948, Positive conditional cache size: 1942, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1949, Positive cache size: 1949, Positive conditional cache size: 1943, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1952, Positive cache size: 1952, Positive conditional cache size: 1946, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1953, Positive cache size: 1953, Positive conditional cache size: 1947, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1956, Positive cache size: 1956, Positive conditional cache size: 1950, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1957, Positive cache size: 1957, Positive conditional cache size: 1951, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1960, Positive cache size: 1960, Positive conditional cache size: 1954, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1961, Positive cache size: 1961, Positive conditional cache size: 1955, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1964, Positive cache size: 1964, Positive conditional cache size: 1958, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1965, Positive cache size: 1965, Positive conditional cache size: 1959, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1968, Positive cache size: 1968, Positive conditional cache size: 1962, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1969, Positive cache size: 1969, Positive conditional cache size: 1963, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1972, Positive cache size: 1972, Positive conditional cache size: 1966, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1973, Positive cache size: 1973, Positive conditional cache size: 1967, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1976, Positive cache size: 1976, Positive conditional cache size: 1970, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1977, Positive cache size: 1977, Positive conditional cache size: 1971, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1980, Positive cache size: 1980, Positive conditional cache size: 1974, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1981, Positive cache size: 1981, Positive conditional cache size: 1975, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1984, Positive cache size: 1984, Positive conditional cache size: 1978, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1985, Positive cache size: 1985, Positive conditional cache size: 1979, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1988, Positive cache size: 1988, Positive conditional cache size: 1982, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1989, Positive cache size: 1989, Positive conditional cache size: 1983, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1992, Positive cache size: 1992, Positive conditional cache size: 1986, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1993, Positive cache size: 1993, Positive conditional cache size: 1987, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 1996, Positive cache size: 1996, Positive conditional cache size: 1990, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 1997, Positive cache size: 1997, Positive conditional cache size: 1991, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2000, Positive cache size: 2000, Positive conditional cache size: 1994, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2001, Positive cache size: 2001, Positive conditional cache size: 1995, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2004, Positive cache size: 2004, Positive conditional cache size: 1998, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2005, Positive cache size: 2005, Positive conditional cache size: 1999, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2008, Positive cache size: 2008, Positive conditional cache size: 2002, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2009, Positive cache size: 2009, Positive conditional cache size: 2003, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2012, Positive cache size: 2012, Positive conditional cache size: 2006, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2013, Positive cache size: 2013, Positive conditional cache size: 2007, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2016, Positive cache size: 2016, Positive conditional cache size: 2010, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2017, Positive cache size: 2017, Positive conditional cache size: 2011, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2020, Positive cache size: 2020, Positive conditional cache size: 2014, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2021, Positive cache size: 2021, Positive conditional cache size: 2015, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2024, Positive cache size: 2024, Positive conditional cache size: 2018, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2025, Positive cache size: 2025, Positive conditional cache size: 2019, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2028, Positive cache size: 2028, Positive conditional cache size: 2022, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2029, Positive cache size: 2029, Positive conditional cache size: 2023, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2032, Positive cache size: 2032, Positive conditional cache size: 2026, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2033, Positive cache size: 2033, Positive conditional cache size: 2027, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2036, Positive cache size: 2036, Positive conditional cache size: 2030, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2037, Positive cache size: 2037, Positive conditional cache size: 2031, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2040, Positive cache size: 2040, Positive conditional cache size: 2034, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2041, Positive cache size: 2041, Positive conditional cache size: 2035, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2044, Positive cache size: 2044, Positive conditional cache size: 2038, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2045, Positive cache size: 2045, Positive conditional cache size: 2039, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2048, Positive cache size: 2048, Positive conditional cache size: 2042, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2049, Positive cache size: 2049, Positive conditional cache size: 2043, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2052, Positive cache size: 2052, Positive conditional cache size: 2046, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2053, Positive cache size: 2053, Positive conditional cache size: 2047, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2056, Positive cache size: 2056, Positive conditional cache size: 2050, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2057, Positive cache size: 2057, Positive conditional cache size: 2051, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2060, Positive cache size: 2060, Positive conditional cache size: 2054, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2061, Positive cache size: 2061, Positive conditional cache size: 2055, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2064, Positive cache size: 2064, Positive conditional cache size: 2058, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2065, Positive cache size: 2065, Positive conditional cache size: 2059, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2068, Positive cache size: 2068, Positive conditional cache size: 2062, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2069, Positive cache size: 2069, Positive conditional cache size: 2063, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2072, Positive cache size: 2072, Positive conditional cache size: 2066, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2073, Positive cache size: 2073, Positive conditional cache size: 2067, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2076, Positive cache size: 2076, Positive conditional cache size: 2070, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2077, Positive cache size: 2077, Positive conditional cache size: 2071, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2080, Positive cache size: 2080, Positive conditional cache size: 2074, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2081, Positive cache size: 2081, Positive conditional cache size: 2075, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2084, Positive cache size: 2084, Positive conditional cache size: 2078, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2085, Positive cache size: 2085, Positive conditional cache size: 2079, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2088, Positive cache size: 2088, Positive conditional cache size: 2082, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2089, Positive cache size: 2089, Positive conditional cache size: 2083, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2092, Positive cache size: 2092, Positive conditional cache size: 2086, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2093, Positive cache size: 2093, Positive conditional cache size: 2087, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2096, Positive cache size: 2096, Positive conditional cache size: 2090, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2097, Positive cache size: 2097, Positive conditional cache size: 2091, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2100, Positive cache size: 2100, Positive conditional cache size: 2094, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2101, Positive cache size: 2101, Positive conditional cache size: 2095, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2104, Positive cache size: 2104, Positive conditional cache size: 2098, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2105, Positive cache size: 2105, Positive conditional cache size: 2099, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2108, Positive cache size: 2108, Positive conditional cache size: 2102, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2109, Positive cache size: 2109, Positive conditional cache size: 2103, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2112, Positive cache size: 2112, Positive conditional cache size: 2106, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2113, Positive cache size: 2113, Positive conditional cache size: 2107, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2116, Positive cache size: 2116, Positive conditional cache size: 2110, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2117, Positive cache size: 2117, Positive conditional cache size: 2111, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2120, Positive cache size: 2120, Positive conditional cache size: 2114, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2121, Positive cache size: 2121, Positive conditional cache size: 2115, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2124, Positive cache size: 2124, Positive conditional cache size: 2118, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2125, Positive cache size: 2125, Positive conditional cache size: 2119, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2128, Positive cache size: 2128, Positive conditional cache size: 2122, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2129, Positive cache size: 2129, Positive conditional cache size: 2123, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2132, Positive cache size: 2132, Positive conditional cache size: 2126, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2133, Positive cache size: 2133, Positive conditional cache size: 2127, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2136, Positive cache size: 2136, Positive conditional cache size: 2130, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2137, Positive cache size: 2137, Positive conditional cache size: 2131, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2140, Positive cache size: 2140, Positive conditional cache size: 2134, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2141, Positive cache size: 2141, Positive conditional cache size: 2135, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2144, Positive cache size: 2144, Positive conditional cache size: 2138, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2145, Positive cache size: 2145, Positive conditional cache size: 2139, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2148, Positive cache size: 2148, Positive conditional cache size: 2142, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2149, Positive cache size: 2149, Positive conditional cache size: 2143, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2152, Positive cache size: 2152, Positive conditional cache size: 2146, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2153, Positive cache size: 2153, Positive conditional cache size: 2147, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2156, Positive cache size: 2156, Positive conditional cache size: 2150, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2157, Positive cache size: 2157, Positive conditional cache size: 2151, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2160, Positive cache size: 2160, Positive conditional cache size: 2154, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2161, Positive cache size: 2161, Positive conditional cache size: 2155, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2164, Positive cache size: 2164, Positive conditional cache size: 2158, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2165, Positive cache size: 2165, Positive conditional cache size: 2159, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2168, Positive cache size: 2168, Positive conditional cache size: 2162, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2169, Positive cache size: 2169, Positive conditional cache size: 2163, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2172, Positive cache size: 2172, Positive conditional cache size: 2166, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2173, Positive cache size: 2173, Positive conditional cache size: 2167, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2176, Positive cache size: 2176, Positive conditional cache size: 2170, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2177, Positive cache size: 2177, Positive conditional cache size: 2171, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2180, Positive cache size: 2180, Positive conditional cache size: 2174, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2181, Positive cache size: 2181, Positive conditional cache size: 2175, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2184, Positive cache size: 2184, Positive conditional cache size: 2178, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2185, Positive cache size: 2185, Positive conditional cache size: 2179, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2188, Positive cache size: 2188, Positive conditional cache size: 2182, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2189, Positive cache size: 2189, Positive conditional cache size: 2183, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2192, Positive cache size: 2192, Positive conditional cache size: 2186, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2193, Positive cache size: 2193, Positive conditional cache size: 2187, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2196, Positive cache size: 2196, Positive conditional cache size: 2190, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2197, Positive cache size: 2197, Positive conditional cache size: 2191, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2200, Positive cache size: 2200, Positive conditional cache size: 2194, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2201, Positive cache size: 2201, Positive conditional cache size: 2195, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2204, Positive cache size: 2204, Positive conditional cache size: 2198, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2205, Positive cache size: 2205, Positive conditional cache size: 2199, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2208, Positive cache size: 2208, Positive conditional cache size: 2202, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2209, Positive cache size: 2209, Positive conditional cache size: 2203, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2212, Positive cache size: 2212, Positive conditional cache size: 2206, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2213, Positive cache size: 2213, Positive conditional cache size: 2207, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2216, Positive cache size: 2216, Positive conditional cache size: 2210, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2217, Positive cache size: 2217, Positive conditional cache size: 2211, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2220, Positive cache size: 2220, Positive conditional cache size: 2214, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2221, Positive cache size: 2221, Positive conditional cache size: 2215, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2224, Positive cache size: 2224, Positive conditional cache size: 2218, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2225, Positive cache size: 2225, Positive conditional cache size: 2219, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2228, Positive cache size: 2228, Positive conditional cache size: 2222, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2229, Positive cache size: 2229, Positive conditional cache size: 2223, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2232, Positive cache size: 2232, Positive conditional cache size: 2226, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2233, Positive cache size: 2233, Positive conditional cache size: 2227, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2236, Positive cache size: 2236, Positive conditional cache size: 2230, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2237, Positive cache size: 2237, Positive conditional cache size: 2231, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2240, Positive cache size: 2240, Positive conditional cache size: 2234, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2241, Positive cache size: 2241, Positive conditional cache size: 2235, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2244, Positive cache size: 2244, Positive conditional cache size: 2238, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2245, Positive cache size: 2245, Positive conditional cache size: 2239, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2248, Positive cache size: 2248, Positive conditional cache size: 2242, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2249, Positive cache size: 2249, Positive conditional cache size: 2243, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2252, Positive cache size: 2252, Positive conditional cache size: 2246, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2253, Positive cache size: 2253, Positive conditional cache size: 2247, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2256, Positive cache size: 2256, Positive conditional cache size: 2250, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2257, Positive cache size: 2257, Positive conditional cache size: 2251, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2260, Positive cache size: 2260, Positive conditional cache size: 2254, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2261, Positive cache size: 2261, Positive conditional cache size: 2255, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2264, Positive cache size: 2264, Positive conditional cache size: 2258, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2265, Positive cache size: 2265, Positive conditional cache size: 2259, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2268, Positive cache size: 2268, Positive conditional cache size: 2262, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2269, Positive cache size: 2269, Positive conditional cache size: 2263, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2272, Positive cache size: 2272, Positive conditional cache size: 2266, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2273, Positive cache size: 2273, Positive conditional cache size: 2267, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2276, Positive cache size: 2276, Positive conditional cache size: 2270, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2277, Positive cache size: 2277, Positive conditional cache size: 2271, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2280, Positive cache size: 2280, Positive conditional cache size: 2274, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2281, Positive cache size: 2281, Positive conditional cache size: 2275, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2284, Positive cache size: 2284, Positive conditional cache size: 2278, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2285, Positive cache size: 2285, Positive conditional cache size: 2279, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2288, Positive cache size: 2288, Positive conditional cache size: 2282, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2289, Positive cache size: 2289, Positive conditional cache size: 2283, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2292, Positive cache size: 2292, Positive conditional cache size: 2286, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2293, Positive cache size: 2293, Positive conditional cache size: 2287, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2296, Positive cache size: 2296, Positive conditional cache size: 2290, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2297, Positive cache size: 2297, Positive conditional cache size: 2291, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2300, Positive cache size: 2300, Positive conditional cache size: 2294, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2301, Positive cache size: 2301, Positive conditional cache size: 2295, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2304, Positive cache size: 2304, Positive conditional cache size: 2298, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2305, Positive cache size: 2305, Positive conditional cache size: 2299, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2308, Positive cache size: 2308, Positive conditional cache size: 2302, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2309, Positive cache size: 2309, Positive conditional cache size: 2303, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2312, Positive cache size: 2312, Positive conditional cache size: 2306, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2313, Positive cache size: 2313, Positive conditional cache size: 2307, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2316, Positive cache size: 2316, Positive conditional cache size: 2310, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2317, Positive cache size: 2317, Positive conditional cache size: 2311, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2320, Positive cache size: 2320, Positive conditional cache size: 2314, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2321, Positive cache size: 2321, Positive conditional cache size: 2315, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2324, Positive cache size: 2324, Positive conditional cache size: 2318, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2325, Positive cache size: 2325, Positive conditional cache size: 2319, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2328, Positive cache size: 2328, Positive conditional cache size: 2322, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2329, Positive cache size: 2329, Positive conditional cache size: 2323, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2332, Positive cache size: 2332, Positive conditional cache size: 2326, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2333, Positive cache size: 2333, Positive conditional cache size: 2327, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2336, Positive cache size: 2336, Positive conditional cache size: 2330, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2337, Positive cache size: 2337, Positive conditional cache size: 2331, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2340, Positive cache size: 2340, Positive conditional cache size: 2334, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2341, Positive cache size: 2341, Positive conditional cache size: 2335, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2344, Positive cache size: 2344, Positive conditional cache size: 2338, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2345, Positive cache size: 2345, Positive conditional cache size: 2339, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2348, Positive cache size: 2348, Positive conditional cache size: 2342, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2349, Positive cache size: 2349, Positive conditional cache size: 2343, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2352, Positive cache size: 2352, Positive conditional cache size: 2346, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2353, Positive cache size: 2353, Positive conditional cache size: 2347, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2356, Positive cache size: 2356, Positive conditional cache size: 2350, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2357, Positive cache size: 2357, Positive conditional cache size: 2351, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2360, Positive cache size: 2360, Positive conditional cache size: 2354, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2361, Positive cache size: 2361, Positive conditional cache size: 2355, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2364, Positive cache size: 2364, Positive conditional cache size: 2358, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2365, Positive cache size: 2365, Positive conditional cache size: 2359, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2368, Positive cache size: 2368, Positive conditional cache size: 2362, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2369, Positive cache size: 2369, Positive conditional cache size: 2363, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2372, Positive cache size: 2372, Positive conditional cache size: 2366, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2373, Positive cache size: 2373, Positive conditional cache size: 2367, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2376, Positive cache size: 2376, Positive conditional cache size: 2370, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2377, Positive cache size: 2377, Positive conditional cache size: 2371, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2380, Positive cache size: 2380, Positive conditional cache size: 2374, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2381, Positive cache size: 2381, Positive conditional cache size: 2375, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2384, Positive cache size: 2384, Positive conditional cache size: 2378, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2385, Positive cache size: 2385, Positive conditional cache size: 2379, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2388, Positive cache size: 2388, Positive conditional cache size: 2382, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2389, Positive cache size: 2389, Positive conditional cache size: 2383, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2392, Positive cache size: 2392, Positive conditional cache size: 2386, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2393, Positive cache size: 2393, Positive conditional cache size: 2387, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2396, Positive cache size: 2396, Positive conditional cache size: 2390, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2397, Positive cache size: 2397, Positive conditional cache size: 2391, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2400, Positive cache size: 2400, Positive conditional cache size: 2394, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2401, Positive cache size: 2401, Positive conditional cache size: 2395, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2404, Positive cache size: 2404, Positive conditional cache size: 2398, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2405, Positive cache size: 2405, Positive conditional cache size: 2399, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2408, Positive cache size: 2408, Positive conditional cache size: 2402, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2409, Positive cache size: 2409, Positive conditional cache size: 2403, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2412, Positive cache size: 2412, Positive conditional cache size: 2406, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2413, Positive cache size: 2413, Positive conditional cache size: 2407, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2416, Positive cache size: 2416, Positive conditional cache size: 2410, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2417, Positive cache size: 2417, Positive conditional cache size: 2411, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2420, Positive cache size: 2420, Positive conditional cache size: 2414, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2421, Positive cache size: 2421, Positive conditional cache size: 2415, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2424, Positive cache size: 2424, Positive conditional cache size: 2418, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2425, Positive cache size: 2425, Positive conditional cache size: 2419, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2428, Positive cache size: 2428, Positive conditional cache size: 2422, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2429, Positive cache size: 2429, Positive conditional cache size: 2423, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2432, Positive cache size: 2432, Positive conditional cache size: 2426, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2433, Positive cache size: 2433, Positive conditional cache size: 2427, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2436, Positive cache size: 2436, Positive conditional cache size: 2430, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2437, Positive cache size: 2437, Positive conditional cache size: 2431, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2440, Positive cache size: 2440, Positive conditional cache size: 2434, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2441, Positive cache size: 2441, Positive conditional cache size: 2435, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2444, Positive cache size: 2444, Positive conditional cache size: 2438, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2445, Positive cache size: 2445, Positive conditional cache size: 2439, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2448, Positive cache size: 2448, Positive conditional cache size: 2442, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2449, Positive cache size: 2449, Positive conditional cache size: 2443, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2452, Positive cache size: 2452, Positive conditional cache size: 2446, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2453, Positive cache size: 2453, Positive conditional cache size: 2447, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2456, Positive cache size: 2456, Positive conditional cache size: 2450, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2457, Positive cache size: 2457, Positive conditional cache size: 2451, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2460, Positive cache size: 2460, Positive conditional cache size: 2454, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2461, Positive cache size: 2461, Positive conditional cache size: 2455, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2464, Positive cache size: 2464, Positive conditional cache size: 2458, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2465, Positive cache size: 2465, Positive conditional cache size: 2459, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2468, Positive cache size: 2468, Positive conditional cache size: 2462, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2469, Positive cache size: 2469, Positive conditional cache size: 2463, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2472, Positive cache size: 2472, Positive conditional cache size: 2466, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2473, Positive cache size: 2473, Positive conditional cache size: 2467, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2476, Positive cache size: 2476, Positive conditional cache size: 2470, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2477, Positive cache size: 2477, Positive conditional cache size: 2471, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2480, Positive cache size: 2480, Positive conditional cache size: 2474, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2481, Positive cache size: 2481, Positive conditional cache size: 2475, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2484, Positive cache size: 2484, Positive conditional cache size: 2478, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2485, Positive cache size: 2485, Positive conditional cache size: 2479, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2488, Positive cache size: 2488, Positive conditional cache size: 2482, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2489, Positive cache size: 2489, Positive conditional cache size: 2483, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2492, Positive cache size: 2492, Positive conditional cache size: 2486, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2493, Positive cache size: 2493, Positive conditional cache size: 2487, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2496, Positive cache size: 2496, Positive conditional cache size: 2490, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2497, Positive cache size: 2497, Positive conditional cache size: 2491, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2500, Positive cache size: 2500, Positive conditional cache size: 2494, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2501, Positive cache size: 2501, Positive conditional cache size: 2495, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2504, Positive cache size: 2504, Positive conditional cache size: 2498, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2505, Positive cache size: 2505, Positive conditional cache size: 2499, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2508, Positive cache size: 2508, Positive conditional cache size: 2502, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2509, Positive cache size: 2509, Positive conditional cache size: 2503, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2512, Positive cache size: 2512, Positive conditional cache size: 2506, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2513, Positive cache size: 2513, Positive conditional cache size: 2507, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2516, Positive cache size: 2516, Positive conditional cache size: 2510, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2517, Positive cache size: 2517, Positive conditional cache size: 2511, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2520, Positive cache size: 2520, Positive conditional cache size: 2514, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2521, Positive cache size: 2521, Positive conditional cache size: 2515, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2524, Positive cache size: 2524, Positive conditional cache size: 2518, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2525, Positive cache size: 2525, Positive conditional cache size: 2519, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2528, Positive cache size: 2528, Positive conditional cache size: 2522, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2529, Positive cache size: 2529, Positive conditional cache size: 2523, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2532, Positive cache size: 2532, Positive conditional cache size: 2526, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2533, Positive cache size: 2533, Positive conditional cache size: 2527, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2536, Positive cache size: 2536, Positive conditional cache size: 2530, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2537, Positive cache size: 2537, Positive conditional cache size: 2531, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2540, Positive cache size: 2540, Positive conditional cache size: 2534, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2541, Positive cache size: 2541, Positive conditional cache size: 2535, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2544, Positive cache size: 2544, Positive conditional cache size: 2538, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2545, Positive cache size: 2545, Positive conditional cache size: 2539, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2548, Positive cache size: 2548, Positive conditional cache size: 2542, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2549, Positive cache size: 2549, Positive conditional cache size: 2543, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2552, Positive cache size: 2552, Positive conditional cache size: 2546, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2553, Positive cache size: 2553, Positive conditional cache size: 2547, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2556, Positive cache size: 2556, Positive conditional cache size: 2550, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2557, Positive cache size: 2557, Positive conditional cache size: 2551, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2560, Positive cache size: 2560, Positive conditional cache size: 2554, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2561, Positive cache size: 2561, Positive conditional cache size: 2555, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2564, Positive cache size: 2564, Positive conditional cache size: 2558, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2565, Positive cache size: 2565, Positive conditional cache size: 2559, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2568, Positive cache size: 2568, Positive conditional cache size: 2562, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2569, Positive cache size: 2569, Positive conditional cache size: 2563, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2572, Positive cache size: 2572, Positive conditional cache size: 2566, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2573, Positive cache size: 2573, Positive conditional cache size: 2567, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2576, Positive cache size: 2576, Positive conditional cache size: 2570, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2577, Positive cache size: 2577, Positive conditional cache size: 2571, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2580, Positive cache size: 2580, Positive conditional cache size: 2574, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2581, Positive cache size: 2581, Positive conditional cache size: 2575, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2584, Positive cache size: 2584, Positive conditional cache size: 2578, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2585, Positive cache size: 2585, Positive conditional cache size: 2579, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2588, Positive cache size: 2588, Positive conditional cache size: 2582, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2589, Positive cache size: 2589, Positive conditional cache size: 2583, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2592, Positive cache size: 2592, Positive conditional cache size: 2586, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2593, Positive cache size: 2593, Positive conditional cache size: 2587, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2596, Positive cache size: 2596, Positive conditional cache size: 2590, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2597, Positive cache size: 2597, Positive conditional cache size: 2591, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2600, Positive cache size: 2600, Positive conditional cache size: 2594, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2601, Positive cache size: 2601, Positive conditional cache size: 2595, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2604, Positive cache size: 2604, Positive conditional cache size: 2598, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2605, Positive cache size: 2605, Positive conditional cache size: 2599, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2608, Positive cache size: 2608, Positive conditional cache size: 2602, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2609, Positive cache size: 2609, Positive conditional cache size: 2603, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2612, Positive cache size: 2612, Positive conditional cache size: 2606, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2613, Positive cache size: 2613, Positive conditional cache size: 2607, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2616, Positive cache size: 2616, Positive conditional cache size: 2610, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2617, Positive cache size: 2617, Positive conditional cache size: 2611, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2620, Positive cache size: 2620, Positive conditional cache size: 2614, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2621, Positive cache size: 2621, Positive conditional cache size: 2615, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2624, Positive cache size: 2624, Positive conditional cache size: 2618, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2625, Positive cache size: 2625, Positive conditional cache size: 2619, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2628, Positive cache size: 2628, Positive conditional cache size: 2622, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2629, Positive cache size: 2629, Positive conditional cache size: 2623, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2632, Positive cache size: 2632, Positive conditional cache size: 2626, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2633, Positive cache size: 2633, Positive conditional cache size: 2627, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2636, Positive cache size: 2636, Positive conditional cache size: 2630, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2637, Positive cache size: 2637, Positive conditional cache size: 2631, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2640, Positive cache size: 2640, Positive conditional cache size: 2634, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2641, Positive cache size: 2641, Positive conditional cache size: 2635, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2644, Positive cache size: 2644, Positive conditional cache size: 2638, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2645, Positive cache size: 2645, Positive conditional cache size: 2639, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2648, Positive cache size: 2648, Positive conditional cache size: 2642, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2649, Positive cache size: 2649, Positive conditional cache size: 2643, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2652, Positive cache size: 2652, Positive conditional cache size: 2646, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2653, Positive cache size: 2653, Positive conditional cache size: 2647, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2656, Positive cache size: 2656, Positive conditional cache size: 2650, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2657, Positive cache size: 2657, Positive conditional cache size: 2651, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2660, Positive cache size: 2660, Positive conditional cache size: 2654, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2661, Positive cache size: 2661, Positive conditional cache size: 2655, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2664, Positive cache size: 2664, Positive conditional cache size: 2658, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2665, Positive cache size: 2665, Positive conditional cache size: 2659, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2668, Positive cache size: 2668, Positive conditional cache size: 2662, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2669, Positive cache size: 2669, Positive conditional cache size: 2663, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2672, Positive cache size: 2672, Positive conditional cache size: 2666, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2673, Positive cache size: 2673, Positive conditional cache size: 2667, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2676, Positive cache size: 2676, Positive conditional cache size: 2670, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2677, Positive cache size: 2677, Positive conditional cache size: 2671, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2680, Positive cache size: 2680, Positive conditional cache size: 2674, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2681, Positive cache size: 2681, Positive conditional cache size: 2675, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2684, Positive cache size: 2684, Positive conditional cache size: 2678, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2685, Positive cache size: 2685, Positive conditional cache size: 2679, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2688, Positive cache size: 2688, Positive conditional cache size: 2682, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2689, Positive cache size: 2689, Positive conditional cache size: 2683, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2692, Positive cache size: 2692, Positive conditional cache size: 2686, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2693, Positive cache size: 2693, Positive conditional cache size: 2687, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2696, Positive cache size: 2696, Positive conditional cache size: 2690, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2697, Positive cache size: 2697, Positive conditional cache size: 2691, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2700, Positive cache size: 2700, Positive conditional cache size: 2694, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2701, Positive cache size: 2701, Positive conditional cache size: 2695, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2704, Positive cache size: 2704, Positive conditional cache size: 2698, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2705, Positive cache size: 2705, Positive conditional cache size: 2699, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2708, Positive cache size: 2708, Positive conditional cache size: 2702, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2709, Positive cache size: 2709, Positive conditional cache size: 2703, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2712, Positive cache size: 2712, Positive conditional cache size: 2706, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2713, Positive cache size: 2713, Positive conditional cache size: 2707, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2716, Positive cache size: 2716, Positive conditional cache size: 2710, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2717, Positive cache size: 2717, Positive conditional cache size: 2711, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2720, Positive cache size: 2720, Positive conditional cache size: 2714, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2721, Positive cache size: 2721, Positive conditional cache size: 2715, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2724, Positive cache size: 2724, Positive conditional cache size: 2718, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2725, Positive cache size: 2725, Positive conditional cache size: 2719, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2728, Positive cache size: 2728, Positive conditional cache size: 2722, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2729, Positive cache size: 2729, Positive conditional cache size: 2723, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2732, Positive cache size: 2732, Positive conditional cache size: 2726, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2733, Positive cache size: 2733, Positive conditional cache size: 2727, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2736, Positive cache size: 2736, Positive conditional cache size: 2730, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2737, Positive cache size: 2737, Positive conditional cache size: 2731, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2740, Positive cache size: 2740, Positive conditional cache size: 2734, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2741, Positive cache size: 2741, Positive conditional cache size: 2735, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2744, Positive cache size: 2744, Positive conditional cache size: 2738, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2745, Positive cache size: 2745, Positive conditional cache size: 2739, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2748, Positive cache size: 2748, Positive conditional cache size: 2742, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2749, Positive cache size: 2749, Positive conditional cache size: 2743, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2752, Positive cache size: 2752, Positive conditional cache size: 2746, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2753, Positive cache size: 2753, Positive conditional cache size: 2747, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2756, Positive cache size: 2756, Positive conditional cache size: 2750, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2757, Positive cache size: 2757, Positive conditional cache size: 2751, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2760, Positive cache size: 2760, Positive conditional cache size: 2754, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2761, Positive cache size: 2761, Positive conditional cache size: 2755, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2764, Positive cache size: 2764, Positive conditional cache size: 2758, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2765, Positive cache size: 2765, Positive conditional cache size: 2759, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2768, Positive cache size: 2768, Positive conditional cache size: 2762, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2769, Positive cache size: 2769, Positive conditional cache size: 2763, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2772, Positive cache size: 2772, Positive conditional cache size: 2766, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2773, Positive cache size: 2773, Positive conditional cache size: 2767, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2776, Positive cache size: 2776, Positive conditional cache size: 2770, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2777, Positive cache size: 2777, Positive conditional cache size: 2771, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2780, Positive cache size: 2780, Positive conditional cache size: 2774, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2781, Positive cache size: 2781, Positive conditional cache size: 2775, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2784, Positive cache size: 2784, Positive conditional cache size: 2778, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2785, Positive cache size: 2785, Positive conditional cache size: 2779, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2788, Positive cache size: 2788, Positive conditional cache size: 2782, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2789, Positive cache size: 2789, Positive conditional cache size: 2783, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2792, Positive cache size: 2792, Positive conditional cache size: 2786, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2793, Positive cache size: 2793, Positive conditional cache size: 2787, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2796, Positive cache size: 2796, Positive conditional cache size: 2790, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2797, Positive cache size: 2797, Positive conditional cache size: 2791, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2800, Positive cache size: 2800, Positive conditional cache size: 2794, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2801, Positive cache size: 2801, Positive conditional cache size: 2795, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2804, Positive cache size: 2804, Positive conditional cache size: 2798, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2805, Positive cache size: 2805, Positive conditional cache size: 2799, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2808, Positive cache size: 2808, Positive conditional cache size: 2802, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2809, Positive cache size: 2809, Positive conditional cache size: 2803, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2812, Positive cache size: 2812, Positive conditional cache size: 2806, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2813, Positive cache size: 2813, Positive conditional cache size: 2807, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2816, Positive cache size: 2816, Positive conditional cache size: 2810, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2817, Positive cache size: 2817, Positive conditional cache size: 2811, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2820, Positive cache size: 2820, Positive conditional cache size: 2814, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2821, Positive cache size: 2821, Positive conditional cache size: 2815, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2824, Positive cache size: 2824, Positive conditional cache size: 2818, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2825, Positive cache size: 2825, Positive conditional cache size: 2819, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2828, Positive cache size: 2828, Positive conditional cache size: 2822, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2829, Positive cache size: 2829, Positive conditional cache size: 2823, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2832, Positive cache size: 2832, Positive conditional cache size: 2826, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2833, Positive cache size: 2833, Positive conditional cache size: 2827, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2836, Positive cache size: 2836, Positive conditional cache size: 2830, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2837, Positive cache size: 2837, Positive conditional cache size: 2831, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2840, Positive cache size: 2840, Positive conditional cache size: 2834, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2841, Positive cache size: 2841, Positive conditional cache size: 2835, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2844, Positive cache size: 2844, Positive conditional cache size: 2838, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2845, Positive cache size: 2845, Positive conditional cache size: 2839, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2848, Positive cache size: 2848, Positive conditional cache size: 2842, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2849, Positive cache size: 2849, Positive conditional cache size: 2843, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2852, Positive cache size: 2852, Positive conditional cache size: 2846, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2853, Positive cache size: 2853, Positive conditional cache size: 2847, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2856, Positive cache size: 2856, Positive conditional cache size: 2850, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2857, Positive cache size: 2857, Positive conditional cache size: 2851, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2860, Positive cache size: 2860, Positive conditional cache size: 2854, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2861, Positive cache size: 2861, Positive conditional cache size: 2855, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2864, Positive cache size: 2864, Positive conditional cache size: 2858, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2865, Positive cache size: 2865, Positive conditional cache size: 2859, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2868, Positive cache size: 2868, Positive conditional cache size: 2862, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2869, Positive cache size: 2869, Positive conditional cache size: 2863, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2872, Positive cache size: 2872, Positive conditional cache size: 2866, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2873, Positive cache size: 2873, Positive conditional cache size: 2867, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2876, Positive cache size: 2876, Positive conditional cache size: 2870, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2877, Positive cache size: 2877, Positive conditional cache size: 2871, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2880, Positive cache size: 2880, Positive conditional cache size: 2874, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2881, Positive cache size: 2881, Positive conditional cache size: 2875, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2884, Positive cache size: 2884, Positive conditional cache size: 2878, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2885, Positive cache size: 2885, Positive conditional cache size: 2879, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2888, Positive cache size: 2888, Positive conditional cache size: 2882, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2889, Positive cache size: 2889, Positive conditional cache size: 2883, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2892, Positive cache size: 2892, Positive conditional cache size: 2886, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2893, Positive cache size: 2893, Positive conditional cache size: 2887, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2896, Positive cache size: 2896, Positive conditional cache size: 2890, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2897, Positive cache size: 2897, Positive conditional cache size: 2891, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2900, Positive cache size: 2900, Positive conditional cache size: 2894, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2901, Positive cache size: 2901, Positive conditional cache size: 2895, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2904, Positive cache size: 2904, Positive conditional cache size: 2898, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2905, Positive cache size: 2905, Positive conditional cache size: 2899, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2908, Positive cache size: 2908, Positive conditional cache size: 2902, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2909, Positive cache size: 2909, Positive conditional cache size: 2903, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2912, Positive cache size: 2912, Positive conditional cache size: 2906, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2913, Positive cache size: 2913, Positive conditional cache size: 2907, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2916, Positive cache size: 2916, Positive conditional cache size: 2910, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2917, Positive cache size: 2917, Positive conditional cache size: 2911, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2920, Positive cache size: 2920, Positive conditional cache size: 2914, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2921, Positive cache size: 2921, Positive conditional cache size: 2915, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2924, Positive cache size: 2924, Positive conditional cache size: 2918, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2925, Positive cache size: 2925, Positive conditional cache size: 2919, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2928, Positive cache size: 2928, Positive conditional cache size: 2922, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2929, Positive cache size: 2929, Positive conditional cache size: 2923, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2932, Positive cache size: 2932, Positive conditional cache size: 2926, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2933, Positive cache size: 2933, Positive conditional cache size: 2927, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2936, Positive cache size: 2936, Positive conditional cache size: 2930, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2937, Positive cache size: 2937, Positive conditional cache size: 2931, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2940, Positive cache size: 2940, Positive conditional cache size: 2934, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2941, Positive cache size: 2941, Positive conditional cache size: 2935, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2944, Positive cache size: 2944, Positive conditional cache size: 2938, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2945, Positive cache size: 2945, Positive conditional cache size: 2939, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2948, Positive cache size: 2948, Positive conditional cache size: 2942, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2949, Positive cache size: 2949, Positive conditional cache size: 2943, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2952, Positive cache size: 2952, Positive conditional cache size: 2946, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2953, Positive cache size: 2953, Positive conditional cache size: 2947, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2956, Positive cache size: 2956, Positive conditional cache size: 2950, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2957, Positive cache size: 2957, Positive conditional cache size: 2951, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2960, Positive cache size: 2960, Positive conditional cache size: 2954, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2961, Positive cache size: 2961, Positive conditional cache size: 2955, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2964, Positive cache size: 2964, Positive conditional cache size: 2958, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2965, Positive cache size: 2965, Positive conditional cache size: 2959, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2968, Positive cache size: 2968, Positive conditional cache size: 2962, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2969, Positive cache size: 2969, Positive conditional cache size: 2963, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2972, Positive cache size: 2972, Positive conditional cache size: 2966, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2973, Positive cache size: 2973, Positive conditional cache size: 2967, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2976, Positive cache size: 2976, Positive conditional cache size: 2970, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2977, Positive cache size: 2977, Positive conditional cache size: 2971, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2980, Positive cache size: 2980, Positive conditional cache size: 2974, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2981, Positive cache size: 2981, Positive conditional cache size: 2975, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2984, Positive cache size: 2984, Positive conditional cache size: 2978, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2985, Positive cache size: 2985, Positive conditional cache size: 2979, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2988, Positive cache size: 2988, Positive conditional cache size: 2982, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2989, Positive cache size: 2989, Positive conditional cache size: 2983, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2992, Positive cache size: 2992, Positive conditional cache size: 2986, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2993, Positive cache size: 2993, Positive conditional cache size: 2987, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 2996, Positive cache size: 2996, Positive conditional cache size: 2990, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 2997, Positive cache size: 2997, Positive conditional cache size: 2991, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3000, Positive cache size: 3000, Positive conditional cache size: 2994, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3001, Positive cache size: 3001, Positive conditional cache size: 2995, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3004, Positive cache size: 3004, Positive conditional cache size: 2998, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3005, Positive cache size: 3005, Positive conditional cache size: 2999, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3008, Positive cache size: 3008, Positive conditional cache size: 3002, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3009, Positive cache size: 3009, Positive conditional cache size: 3003, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3012, Positive cache size: 3012, Positive conditional cache size: 3006, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3013, Positive cache size: 3013, Positive conditional cache size: 3007, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3016, Positive cache size: 3016, Positive conditional cache size: 3010, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3017, Positive cache size: 3017, Positive conditional cache size: 3011, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3020, Positive cache size: 3020, Positive conditional cache size: 3014, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3021, Positive cache size: 3021, Positive conditional cache size: 3015, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3024, Positive cache size: 3024, Positive conditional cache size: 3018, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3025, Positive cache size: 3025, Positive conditional cache size: 3019, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3028, Positive cache size: 3028, Positive conditional cache size: 3022, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3029, Positive cache size: 3029, Positive conditional cache size: 3023, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3032, Positive cache size: 3032, Positive conditional cache size: 3026, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3033, Positive cache size: 3033, Positive conditional cache size: 3027, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3036, Positive cache size: 3036, Positive conditional cache size: 3030, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3037, Positive cache size: 3037, Positive conditional cache size: 3031, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3040, Positive cache size: 3040, Positive conditional cache size: 3034, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3041, Positive cache size: 3041, Positive conditional cache size: 3035, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3044, Positive cache size: 3044, Positive conditional cache size: 3038, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3045, Positive cache size: 3045, Positive conditional cache size: 3039, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3048, Positive cache size: 3048, Positive conditional cache size: 3042, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3049, Positive cache size: 3049, Positive conditional cache size: 3043, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3052, Positive cache size: 3052, Positive conditional cache size: 3046, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3053, Positive cache size: 3053, Positive conditional cache size: 3047, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3056, Positive cache size: 3056, Positive conditional cache size: 3050, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3057, Positive cache size: 3057, Positive conditional cache size: 3051, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3060, Positive cache size: 3060, Positive conditional cache size: 3054, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3061, Positive cache size: 3061, Positive conditional cache size: 3055, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3064, Positive cache size: 3064, Positive conditional cache size: 3058, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3065, Positive cache size: 3065, Positive conditional cache size: 3059, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3068, Positive cache size: 3068, Positive conditional cache size: 3062, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3069, Positive cache size: 3069, Positive conditional cache size: 3063, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3072, Positive cache size: 3072, Positive conditional cache size: 3066, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3073, Positive cache size: 3073, Positive conditional cache size: 3067, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3076, Positive cache size: 3076, Positive conditional cache size: 3070, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3077, Positive cache size: 3077, Positive conditional cache size: 3071, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3080, Positive cache size: 3080, Positive conditional cache size: 3074, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3081, Positive cache size: 3081, Positive conditional cache size: 3075, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3084, Positive cache size: 3084, Positive conditional cache size: 3078, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3085, Positive cache size: 3085, Positive conditional cache size: 3079, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3088, Positive cache size: 3088, Positive conditional cache size: 3082, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3089, Positive cache size: 3089, Positive conditional cache size: 3083, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3092, Positive cache size: 3092, Positive conditional cache size: 3086, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3093, Positive cache size: 3093, Positive conditional cache size: 3087, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3096, Positive cache size: 3096, Positive conditional cache size: 3090, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3097, Positive cache size: 3097, Positive conditional cache size: 3091, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3100, Positive cache size: 3100, Positive conditional cache size: 3094, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3101, Positive cache size: 3101, Positive conditional cache size: 3095, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3104, Positive cache size: 3104, Positive conditional cache size: 3098, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3105, Positive cache size: 3105, Positive conditional cache size: 3099, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3108, Positive cache size: 3108, Positive conditional cache size: 3102, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3109, Positive cache size: 3109, Positive conditional cache size: 3103, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3112, Positive cache size: 3112, Positive conditional cache size: 3106, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3113, Positive cache size: 3113, Positive conditional cache size: 3107, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3116, Positive cache size: 3116, Positive conditional cache size: 3110, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3117, Positive cache size: 3117, Positive conditional cache size: 3111, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3120, Positive cache size: 3120, Positive conditional cache size: 3114, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3121, Positive cache size: 3121, Positive conditional cache size: 3115, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3124, Positive cache size: 3124, Positive conditional cache size: 3118, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3125, Positive cache size: 3125, Positive conditional cache size: 3119, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3128, Positive cache size: 3128, Positive conditional cache size: 3122, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3129, Positive cache size: 3129, Positive conditional cache size: 3123, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3132, Positive cache size: 3132, Positive conditional cache size: 3126, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3133, Positive cache size: 3133, Positive conditional cache size: 3127, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3136, Positive cache size: 3136, Positive conditional cache size: 3130, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3137, Positive cache size: 3137, Positive conditional cache size: 3131, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3140, Positive cache size: 3140, Positive conditional cache size: 3134, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3141, Positive cache size: 3141, Positive conditional cache size: 3135, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3144, Positive cache size: 3144, Positive conditional cache size: 3138, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3145, Positive cache size: 3145, Positive conditional cache size: 3139, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3148, Positive cache size: 3148, Positive conditional cache size: 3142, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3149, Positive cache size: 3149, Positive conditional cache size: 3143, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3152, Positive cache size: 3152, Positive conditional cache size: 3146, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3153, Positive cache size: 3153, Positive conditional cache size: 3147, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3156, Positive cache size: 3156, Positive conditional cache size: 3150, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3157, Positive cache size: 3157, Positive conditional cache size: 3151, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3160, Positive cache size: 3160, Positive conditional cache size: 3154, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3161, Positive cache size: 3161, Positive conditional cache size: 3155, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3164, Positive cache size: 3164, Positive conditional cache size: 3158, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3165, Positive cache size: 3165, Positive conditional cache size: 3159, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3168, Positive cache size: 3168, Positive conditional cache size: 3162, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3169, Positive cache size: 3169, Positive conditional cache size: 3163, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3172, Positive cache size: 3172, Positive conditional cache size: 3166, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3173, Positive cache size: 3173, Positive conditional cache size: 3167, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3176, Positive cache size: 3176, Positive conditional cache size: 3170, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3177, Positive cache size: 3177, Positive conditional cache size: 3171, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3180, Positive cache size: 3180, Positive conditional cache size: 3174, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3181, Positive cache size: 3181, Positive conditional cache size: 3175, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3184, Positive cache size: 3184, Positive conditional cache size: 3178, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3185, Positive cache size: 3185, Positive conditional cache size: 3179, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3188, Positive cache size: 3188, Positive conditional cache size: 3182, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3189, Positive cache size: 3189, Positive conditional cache size: 3183, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3192, Positive cache size: 3192, Positive conditional cache size: 3186, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3193, Positive cache size: 3193, Positive conditional cache size: 3187, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3196, Positive cache size: 3196, Positive conditional cache size: 3190, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3197, Positive cache size: 3197, Positive conditional cache size: 3191, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3200, Positive cache size: 3200, Positive conditional cache size: 3194, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3201, Positive cache size: 3201, Positive conditional cache size: 3195, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3204, Positive cache size: 3204, Positive conditional cache size: 3198, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3205, Positive cache size: 3205, Positive conditional cache size: 3199, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3208, Positive cache size: 3208, Positive conditional cache size: 3202, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3209, Positive cache size: 3209, Positive conditional cache size: 3203, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3212, Positive cache size: 3212, Positive conditional cache size: 3206, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3213, Positive cache size: 3213, Positive conditional cache size: 3207, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3216, Positive cache size: 3216, Positive conditional cache size: 3210, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3217, Positive cache size: 3217, Positive conditional cache size: 3211, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3220, Positive cache size: 3220, Positive conditional cache size: 3214, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3221, Positive cache size: 3221, Positive conditional cache size: 3215, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3224, Positive cache size: 3224, Positive conditional cache size: 3218, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3225, Positive cache size: 3225, Positive conditional cache size: 3219, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3228, Positive cache size: 3228, Positive conditional cache size: 3222, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3229, Positive cache size: 3229, Positive conditional cache size: 3223, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3232, Positive cache size: 3232, Positive conditional cache size: 3226, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3233, Positive cache size: 3233, Positive conditional cache size: 3227, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3236, Positive cache size: 3236, Positive conditional cache size: 3230, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3237, Positive cache size: 3237, Positive conditional cache size: 3231, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3240, Positive cache size: 3240, Positive conditional cache size: 3234, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3241, Positive cache size: 3241, Positive conditional cache size: 3235, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3244, Positive cache size: 3244, Positive conditional cache size: 3238, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3245, Positive cache size: 3245, Positive conditional cache size: 3239, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3248, Positive cache size: 3248, Positive conditional cache size: 3242, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3249, Positive cache size: 3249, Positive conditional cache size: 3243, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3252, Positive cache size: 3252, Positive conditional cache size: 3246, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3253, Positive cache size: 3253, Positive conditional cache size: 3247, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3256, Positive cache size: 3256, Positive conditional cache size: 3250, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3257, Positive cache size: 3257, Positive conditional cache size: 3251, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3260, Positive cache size: 3260, Positive conditional cache size: 3254, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3261, Positive cache size: 3261, Positive conditional cache size: 3255, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3264, Positive cache size: 3264, Positive conditional cache size: 3258, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3265, Positive cache size: 3265, Positive conditional cache size: 3259, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3268, Positive cache size: 3268, Positive conditional cache size: 3262, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3269, Positive cache size: 3269, Positive conditional cache size: 3263, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3272, Positive cache size: 3272, Positive conditional cache size: 3266, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3273, Positive cache size: 3273, Positive conditional cache size: 3267, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3276, Positive cache size: 3276, Positive conditional cache size: 3270, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3277, Positive cache size: 3277, Positive conditional cache size: 3271, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3280, Positive cache size: 3280, Positive conditional cache size: 3274, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3281, Positive cache size: 3281, Positive conditional cache size: 3275, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3284, Positive cache size: 3284, Positive conditional cache size: 3278, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3285, Positive cache size: 3285, Positive conditional cache size: 3279, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3288, Positive cache size: 3288, Positive conditional cache size: 3282, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3289, Positive cache size: 3289, Positive conditional cache size: 3283, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3292, Positive cache size: 3292, Positive conditional cache size: 3286, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3293, Positive cache size: 3293, Positive conditional cache size: 3287, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3296, Positive cache size: 3296, Positive conditional cache size: 3290, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3297, Positive cache size: 3297, Positive conditional cache size: 3291, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3300, Positive cache size: 3300, Positive conditional cache size: 3294, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3301, Positive cache size: 3301, Positive conditional cache size: 3295, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3304, Positive cache size: 3304, Positive conditional cache size: 3298, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3305, Positive cache size: 3305, Positive conditional cache size: 3299, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3308, Positive cache size: 3308, Positive conditional cache size: 3302, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3309, Positive cache size: 3309, Positive conditional cache size: 3303, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3312, Positive cache size: 3312, Positive conditional cache size: 3306, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3313, Positive cache size: 3313, Positive conditional cache size: 3307, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3316, Positive cache size: 3316, Positive conditional cache size: 3310, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3317, Positive cache size: 3317, Positive conditional cache size: 3311, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3320, Positive cache size: 3320, Positive conditional cache size: 3314, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3321, Positive cache size: 3321, Positive conditional cache size: 3315, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3324, Positive cache size: 3324, Positive conditional cache size: 3318, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3325, Positive cache size: 3325, Positive conditional cache size: 3319, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3328, Positive cache size: 3328, Positive conditional cache size: 3322, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3329, Positive cache size: 3329, Positive conditional cache size: 3323, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3332, Positive cache size: 3332, Positive conditional cache size: 3326, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3333, Positive cache size: 3333, Positive conditional cache size: 3327, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3336, Positive cache size: 3336, Positive conditional cache size: 3330, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3337, Positive cache size: 3337, Positive conditional cache size: 3331, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3340, Positive cache size: 3340, Positive conditional cache size: 3334, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3341, Positive cache size: 3341, Positive conditional cache size: 3335, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3344, Positive cache size: 3344, Positive conditional cache size: 3338, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3345, Positive cache size: 3345, Positive conditional cache size: 3339, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3348, Positive cache size: 3348, Positive conditional cache size: 3342, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3349, Positive cache size: 3349, Positive conditional cache size: 3343, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3352, Positive cache size: 3352, Positive conditional cache size: 3346, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3353, Positive cache size: 3353, Positive conditional cache size: 3347, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3356, Positive cache size: 3356, Positive conditional cache size: 3350, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3357, Positive cache size: 3357, Positive conditional cache size: 3351, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3360, Positive cache size: 3360, Positive conditional cache size: 3354, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3361, Positive cache size: 3361, Positive conditional cache size: 3355, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3364, Positive cache size: 3364, Positive conditional cache size: 3358, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3365, Positive cache size: 3365, Positive conditional cache size: 3359, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3368, Positive cache size: 3368, Positive conditional cache size: 3362, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3369, Positive cache size: 3369, Positive conditional cache size: 3363, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3372, Positive cache size: 3372, Positive conditional cache size: 3366, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3373, Positive cache size: 3373, Positive conditional cache size: 3367, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3376, Positive cache size: 3376, Positive conditional cache size: 3370, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3377, Positive cache size: 3377, Positive conditional cache size: 3371, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3380, Positive cache size: 3380, Positive conditional cache size: 3374, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3381, Positive cache size: 3381, Positive conditional cache size: 3375, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3384, Positive cache size: 3384, Positive conditional cache size: 3378, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3385, Positive cache size: 3385, Positive conditional cache size: 3379, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3388, Positive cache size: 3388, Positive conditional cache size: 3382, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3389, Positive cache size: 3389, Positive conditional cache size: 3383, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3392, Positive cache size: 3392, Positive conditional cache size: 3386, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3393, Positive cache size: 3393, Positive conditional cache size: 3387, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3396, Positive cache size: 3396, Positive conditional cache size: 3390, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3397, Positive cache size: 3397, Positive conditional cache size: 3391, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3400, Positive cache size: 3400, Positive conditional cache size: 3394, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3401, Positive cache size: 3401, Positive conditional cache size: 3395, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3404, Positive cache size: 3404, Positive conditional cache size: 3398, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3405, Positive cache size: 3405, Positive conditional cache size: 3399, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3408, Positive cache size: 3408, Positive conditional cache size: 3402, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3409, Positive cache size: 3409, Positive conditional cache size: 3403, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3412, Positive cache size: 3412, Positive conditional cache size: 3406, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3413, Positive cache size: 3413, Positive conditional cache size: 3407, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3416, Positive cache size: 3416, Positive conditional cache size: 3410, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3417, Positive cache size: 3417, Positive conditional cache size: 3411, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3420, Positive cache size: 3420, Positive conditional cache size: 3414, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3421, Positive cache size: 3421, Positive conditional cache size: 3415, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3424, Positive cache size: 3424, Positive conditional cache size: 3418, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3425, Positive cache size: 3425, Positive conditional cache size: 3419, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3428, Positive cache size: 3428, Positive conditional cache size: 3422, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3429, Positive cache size: 3429, Positive conditional cache size: 3423, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3432, Positive cache size: 3432, Positive conditional cache size: 3426, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3433, Positive cache size: 3433, Positive conditional cache size: 3427, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3436, Positive cache size: 3436, Positive conditional cache size: 3430, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3437, Positive cache size: 3437, Positive conditional cache size: 3431, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3440, Positive cache size: 3440, Positive conditional cache size: 3434, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3441, Positive cache size: 3441, Positive conditional cache size: 3435, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3444, Positive cache size: 3444, Positive conditional cache size: 3438, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3445, Positive cache size: 3445, Positive conditional cache size: 3439, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3448, Positive cache size: 3448, Positive conditional cache size: 3442, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3449, Positive cache size: 3449, Positive conditional cache size: 3443, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3452, Positive cache size: 3452, Positive conditional cache size: 3446, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3453, Positive cache size: 3453, Positive conditional cache size: 3447, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3456, Positive cache size: 3456, Positive conditional cache size: 3450, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3457, Positive cache size: 3457, Positive conditional cache size: 3451, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3460, Positive cache size: 3460, Positive conditional cache size: 3454, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3461, Positive cache size: 3461, Positive conditional cache size: 3455, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3464, Positive cache size: 3464, Positive conditional cache size: 3458, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3465, Positive cache size: 3465, Positive conditional cache size: 3459, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3468, Positive cache size: 3468, Positive conditional cache size: 3462, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3469, Positive cache size: 3469, Positive conditional cache size: 3463, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3472, Positive cache size: 3472, Positive conditional cache size: 3466, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3473, Positive cache size: 3473, Positive conditional cache size: 3467, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3476, Positive cache size: 3476, Positive conditional cache size: 3470, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3477, Positive cache size: 3477, Positive conditional cache size: 3471, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3480, Positive cache size: 3480, Positive conditional cache size: 3474, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3481, Positive cache size: 3481, Positive conditional cache size: 3475, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3484, Positive cache size: 3484, Positive conditional cache size: 3478, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3485, Positive cache size: 3485, Positive conditional cache size: 3479, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3488, Positive cache size: 3488, Positive conditional cache size: 3482, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3489, Positive cache size: 3489, Positive conditional cache size: 3483, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3492, Positive cache size: 3492, Positive conditional cache size: 3486, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3493, Positive cache size: 3493, Positive conditional cache size: 3487, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3496, Positive cache size: 3496, Positive conditional cache size: 3490, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3497, Positive cache size: 3497, Positive conditional cache size: 3491, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3500, Positive cache size: 3500, Positive conditional cache size: 3494, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3501, Positive cache size: 3501, Positive conditional cache size: 3495, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3504, Positive cache size: 3504, Positive conditional cache size: 3498, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3505, Positive cache size: 3505, Positive conditional cache size: 3499, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3508, Positive cache size: 3508, Positive conditional cache size: 3502, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3509, Positive cache size: 3509, Positive conditional cache size: 3503, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3512, Positive cache size: 3512, Positive conditional cache size: 3506, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3513, Positive cache size: 3513, Positive conditional cache size: 3507, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3516, Positive cache size: 3516, Positive conditional cache size: 3510, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3517, Positive cache size: 3517, Positive conditional cache size: 3511, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3520, Positive cache size: 3520, Positive conditional cache size: 3514, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3521, Positive cache size: 3521, Positive conditional cache size: 3515, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3524, Positive cache size: 3524, Positive conditional cache size: 3518, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3525, Positive cache size: 3525, Positive conditional cache size: 3519, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3528, Positive cache size: 3528, Positive conditional cache size: 3522, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3529, Positive cache size: 3529, Positive conditional cache size: 3523, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3532, Positive cache size: 3532, Positive conditional cache size: 3526, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3533, Positive cache size: 3533, Positive conditional cache size: 3527, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3536, Positive cache size: 3536, Positive conditional cache size: 3530, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3537, Positive cache size: 3537, Positive conditional cache size: 3531, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3540, Positive cache size: 3540, Positive conditional cache size: 3534, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3541, Positive cache size: 3541, Positive conditional cache size: 3535, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3544, Positive cache size: 3544, Positive conditional cache size: 3538, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3545, Positive cache size: 3545, Positive conditional cache size: 3539, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3548, Positive cache size: 3548, Positive conditional cache size: 3542, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3549, Positive cache size: 3549, Positive conditional cache size: 3543, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3552, Positive cache size: 3552, Positive conditional cache size: 3546, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3553, Positive cache size: 3553, Positive conditional cache size: 3547, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3556, Positive cache size: 3556, Positive conditional cache size: 3550, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3557, Positive cache size: 3557, Positive conditional cache size: 3551, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3560, Positive cache size: 3560, Positive conditional cache size: 3554, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3561, Positive cache size: 3561, Positive conditional cache size: 3555, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3564, Positive cache size: 3564, Positive conditional cache size: 3558, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3565, Positive cache size: 3565, Positive conditional cache size: 3559, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3568, Positive cache size: 3568, Positive conditional cache size: 3562, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3569, Positive cache size: 3569, Positive conditional cache size: 3563, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3572, Positive cache size: 3572, Positive conditional cache size: 3566, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3573, Positive cache size: 3573, Positive conditional cache size: 3567, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3576, Positive cache size: 3576, Positive conditional cache size: 3570, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3577, Positive cache size: 3577, Positive conditional cache size: 3571, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3580, Positive cache size: 3580, Positive conditional cache size: 3574, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3581, Positive cache size: 3581, Positive conditional cache size: 3575, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3584, Positive cache size: 3584, Positive conditional cache size: 3578, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3585, Positive cache size: 3585, Positive conditional cache size: 3579, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3588, Positive cache size: 3588, Positive conditional cache size: 3582, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3589, Positive cache size: 3589, Positive conditional cache size: 3583, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3592, Positive cache size: 3592, Positive conditional cache size: 3586, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3593, Positive cache size: 3593, Positive conditional cache size: 3587, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3596, Positive cache size: 3596, Positive conditional cache size: 3590, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3597, Positive cache size: 3597, Positive conditional cache size: 3591, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3600, Positive cache size: 3600, Positive conditional cache size: 3594, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3601, Positive cache size: 3601, Positive conditional cache size: 3595, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3604, Positive cache size: 3604, Positive conditional cache size: 3598, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3605, Positive cache size: 3605, Positive conditional cache size: 3599, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3608, Positive cache size: 3608, Positive conditional cache size: 3602, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3609, Positive cache size: 3609, Positive conditional cache size: 3603, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3612, Positive cache size: 3612, Positive conditional cache size: 3606, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3613, Positive cache size: 3613, Positive conditional cache size: 3607, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3616, Positive cache size: 3616, Positive conditional cache size: 3610, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3617, Positive cache size: 3617, Positive conditional cache size: 3611, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3620, Positive cache size: 3620, Positive conditional cache size: 3614, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3621, Positive cache size: 3621, Positive conditional cache size: 3615, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3624, Positive cache size: 3624, Positive conditional cache size: 3618, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3625, Positive cache size: 3625, Positive conditional cache size: 3619, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3628, Positive cache size: 3628, Positive conditional cache size: 3622, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3629, Positive cache size: 3629, Positive conditional cache size: 3623, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3632, Positive cache size: 3632, Positive conditional cache size: 3626, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3633, Positive cache size: 3633, Positive conditional cache size: 3627, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3636, Positive cache size: 3636, Positive conditional cache size: 3630, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3637, Positive cache size: 3637, Positive conditional cache size: 3631, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3640, Positive cache size: 3640, Positive conditional cache size: 3634, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3641, Positive cache size: 3641, Positive conditional cache size: 3635, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3644, Positive cache size: 3644, Positive conditional cache size: 3638, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3645, Positive cache size: 3645, Positive conditional cache size: 3639, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3648, Positive cache size: 3648, Positive conditional cache size: 3642, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3649, Positive cache size: 3649, Positive conditional cache size: 3643, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3652, Positive cache size: 3652, Positive conditional cache size: 3646, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3653, Positive cache size: 3653, Positive conditional cache size: 3647, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3656, Positive cache size: 3656, Positive conditional cache size: 3650, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3657, Positive cache size: 3657, Positive conditional cache size: 3651, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3660, Positive cache size: 3660, Positive conditional cache size: 3654, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3661, Positive cache size: 3661, Positive conditional cache size: 3655, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3664, Positive cache size: 3664, Positive conditional cache size: 3658, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3665, Positive cache size: 3665, Positive conditional cache size: 3659, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3668, Positive cache size: 3668, Positive conditional cache size: 3662, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3669, Positive cache size: 3669, Positive conditional cache size: 3663, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3672, Positive cache size: 3672, Positive conditional cache size: 3666, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3673, Positive cache size: 3673, Positive conditional cache size: 3667, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3676, Positive cache size: 3676, Positive conditional cache size: 3670, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3677, Positive cache size: 3677, Positive conditional cache size: 3671, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3680, Positive cache size: 3680, Positive conditional cache size: 3674, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3681, Positive cache size: 3681, Positive conditional cache size: 3675, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3684, Positive cache size: 3684, Positive conditional cache size: 3678, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3685, Positive cache size: 3685, Positive conditional cache size: 3679, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3688, Positive cache size: 3688, Positive conditional cache size: 3682, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3689, Positive cache size: 3689, Positive conditional cache size: 3683, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3692, Positive cache size: 3692, Positive conditional cache size: 3686, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3693, Positive cache size: 3693, Positive conditional cache size: 3687, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3696, Positive cache size: 3696, Positive conditional cache size: 3690, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3697, Positive cache size: 3697, Positive conditional cache size: 3691, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3700, Positive cache size: 3700, Positive conditional cache size: 3694, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3701, Positive cache size: 3701, Positive conditional cache size: 3695, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3704, Positive cache size: 3704, Positive conditional cache size: 3698, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3705, Positive cache size: 3705, Positive conditional cache size: 3699, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3708, Positive cache size: 3708, Positive conditional cache size: 3702, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3709, Positive cache size: 3709, Positive conditional cache size: 3703, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3712, Positive cache size: 3712, Positive conditional cache size: 3706, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3713, Positive cache size: 3713, Positive conditional cache size: 3707, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3716, Positive cache size: 3716, Positive conditional cache size: 3710, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3717, Positive cache size: 3717, Positive conditional cache size: 3711, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3720, Positive cache size: 3720, Positive conditional cache size: 3714, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3721, Positive cache size: 3721, Positive conditional cache size: 3715, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3724, Positive cache size: 3724, Positive conditional cache size: 3718, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3725, Positive cache size: 3725, Positive conditional cache size: 3719, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3728, Positive cache size: 3728, Positive conditional cache size: 3722, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3729, Positive cache size: 3729, Positive conditional cache size: 3723, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3732, Positive cache size: 3732, Positive conditional cache size: 3726, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3733, Positive cache size: 3733, Positive conditional cache size: 3727, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3736, Positive cache size: 3736, Positive conditional cache size: 3730, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3737, Positive cache size: 3737, Positive conditional cache size: 3731, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3740, Positive cache size: 3740, Positive conditional cache size: 3734, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3741, Positive cache size: 3741, Positive conditional cache size: 3735, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3744, Positive cache size: 3744, Positive conditional cache size: 3738, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3745, Positive cache size: 3745, Positive conditional cache size: 3739, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3748, Positive cache size: 3748, Positive conditional cache size: 3742, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3749, Positive cache size: 3749, Positive conditional cache size: 3743, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3752, Positive cache size: 3752, Positive conditional cache size: 3746, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3753, Positive cache size: 3753, Positive conditional cache size: 3747, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3756, Positive cache size: 3756, Positive conditional cache size: 3750, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3757, Positive cache size: 3757, Positive conditional cache size: 3751, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3760, Positive cache size: 3760, Positive conditional cache size: 3754, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3761, Positive cache size: 3761, Positive conditional cache size: 3755, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3764, Positive cache size: 3764, Positive conditional cache size: 3758, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3765, Positive cache size: 3765, Positive conditional cache size: 3759, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3768, Positive cache size: 3768, Positive conditional cache size: 3762, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3769, Positive cache size: 3769, Positive conditional cache size: 3763, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3772, Positive cache size: 3772, Positive conditional cache size: 3766, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3773, Positive cache size: 3773, Positive conditional cache size: 3767, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3776, Positive cache size: 3776, Positive conditional cache size: 3770, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3777, Positive cache size: 3777, Positive conditional cache size: 3771, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3780, Positive cache size: 3780, Positive conditional cache size: 3774, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3781, Positive cache size: 3781, Positive conditional cache size: 3775, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3784, Positive cache size: 3784, Positive conditional cache size: 3778, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3785, Positive cache size: 3785, Positive conditional cache size: 3779, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3788, Positive cache size: 3788, Positive conditional cache size: 3782, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3789, Positive cache size: 3789, Positive conditional cache size: 3783, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3792, Positive cache size: 3792, Positive conditional cache size: 3786, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3793, Positive cache size: 3793, Positive conditional cache size: 3787, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3796, Positive cache size: 3796, Positive conditional cache size: 3790, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3797, Positive cache size: 3797, Positive conditional cache size: 3791, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3800, Positive cache size: 3800, Positive conditional cache size: 3794, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3801, Positive cache size: 3801, Positive conditional cache size: 3795, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3804, Positive cache size: 3804, Positive conditional cache size: 3798, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3805, Positive cache size: 3805, Positive conditional cache size: 3799, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3808, Positive cache size: 3808, Positive conditional cache size: 3802, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3809, Positive cache size: 3809, Positive conditional cache size: 3803, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3812, Positive cache size: 3812, Positive conditional cache size: 3806, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3813, Positive cache size: 3813, Positive conditional cache size: 3807, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3816, Positive cache size: 3816, Positive conditional cache size: 3810, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3817, Positive cache size: 3817, Positive conditional cache size: 3811, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3820, Positive cache size: 3820, Positive conditional cache size: 3814, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3821, Positive cache size: 3821, Positive conditional cache size: 3815, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3824, Positive cache size: 3824, Positive conditional cache size: 3818, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3825, Positive cache size: 3825, Positive conditional cache size: 3819, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3828, Positive cache size: 3828, Positive conditional cache size: 3822, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3829, Positive cache size: 3829, Positive conditional cache size: 3823, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3832, Positive cache size: 3832, Positive conditional cache size: 3826, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3833, Positive cache size: 3833, Positive conditional cache size: 3827, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3836, Positive cache size: 3836, Positive conditional cache size: 3830, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3837, Positive cache size: 3837, Positive conditional cache size: 3831, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3840, Positive cache size: 3840, Positive conditional cache size: 3834, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3841, Positive cache size: 3841, Positive conditional cache size: 3835, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3844, Positive cache size: 3844, Positive conditional cache size: 3838, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3845, Positive cache size: 3845, Positive conditional cache size: 3839, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3848, Positive cache size: 3848, Positive conditional cache size: 3842, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3849, Positive cache size: 3849, Positive conditional cache size: 3843, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3852, Positive cache size: 3852, Positive conditional cache size: 3846, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3853, Positive cache size: 3853, Positive conditional cache size: 3847, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3856, Positive cache size: 3856, Positive conditional cache size: 3850, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3857, Positive cache size: 3857, Positive conditional cache size: 3851, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3860, Positive cache size: 3860, Positive conditional cache size: 3854, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3861, Positive cache size: 3861, Positive conditional cache size: 3855, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3864, Positive cache size: 3864, Positive conditional cache size: 3858, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3865, Positive cache size: 3865, Positive conditional cache size: 3859, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3868, Positive cache size: 3868, Positive conditional cache size: 3862, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3869, Positive cache size: 3869, Positive conditional cache size: 3863, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3872, Positive cache size: 3872, Positive conditional cache size: 3866, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3873, Positive cache size: 3873, Positive conditional cache size: 3867, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3876, Positive cache size: 3876, Positive conditional cache size: 3870, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3877, Positive cache size: 3877, Positive conditional cache size: 3871, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3880, Positive cache size: 3880, Positive conditional cache size: 3874, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3881, Positive cache size: 3881, Positive conditional cache size: 3875, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3884, Positive cache size: 3884, Positive conditional cache size: 3878, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3885, Positive cache size: 3885, Positive conditional cache size: 3879, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3888, Positive cache size: 3888, Positive conditional cache size: 3882, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3889, Positive cache size: 3889, Positive conditional cache size: 3883, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3892, Positive cache size: 3892, Positive conditional cache size: 3886, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3893, Positive cache size: 3893, Positive conditional cache size: 3887, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3896, Positive cache size: 3896, Positive conditional cache size: 3890, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3897, Positive cache size: 3897, Positive conditional cache size: 3891, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3900, Positive cache size: 3900, Positive conditional cache size: 3894, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3901, Positive cache size: 3901, Positive conditional cache size: 3895, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3904, Positive cache size: 3904, Positive conditional cache size: 3898, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3905, Positive cache size: 3905, Positive conditional cache size: 3899, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3908, Positive cache size: 3908, Positive conditional cache size: 3902, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3909, Positive cache size: 3909, Positive conditional cache size: 3903, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3912, Positive cache size: 3912, Positive conditional cache size: 3906, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3913, Positive cache size: 3913, Positive conditional cache size: 3907, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3916, Positive cache size: 3916, Positive conditional cache size: 3910, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3917, Positive cache size: 3917, Positive conditional cache size: 3911, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3920, Positive cache size: 3920, Positive conditional cache size: 3914, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3921, Positive cache size: 3921, Positive conditional cache size: 3915, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3924, Positive cache size: 3924, Positive conditional cache size: 3918, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3925, Positive cache size: 3925, Positive conditional cache size: 3919, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3928, Positive cache size: 3928, Positive conditional cache size: 3922, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3929, Positive cache size: 3929, Positive conditional cache size: 3923, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3932, Positive cache size: 3932, Positive conditional cache size: 3926, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3933, Positive cache size: 3933, Positive conditional cache size: 3927, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3936, Positive cache size: 3936, Positive conditional cache size: 3930, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3937, Positive cache size: 3937, Positive conditional cache size: 3931, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3940, Positive cache size: 3940, Positive conditional cache size: 3934, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3941, Positive cache size: 3941, Positive conditional cache size: 3935, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3944, Positive cache size: 3944, Positive conditional cache size: 3938, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3945, Positive cache size: 3945, Positive conditional cache size: 3939, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3948, Positive cache size: 3948, Positive conditional cache size: 3942, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3949, Positive cache size: 3949, Positive conditional cache size: 3943, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3952, Positive cache size: 3952, Positive conditional cache size: 3946, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3953, Positive cache size: 3953, Positive conditional cache size: 3947, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3956, Positive cache size: 3956, Positive conditional cache size: 3950, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3957, Positive cache size: 3957, Positive conditional cache size: 3951, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3960, Positive cache size: 3960, Positive conditional cache size: 3954, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3961, Positive cache size: 3961, Positive conditional cache size: 3955, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3964, Positive cache size: 3964, Positive conditional cache size: 3958, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3965, Positive cache size: 3965, Positive conditional cache size: 3959, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3968, Positive cache size: 3968, Positive conditional cache size: 3962, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3969, Positive cache size: 3969, Positive conditional cache size: 3963, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3972, Positive cache size: 3972, Positive conditional cache size: 3966, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3973, Positive cache size: 3973, Positive conditional cache size: 3967, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3976, Positive cache size: 3976, Positive conditional cache size: 3970, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3977, Positive cache size: 3977, Positive conditional cache size: 3971, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3980, Positive cache size: 3980, Positive conditional cache size: 3974, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3981, Positive cache size: 3981, Positive conditional cache size: 3975, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3984, Positive cache size: 3984, Positive conditional cache size: 3978, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3985, Positive cache size: 3985, Positive conditional cache size: 3979, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3988, Positive cache size: 3988, Positive conditional cache size: 3982, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3989, Positive cache size: 3989, Positive conditional cache size: 3983, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3992, Positive cache size: 3992, Positive conditional cache size: 3986, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3993, Positive cache size: 3993, Positive conditional cache size: 3987, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 3996, Positive cache size: 3996, Positive conditional cache size: 3990, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 3997, Positive cache size: 3997, Positive conditional cache size: 3991, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4000, Positive cache size: 4000, Positive conditional cache size: 3994, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4001, Positive cache size: 4001, Positive conditional cache size: 3995, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4004, Positive cache size: 4004, Positive conditional cache size: 3998, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4005, Positive cache size: 4005, Positive conditional cache size: 3999, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4008, Positive cache size: 4008, Positive conditional cache size: 4002, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4009, Positive cache size: 4009, Positive conditional cache size: 4003, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4012, Positive cache size: 4012, Positive conditional cache size: 4006, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4013, Positive cache size: 4013, Positive conditional cache size: 4007, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4016, Positive cache size: 4016, Positive conditional cache size: 4010, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4017, Positive cache size: 4017, Positive conditional cache size: 4011, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4020, Positive cache size: 4020, Positive conditional cache size: 4014, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4021, Positive cache size: 4021, Positive conditional cache size: 4015, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4024, Positive cache size: 4024, Positive conditional cache size: 4018, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4025, Positive cache size: 4025, Positive conditional cache size: 4019, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4028, Positive cache size: 4028, Positive conditional cache size: 4022, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4029, Positive cache size: 4029, Positive conditional cache size: 4023, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4032, Positive cache size: 4032, Positive conditional cache size: 4026, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4033, Positive cache size: 4033, Positive conditional cache size: 4027, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4036, Positive cache size: 4036, Positive conditional cache size: 4030, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4037, Positive cache size: 4037, Positive conditional cache size: 4031, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4040, Positive cache size: 4040, Positive conditional cache size: 4034, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4041, Positive cache size: 4041, Positive conditional cache size: 4035, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4044, Positive cache size: 4044, Positive conditional cache size: 4038, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4045, Positive cache size: 4045, Positive conditional cache size: 4039, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4048, Positive cache size: 4048, Positive conditional cache size: 4042, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4049, Positive cache size: 4049, Positive conditional cache size: 4043, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4052, Positive cache size: 4052, Positive conditional cache size: 4046, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4053, Positive cache size: 4053, Positive conditional cache size: 4047, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4056, Positive cache size: 4056, Positive conditional cache size: 4050, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4057, Positive cache size: 4057, Positive conditional cache size: 4051, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4060, Positive cache size: 4060, Positive conditional cache size: 4054, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4061, Positive cache size: 4061, Positive conditional cache size: 4055, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4064, Positive cache size: 4064, Positive conditional cache size: 4058, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4065, Positive cache size: 4065, Positive conditional cache size: 4059, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4068, Positive cache size: 4068, Positive conditional cache size: 4062, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4069, Positive cache size: 4069, Positive conditional cache size: 4063, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4072, Positive cache size: 4072, Positive conditional cache size: 4066, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4073, Positive cache size: 4073, Positive conditional cache size: 4067, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4076, Positive cache size: 4076, Positive conditional cache size: 4070, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4077, Positive cache size: 4077, Positive conditional cache size: 4071, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4080, Positive cache size: 4080, Positive conditional cache size: 4074, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4081, Positive cache size: 4081, Positive conditional cache size: 4075, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4084, Positive cache size: 4084, Positive conditional cache size: 4078, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4085, Positive cache size: 4085, Positive conditional cache size: 4079, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4088, Positive cache size: 4088, Positive conditional cache size: 4082, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4089, Positive cache size: 4089, Positive conditional cache size: 4083, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4092, Positive cache size: 4092, Positive conditional cache size: 4086, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4093, Positive cache size: 4093, Positive conditional cache size: 4087, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4096, Positive cache size: 4096, Positive conditional cache size: 4090, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4097, Positive cache size: 4097, Positive conditional cache size: 4091, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4100, Positive cache size: 4100, Positive conditional cache size: 4094, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4101, Positive cache size: 4101, Positive conditional cache size: 4095, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4104, Positive cache size: 4104, Positive conditional cache size: 4098, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4105, Positive cache size: 4105, Positive conditional cache size: 4099, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4108, Positive cache size: 4108, Positive conditional cache size: 4102, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4109, Positive cache size: 4109, Positive conditional cache size: 4103, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4112, Positive cache size: 4112, Positive conditional cache size: 4106, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4113, Positive cache size: 4113, Positive conditional cache size: 4107, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4116, Positive cache size: 4116, Positive conditional cache size: 4110, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4117, Positive cache size: 4117, Positive conditional cache size: 4111, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4120, Positive cache size: 4120, Positive conditional cache size: 4114, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4121, Positive cache size: 4121, Positive conditional cache size: 4115, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4124, Positive cache size: 4124, Positive conditional cache size: 4118, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4125, Positive cache size: 4125, Positive conditional cache size: 4119, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4128, Positive cache size: 4128, Positive conditional cache size: 4122, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4129, Positive cache size: 4129, Positive conditional cache size: 4123, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4132, Positive cache size: 4132, Positive conditional cache size: 4126, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4133, Positive cache size: 4133, Positive conditional cache size: 4127, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4136, Positive cache size: 4136, Positive conditional cache size: 4130, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4137, Positive cache size: 4137, Positive conditional cache size: 4131, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4140, Positive cache size: 4140, Positive conditional cache size: 4134, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4141, Positive cache size: 4141, Positive conditional cache size: 4135, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4144, Positive cache size: 4144, Positive conditional cache size: 4138, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4145, Positive cache size: 4145, Positive conditional cache size: 4139, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4148, Positive cache size: 4148, Positive conditional cache size: 4142, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4149, Positive cache size: 4149, Positive conditional cache size: 4143, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4152, Positive cache size: 4152, Positive conditional cache size: 4146, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4153, Positive cache size: 4153, Positive conditional cache size: 4147, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4156, Positive cache size: 4156, Positive conditional cache size: 4150, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4157, Positive cache size: 4157, Positive conditional cache size: 4151, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4160, Positive cache size: 4160, Positive conditional cache size: 4154, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4161, Positive cache size: 4161, Positive conditional cache size: 4155, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4164, Positive cache size: 4164, Positive conditional cache size: 4158, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4165, Positive cache size: 4165, Positive conditional cache size: 4159, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4168, Positive cache size: 4168, Positive conditional cache size: 4162, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4169, Positive cache size: 4169, Positive conditional cache size: 4163, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4172, Positive cache size: 4172, Positive conditional cache size: 4166, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4173, Positive cache size: 4173, Positive conditional cache size: 4167, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4176, Positive cache size: 4176, Positive conditional cache size: 4170, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4177, Positive cache size: 4177, Positive conditional cache size: 4171, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4180, Positive cache size: 4180, Positive conditional cache size: 4174, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4181, Positive cache size: 4181, Positive conditional cache size: 4175, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4184, Positive cache size: 4184, Positive conditional cache size: 4178, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4185, Positive cache size: 4185, Positive conditional cache size: 4179, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4188, Positive cache size: 4188, Positive conditional cache size: 4182, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4189, Positive cache size: 4189, Positive conditional cache size: 4183, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4192, Positive cache size: 4192, Positive conditional cache size: 4186, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4193, Positive cache size: 4193, Positive conditional cache size: 4187, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4196, Positive cache size: 4196, Positive conditional cache size: 4190, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4197, Positive cache size: 4197, Positive conditional cache size: 4191, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4200, Positive cache size: 4200, Positive conditional cache size: 4194, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4201, Positive cache size: 4201, Positive conditional cache size: 4195, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4204, Positive cache size: 4204, Positive conditional cache size: 4198, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4205, Positive cache size: 4205, Positive conditional cache size: 4199, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4208, Positive cache size: 4208, Positive conditional cache size: 4202, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4209, Positive cache size: 4209, Positive conditional cache size: 4203, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4212, Positive cache size: 4212, Positive conditional cache size: 4206, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4213, Positive cache size: 4213, Positive conditional cache size: 4207, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4216, Positive cache size: 4216, Positive conditional cache size: 4210, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4217, Positive cache size: 4217, Positive conditional cache size: 4211, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4220, Positive cache size: 4220, Positive conditional cache size: 4214, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4221, Positive cache size: 4221, Positive conditional cache size: 4215, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4224, Positive cache size: 4224, Positive conditional cache size: 4218, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4225, Positive cache size: 4225, Positive conditional cache size: 4219, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4228, Positive cache size: 4228, Positive conditional cache size: 4222, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4229, Positive cache size: 4229, Positive conditional cache size: 4223, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4232, Positive cache size: 4232, Positive conditional cache size: 4226, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4233, Positive cache size: 4233, Positive conditional cache size: 4227, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4236, Positive cache size: 4236, Positive conditional cache size: 4230, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4237, Positive cache size: 4237, Positive conditional cache size: 4231, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4240, Positive cache size: 4240, Positive conditional cache size: 4234, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4241, Positive cache size: 4241, Positive conditional cache size: 4235, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4244, Positive cache size: 4244, Positive conditional cache size: 4238, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4245, Positive cache size: 4245, Positive conditional cache size: 4239, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4248, Positive cache size: 4248, Positive conditional cache size: 4242, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4249, Positive cache size: 4249, Positive conditional cache size: 4243, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4252, Positive cache size: 4252, Positive conditional cache size: 4246, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4253, Positive cache size: 4253, Positive conditional cache size: 4247, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4256, Positive cache size: 4256, Positive conditional cache size: 4250, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4257, Positive cache size: 4257, Positive conditional cache size: 4251, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4260, Positive cache size: 4260, Positive conditional cache size: 4254, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4261, Positive cache size: 4261, Positive conditional cache size: 4255, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4264, Positive cache size: 4264, Positive conditional cache size: 4258, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4265, Positive cache size: 4265, Positive conditional cache size: 4259, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4268, Positive cache size: 4268, Positive conditional cache size: 4262, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4269, Positive cache size: 4269, Positive conditional cache size: 4263, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4272, Positive cache size: 4272, Positive conditional cache size: 4266, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4273, Positive cache size: 4273, Positive conditional cache size: 4267, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4276, Positive cache size: 4276, Positive conditional cache size: 4270, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4277, Positive cache size: 4277, Positive conditional cache size: 4271, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4280, Positive cache size: 4280, Positive conditional cache size: 4274, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4281, Positive cache size: 4281, Positive conditional cache size: 4275, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4284, Positive cache size: 4284, Positive conditional cache size: 4278, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4285, Positive cache size: 4285, Positive conditional cache size: 4279, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4288, Positive cache size: 4288, Positive conditional cache size: 4282, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4289, Positive cache size: 4289, Positive conditional cache size: 4283, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4292, Positive cache size: 4292, Positive conditional cache size: 4286, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4293, Positive cache size: 4293, Positive conditional cache size: 4287, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4296, Positive cache size: 4296, Positive conditional cache size: 4290, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4297, Positive cache size: 4297, Positive conditional cache size: 4291, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4300, Positive cache size: 4300, Positive conditional cache size: 4294, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4301, Positive cache size: 4301, Positive conditional cache size: 4295, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4304, Positive cache size: 4304, Positive conditional cache size: 4298, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4305, Positive cache size: 4305, Positive conditional cache size: 4299, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4308, Positive cache size: 4308, Positive conditional cache size: 4302, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4309, Positive cache size: 4309, Positive conditional cache size: 4303, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4312, Positive cache size: 4312, Positive conditional cache size: 4306, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4313, Positive cache size: 4313, Positive conditional cache size: 4307, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4316, Positive cache size: 4316, Positive conditional cache size: 4310, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4317, Positive cache size: 4317, Positive conditional cache size: 4311, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4320, Positive cache size: 4320, Positive conditional cache size: 4314, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4321, Positive cache size: 4321, Positive conditional cache size: 4315, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4324, Positive cache size: 4324, Positive conditional cache size: 4318, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4325, Positive cache size: 4325, Positive conditional cache size: 4319, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4328, Positive cache size: 4328, Positive conditional cache size: 4322, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4329, Positive cache size: 4329, Positive conditional cache size: 4323, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4332, Positive cache size: 4332, Positive conditional cache size: 4326, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4333, Positive cache size: 4333, Positive conditional cache size: 4327, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4336, Positive cache size: 4336, Positive conditional cache size: 4330, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4337, Positive cache size: 4337, Positive conditional cache size: 4331, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4340, Positive cache size: 4340, Positive conditional cache size: 4334, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4341, Positive cache size: 4341, Positive conditional cache size: 4335, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4344, Positive cache size: 4344, Positive conditional cache size: 4338, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4345, Positive cache size: 4345, Positive conditional cache size: 4339, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4348, Positive cache size: 4348, Positive conditional cache size: 4342, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4349, Positive cache size: 4349, Positive conditional cache size: 4343, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4352, Positive cache size: 4352, Positive conditional cache size: 4346, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4353, Positive cache size: 4353, Positive conditional cache size: 4347, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4356, Positive cache size: 4356, Positive conditional cache size: 4350, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4357, Positive cache size: 4357, Positive conditional cache size: 4351, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4360, Positive cache size: 4360, Positive conditional cache size: 4354, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4361, Positive cache size: 4361, Positive conditional cache size: 4355, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4364, Positive cache size: 4364, Positive conditional cache size: 4358, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4365, Positive cache size: 4365, Positive conditional cache size: 4359, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4368, Positive cache size: 4368, Positive conditional cache size: 4362, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4369, Positive cache size: 4369, Positive conditional cache size: 4363, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4372, Positive cache size: 4372, Positive conditional cache size: 4366, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4373, Positive cache size: 4373, Positive conditional cache size: 4367, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4376, Positive cache size: 4376, Positive conditional cache size: 4370, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4377, Positive cache size: 4377, Positive conditional cache size: 4371, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4380, Positive cache size: 4380, Positive conditional cache size: 4374, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4381, Positive cache size: 4381, Positive conditional cache size: 4375, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4384, Positive cache size: 4384, Positive conditional cache size: 4378, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4385, Positive cache size: 4385, Positive conditional cache size: 4379, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4388, Positive cache size: 4388, Positive conditional cache size: 4382, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4389, Positive cache size: 4389, Positive conditional cache size: 4383, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4392, Positive cache size: 4392, Positive conditional cache size: 4386, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4393, Positive cache size: 4393, Positive conditional cache size: 4387, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4396, Positive cache size: 4396, Positive conditional cache size: 4390, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4397, Positive cache size: 4397, Positive conditional cache size: 4391, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4400, Positive cache size: 4400, Positive conditional cache size: 4394, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4401, Positive cache size: 4401, Positive conditional cache size: 4395, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4404, Positive cache size: 4404, Positive conditional cache size: 4398, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4405, Positive cache size: 4405, Positive conditional cache size: 4399, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4408, Positive cache size: 4408, Positive conditional cache size: 4402, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4409, Positive cache size: 4409, Positive conditional cache size: 4403, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4412, Positive cache size: 4412, Positive conditional cache size: 4406, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4413, Positive cache size: 4413, Positive conditional cache size: 4407, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4416, Positive cache size: 4416, Positive conditional cache size: 4410, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4417, Positive cache size: 4417, Positive conditional cache size: 4411, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4420, Positive cache size: 4420, Positive conditional cache size: 4414, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4421, Positive cache size: 4421, Positive conditional cache size: 4415, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4424, Positive cache size: 4424, Positive conditional cache size: 4418, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4425, Positive cache size: 4425, Positive conditional cache size: 4419, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4428, Positive cache size: 4428, Positive conditional cache size: 4422, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4429, Positive cache size: 4429, Positive conditional cache size: 4423, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4432, Positive cache size: 4432, Positive conditional cache size: 4426, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4433, Positive cache size: 4433, Positive conditional cache size: 4427, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4436, Positive cache size: 4436, Positive conditional cache size: 4430, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4437, Positive cache size: 4437, Positive conditional cache size: 4431, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4440, Positive cache size: 4440, Positive conditional cache size: 4434, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4441, Positive cache size: 4441, Positive conditional cache size: 4435, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4444, Positive cache size: 4444, Positive conditional cache size: 4438, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4445, Positive cache size: 4445, Positive conditional cache size: 4439, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4448, Positive cache size: 4448, Positive conditional cache size: 4442, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4449, Positive cache size: 4449, Positive conditional cache size: 4443, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4452, Positive cache size: 4452, Positive conditional cache size: 4446, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4453, Positive cache size: 4453, Positive conditional cache size: 4447, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4456, Positive cache size: 4456, Positive conditional cache size: 4450, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4457, Positive cache size: 4457, Positive conditional cache size: 4451, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4460, Positive cache size: 4460, Positive conditional cache size: 4454, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4461, Positive cache size: 4461, Positive conditional cache size: 4455, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4464, Positive cache size: 4464, Positive conditional cache size: 4458, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4465, Positive cache size: 4465, Positive conditional cache size: 4459, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4468, Positive cache size: 4468, Positive conditional cache size: 4462, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4469, Positive cache size: 4469, Positive conditional cache size: 4463, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4472, Positive cache size: 4472, Positive conditional cache size: 4466, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4473, Positive cache size: 4473, Positive conditional cache size: 4467, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4476, Positive cache size: 4476, Positive conditional cache size: 4470, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4477, Positive cache size: 4477, Positive conditional cache size: 4471, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4480, Positive cache size: 4480, Positive conditional cache size: 4474, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4481, Positive cache size: 4481, Positive conditional cache size: 4475, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4484, Positive cache size: 4484, Positive conditional cache size: 4478, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4485, Positive cache size: 4485, Positive conditional cache size: 4479, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4488, Positive cache size: 4488, Positive conditional cache size: 4482, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4489, Positive cache size: 4489, Positive conditional cache size: 4483, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4492, Positive cache size: 4492, Positive conditional cache size: 4486, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4493, Positive cache size: 4493, Positive conditional cache size: 4487, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4496, Positive cache size: 4496, Positive conditional cache size: 4490, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4497, Positive cache size: 4497, Positive conditional cache size: 4491, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4500, Positive cache size: 4500, Positive conditional cache size: 4494, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4501, Positive cache size: 4501, Positive conditional cache size: 4495, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4504, Positive cache size: 4504, Positive conditional cache size: 4498, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4505, Positive cache size: 4505, Positive conditional cache size: 4499, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4508, Positive cache size: 4508, Positive conditional cache size: 4502, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4509, Positive cache size: 4509, Positive conditional cache size: 4503, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4512, Positive cache size: 4512, Positive conditional cache size: 4506, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4513, Positive cache size: 4513, Positive conditional cache size: 4507, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4516, Positive cache size: 4516, Positive conditional cache size: 4510, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4517, Positive cache size: 4517, Positive conditional cache size: 4511, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4520, Positive cache size: 4520, Positive conditional cache size: 4514, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4521, Positive cache size: 4521, Positive conditional cache size: 4515, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4524, Positive cache size: 4524, Positive conditional cache size: 4518, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4525, Positive cache size: 4525, Positive conditional cache size: 4519, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4528, Positive cache size: 4528, Positive conditional cache size: 4522, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4529, Positive cache size: 4529, Positive conditional cache size: 4523, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4532, Positive cache size: 4532, Positive conditional cache size: 4526, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4533, Positive cache size: 4533, Positive conditional cache size: 4527, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4536, Positive cache size: 4536, Positive conditional cache size: 4530, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4537, Positive cache size: 4537, Positive conditional cache size: 4531, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4540, Positive cache size: 4540, Positive conditional cache size: 4534, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4541, Positive cache size: 4541, Positive conditional cache size: 4535, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4544, Positive cache size: 4544, Positive conditional cache size: 4538, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4545, Positive cache size: 4545, Positive conditional cache size: 4539, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4548, Positive cache size: 4548, Positive conditional cache size: 4542, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4549, Positive cache size: 4549, Positive conditional cache size: 4543, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4552, Positive cache size: 4552, Positive conditional cache size: 4546, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4553, Positive cache size: 4553, Positive conditional cache size: 4547, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4556, Positive cache size: 4556, Positive conditional cache size: 4550, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4557, Positive cache size: 4557, Positive conditional cache size: 4551, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4560, Positive cache size: 4560, Positive conditional cache size: 4554, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4561, Positive cache size: 4561, Positive conditional cache size: 4555, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4564, Positive cache size: 4564, Positive conditional cache size: 4558, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4565, Positive cache size: 4565, Positive conditional cache size: 4559, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4568, Positive cache size: 4568, Positive conditional cache size: 4562, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4569, Positive cache size: 4569, Positive conditional cache size: 4563, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4572, Positive cache size: 4572, Positive conditional cache size: 4566, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4573, Positive cache size: 4573, Positive conditional cache size: 4567, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4576, Positive cache size: 4576, Positive conditional cache size: 4570, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4577, Positive cache size: 4577, Positive conditional cache size: 4571, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4580, Positive cache size: 4580, Positive conditional cache size: 4574, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4581, Positive cache size: 4581, Positive conditional cache size: 4575, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4584, Positive cache size: 4584, Positive conditional cache size: 4578, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4585, Positive cache size: 4585, Positive conditional cache size: 4579, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4588, Positive cache size: 4588, Positive conditional cache size: 4582, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4589, Positive cache size: 4589, Positive conditional cache size: 4583, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4592, Positive cache size: 4592, Positive conditional cache size: 4586, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4593, Positive cache size: 4593, Positive conditional cache size: 4587, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4596, Positive cache size: 4596, Positive conditional cache size: 4590, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4597, Positive cache size: 4597, Positive conditional cache size: 4591, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4600, Positive cache size: 4600, Positive conditional cache size: 4594, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4601, Positive cache size: 4601, Positive conditional cache size: 4595, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4604, Positive cache size: 4604, Positive conditional cache size: 4598, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4605, Positive cache size: 4605, Positive conditional cache size: 4599, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4608, Positive cache size: 4608, Positive conditional cache size: 4602, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4609, Positive cache size: 4609, Positive conditional cache size: 4603, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4612, Positive cache size: 4612, Positive conditional cache size: 4606, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4613, Positive cache size: 4613, Positive conditional cache size: 4607, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4616, Positive cache size: 4616, Positive conditional cache size: 4610, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4617, Positive cache size: 4617, Positive conditional cache size: 4611, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4620, Positive cache size: 4620, Positive conditional cache size: 4614, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4621, Positive cache size: 4621, Positive conditional cache size: 4615, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4624, Positive cache size: 4624, Positive conditional cache size: 4618, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4625, Positive cache size: 4625, Positive conditional cache size: 4619, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4628, Positive cache size: 4628, Positive conditional cache size: 4622, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4629, Positive cache size: 4629, Positive conditional cache size: 4623, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4632, Positive cache size: 4632, Positive conditional cache size: 4626, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4633, Positive cache size: 4633, Positive conditional cache size: 4627, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4636, Positive cache size: 4636, Positive conditional cache size: 4630, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4637, Positive cache size: 4637, Positive conditional cache size: 4631, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4640, Positive cache size: 4640, Positive conditional cache size: 4634, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4641, Positive cache size: 4641, Positive conditional cache size: 4635, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4644, Positive cache size: 4644, Positive conditional cache size: 4638, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4645, Positive cache size: 4645, Positive conditional cache size: 4639, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4648, Positive cache size: 4648, Positive conditional cache size: 4642, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4649, Positive cache size: 4649, Positive conditional cache size: 4643, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4652, Positive cache size: 4652, Positive conditional cache size: 4646, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4653, Positive cache size: 4653, Positive conditional cache size: 4647, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4656, Positive cache size: 4656, Positive conditional cache size: 4650, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4657, Positive cache size: 4657, Positive conditional cache size: 4651, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4660, Positive cache size: 4660, Positive conditional cache size: 4654, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4661, Positive cache size: 4661, Positive conditional cache size: 4655, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4664, Positive cache size: 4664, Positive conditional cache size: 4658, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4665, Positive cache size: 4665, Positive conditional cache size: 4659, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4668, Positive cache size: 4668, Positive conditional cache size: 4662, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4669, Positive cache size: 4669, Positive conditional cache size: 4663, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4672, Positive cache size: 4672, Positive conditional cache size: 4666, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4673, Positive cache size: 4673, Positive conditional cache size: 4667, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4676, Positive cache size: 4676, Positive conditional cache size: 4670, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4677, Positive cache size: 4677, Positive conditional cache size: 4671, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4680, Positive cache size: 4680, Positive conditional cache size: 4674, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4681, Positive cache size: 4681, Positive conditional cache size: 4675, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4684, Positive cache size: 4684, Positive conditional cache size: 4678, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4685, Positive cache size: 4685, Positive conditional cache size: 4679, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4688, Positive cache size: 4688, Positive conditional cache size: 4682, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4689, Positive cache size: 4689, Positive conditional cache size: 4683, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4692, Positive cache size: 4692, Positive conditional cache size: 4686, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4693, Positive cache size: 4693, Positive conditional cache size: 4687, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4696, Positive cache size: 4696, Positive conditional cache size: 4690, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4697, Positive cache size: 4697, Positive conditional cache size: 4691, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4700, Positive cache size: 4700, Positive conditional cache size: 4694, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4701, Positive cache size: 4701, Positive conditional cache size: 4695, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4704, Positive cache size: 4704, Positive conditional cache size: 4698, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4705, Positive cache size: 4705, Positive conditional cache size: 4699, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4708, Positive cache size: 4708, Positive conditional cache size: 4702, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4709, Positive cache size: 4709, Positive conditional cache size: 4703, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4712, Positive cache size: 4712, Positive conditional cache size: 4706, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4713, Positive cache size: 4713, Positive conditional cache size: 4707, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4716, Positive cache size: 4716, Positive conditional cache size: 4710, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4717, Positive cache size: 4717, Positive conditional cache size: 4711, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4720, Positive cache size: 4720, Positive conditional cache size: 4714, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4721, Positive cache size: 4721, Positive conditional cache size: 4715, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4724, Positive cache size: 4724, Positive conditional cache size: 4718, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4725, Positive cache size: 4725, Positive conditional cache size: 4719, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4728, Positive cache size: 4728, Positive conditional cache size: 4722, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4729, Positive cache size: 4729, Positive conditional cache size: 4723, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4732, Positive cache size: 4732, Positive conditional cache size: 4726, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4733, Positive cache size: 4733, Positive conditional cache size: 4727, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4736, Positive cache size: 4736, Positive conditional cache size: 4730, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4737, Positive cache size: 4737, Positive conditional cache size: 4731, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4740, Positive cache size: 4740, Positive conditional cache size: 4734, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4741, Positive cache size: 4741, Positive conditional cache size: 4735, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4744, Positive cache size: 4744, Positive conditional cache size: 4738, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4745, Positive cache size: 4745, Positive conditional cache size: 4739, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4748, Positive cache size: 4748, Positive conditional cache size: 4742, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4749, Positive cache size: 4749, Positive conditional cache size: 4743, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4752, Positive cache size: 4752, Positive conditional cache size: 4746, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4753, Positive cache size: 4753, Positive conditional cache size: 4747, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4756, Positive cache size: 4756, Positive conditional cache size: 4750, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4757, Positive cache size: 4757, Positive conditional cache size: 4751, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4760, Positive cache size: 4760, Positive conditional cache size: 4754, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4761, Positive cache size: 4761, Positive conditional cache size: 4755, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4764, Positive cache size: 4764, Positive conditional cache size: 4758, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4765, Positive cache size: 4765, Positive conditional cache size: 4759, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4768, Positive cache size: 4768, Positive conditional cache size: 4762, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4769, Positive cache size: 4769, Positive conditional cache size: 4763, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4772, Positive cache size: 4772, Positive conditional cache size: 4766, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4773, Positive cache size: 4773, Positive conditional cache size: 4767, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4776, Positive cache size: 4776, Positive conditional cache size: 4770, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4777, Positive cache size: 4777, Positive conditional cache size: 4771, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4780, Positive cache size: 4780, Positive conditional cache size: 4774, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4781, Positive cache size: 4781, Positive conditional cache size: 4775, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4784, Positive cache size: 4784, Positive conditional cache size: 4778, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4785, Positive cache size: 4785, Positive conditional cache size: 4779, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4788, Positive cache size: 4788, Positive conditional cache size: 4782, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4789, Positive cache size: 4789, Positive conditional cache size: 4783, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4792, Positive cache size: 4792, Positive conditional cache size: 4786, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4793, Positive cache size: 4793, Positive conditional cache size: 4787, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4796, Positive cache size: 4796, Positive conditional cache size: 4790, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4797, Positive cache size: 4797, Positive conditional cache size: 4791, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4800, Positive cache size: 4800, Positive conditional cache size: 4794, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4801, Positive cache size: 4801, Positive conditional cache size: 4795, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4804, Positive cache size: 4804, Positive conditional cache size: 4798, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4805, Positive cache size: 4805, Positive conditional cache size: 4799, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4808, Positive cache size: 4808, Positive conditional cache size: 4802, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4809, Positive cache size: 4809, Positive conditional cache size: 4803, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4812, Positive cache size: 4812, Positive conditional cache size: 4806, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4813, Positive cache size: 4813, Positive conditional cache size: 4807, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4816, Positive cache size: 4816, Positive conditional cache size: 4810, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4817, Positive cache size: 4817, Positive conditional cache size: 4811, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4820, Positive cache size: 4820, Positive conditional cache size: 4814, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4821, Positive cache size: 4821, Positive conditional cache size: 4815, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4824, Positive cache size: 4824, Positive conditional cache size: 4818, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4825, Positive cache size: 4825, Positive conditional cache size: 4819, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4828, Positive cache size: 4828, Positive conditional cache size: 4822, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4829, Positive cache size: 4829, Positive conditional cache size: 4823, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4832, Positive cache size: 4832, Positive conditional cache size: 4826, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4833, Positive cache size: 4833, Positive conditional cache size: 4827, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4836, Positive cache size: 4836, Positive conditional cache size: 4830, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4837, Positive cache size: 4837, Positive conditional cache size: 4831, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4840, Positive cache size: 4840, Positive conditional cache size: 4834, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4841, Positive cache size: 4841, Positive conditional cache size: 4835, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4844, Positive cache size: 4844, Positive conditional cache size: 4838, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4845, Positive cache size: 4845, Positive conditional cache size: 4839, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4848, Positive cache size: 4848, Positive conditional cache size: 4842, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4849, Positive cache size: 4849, Positive conditional cache size: 4843, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4852, Positive cache size: 4852, Positive conditional cache size: 4846, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4853, Positive cache size: 4853, Positive conditional cache size: 4847, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4856, Positive cache size: 4856, Positive conditional cache size: 4850, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4857, Positive cache size: 4857, Positive conditional cache size: 4851, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4860, Positive cache size: 4860, Positive conditional cache size: 4854, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4861, Positive cache size: 4861, Positive conditional cache size: 4855, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4864, Positive cache size: 4864, Positive conditional cache size: 4858, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4865, Positive cache size: 4865, Positive conditional cache size: 4859, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4868, Positive cache size: 4868, Positive conditional cache size: 4862, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4869, Positive cache size: 4869, Positive conditional cache size: 4863, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4872, Positive cache size: 4872, Positive conditional cache size: 4866, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4873, Positive cache size: 4873, Positive conditional cache size: 4867, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4876, Positive cache size: 4876, Positive conditional cache size: 4870, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4877, Positive cache size: 4877, Positive conditional cache size: 4871, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4880, Positive cache size: 4880, Positive conditional cache size: 4874, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4881, Positive cache size: 4881, Positive conditional cache size: 4875, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4884, Positive cache size: 4884, Positive conditional cache size: 4878, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4885, Positive cache size: 4885, Positive conditional cache size: 4879, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4888, Positive cache size: 4888, Positive conditional cache size: 4882, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4889, Positive cache size: 4889, Positive conditional cache size: 4883, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4892, Positive cache size: 4892, Positive conditional cache size: 4886, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4893, Positive cache size: 4893, Positive conditional cache size: 4887, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4896, Positive cache size: 4896, Positive conditional cache size: 4890, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4897, Positive cache size: 4897, Positive conditional cache size: 4891, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4900, Positive cache size: 4900, Positive conditional cache size: 4894, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4901, Positive cache size: 4901, Positive conditional cache size: 4895, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4904, Positive cache size: 4904, Positive conditional cache size: 4898, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4905, Positive cache size: 4905, Positive conditional cache size: 4899, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4908, Positive cache size: 4908, Positive conditional cache size: 4902, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4909, Positive cache size: 4909, Positive conditional cache size: 4903, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4912, Positive cache size: 4912, Positive conditional cache size: 4906, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4913, Positive cache size: 4913, Positive conditional cache size: 4907, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4916, Positive cache size: 4916, Positive conditional cache size: 4910, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4917, Positive cache size: 4917, Positive conditional cache size: 4911, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4920, Positive cache size: 4920, Positive conditional cache size: 4914, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4921, Positive cache size: 4921, Positive conditional cache size: 4915, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4924, Positive cache size: 4924, Positive conditional cache size: 4918, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4925, Positive cache size: 4925, Positive conditional cache size: 4919, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4928, Positive cache size: 4928, Positive conditional cache size: 4922, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4929, Positive cache size: 4929, Positive conditional cache size: 4923, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4932, Positive cache size: 4932, Positive conditional cache size: 4926, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4933, Positive cache size: 4933, Positive conditional cache size: 4927, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4936, Positive cache size: 4936, Positive conditional cache size: 4930, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4937, Positive cache size: 4937, Positive conditional cache size: 4931, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4940, Positive cache size: 4940, Positive conditional cache size: 4934, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4941, Positive cache size: 4941, Positive conditional cache size: 4935, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4944, Positive cache size: 4944, Positive conditional cache size: 4938, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4945, Positive cache size: 4945, Positive conditional cache size: 4939, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4948, Positive cache size: 4948, Positive conditional cache size: 4942, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4949, Positive cache size: 4949, Positive conditional cache size: 4943, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4952, Positive cache size: 4952, Positive conditional cache size: 4946, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4953, Positive cache size: 4953, Positive conditional cache size: 4947, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4956, Positive cache size: 4956, Positive conditional cache size: 4950, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4957, Positive cache size: 4957, Positive conditional cache size: 4951, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4960, Positive cache size: 4960, Positive conditional cache size: 4954, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4961, Positive cache size: 4961, Positive conditional cache size: 4955, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4964, Positive cache size: 4964, Positive conditional cache size: 4958, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4965, Positive cache size: 4965, Positive conditional cache size: 4959, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4968, Positive cache size: 4968, Positive conditional cache size: 4962, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4969, Positive cache size: 4969, Positive conditional cache size: 4963, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4972, Positive cache size: 4972, Positive conditional cache size: 4966, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4973, Positive cache size: 4973, Positive conditional cache size: 4967, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4976, Positive cache size: 4976, Positive conditional cache size: 4970, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4977, Positive cache size: 4977, Positive conditional cache size: 4971, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4980, Positive cache size: 4980, Positive conditional cache size: 4974, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4981, Positive cache size: 4981, Positive conditional cache size: 4975, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4984, Positive cache size: 4984, Positive conditional cache size: 4978, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4985, Positive cache size: 4985, Positive conditional cache size: 4979, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4988, Positive cache size: 4988, Positive conditional cache size: 4982, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4989, Positive cache size: 4989, Positive conditional cache size: 4983, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4992, Positive cache size: 4992, Positive conditional cache size: 4986, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4993, Positive cache size: 4993, Positive conditional cache size: 4987, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 4996, Positive cache size: 4996, Positive conditional cache size: 4990, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 4997, Positive cache size: 4997, Positive conditional cache size: 4991, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5000, Positive cache size: 5000, Positive conditional cache size: 4994, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5001, Positive cache size: 5001, Positive conditional cache size: 4995, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5004, Positive cache size: 5004, Positive conditional cache size: 4998, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5005, Positive cache size: 5005, Positive conditional cache size: 4999, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5008, Positive cache size: 5008, Positive conditional cache size: 5002, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5009, Positive cache size: 5009, Positive conditional cache size: 5003, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5012, Positive cache size: 5012, Positive conditional cache size: 5006, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5013, Positive cache size: 5013, Positive conditional cache size: 5007, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5016, Positive cache size: 5016, Positive conditional cache size: 5010, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5017, Positive cache size: 5017, Positive conditional cache size: 5011, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5020, Positive cache size: 5020, Positive conditional cache size: 5014, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5021, Positive cache size: 5021, Positive conditional cache size: 5015, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5024, Positive cache size: 5024, Positive conditional cache size: 5018, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5025, Positive cache size: 5025, Positive conditional cache size: 5019, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5028, Positive cache size: 5028, Positive conditional cache size: 5022, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5029, Positive cache size: 5029, Positive conditional cache size: 5023, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5032, Positive cache size: 5032, Positive conditional cache size: 5026, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5033, Positive cache size: 5033, Positive conditional cache size: 5027, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5036, Positive cache size: 5036, Positive conditional cache size: 5030, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5037, Positive cache size: 5037, Positive conditional cache size: 5031, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5040, Positive cache size: 5040, Positive conditional cache size: 5034, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5041, Positive cache size: 5041, Positive conditional cache size: 5035, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5044, Positive cache size: 5044, Positive conditional cache size: 5038, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5045, Positive cache size: 5045, Positive conditional cache size: 5039, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5048, Positive cache size: 5048, Positive conditional cache size: 5042, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5049, Positive cache size: 5049, Positive conditional cache size: 5043, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5052, Positive cache size: 5052, Positive conditional cache size: 5046, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5053, Positive cache size: 5053, Positive conditional cache size: 5047, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5056, Positive cache size: 5056, Positive conditional cache size: 5050, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5057, Positive cache size: 5057, Positive conditional cache size: 5051, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5060, Positive cache size: 5060, Positive conditional cache size: 5054, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5061, Positive cache size: 5061, Positive conditional cache size: 5055, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5064, Positive cache size: 5064, Positive conditional cache size: 5058, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5065, Positive cache size: 5065, Positive conditional cache size: 5059, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5068, Positive cache size: 5068, Positive conditional cache size: 5062, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5069, Positive cache size: 5069, Positive conditional cache size: 5063, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5072, Positive cache size: 5072, Positive conditional cache size: 5066, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5073, Positive cache size: 5073, Positive conditional cache size: 5067, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5076, Positive cache size: 5076, Positive conditional cache size: 5070, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5077, Positive cache size: 5077, Positive conditional cache size: 5071, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5080, Positive cache size: 5080, Positive conditional cache size: 5074, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5081, Positive cache size: 5081, Positive conditional cache size: 5075, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5084, Positive cache size: 5084, Positive conditional cache size: 5078, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5085, Positive cache size: 5085, Positive conditional cache size: 5079, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5088, Positive cache size: 5088, Positive conditional cache size: 5082, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5089, Positive cache size: 5089, Positive conditional cache size: 5083, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5092, Positive cache size: 5092, Positive conditional cache size: 5086, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5093, Positive cache size: 5093, Positive conditional cache size: 5087, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5096, Positive cache size: 5096, Positive conditional cache size: 5090, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5097, Positive cache size: 5097, Positive conditional cache size: 5091, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5100, Positive cache size: 5100, Positive conditional cache size: 5094, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5101, Positive cache size: 5101, Positive conditional cache size: 5095, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5104, Positive cache size: 5104, Positive conditional cache size: 5098, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5105, Positive cache size: 5105, Positive conditional cache size: 5099, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5108, Positive cache size: 5108, Positive conditional cache size: 5102, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5109, Positive cache size: 5109, Positive conditional cache size: 5103, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5112, Positive cache size: 5112, Positive conditional cache size: 5106, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5113, Positive cache size: 5113, Positive conditional cache size: 5107, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5116, Positive cache size: 5116, Positive conditional cache size: 5110, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5117, Positive cache size: 5117, Positive conditional cache size: 5111, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5120, Positive cache size: 5120, Positive conditional cache size: 5114, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5121, Positive cache size: 5121, Positive conditional cache size: 5115, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5124, Positive cache size: 5124, Positive conditional cache size: 5118, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5125, Positive cache size: 5125, Positive conditional cache size: 5119, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5128, Positive cache size: 5128, Positive conditional cache size: 5122, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5129, Positive cache size: 5129, Positive conditional cache size: 5123, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5132, Positive cache size: 5132, Positive conditional cache size: 5126, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5133, Positive cache size: 5133, Positive conditional cache size: 5127, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5136, Positive cache size: 5136, Positive conditional cache size: 5130, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5137, Positive cache size: 5137, Positive conditional cache size: 5131, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5140, Positive cache size: 5140, Positive conditional cache size: 5134, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5141, Positive cache size: 5141, Positive conditional cache size: 5135, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5144, Positive cache size: 5144, Positive conditional cache size: 5138, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5145, Positive cache size: 5145, Positive conditional cache size: 5139, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5148, Positive cache size: 5148, Positive conditional cache size: 5142, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5149, Positive cache size: 5149, Positive conditional cache size: 5143, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5152, Positive cache size: 5152, Positive conditional cache size: 5146, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5153, Positive cache size: 5153, Positive conditional cache size: 5147, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5156, Positive cache size: 5156, Positive conditional cache size: 5150, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5157, Positive cache size: 5157, Positive conditional cache size: 5151, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5160, Positive cache size: 5160, Positive conditional cache size: 5154, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5161, Positive cache size: 5161, Positive conditional cache size: 5155, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5164, Positive cache size: 5164, Positive conditional cache size: 5158, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5165, Positive cache size: 5165, Positive conditional cache size: 5159, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5168, Positive cache size: 5168, Positive conditional cache size: 5162, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5169, Positive cache size: 5169, Positive conditional cache size: 5163, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5172, Positive cache size: 5172, Positive conditional cache size: 5166, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5173, Positive cache size: 5173, Positive conditional cache size: 5167, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5176, Positive cache size: 5176, Positive conditional cache size: 5170, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5177, Positive cache size: 5177, Positive conditional cache size: 5171, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5180, Positive cache size: 5180, Positive conditional cache size: 5174, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5181, Positive cache size: 5181, Positive conditional cache size: 5175, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5184, Positive cache size: 5184, Positive conditional cache size: 5178, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5185, Positive cache size: 5185, Positive conditional cache size: 5179, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5188, Positive cache size: 5188, Positive conditional cache size: 5182, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5189, Positive cache size: 5189, Positive conditional cache size: 5183, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5192, Positive cache size: 5192, Positive conditional cache size: 5186, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5193, Positive cache size: 5193, Positive conditional cache size: 5187, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5196, Positive cache size: 5196, Positive conditional cache size: 5190, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5197, Positive cache size: 5197, Positive conditional cache size: 5191, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5200, Positive cache size: 5200, Positive conditional cache size: 5194, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5201, Positive cache size: 5201, Positive conditional cache size: 5195, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5204, Positive cache size: 5204, Positive conditional cache size: 5198, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5205, Positive cache size: 5205, Positive conditional cache size: 5199, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5208, Positive cache size: 5208, Positive conditional cache size: 5202, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5209, Positive cache size: 5209, Positive conditional cache size: 5203, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5212, Positive cache size: 5212, Positive conditional cache size: 5206, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5213, Positive cache size: 5213, Positive conditional cache size: 5207, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5216, Positive cache size: 5216, Positive conditional cache size: 5210, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5217, Positive cache size: 5217, Positive conditional cache size: 5211, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5220, Positive cache size: 5220, Positive conditional cache size: 5214, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5221, Positive cache size: 5221, Positive conditional cache size: 5215, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5224, Positive cache size: 5224, Positive conditional cache size: 5218, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5225, Positive cache size: 5225, Positive conditional cache size: 5219, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5228, Positive cache size: 5228, Positive conditional cache size: 5222, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5229, Positive cache size: 5229, Positive conditional cache size: 5223, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5232, Positive cache size: 5232, Positive conditional cache size: 5226, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5233, Positive cache size: 5233, Positive conditional cache size: 5227, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5236, Positive cache size: 5236, Positive conditional cache size: 5230, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5237, Positive cache size: 5237, Positive conditional cache size: 5231, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5240, Positive cache size: 5240, Positive conditional cache size: 5234, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5241, Positive cache size: 5241, Positive conditional cache size: 5235, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5244, Positive cache size: 5244, Positive conditional cache size: 5238, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5245, Positive cache size: 5245, Positive conditional cache size: 5239, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5248, Positive cache size: 5248, Positive conditional cache size: 5242, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5249, Positive cache size: 5249, Positive conditional cache size: 5243, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5252, Positive cache size: 5252, Positive conditional cache size: 5246, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5253, Positive cache size: 5253, Positive conditional cache size: 5247, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5256, Positive cache size: 5256, Positive conditional cache size: 5250, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5257, Positive cache size: 5257, Positive conditional cache size: 5251, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5260, Positive cache size: 5260, Positive conditional cache size: 5254, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5261, Positive cache size: 5261, Positive conditional cache size: 5255, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5264, Positive cache size: 5264, Positive conditional cache size: 5258, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5265, Positive cache size: 5265, Positive conditional cache size: 5259, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5268, Positive cache size: 5268, Positive conditional cache size: 5262, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5269, Positive cache size: 5269, Positive conditional cache size: 5263, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5272, Positive cache size: 5272, Positive conditional cache size: 5266, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5273, Positive cache size: 5273, Positive conditional cache size: 5267, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5276, Positive cache size: 5276, Positive conditional cache size: 5270, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5277, Positive cache size: 5277, Positive conditional cache size: 5271, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5280, Positive cache size: 5280, Positive conditional cache size: 5274, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5281, Positive cache size: 5281, Positive conditional cache size: 5275, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5284, Positive cache size: 5284, Positive conditional cache size: 5278, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5285, Positive cache size: 5285, Positive conditional cache size: 5279, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5288, Positive cache size: 5288, Positive conditional cache size: 5282, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5289, Positive cache size: 5289, Positive conditional cache size: 5283, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5292, Positive cache size: 5292, Positive conditional cache size: 5286, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5293, Positive cache size: 5293, Positive conditional cache size: 5287, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5296, Positive cache size: 5296, Positive conditional cache size: 5290, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5297, Positive cache size: 5297, Positive conditional cache size: 5291, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5300, Positive cache size: 5300, Positive conditional cache size: 5294, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5301, Positive cache size: 5301, Positive conditional cache size: 5295, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5304, Positive cache size: 5304, Positive conditional cache size: 5298, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5305, Positive cache size: 5305, Positive conditional cache size: 5299, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5308, Positive cache size: 5308, Positive conditional cache size: 5302, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5309, Positive cache size: 5309, Positive conditional cache size: 5303, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5312, Positive cache size: 5312, Positive conditional cache size: 5306, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5313, Positive cache size: 5313, Positive conditional cache size: 5307, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5316, Positive cache size: 5316, Positive conditional cache size: 5310, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5317, Positive cache size: 5317, Positive conditional cache size: 5311, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5320, Positive cache size: 5320, Positive conditional cache size: 5314, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5321, Positive cache size: 5321, Positive conditional cache size: 5315, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5324, Positive cache size: 5324, Positive conditional cache size: 5318, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5325, Positive cache size: 5325, Positive conditional cache size: 5319, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5328, Positive cache size: 5328, Positive conditional cache size: 5322, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5329, Positive cache size: 5329, Positive conditional cache size: 5323, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5332, Positive cache size: 5332, Positive conditional cache size: 5326, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5333, Positive cache size: 5333, Positive conditional cache size: 5327, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5336, Positive cache size: 5336, Positive conditional cache size: 5330, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5337, Positive cache size: 5337, Positive conditional cache size: 5331, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5340, Positive cache size: 5340, Positive conditional cache size: 5334, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5341, Positive cache size: 5341, Positive conditional cache size: 5335, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5344, Positive cache size: 5344, Positive conditional cache size: 5338, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5345, Positive cache size: 5345, Positive conditional cache size: 5339, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5348, Positive cache size: 5348, Positive conditional cache size: 5342, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5349, Positive cache size: 5349, Positive conditional cache size: 5343, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5352, Positive cache size: 5352, Positive conditional cache size: 5346, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5353, Positive cache size: 5353, Positive conditional cache size: 5347, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5356, Positive cache size: 5356, Positive conditional cache size: 5350, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5357, Positive cache size: 5357, Positive conditional cache size: 5351, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5360, Positive cache size: 5360, Positive conditional cache size: 5354, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5361, Positive cache size: 5361, Positive conditional cache size: 5355, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5364, Positive cache size: 5364, Positive conditional cache size: 5358, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5365, Positive cache size: 5365, Positive conditional cache size: 5359, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5368, Positive cache size: 5368, Positive conditional cache size: 5362, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5369, Positive cache size: 5369, Positive conditional cache size: 5363, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5372, Positive cache size: 5372, Positive conditional cache size: 5366, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5373, Positive cache size: 5373, Positive conditional cache size: 5367, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5376, Positive cache size: 5376, Positive conditional cache size: 5370, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5377, Positive cache size: 5377, Positive conditional cache size: 5371, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5380, Positive cache size: 5380, Positive conditional cache size: 5374, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5381, Positive cache size: 5381, Positive conditional cache size: 5375, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5384, Positive cache size: 5384, Positive conditional cache size: 5378, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5385, Positive cache size: 5385, Positive conditional cache size: 5379, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5388, Positive cache size: 5388, Positive conditional cache size: 5382, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5389, Positive cache size: 5389, Positive conditional cache size: 5383, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5392, Positive cache size: 5392, Positive conditional cache size: 5386, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5393, Positive cache size: 5393, Positive conditional cache size: 5387, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5396, Positive cache size: 5396, Positive conditional cache size: 5390, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5397, Positive cache size: 5397, Positive conditional cache size: 5391, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5400, Positive cache size: 5400, Positive conditional cache size: 5394, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5401, Positive cache size: 5401, Positive conditional cache size: 5395, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5404, Positive cache size: 5404, Positive conditional cache size: 5398, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5405, Positive cache size: 5405, Positive conditional cache size: 5399, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5408, Positive cache size: 5408, Positive conditional cache size: 5402, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5409, Positive cache size: 5409, Positive conditional cache size: 5403, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5412, Positive cache size: 5412, Positive conditional cache size: 5406, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5413, Positive cache size: 5413, Positive conditional cache size: 5407, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5416, Positive cache size: 5416, Positive conditional cache size: 5410, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5417, Positive cache size: 5417, Positive conditional cache size: 5411, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5420, Positive cache size: 5420, Positive conditional cache size: 5414, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5421, Positive cache size: 5421, Positive conditional cache size: 5415, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5424, Positive cache size: 5424, Positive conditional cache size: 5418, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5425, Positive cache size: 5425, Positive conditional cache size: 5419, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5428, Positive cache size: 5428, Positive conditional cache size: 5422, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5429, Positive cache size: 5429, Positive conditional cache size: 5423, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5432, Positive cache size: 5432, Positive conditional cache size: 5426, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5433, Positive cache size: 5433, Positive conditional cache size: 5427, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5436, Positive cache size: 5436, Positive conditional cache size: 5430, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5437, Positive cache size: 5437, Positive conditional cache size: 5431, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5440, Positive cache size: 5440, Positive conditional cache size: 5434, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5441, Positive cache size: 5441, Positive conditional cache size: 5435, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5444, Positive cache size: 5444, Positive conditional cache size: 5438, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5445, Positive cache size: 5445, Positive conditional cache size: 5439, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5448, Positive cache size: 5448, Positive conditional cache size: 5442, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5449, Positive cache size: 5449, Positive conditional cache size: 5443, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5452, Positive cache size: 5452, Positive conditional cache size: 5446, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5453, Positive cache size: 5453, Positive conditional cache size: 5447, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5456, Positive cache size: 5456, Positive conditional cache size: 5450, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5457, Positive cache size: 5457, Positive conditional cache size: 5451, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5460, Positive cache size: 5460, Positive conditional cache size: 5454, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5461, Positive cache size: 5461, Positive conditional cache size: 5455, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5464, Positive cache size: 5464, Positive conditional cache size: 5458, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5465, Positive cache size: 5465, Positive conditional cache size: 5459, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5468, Positive cache size: 5468, Positive conditional cache size: 5462, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5469, Positive cache size: 5469, Positive conditional cache size: 5463, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5472, Positive cache size: 5472, Positive conditional cache size: 5466, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5473, Positive cache size: 5473, Positive conditional cache size: 5467, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5476, Positive cache size: 5476, Positive conditional cache size: 5470, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5477, Positive cache size: 5477, Positive conditional cache size: 5471, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5480, Positive cache size: 5480, Positive conditional cache size: 5474, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5481, Positive cache size: 5481, Positive conditional cache size: 5475, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5484, Positive cache size: 5484, Positive conditional cache size: 5478, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5485, Positive cache size: 5485, Positive conditional cache size: 5479, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5488, Positive cache size: 5488, Positive conditional cache size: 5482, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5489, Positive cache size: 5489, Positive conditional cache size: 5483, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5492, Positive cache size: 5492, Positive conditional cache size: 5486, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5493, Positive cache size: 5493, Positive conditional cache size: 5487, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5496, Positive cache size: 5496, Positive conditional cache size: 5490, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5497, Positive cache size: 5497, Positive conditional cache size: 5491, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5500, Positive cache size: 5500, Positive conditional cache size: 5494, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5501, Positive cache size: 5501, Positive conditional cache size: 5495, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5504, Positive cache size: 5504, Positive conditional cache size: 5498, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5505, Positive cache size: 5505, Positive conditional cache size: 5499, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5508, Positive cache size: 5508, Positive conditional cache size: 5502, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5509, Positive cache size: 5509, Positive conditional cache size: 5503, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5512, Positive cache size: 5512, Positive conditional cache size: 5506, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5513, Positive cache size: 5513, Positive conditional cache size: 5507, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5516, Positive cache size: 5516, Positive conditional cache size: 5510, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5517, Positive cache size: 5517, Positive conditional cache size: 5511, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5520, Positive cache size: 5520, Positive conditional cache size: 5514, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5521, Positive cache size: 5521, Positive conditional cache size: 5515, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5524, Positive cache size: 5524, Positive conditional cache size: 5518, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5525, Positive cache size: 5525, Positive conditional cache size: 5519, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5528, Positive cache size: 5528, Positive conditional cache size: 5522, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5529, Positive cache size: 5529, Positive conditional cache size: 5523, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5532, Positive cache size: 5532, Positive conditional cache size: 5526, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5533, Positive cache size: 5533, Positive conditional cache size: 5527, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5536, Positive cache size: 5536, Positive conditional cache size: 5530, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5537, Positive cache size: 5537, Positive conditional cache size: 5531, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5540, Positive cache size: 5540, Positive conditional cache size: 5534, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5541, Positive cache size: 5541, Positive conditional cache size: 5535, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5544, Positive cache size: 5544, Positive conditional cache size: 5538, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5545, Positive cache size: 5545, Positive conditional cache size: 5539, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5548, Positive cache size: 5548, Positive conditional cache size: 5542, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5549, Positive cache size: 5549, Positive conditional cache size: 5543, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5552, Positive cache size: 5552, Positive conditional cache size: 5546, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5553, Positive cache size: 5553, Positive conditional cache size: 5547, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5556, Positive cache size: 5556, Positive conditional cache size: 5550, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5557, Positive cache size: 5557, Positive conditional cache size: 5551, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5560, Positive cache size: 5560, Positive conditional cache size: 5554, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5561, Positive cache size: 5561, Positive conditional cache size: 5555, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5564, Positive cache size: 5564, Positive conditional cache size: 5558, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5565, Positive cache size: 5565, Positive conditional cache size: 5559, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5568, Positive cache size: 5568, Positive conditional cache size: 5562, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5569, Positive cache size: 5569, Positive conditional cache size: 5563, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5572, Positive cache size: 5572, Positive conditional cache size: 5566, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5573, Positive cache size: 5573, Positive conditional cache size: 5567, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5576, Positive cache size: 5576, Positive conditional cache size: 5570, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5577, Positive cache size: 5577, Positive conditional cache size: 5571, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5580, Positive cache size: 5580, Positive conditional cache size: 5574, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5581, Positive cache size: 5581, Positive conditional cache size: 5575, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5584, Positive cache size: 5584, Positive conditional cache size: 5578, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5585, Positive cache size: 5585, Positive conditional cache size: 5579, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5588, Positive cache size: 5588, Positive conditional cache size: 5582, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5589, Positive cache size: 5589, Positive conditional cache size: 5583, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5592, Positive cache size: 5592, Positive conditional cache size: 5586, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5593, Positive cache size: 5593, Positive conditional cache size: 5587, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5596, Positive cache size: 5596, Positive conditional cache size: 5590, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5597, Positive cache size: 5597, Positive conditional cache size: 5591, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5600, Positive cache size: 5600, Positive conditional cache size: 5594, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5601, Positive cache size: 5601, Positive conditional cache size: 5595, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5604, Positive cache size: 5604, Positive conditional cache size: 5598, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5605, Positive cache size: 5605, Positive conditional cache size: 5599, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5608, Positive cache size: 5608, Positive conditional cache size: 5602, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5609, Positive cache size: 5609, Positive conditional cache size: 5603, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5612, Positive cache size: 5612, Positive conditional cache size: 5606, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5613, Positive cache size: 5613, Positive conditional cache size: 5607, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5616, Positive cache size: 5616, Positive conditional cache size: 5610, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5617, Positive cache size: 5617, Positive conditional cache size: 5611, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5620, Positive cache size: 5620, Positive conditional cache size: 5614, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5621, Positive cache size: 5621, Positive conditional cache size: 5615, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5624, Positive cache size: 5624, Positive conditional cache size: 5618, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5625, Positive cache size: 5625, Positive conditional cache size: 5619, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5628, Positive cache size: 5628, Positive conditional cache size: 5622, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5629, Positive cache size: 5629, Positive conditional cache size: 5623, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5632, Positive cache size: 5632, Positive conditional cache size: 5626, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5633, Positive cache size: 5633, Positive conditional cache size: 5627, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5636, Positive cache size: 5636, Positive conditional cache size: 5630, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5637, Positive cache size: 5637, Positive conditional cache size: 5631, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5640, Positive cache size: 5640, Positive conditional cache size: 5634, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5641, Positive cache size: 5641, Positive conditional cache size: 5635, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5644, Positive cache size: 5644, Positive conditional cache size: 5638, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5645, Positive cache size: 5645, Positive conditional cache size: 5639, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5648, Positive cache size: 5648, Positive conditional cache size: 5642, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5649, Positive cache size: 5649, Positive conditional cache size: 5643, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5652, Positive cache size: 5652, Positive conditional cache size: 5646, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5653, Positive cache size: 5653, Positive conditional cache size: 5647, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5656, Positive cache size: 5656, Positive conditional cache size: 5650, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5657, Positive cache size: 5657, Positive conditional cache size: 5651, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5660, Positive cache size: 5660, Positive conditional cache size: 5654, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5661, Positive cache size: 5661, Positive conditional cache size: 5655, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5664, Positive cache size: 5664, Positive conditional cache size: 5658, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5665, Positive cache size: 5665, Positive conditional cache size: 5659, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5668, Positive cache size: 5668, Positive conditional cache size: 5662, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5669, Positive cache size: 5669, Positive conditional cache size: 5663, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5672, Positive cache size: 5672, Positive conditional cache size: 5666, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5673, Positive cache size: 5673, Positive conditional cache size: 5667, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5676, Positive cache size: 5676, Positive conditional cache size: 5670, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5677, Positive cache size: 5677, Positive conditional cache size: 5671, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5680, Positive cache size: 5680, Positive conditional cache size: 5674, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5681, Positive cache size: 5681, Positive conditional cache size: 5675, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5684, Positive cache size: 5684, Positive conditional cache size: 5678, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5685, Positive cache size: 5685, Positive conditional cache size: 5679, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5688, Positive cache size: 5688, Positive conditional cache size: 5682, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5689, Positive cache size: 5689, Positive conditional cache size: 5683, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5692, Positive cache size: 5692, Positive conditional cache size: 5686, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5693, Positive cache size: 5693, Positive conditional cache size: 5687, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5696, Positive cache size: 5696, Positive conditional cache size: 5690, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5697, Positive cache size: 5697, Positive conditional cache size: 5691, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5700, Positive cache size: 5700, Positive conditional cache size: 5694, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5701, Positive cache size: 5701, Positive conditional cache size: 5695, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5704, Positive cache size: 5704, Positive conditional cache size: 5698, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5705, Positive cache size: 5705, Positive conditional cache size: 5699, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5708, Positive cache size: 5708, Positive conditional cache size: 5702, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5709, Positive cache size: 5709, Positive conditional cache size: 5703, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5712, Positive cache size: 5712, Positive conditional cache size: 5706, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5713, Positive cache size: 5713, Positive conditional cache size: 5707, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5716, Positive cache size: 5716, Positive conditional cache size: 5710, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5717, Positive cache size: 5717, Positive conditional cache size: 5711, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5720, Positive cache size: 5720, Positive conditional cache size: 5714, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5721, Positive cache size: 5721, Positive conditional cache size: 5715, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5724, Positive cache size: 5724, Positive conditional cache size: 5718, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5725, Positive cache size: 5725, Positive conditional cache size: 5719, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5728, Positive cache size: 5728, Positive conditional cache size: 5722, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5729, Positive cache size: 5729, Positive conditional cache size: 5723, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5732, Positive cache size: 5732, Positive conditional cache size: 5726, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5733, Positive cache size: 5733, Positive conditional cache size: 5727, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5736, Positive cache size: 5736, Positive conditional cache size: 5730, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5737, Positive cache size: 5737, Positive conditional cache size: 5731, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5740, Positive cache size: 5740, Positive conditional cache size: 5734, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5741, Positive cache size: 5741, Positive conditional cache size: 5735, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5744, Positive cache size: 5744, Positive conditional cache size: 5738, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5745, Positive cache size: 5745, Positive conditional cache size: 5739, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5748, Positive cache size: 5748, Positive conditional cache size: 5742, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5749, Positive cache size: 5749, Positive conditional cache size: 5743, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5752, Positive cache size: 5752, Positive conditional cache size: 5746, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5753, Positive cache size: 5753, Positive conditional cache size: 5747, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5756, Positive cache size: 5756, Positive conditional cache size: 5750, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5757, Positive cache size: 5757, Positive conditional cache size: 5751, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5760, Positive cache size: 5760, Positive conditional cache size: 5754, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5761, Positive cache size: 5761, Positive conditional cache size: 5755, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5764, Positive cache size: 5764, Positive conditional cache size: 5758, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5765, Positive cache size: 5765, Positive conditional cache size: 5759, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5768, Positive cache size: 5768, Positive conditional cache size: 5762, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5769, Positive cache size: 5769, Positive conditional cache size: 5763, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5772, Positive cache size: 5772, Positive conditional cache size: 5766, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5773, Positive cache size: 5773, Positive conditional cache size: 5767, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5776, Positive cache size: 5776, Positive conditional cache size: 5770, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5777, Positive cache size: 5777, Positive conditional cache size: 5771, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5780, Positive cache size: 5780, Positive conditional cache size: 5774, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5781, Positive cache size: 5781, Positive conditional cache size: 5775, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5784, Positive cache size: 5784, Positive conditional cache size: 5778, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5785, Positive cache size: 5785, Positive conditional cache size: 5779, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5788, Positive cache size: 5788, Positive conditional cache size: 5782, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5789, Positive cache size: 5789, Positive conditional cache size: 5783, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5792, Positive cache size: 5792, Positive conditional cache size: 5786, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5793, Positive cache size: 5793, Positive conditional cache size: 5787, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5796, Positive cache size: 5796, Positive conditional cache size: 5790, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5797, Positive cache size: 5797, Positive conditional cache size: 5791, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5800, Positive cache size: 5800, Positive conditional cache size: 5794, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5801, Positive cache size: 5801, Positive conditional cache size: 5795, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5804, Positive cache size: 5804, Positive conditional cache size: 5798, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5805, Positive cache size: 5805, Positive conditional cache size: 5799, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5808, Positive cache size: 5808, Positive conditional cache size: 5802, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5809, Positive cache size: 5809, Positive conditional cache size: 5803, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5812, Positive cache size: 5812, Positive conditional cache size: 5806, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5813, Positive cache size: 5813, Positive conditional cache size: 5807, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5816, Positive cache size: 5816, Positive conditional cache size: 5810, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5817, Positive cache size: 5817, Positive conditional cache size: 5811, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5820, Positive cache size: 5820, Positive conditional cache size: 5814, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5821, Positive cache size: 5821, Positive conditional cache size: 5815, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5824, Positive cache size: 5824, Positive conditional cache size: 5818, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5825, Positive cache size: 5825, Positive conditional cache size: 5819, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5828, Positive cache size: 5828, Positive conditional cache size: 5822, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5829, Positive cache size: 5829, Positive conditional cache size: 5823, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5832, Positive cache size: 5832, Positive conditional cache size: 5826, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5833, Positive cache size: 5833, Positive conditional cache size: 5827, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5836, Positive cache size: 5836, Positive conditional cache size: 5830, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5837, Positive cache size: 5837, Positive conditional cache size: 5831, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5840, Positive cache size: 5840, Positive conditional cache size: 5834, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5841, Positive cache size: 5841, Positive conditional cache size: 5835, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5844, Positive cache size: 5844, Positive conditional cache size: 5838, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5845, Positive cache size: 5845, Positive conditional cache size: 5839, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5848, Positive cache size: 5848, Positive conditional cache size: 5842, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5849, Positive cache size: 5849, Positive conditional cache size: 5843, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5852, Positive cache size: 5852, Positive conditional cache size: 5846, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5853, Positive cache size: 5853, Positive conditional cache size: 5847, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5856, Positive cache size: 5856, Positive conditional cache size: 5850, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5857, Positive cache size: 5857, Positive conditional cache size: 5851, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5860, Positive cache size: 5860, Positive conditional cache size: 5854, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5861, Positive cache size: 5861, Positive conditional cache size: 5855, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5864, Positive cache size: 5864, Positive conditional cache size: 5858, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5865, Positive cache size: 5865, Positive conditional cache size: 5859, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5868, Positive cache size: 5868, Positive conditional cache size: 5862, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5869, Positive cache size: 5869, Positive conditional cache size: 5863, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5872, Positive cache size: 5872, Positive conditional cache size: 5866, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5873, Positive cache size: 5873, Positive conditional cache size: 5867, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5876, Positive cache size: 5876, Positive conditional cache size: 5870, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5877, Positive cache size: 5877, Positive conditional cache size: 5871, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5880, Positive cache size: 5880, Positive conditional cache size: 5874, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5881, Positive cache size: 5881, Positive conditional cache size: 5875, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5884, Positive cache size: 5884, Positive conditional cache size: 5878, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5885, Positive cache size: 5885, Positive conditional cache size: 5879, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5888, Positive cache size: 5888, Positive conditional cache size: 5882, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5889, Positive cache size: 5889, Positive conditional cache size: 5883, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5892, Positive cache size: 5892, Positive conditional cache size: 5886, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5893, Positive cache size: 5893, Positive conditional cache size: 5887, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5896, Positive cache size: 5896, Positive conditional cache size: 5890, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5897, Positive cache size: 5897, Positive conditional cache size: 5891, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5900, Positive cache size: 5900, Positive conditional cache size: 5894, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5901, Positive cache size: 5901, Positive conditional cache size: 5895, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5904, Positive cache size: 5904, Positive conditional cache size: 5898, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5905, Positive cache size: 5905, Positive conditional cache size: 5899, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5908, Positive cache size: 5908, Positive conditional cache size: 5902, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5909, Positive cache size: 5909, Positive conditional cache size: 5903, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5912, Positive cache size: 5912, Positive conditional cache size: 5906, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5913, Positive cache size: 5913, Positive conditional cache size: 5907, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5916, Positive cache size: 5916, Positive conditional cache size: 5910, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5917, Positive cache size: 5917, Positive conditional cache size: 5911, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5920, Positive cache size: 5920, Positive conditional cache size: 5914, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5921, Positive cache size: 5921, Positive conditional cache size: 5915, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5924, Positive cache size: 5924, Positive conditional cache size: 5918, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5925, Positive cache size: 5925, Positive conditional cache size: 5919, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5928, Positive cache size: 5928, Positive conditional cache size: 5922, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5929, Positive cache size: 5929, Positive conditional cache size: 5923, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5932, Positive cache size: 5932, Positive conditional cache size: 5926, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5933, Positive cache size: 5933, Positive conditional cache size: 5927, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5936, Positive cache size: 5936, Positive conditional cache size: 5930, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5937, Positive cache size: 5937, Positive conditional cache size: 5931, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5940, Positive cache size: 5940, Positive conditional cache size: 5934, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5941, Positive cache size: 5941, Positive conditional cache size: 5935, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5944, Positive cache size: 5944, Positive conditional cache size: 5938, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5945, Positive cache size: 5945, Positive conditional cache size: 5939, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5948, Positive cache size: 5948, Positive conditional cache size: 5942, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5949, Positive cache size: 5949, Positive conditional cache size: 5943, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5952, Positive cache size: 5952, Positive conditional cache size: 5946, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5953, Positive cache size: 5953, Positive conditional cache size: 5947, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5956, Positive cache size: 5956, Positive conditional cache size: 5950, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5957, Positive cache size: 5957, Positive conditional cache size: 5951, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5960, Positive cache size: 5960, Positive conditional cache size: 5954, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5961, Positive cache size: 5961, Positive conditional cache size: 5955, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5964, Positive cache size: 5964, Positive conditional cache size: 5958, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5965, Positive cache size: 5965, Positive conditional cache size: 5959, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5968, Positive cache size: 5968, Positive conditional cache size: 5962, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5969, Positive cache size: 5969, Positive conditional cache size: 5963, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5972, Positive cache size: 5972, Positive conditional cache size: 5966, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5973, Positive cache size: 5973, Positive conditional cache size: 5967, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5976, Positive cache size: 5976, Positive conditional cache size: 5970, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5977, Positive cache size: 5977, Positive conditional cache size: 5971, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5980, Positive cache size: 5980, Positive conditional cache size: 5974, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5981, Positive cache size: 5981, Positive conditional cache size: 5975, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5984, Positive cache size: 5984, Positive conditional cache size: 5978, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5985, Positive cache size: 5985, Positive conditional cache size: 5979, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5988, Positive cache size: 5988, Positive conditional cache size: 5982, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5989, Positive cache size: 5989, Positive conditional cache size: 5983, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5992, Positive cache size: 5992, Positive conditional cache size: 5986, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5993, Positive cache size: 5993, Positive conditional cache size: 5987, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 5996, Positive cache size: 5996, Positive conditional cache size: 5990, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 5997, Positive cache size: 5997, Positive conditional cache size: 5991, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6000, Positive cache size: 6000, Positive conditional cache size: 5994, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6001, Positive cache size: 6001, Positive conditional cache size: 5995, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6004, Positive cache size: 6004, Positive conditional cache size: 5998, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6005, Positive cache size: 6005, Positive conditional cache size: 5999, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6008, Positive cache size: 6008, Positive conditional cache size: 6002, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6009, Positive cache size: 6009, Positive conditional cache size: 6003, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6012, Positive cache size: 6012, Positive conditional cache size: 6006, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6013, Positive cache size: 6013, Positive conditional cache size: 6007, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6016, Positive cache size: 6016, Positive conditional cache size: 6010, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6017, Positive cache size: 6017, Positive conditional cache size: 6011, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6020, Positive cache size: 6020, Positive conditional cache size: 6014, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6021, Positive cache size: 6021, Positive conditional cache size: 6015, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6024, Positive cache size: 6024, Positive conditional cache size: 6018, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6025, Positive cache size: 6025, Positive conditional cache size: 6019, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6028, Positive cache size: 6028, Positive conditional cache size: 6022, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6029, Positive cache size: 6029, Positive conditional cache size: 6023, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6032, Positive cache size: 6032, Positive conditional cache size: 6026, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6033, Positive cache size: 6033, Positive conditional cache size: 6027, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6036, Positive cache size: 6036, Positive conditional cache size: 6030, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6037, Positive cache size: 6037, Positive conditional cache size: 6031, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6040, Positive cache size: 6040, Positive conditional cache size: 6034, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6041, Positive cache size: 6041, Positive conditional cache size: 6035, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6044, Positive cache size: 6044, Positive conditional cache size: 6038, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6045, Positive cache size: 6045, Positive conditional cache size: 6039, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6048, Positive cache size: 6048, Positive conditional cache size: 6042, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6049, Positive cache size: 6049, Positive conditional cache size: 6043, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6052, Positive cache size: 6052, Positive conditional cache size: 6046, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6053, Positive cache size: 6053, Positive conditional cache size: 6047, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6056, Positive cache size: 6056, Positive conditional cache size: 6050, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6057, Positive cache size: 6057, Positive conditional cache size: 6051, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6060, Positive cache size: 6060, Positive conditional cache size: 6054, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6061, Positive cache size: 6061, Positive conditional cache size: 6055, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6064, Positive cache size: 6064, Positive conditional cache size: 6058, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6065, Positive cache size: 6065, Positive conditional cache size: 6059, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6068, Positive cache size: 6068, Positive conditional cache size: 6062, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6069, Positive cache size: 6069, Positive conditional cache size: 6063, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6072, Positive cache size: 6072, Positive conditional cache size: 6066, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6073, Positive cache size: 6073, Positive conditional cache size: 6067, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6076, Positive cache size: 6076, Positive conditional cache size: 6070, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6077, Positive cache size: 6077, Positive conditional cache size: 6071, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6080, Positive cache size: 6080, Positive conditional cache size: 6074, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6081, Positive cache size: 6081, Positive conditional cache size: 6075, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6084, Positive cache size: 6084, Positive conditional cache size: 6078, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6085, Positive cache size: 6085, Positive conditional cache size: 6079, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6088, Positive cache size: 6088, Positive conditional cache size: 6082, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6089, Positive cache size: 6089, Positive conditional cache size: 6083, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6092, Positive cache size: 6092, Positive conditional cache size: 6086, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6093, Positive cache size: 6093, Positive conditional cache size: 6087, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6096, Positive cache size: 6096, Positive conditional cache size: 6090, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6097, Positive cache size: 6097, Positive conditional cache size: 6091, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6100, Positive cache size: 6100, Positive conditional cache size: 6094, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6101, Positive cache size: 6101, Positive conditional cache size: 6095, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6104, Positive cache size: 6104, Positive conditional cache size: 6098, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6105, Positive cache size: 6105, Positive conditional cache size: 6099, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6108, Positive cache size: 6108, Positive conditional cache size: 6102, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6109, Positive cache size: 6109, Positive conditional cache size: 6103, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6112, Positive cache size: 6112, Positive conditional cache size: 6106, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6113, Positive cache size: 6113, Positive conditional cache size: 6107, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6116, Positive cache size: 6116, Positive conditional cache size: 6110, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6117, Positive cache size: 6117, Positive conditional cache size: 6111, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6120, Positive cache size: 6120, Positive conditional cache size: 6114, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6121, Positive cache size: 6121, Positive conditional cache size: 6115, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6124, Positive cache size: 6124, Positive conditional cache size: 6118, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6125, Positive cache size: 6125, Positive conditional cache size: 6119, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6128, Positive cache size: 6128, Positive conditional cache size: 6122, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6129, Positive cache size: 6129, Positive conditional cache size: 6123, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6132, Positive cache size: 6132, Positive conditional cache size: 6126, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6133, Positive cache size: 6133, Positive conditional cache size: 6127, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6136, Positive cache size: 6136, Positive conditional cache size: 6130, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6137, Positive cache size: 6137, Positive conditional cache size: 6131, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6140, Positive cache size: 6140, Positive conditional cache size: 6134, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6141, Positive cache size: 6141, Positive conditional cache size: 6135, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6144, Positive cache size: 6144, Positive conditional cache size: 6138, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6145, Positive cache size: 6145, Positive conditional cache size: 6139, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6148, Positive cache size: 6148, Positive conditional cache size: 6142, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6149, Positive cache size: 6149, Positive conditional cache size: 6143, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6152, Positive cache size: 6152, Positive conditional cache size: 6146, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6153, Positive cache size: 6153, Positive conditional cache size: 6147, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6156, Positive cache size: 6156, Positive conditional cache size: 6150, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6157, Positive cache size: 6157, Positive conditional cache size: 6151, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6160, Positive cache size: 6160, Positive conditional cache size: 6154, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6161, Positive cache size: 6161, Positive conditional cache size: 6155, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6164, Positive cache size: 6164, Positive conditional cache size: 6158, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6165, Positive cache size: 6165, Positive conditional cache size: 6159, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6168, Positive cache size: 6168, Positive conditional cache size: 6162, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6169, Positive cache size: 6169, Positive conditional cache size: 6163, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6172, Positive cache size: 6172, Positive conditional cache size: 6166, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6173, Positive cache size: 6173, Positive conditional cache size: 6167, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6176, Positive cache size: 6176, Positive conditional cache size: 6170, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6177, Positive cache size: 6177, Positive conditional cache size: 6171, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6180, Positive cache size: 6180, Positive conditional cache size: 6174, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6181, Positive cache size: 6181, Positive conditional cache size: 6175, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6184, Positive cache size: 6184, Positive conditional cache size: 6178, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6185, Positive cache size: 6185, Positive conditional cache size: 6179, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6188, Positive cache size: 6188, Positive conditional cache size: 6182, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6189, Positive cache size: 6189, Positive conditional cache size: 6183, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6192, Positive cache size: 6192, Positive conditional cache size: 6186, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6193, Positive cache size: 6193, Positive conditional cache size: 6187, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6196, Positive cache size: 6196, Positive conditional cache size: 6190, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6197, Positive cache size: 6197, Positive conditional cache size: 6191, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6200, Positive cache size: 6200, Positive conditional cache size: 6194, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6201, Positive cache size: 6201, Positive conditional cache size: 6195, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6204, Positive cache size: 6204, Positive conditional cache size: 6198, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6205, Positive cache size: 6205, Positive conditional cache size: 6199, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6208, Positive cache size: 6208, Positive conditional cache size: 6202, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6209, Positive cache size: 6209, Positive conditional cache size: 6203, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6212, Positive cache size: 6212, Positive conditional cache size: 6206, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6213, Positive cache size: 6213, Positive conditional cache size: 6207, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6216, Positive cache size: 6216, Positive conditional cache size: 6210, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6217, Positive cache size: 6217, Positive conditional cache size: 6211, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6220, Positive cache size: 6220, Positive conditional cache size: 6214, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6221, Positive cache size: 6221, Positive conditional cache size: 6215, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6224, Positive cache size: 6224, Positive conditional cache size: 6218, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6225, Positive cache size: 6225, Positive conditional cache size: 6219, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6228, Positive cache size: 6228, Positive conditional cache size: 6222, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6229, Positive cache size: 6229, Positive conditional cache size: 6223, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6232, Positive cache size: 6232, Positive conditional cache size: 6226, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6233, Positive cache size: 6233, Positive conditional cache size: 6227, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6236, Positive cache size: 6236, Positive conditional cache size: 6230, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6237, Positive cache size: 6237, Positive conditional cache size: 6231, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6240, Positive cache size: 6240, Positive conditional cache size: 6234, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6241, Positive cache size: 6241, Positive conditional cache size: 6235, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6244, Positive cache size: 6244, Positive conditional cache size: 6238, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6245, Positive cache size: 6245, Positive conditional cache size: 6239, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6248, Positive cache size: 6248, Positive conditional cache size: 6242, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6249, Positive cache size: 6249, Positive conditional cache size: 6243, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6252, Positive cache size: 6252, Positive conditional cache size: 6246, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6253, Positive cache size: 6253, Positive conditional cache size: 6247, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6256, Positive cache size: 6256, Positive conditional cache size: 6250, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6257, Positive cache size: 6257, Positive conditional cache size: 6251, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6260, Positive cache size: 6260, Positive conditional cache size: 6254, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6261, Positive cache size: 6261, Positive conditional cache size: 6255, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6264, Positive cache size: 6264, Positive conditional cache size: 6258, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6265, Positive cache size: 6265, Positive conditional cache size: 6259, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6268, Positive cache size: 6268, Positive conditional cache size: 6262, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6269, Positive cache size: 6269, Positive conditional cache size: 6263, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6272, Positive cache size: 6272, Positive conditional cache size: 6266, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6273, Positive cache size: 6273, Positive conditional cache size: 6267, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6276, Positive cache size: 6276, Positive conditional cache size: 6270, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6277, Positive cache size: 6277, Positive conditional cache size: 6271, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6280, Positive cache size: 6280, Positive conditional cache size: 6274, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6281, Positive cache size: 6281, Positive conditional cache size: 6275, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6284, Positive cache size: 6284, Positive conditional cache size: 6278, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6285, Positive cache size: 6285, Positive conditional cache size: 6279, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6288, Positive cache size: 6288, Positive conditional cache size: 6282, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6289, Positive cache size: 6289, Positive conditional cache size: 6283, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6292, Positive cache size: 6292, Positive conditional cache size: 6286, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6293, Positive cache size: 6293, Positive conditional cache size: 6287, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6296, Positive cache size: 6296, Positive conditional cache size: 6290, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6297, Positive cache size: 6297, Positive conditional cache size: 6291, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6300, Positive cache size: 6300, Positive conditional cache size: 6294, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6301, Positive cache size: 6301, Positive conditional cache size: 6295, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6304, Positive cache size: 6304, Positive conditional cache size: 6298, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6305, Positive cache size: 6305, Positive conditional cache size: 6299, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6308, Positive cache size: 6308, Positive conditional cache size: 6302, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6309, Positive cache size: 6309, Positive conditional cache size: 6303, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6312, Positive cache size: 6312, Positive conditional cache size: 6306, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6313, Positive cache size: 6313, Positive conditional cache size: 6307, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6316, Positive cache size: 6316, Positive conditional cache size: 6310, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6317, Positive cache size: 6317, Positive conditional cache size: 6311, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6320, Positive cache size: 6320, Positive conditional cache size: 6314, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6321, Positive cache size: 6321, Positive conditional cache size: 6315, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6324, Positive cache size: 6324, Positive conditional cache size: 6318, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6325, Positive cache size: 6325, Positive conditional cache size: 6319, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6328, Positive cache size: 6328, Positive conditional cache size: 6322, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6329, Positive cache size: 6329, Positive conditional cache size: 6323, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6332, Positive cache size: 6332, Positive conditional cache size: 6326, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6333, Positive cache size: 6333, Positive conditional cache size: 6327, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6336, Positive cache size: 6336, Positive conditional cache size: 6330, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6337, Positive cache size: 6337, Positive conditional cache size: 6331, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6340, Positive cache size: 6340, Positive conditional cache size: 6334, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6341, Positive cache size: 6341, Positive conditional cache size: 6335, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6344, Positive cache size: 6344, Positive conditional cache size: 6338, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6345, Positive cache size: 6345, Positive conditional cache size: 6339, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6348, Positive cache size: 6348, Positive conditional cache size: 6342, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6349, Positive cache size: 6349, Positive conditional cache size: 6343, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6352, Positive cache size: 6352, Positive conditional cache size: 6346, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6353, Positive cache size: 6353, Positive conditional cache size: 6347, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6356, Positive cache size: 6356, Positive conditional cache size: 6350, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6357, Positive cache size: 6357, Positive conditional cache size: 6351, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6360, Positive cache size: 6360, Positive conditional cache size: 6354, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6361, Positive cache size: 6361, Positive conditional cache size: 6355, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6364, Positive cache size: 6364, Positive conditional cache size: 6358, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6365, Positive cache size: 6365, Positive conditional cache size: 6359, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6368, Positive cache size: 6368, Positive conditional cache size: 6362, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6369, Positive cache size: 6369, Positive conditional cache size: 6363, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6372, Positive cache size: 6372, Positive conditional cache size: 6366, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6373, Positive cache size: 6373, Positive conditional cache size: 6367, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6376, Positive cache size: 6376, Positive conditional cache size: 6370, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6377, Positive cache size: 6377, Positive conditional cache size: 6371, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6380, Positive cache size: 6380, Positive conditional cache size: 6374, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6381, Positive cache size: 6381, Positive conditional cache size: 6375, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6384, Positive cache size: 6384, Positive conditional cache size: 6378, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6385, Positive cache size: 6385, Positive conditional cache size: 6379, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6388, Positive cache size: 6388, Positive conditional cache size: 6382, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6389, Positive cache size: 6389, Positive conditional cache size: 6383, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6392, Positive cache size: 6392, Positive conditional cache size: 6386, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6393, Positive cache size: 6393, Positive conditional cache size: 6387, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6396, Positive cache size: 6396, Positive conditional cache size: 6390, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6397, Positive cache size: 6397, Positive conditional cache size: 6391, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6400, Positive cache size: 6400, Positive conditional cache size: 6394, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6401, Positive cache size: 6401, Positive conditional cache size: 6395, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6404, Positive cache size: 6404, Positive conditional cache size: 6398, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6405, Positive cache size: 6405, Positive conditional cache size: 6399, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6408, Positive cache size: 6408, Positive conditional cache size: 6402, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6409, Positive cache size: 6409, Positive conditional cache size: 6403, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6412, Positive cache size: 6412, Positive conditional cache size: 6406, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6413, Positive cache size: 6413, Positive conditional cache size: 6407, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6416, Positive cache size: 6416, Positive conditional cache size: 6410, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6417, Positive cache size: 6417, Positive conditional cache size: 6411, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6420, Positive cache size: 6420, Positive conditional cache size: 6414, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6421, Positive cache size: 6421, Positive conditional cache size: 6415, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6424, Positive cache size: 6424, Positive conditional cache size: 6418, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6425, Positive cache size: 6425, Positive conditional cache size: 6419, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6428, Positive cache size: 6428, Positive conditional cache size: 6422, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6429, Positive cache size: 6429, Positive conditional cache size: 6423, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6432, Positive cache size: 6432, Positive conditional cache size: 6426, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6433, Positive cache size: 6433, Positive conditional cache size: 6427, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6436, Positive cache size: 6436, Positive conditional cache size: 6430, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6437, Positive cache size: 6437, Positive conditional cache size: 6431, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6440, Positive cache size: 6440, Positive conditional cache size: 6434, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6441, Positive cache size: 6441, Positive conditional cache size: 6435, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6444, Positive cache size: 6444, Positive conditional cache size: 6438, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6445, Positive cache size: 6445, Positive conditional cache size: 6439, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6448, Positive cache size: 6448, Positive conditional cache size: 6442, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6449, Positive cache size: 6449, Positive conditional cache size: 6443, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6452, Positive cache size: 6452, Positive conditional cache size: 6446, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6453, Positive cache size: 6453, Positive conditional cache size: 6447, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6456, Positive cache size: 6456, Positive conditional cache size: 6450, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6457, Positive cache size: 6457, Positive conditional cache size: 6451, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6460, Positive cache size: 6460, Positive conditional cache size: 6454, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6461, Positive cache size: 6461, Positive conditional cache size: 6455, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6464, Positive cache size: 6464, Positive conditional cache size: 6458, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6465, Positive cache size: 6465, Positive conditional cache size: 6459, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6468, Positive cache size: 6468, Positive conditional cache size: 6462, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6469, Positive cache size: 6469, Positive conditional cache size: 6463, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6472, Positive cache size: 6472, Positive conditional cache size: 6466, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6473, Positive cache size: 6473, Positive conditional cache size: 6467, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6476, Positive cache size: 6476, Positive conditional cache size: 6470, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6477, Positive cache size: 6477, Positive conditional cache size: 6471, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6480, Positive cache size: 6480, Positive conditional cache size: 6474, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6481, Positive cache size: 6481, Positive conditional cache size: 6475, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6484, Positive cache size: 6484, Positive conditional cache size: 6478, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6485, Positive cache size: 6485, Positive conditional cache size: 6479, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6488, Positive cache size: 6488, Positive conditional cache size: 6482, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6489, Positive cache size: 6489, Positive conditional cache size: 6483, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6492, Positive cache size: 6492, Positive conditional cache size: 6486, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6493, Positive cache size: 6493, Positive conditional cache size: 6487, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6496, Positive cache size: 6496, Positive conditional cache size: 6490, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6497, Positive cache size: 6497, Positive conditional cache size: 6491, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6500, Positive cache size: 6500, Positive conditional cache size: 6494, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6501, Positive cache size: 6501, Positive conditional cache size: 6495, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6504, Positive cache size: 6504, Positive conditional cache size: 6498, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6505, Positive cache size: 6505, Positive conditional cache size: 6499, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6508, Positive cache size: 6508, Positive conditional cache size: 6502, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6509, Positive cache size: 6509, Positive conditional cache size: 6503, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6512, Positive cache size: 6512, Positive conditional cache size: 6506, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6513, Positive cache size: 6513, Positive conditional cache size: 6507, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6516, Positive cache size: 6516, Positive conditional cache size: 6510, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6517, Positive cache size: 6517, Positive conditional cache size: 6511, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6520, Positive cache size: 6520, Positive conditional cache size: 6514, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6521, Positive cache size: 6521, Positive conditional cache size: 6515, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6524, Positive cache size: 6524, Positive conditional cache size: 6518, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6525, Positive cache size: 6525, Positive conditional cache size: 6519, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6528, Positive cache size: 6528, Positive conditional cache size: 6522, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6529, Positive cache size: 6529, Positive conditional cache size: 6523, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6532, Positive cache size: 6532, Positive conditional cache size: 6526, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6533, Positive cache size: 6533, Positive conditional cache size: 6527, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6536, Positive cache size: 6536, Positive conditional cache size: 6530, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6537, Positive cache size: 6537, Positive conditional cache size: 6531, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6540, Positive cache size: 6540, Positive conditional cache size: 6534, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6541, Positive cache size: 6541, Positive conditional cache size: 6535, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6544, Positive cache size: 6544, Positive conditional cache size: 6538, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6545, Positive cache size: 6545, Positive conditional cache size: 6539, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6548, Positive cache size: 6548, Positive conditional cache size: 6542, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6549, Positive cache size: 6549, Positive conditional cache size: 6543, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6552, Positive cache size: 6552, Positive conditional cache size: 6546, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6553, Positive cache size: 6553, Positive conditional cache size: 6547, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6556, Positive cache size: 6556, Positive conditional cache size: 6550, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6557, Positive cache size: 6557, Positive conditional cache size: 6551, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6560, Positive cache size: 6560, Positive conditional cache size: 6554, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6561, Positive cache size: 6561, Positive conditional cache size: 6555, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6564, Positive cache size: 6564, Positive conditional cache size: 6558, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6565, Positive cache size: 6565, Positive conditional cache size: 6559, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6568, Positive cache size: 6568, Positive conditional cache size: 6562, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6569, Positive cache size: 6569, Positive conditional cache size: 6563, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6572, Positive cache size: 6572, Positive conditional cache size: 6566, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6573, Positive cache size: 6573, Positive conditional cache size: 6567, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6576, Positive cache size: 6576, Positive conditional cache size: 6570, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6577, Positive cache size: 6577, Positive conditional cache size: 6571, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6580, Positive cache size: 6580, Positive conditional cache size: 6574, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6581, Positive cache size: 6581, Positive conditional cache size: 6575, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6584, Positive cache size: 6584, Positive conditional cache size: 6578, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6585, Positive cache size: 6585, Positive conditional cache size: 6579, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6588, Positive cache size: 6588, Positive conditional cache size: 6582, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6589, Positive cache size: 6589, Positive conditional cache size: 6583, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6592, Positive cache size: 6592, Positive conditional cache size: 6586, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6593, Positive cache size: 6593, Positive conditional cache size: 6587, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6596, Positive cache size: 6596, Positive conditional cache size: 6590, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6597, Positive cache size: 6597, Positive conditional cache size: 6591, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6600, Positive cache size: 6600, Positive conditional cache size: 6594, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6601, Positive cache size: 6601, Positive conditional cache size: 6595, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6604, Positive cache size: 6604, Positive conditional cache size: 6598, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6605, Positive cache size: 6605, Positive conditional cache size: 6599, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6608, Positive cache size: 6608, Positive conditional cache size: 6602, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6609, Positive cache size: 6609, Positive conditional cache size: 6603, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6612, Positive cache size: 6612, Positive conditional cache size: 6606, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6613, Positive cache size: 6613, Positive conditional cache size: 6607, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6616, Positive cache size: 6616, Positive conditional cache size: 6610, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6617, Positive cache size: 6617, Positive conditional cache size: 6611, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6620, Positive cache size: 6620, Positive conditional cache size: 6614, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6621, Positive cache size: 6621, Positive conditional cache size: 6615, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6624, Positive cache size: 6624, Positive conditional cache size: 6618, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6625, Positive cache size: 6625, Positive conditional cache size: 6619, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6628, Positive cache size: 6628, Positive conditional cache size: 6622, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6629, Positive cache size: 6629, Positive conditional cache size: 6623, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6632, Positive cache size: 6632, Positive conditional cache size: 6626, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6633, Positive cache size: 6633, Positive conditional cache size: 6627, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6636, Positive cache size: 6636, Positive conditional cache size: 6630, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6637, Positive cache size: 6637, Positive conditional cache size: 6631, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6640, Positive cache size: 6640, Positive conditional cache size: 6634, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6641, Positive cache size: 6641, Positive conditional cache size: 6635, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6644, Positive cache size: 6644, Positive conditional cache size: 6638, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6645, Positive cache size: 6645, Positive conditional cache size: 6639, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6648, Positive cache size: 6648, Positive conditional cache size: 6642, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6649, Positive cache size: 6649, Positive conditional cache size: 6643, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6652, Positive cache size: 6652, Positive conditional cache size: 6646, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6653, Positive cache size: 6653, Positive conditional cache size: 6647, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6656, Positive cache size: 6656, Positive conditional cache size: 6650, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6657, Positive cache size: 6657, Positive conditional cache size: 6651, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6660, Positive cache size: 6660, Positive conditional cache size: 6654, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6661, Positive cache size: 6661, Positive conditional cache size: 6655, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6664, Positive cache size: 6664, Positive conditional cache size: 6658, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6665, Positive cache size: 6665, Positive conditional cache size: 6659, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6668, Positive cache size: 6668, Positive conditional cache size: 6662, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6669, Positive cache size: 6669, Positive conditional cache size: 6663, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6672, Positive cache size: 6672, Positive conditional cache size: 6666, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6673, Positive cache size: 6673, Positive conditional cache size: 6667, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6676, Positive cache size: 6676, Positive conditional cache size: 6670, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6677, Positive cache size: 6677, Positive conditional cache size: 6671, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6680, Positive cache size: 6680, Positive conditional cache size: 6674, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6681, Positive cache size: 6681, Positive conditional cache size: 6675, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6684, Positive cache size: 6684, Positive conditional cache size: 6678, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6685, Positive cache size: 6685, Positive conditional cache size: 6679, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6688, Positive cache size: 6688, Positive conditional cache size: 6682, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6689, Positive cache size: 6689, Positive conditional cache size: 6683, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6692, Positive cache size: 6692, Positive conditional cache size: 6686, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6693, Positive cache size: 6693, Positive conditional cache size: 6687, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6696, Positive cache size: 6696, Positive conditional cache size: 6690, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6697, Positive cache size: 6697, Positive conditional cache size: 6691, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6700, Positive cache size: 6700, Positive conditional cache size: 6694, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6701, Positive cache size: 6701, Positive conditional cache size: 6695, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6704, Positive cache size: 6704, Positive conditional cache size: 6698, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6705, Positive cache size: 6705, Positive conditional cache size: 6699, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6708, Positive cache size: 6708, Positive conditional cache size: 6702, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6709, Positive cache size: 6709, Positive conditional cache size: 6703, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6712, Positive cache size: 6712, Positive conditional cache size: 6706, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6713, Positive cache size: 6713, Positive conditional cache size: 6707, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6716, Positive cache size: 6716, Positive conditional cache size: 6710, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6717, Positive cache size: 6717, Positive conditional cache size: 6711, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6720, Positive cache size: 6720, Positive conditional cache size: 6714, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6721, Positive cache size: 6721, Positive conditional cache size: 6715, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6724, Positive cache size: 6724, Positive conditional cache size: 6718, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6725, Positive cache size: 6725, Positive conditional cache size: 6719, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6728, Positive cache size: 6728, Positive conditional cache size: 6722, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6729, Positive cache size: 6729, Positive conditional cache size: 6723, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6732, Positive cache size: 6732, Positive conditional cache size: 6726, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6733, Positive cache size: 6733, Positive conditional cache size: 6727, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6736, Positive cache size: 6736, Positive conditional cache size: 6730, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6737, Positive cache size: 6737, Positive conditional cache size: 6731, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6740, Positive cache size: 6740, Positive conditional cache size: 6734, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6741, Positive cache size: 6741, Positive conditional cache size: 6735, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6744, Positive cache size: 6744, Positive conditional cache size: 6738, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6745, Positive cache size: 6745, Positive conditional cache size: 6739, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6748, Positive cache size: 6748, Positive conditional cache size: 6742, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6749, Positive cache size: 6749, Positive conditional cache size: 6743, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6752, Positive cache size: 6752, Positive conditional cache size: 6746, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6753, Positive cache size: 6753, Positive conditional cache size: 6747, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6756, Positive cache size: 6756, Positive conditional cache size: 6750, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6757, Positive cache size: 6757, Positive conditional cache size: 6751, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6760, Positive cache size: 6760, Positive conditional cache size: 6754, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6761, Positive cache size: 6761, Positive conditional cache size: 6755, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6764, Positive cache size: 6764, Positive conditional cache size: 6758, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6765, Positive cache size: 6765, Positive conditional cache size: 6759, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6768, Positive cache size: 6768, Positive conditional cache size: 6762, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6769, Positive cache size: 6769, Positive conditional cache size: 6763, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6772, Positive cache size: 6772, Positive conditional cache size: 6766, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6773, Positive cache size: 6773, Positive conditional cache size: 6767, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6776, Positive cache size: 6776, Positive conditional cache size: 6770, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6777, Positive cache size: 6777, Positive conditional cache size: 6771, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6780, Positive cache size: 6780, Positive conditional cache size: 6774, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6781, Positive cache size: 6781, Positive conditional cache size: 6775, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6784, Positive cache size: 6784, Positive conditional cache size: 6778, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6785, Positive cache size: 6785, Positive conditional cache size: 6779, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6788, Positive cache size: 6788, Positive conditional cache size: 6782, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6789, Positive cache size: 6789, Positive conditional cache size: 6783, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6792, Positive cache size: 6792, Positive conditional cache size: 6786, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6793, Positive cache size: 6793, Positive conditional cache size: 6787, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6796, Positive cache size: 6796, Positive conditional cache size: 6790, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6797, Positive cache size: 6797, Positive conditional cache size: 6791, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6800, Positive cache size: 6800, Positive conditional cache size: 6794, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6801, Positive cache size: 6801, Positive conditional cache size: 6795, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6804, Positive cache size: 6804, Positive conditional cache size: 6798, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6805, Positive cache size: 6805, Positive conditional cache size: 6799, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6808, Positive cache size: 6808, Positive conditional cache size: 6802, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6809, Positive cache size: 6809, Positive conditional cache size: 6803, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6812, Positive cache size: 6812, Positive conditional cache size: 6806, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6813, Positive cache size: 6813, Positive conditional cache size: 6807, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6816, Positive cache size: 6816, Positive conditional cache size: 6810, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6817, Positive cache size: 6817, Positive conditional cache size: 6811, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6820, Positive cache size: 6820, Positive conditional cache size: 6814, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6821, Positive cache size: 6821, Positive conditional cache size: 6815, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6824, Positive cache size: 6824, Positive conditional cache size: 6818, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6825, Positive cache size: 6825, Positive conditional cache size: 6819, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6828, Positive cache size: 6828, Positive conditional cache size: 6822, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6829, Positive cache size: 6829, Positive conditional cache size: 6823, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6832, Positive cache size: 6832, Positive conditional cache size: 6826, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6833, Positive cache size: 6833, Positive conditional cache size: 6827, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6836, Positive cache size: 6836, Positive conditional cache size: 6830, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6837, Positive cache size: 6837, Positive conditional cache size: 6831, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6840, Positive cache size: 6840, Positive conditional cache size: 6834, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6841, Positive cache size: 6841, Positive conditional cache size: 6835, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6844, Positive cache size: 6844, Positive conditional cache size: 6838, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6845, Positive cache size: 6845, Positive conditional cache size: 6839, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6848, Positive cache size: 6848, Positive conditional cache size: 6842, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6849, Positive cache size: 6849, Positive conditional cache size: 6843, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6852, Positive cache size: 6852, Positive conditional cache size: 6846, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6853, Positive cache size: 6853, Positive conditional cache size: 6847, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6856, Positive cache size: 6856, Positive conditional cache size: 6850, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6857, Positive cache size: 6857, Positive conditional cache size: 6851, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6860, Positive cache size: 6860, Positive conditional cache size: 6854, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6861, Positive cache size: 6861, Positive conditional cache size: 6855, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6864, Positive cache size: 6864, Positive conditional cache size: 6858, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6865, Positive cache size: 6865, Positive conditional cache size: 6859, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6868, Positive cache size: 6868, Positive conditional cache size: 6862, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6869, Positive cache size: 6869, Positive conditional cache size: 6863, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6872, Positive cache size: 6872, Positive conditional cache size: 6866, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6873, Positive cache size: 6873, Positive conditional cache size: 6867, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6876, Positive cache size: 6876, Positive conditional cache size: 6870, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6877, Positive cache size: 6877, Positive conditional cache size: 6871, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6880, Positive cache size: 6880, Positive conditional cache size: 6874, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6881, Positive cache size: 6881, Positive conditional cache size: 6875, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6884, Positive cache size: 6884, Positive conditional cache size: 6878, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6885, Positive cache size: 6885, Positive conditional cache size: 6879, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6888, Positive cache size: 6888, Positive conditional cache size: 6882, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6889, Positive cache size: 6889, Positive conditional cache size: 6883, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6892, Positive cache size: 6892, Positive conditional cache size: 6886, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6893, Positive cache size: 6893, Positive conditional cache size: 6887, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6896, Positive cache size: 6896, Positive conditional cache size: 6890, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6897, Positive cache size: 6897, Positive conditional cache size: 6891, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6900, Positive cache size: 6900, Positive conditional cache size: 6894, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6901, Positive cache size: 6901, Positive conditional cache size: 6895, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6904, Positive cache size: 6904, Positive conditional cache size: 6898, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6905, Positive cache size: 6905, Positive conditional cache size: 6899, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6908, Positive cache size: 6908, Positive conditional cache size: 6902, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6909, Positive cache size: 6909, Positive conditional cache size: 6903, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6912, Positive cache size: 6912, Positive conditional cache size: 6906, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6913, Positive cache size: 6913, Positive conditional cache size: 6907, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6916, Positive cache size: 6916, Positive conditional cache size: 6910, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6917, Positive cache size: 6917, Positive conditional cache size: 6911, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6920, Positive cache size: 6920, Positive conditional cache size: 6914, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6921, Positive cache size: 6921, Positive conditional cache size: 6915, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6924, Positive cache size: 6924, Positive conditional cache size: 6918, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6925, Positive cache size: 6925, Positive conditional cache size: 6919, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6928, Positive cache size: 6928, Positive conditional cache size: 6922, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6929, Positive cache size: 6929, Positive conditional cache size: 6923, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6932, Positive cache size: 6932, Positive conditional cache size: 6926, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6933, Positive cache size: 6933, Positive conditional cache size: 6927, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6936, Positive cache size: 6936, Positive conditional cache size: 6930, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6937, Positive cache size: 6937, Positive conditional cache size: 6931, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6940, Positive cache size: 6940, Positive conditional cache size: 6934, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6941, Positive cache size: 6941, Positive conditional cache size: 6935, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6944, Positive cache size: 6944, Positive conditional cache size: 6938, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6945, Positive cache size: 6945, Positive conditional cache size: 6939, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6948, Positive cache size: 6948, Positive conditional cache size: 6942, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6949, Positive cache size: 6949, Positive conditional cache size: 6943, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6952, Positive cache size: 6952, Positive conditional cache size: 6946, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6953, Positive cache size: 6953, Positive conditional cache size: 6947, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6956, Positive cache size: 6956, Positive conditional cache size: 6950, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6957, Positive cache size: 6957, Positive conditional cache size: 6951, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6960, Positive cache size: 6960, Positive conditional cache size: 6954, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6961, Positive cache size: 6961, Positive conditional cache size: 6955, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6964, Positive cache size: 6964, Positive conditional cache size: 6958, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6965, Positive cache size: 6965, Positive conditional cache size: 6959, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6968, Positive cache size: 6968, Positive conditional cache size: 6962, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6969, Positive cache size: 6969, Positive conditional cache size: 6963, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6972, Positive cache size: 6972, Positive conditional cache size: 6966, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6973, Positive cache size: 6973, Positive conditional cache size: 6967, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6976, Positive cache size: 6976, Positive conditional cache size: 6970, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6977, Positive cache size: 6977, Positive conditional cache size: 6971, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6980, Positive cache size: 6980, Positive conditional cache size: 6974, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6981, Positive cache size: 6981, Positive conditional cache size: 6975, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6984, Positive cache size: 6984, Positive conditional cache size: 6978, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6985, Positive cache size: 6985, Positive conditional cache size: 6979, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6988, Positive cache size: 6988, Positive conditional cache size: 6982, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6989, Positive cache size: 6989, Positive conditional cache size: 6983, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6992, Positive cache size: 6992, Positive conditional cache size: 6986, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6993, Positive cache size: 6993, Positive conditional cache size: 6987, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 6996, Positive cache size: 6996, Positive conditional cache size: 6990, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 6997, Positive cache size: 6997, Positive conditional cache size: 6991, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7000, Positive cache size: 7000, Positive conditional cache size: 6994, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7001, Positive cache size: 7001, Positive conditional cache size: 6995, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7004, Positive cache size: 7004, Positive conditional cache size: 6998, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7005, Positive cache size: 7005, Positive conditional cache size: 6999, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7008, Positive cache size: 7008, Positive conditional cache size: 7002, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7009, Positive cache size: 7009, Positive conditional cache size: 7003, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7012, Positive cache size: 7012, Positive conditional cache size: 7006, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7013, Positive cache size: 7013, Positive conditional cache size: 7007, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7016, Positive cache size: 7016, Positive conditional cache size: 7010, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7017, Positive cache size: 7017, Positive conditional cache size: 7011, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7020, Positive cache size: 7020, Positive conditional cache size: 7014, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7021, Positive cache size: 7021, Positive conditional cache size: 7015, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7024, Positive cache size: 7024, Positive conditional cache size: 7018, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7025, Positive cache size: 7025, Positive conditional cache size: 7019, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7028, Positive cache size: 7028, Positive conditional cache size: 7022, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7029, Positive cache size: 7029, Positive conditional cache size: 7023, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7032, Positive cache size: 7032, Positive conditional cache size: 7026, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7033, Positive cache size: 7033, Positive conditional cache size: 7027, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7036, Positive cache size: 7036, Positive conditional cache size: 7030, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7037, Positive cache size: 7037, Positive conditional cache size: 7031, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7040, Positive cache size: 7040, Positive conditional cache size: 7034, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7041, Positive cache size: 7041, Positive conditional cache size: 7035, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7044, Positive cache size: 7044, Positive conditional cache size: 7038, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7045, Positive cache size: 7045, Positive conditional cache size: 7039, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7048, Positive cache size: 7048, Positive conditional cache size: 7042, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7049, Positive cache size: 7049, Positive conditional cache size: 7043, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7052, Positive cache size: 7052, Positive conditional cache size: 7046, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7053, Positive cache size: 7053, Positive conditional cache size: 7047, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7056, Positive cache size: 7056, Positive conditional cache size: 7050, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7057, Positive cache size: 7057, Positive conditional cache size: 7051, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7060, Positive cache size: 7060, Positive conditional cache size: 7054, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7061, Positive cache size: 7061, Positive conditional cache size: 7055, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7064, Positive cache size: 7064, Positive conditional cache size: 7058, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7065, Positive cache size: 7065, Positive conditional cache size: 7059, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7068, Positive cache size: 7068, Positive conditional cache size: 7062, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7069, Positive cache size: 7069, Positive conditional cache size: 7063, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7072, Positive cache size: 7072, Positive conditional cache size: 7066, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7073, Positive cache size: 7073, Positive conditional cache size: 7067, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7076, Positive cache size: 7076, Positive conditional cache size: 7070, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7077, Positive cache size: 7077, Positive conditional cache size: 7071, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7080, Positive cache size: 7080, Positive conditional cache size: 7074, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7081, Positive cache size: 7081, Positive conditional cache size: 7075, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7084, Positive cache size: 7084, Positive conditional cache size: 7078, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7085, Positive cache size: 7085, Positive conditional cache size: 7079, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7088, Positive cache size: 7088, Positive conditional cache size: 7082, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7089, Positive cache size: 7089, Positive conditional cache size: 7083, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7092, Positive cache size: 7092, Positive conditional cache size: 7086, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7093, Positive cache size: 7093, Positive conditional cache size: 7087, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7096, Positive cache size: 7096, Positive conditional cache size: 7090, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7097, Positive cache size: 7097, Positive conditional cache size: 7091, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7100, Positive cache size: 7100, Positive conditional cache size: 7094, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7101, Positive cache size: 7101, Positive conditional cache size: 7095, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7104, Positive cache size: 7104, Positive conditional cache size: 7098, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7105, Positive cache size: 7105, Positive conditional cache size: 7099, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7108, Positive cache size: 7108, Positive conditional cache size: 7102, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7109, Positive cache size: 7109, Positive conditional cache size: 7103, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7112, Positive cache size: 7112, Positive conditional cache size: 7106, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7113, Positive cache size: 7113, Positive conditional cache size: 7107, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7116, Positive cache size: 7116, Positive conditional cache size: 7110, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7117, Positive cache size: 7117, Positive conditional cache size: 7111, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7120, Positive cache size: 7120, Positive conditional cache size: 7114, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7121, Positive cache size: 7121, Positive conditional cache size: 7115, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7124, Positive cache size: 7124, Positive conditional cache size: 7118, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7125, Positive cache size: 7125, Positive conditional cache size: 7119, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7128, Positive cache size: 7128, Positive conditional cache size: 7122, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7129, Positive cache size: 7129, Positive conditional cache size: 7123, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7132, Positive cache size: 7132, Positive conditional cache size: 7126, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7133, Positive cache size: 7133, Positive conditional cache size: 7127, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7136, Positive cache size: 7136, Positive conditional cache size: 7130, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7137, Positive cache size: 7137, Positive conditional cache size: 7131, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7140, Positive cache size: 7140, Positive conditional cache size: 7134, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7141, Positive cache size: 7141, Positive conditional cache size: 7135, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7144, Positive cache size: 7144, Positive conditional cache size: 7138, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7145, Positive cache size: 7145, Positive conditional cache size: 7139, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7148, Positive cache size: 7148, Positive conditional cache size: 7142, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7149, Positive cache size: 7149, Positive conditional cache size: 7143, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7152, Positive cache size: 7152, Positive conditional cache size: 7146, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7153, Positive cache size: 7153, Positive conditional cache size: 7147, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7156, Positive cache size: 7156, Positive conditional cache size: 7150, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7157, Positive cache size: 7157, Positive conditional cache size: 7151, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7160, Positive cache size: 7160, Positive conditional cache size: 7154, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7161, Positive cache size: 7161, Positive conditional cache size: 7155, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7164, Positive cache size: 7164, Positive conditional cache size: 7158, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7165, Positive cache size: 7165, Positive conditional cache size: 7159, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7168, Positive cache size: 7168, Positive conditional cache size: 7162, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7169, Positive cache size: 7169, Positive conditional cache size: 7163, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7172, Positive cache size: 7172, Positive conditional cache size: 7166, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7173, Positive cache size: 7173, Positive conditional cache size: 7167, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7176, Positive cache size: 7176, Positive conditional cache size: 7170, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7177, Positive cache size: 7177, Positive conditional cache size: 7171, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7180, Positive cache size: 7180, Positive conditional cache size: 7174, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7181, Positive cache size: 7181, Positive conditional cache size: 7175, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7184, Positive cache size: 7184, Positive conditional cache size: 7178, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7185, Positive cache size: 7185, Positive conditional cache size: 7179, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7188, Positive cache size: 7188, Positive conditional cache size: 7182, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7189, Positive cache size: 7189, Positive conditional cache size: 7183, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7192, Positive cache size: 7192, Positive conditional cache size: 7186, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7193, Positive cache size: 7193, Positive conditional cache size: 7187, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7196, Positive cache size: 7196, Positive conditional cache size: 7190, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7197, Positive cache size: 7197, Positive conditional cache size: 7191, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7200, Positive cache size: 7200, Positive conditional cache size: 7194, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7201, Positive cache size: 7201, Positive conditional cache size: 7195, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7204, Positive cache size: 7204, Positive conditional cache size: 7198, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7205, Positive cache size: 7205, Positive conditional cache size: 7199, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7208, Positive cache size: 7208, Positive conditional cache size: 7202, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7209, Positive cache size: 7209, Positive conditional cache size: 7203, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7212, Positive cache size: 7212, Positive conditional cache size: 7206, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7213, Positive cache size: 7213, Positive conditional cache size: 7207, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7216, Positive cache size: 7216, Positive conditional cache size: 7210, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7217, Positive cache size: 7217, Positive conditional cache size: 7211, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7220, Positive cache size: 7220, Positive conditional cache size: 7214, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7221, Positive cache size: 7221, Positive conditional cache size: 7215, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7224, Positive cache size: 7224, Positive conditional cache size: 7218, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7225, Positive cache size: 7225, Positive conditional cache size: 7219, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7228, Positive cache size: 7228, Positive conditional cache size: 7222, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7229, Positive cache size: 7229, Positive conditional cache size: 7223, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7232, Positive cache size: 7232, Positive conditional cache size: 7226, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7233, Positive cache size: 7233, Positive conditional cache size: 7227, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7236, Positive cache size: 7236, Positive conditional cache size: 7230, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7237, Positive cache size: 7237, Positive conditional cache size: 7231, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7240, Positive cache size: 7240, Positive conditional cache size: 7234, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7241, Positive cache size: 7241, Positive conditional cache size: 7235, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7244, Positive cache size: 7244, Positive conditional cache size: 7238, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7245, Positive cache size: 7245, Positive conditional cache size: 7239, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7248, Positive cache size: 7248, Positive conditional cache size: 7242, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7249, Positive cache size: 7249, Positive conditional cache size: 7243, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7252, Positive cache size: 7252, Positive conditional cache size: 7246, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7253, Positive cache size: 7253, Positive conditional cache size: 7247, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7256, Positive cache size: 7256, Positive conditional cache size: 7250, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7257, Positive cache size: 7257, Positive conditional cache size: 7251, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7260, Positive cache size: 7260, Positive conditional cache size: 7254, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7261, Positive cache size: 7261, Positive conditional cache size: 7255, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7264, Positive cache size: 7264, Positive conditional cache size: 7258, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 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): 7265, Positive cache size: 7265, Positive conditional cache size: 7259, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 96 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): 7268, Positive cache size: 7268, Positive conditional cache size: 7262, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional 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: 70]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while TransFormulaUtils was doing sequential composition of 2 TransFormulas,while SimplifyDDAWithTimeout was simplifying term of DAG size 37 for 9ms.. - TimeoutResultAtElement [Line: 65]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while TransFormulaUtils was doing sequential composition of 2 TransFormulas,while SimplifyDDAWithTimeout was simplifying term of DAG size 37 for 9ms.. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while TransFormulaUtils was doing sequential composition of 2 TransFormulas,while SimplifyDDAWithTimeout was simplifying term of DAG size 37 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: 700.9s, OverallIterations: 3628, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 156.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18213 SdHoareTripleChecker+Valid, 122.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18213 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 101.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 3637 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 222657 IncrementalHoareTripleChecker+Invalid, 226294 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3637 mSolverCounterUnsat, 4 mSDtfsCounter, 222657 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7291 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 7268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 24.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=185occurred in iteration=12, InterpolantAutomatonStates: 14518, 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.8s SsaConstructionTime, 15.4s SatisfiabilityAnalysisTime, 191.5s InterpolantComputationTime, 39932 NumberOfCodeBlocks, 39932 NumberOfCodeBlocksAsserted, 3629 NumberOfCheckSat, 36316 ConstructedInterpolants, 0 QuantifiedInterpolants, 331905 SizeOfPredicates, 4 NumberOfNonLiveVariables, 111 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 3630 InterpolantComputations, 3627 PerfectInterpolantSequences, 0/3 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